Designing bound states in a band as a model for a quantum network

We provide a model of a one dimensional quantum network, in the framework of a lattice using Von Neumann and Wigner's idea of bound states in a continuum. The localized states acting as qubits are created by a controlled deformation of a periodic potential. These wave functions lie at the band edges and are defects in a lattice. We propose that these defect states, with atoms trapped in them, can be realized in an optical lattice and can act as a model for a quantum network.Comment: 8 pages, 10 figure

Coded Caching based on Combinatorial Designs

We consider the standard broadcast setup with a single server broadcasting information to a number of clients, each of which contains local storage (called \textit{cache}) of some size, which can store some parts of the available files at the server. The centralized coded caching framework, consists of a caching phase and a delivery phase, both of which are carefully designed in order to use the cache and the channel together optimally. In prior literature, various combinatorial structures have been used to construct coded caching schemes. In this work, we propose a binary matrix model to construct the coded caching scheme. The ones in such a \textit{caching matrix} indicate uncached subfiles at the users. Identity submatrices of the caching matrix represent transmissions in the delivery phase. Using this model, we then propose several novel constructions for coded caching based on the various types of combinatorial designs. While most of the schemes constructed in this work (based on existing designs) have a high cache requirement (uncached fraction being $\Theta(\frac{1}{\sqrt{K}})$ or $\Theta(\frac{1}{K})$, $K$ being the number of users), they provide a rate that is either constant or decreasing ($O(\frac{1}{K})$) with increasing $K$, and moreover require competitively small levels of subpacketization (being $O(K^i), 1\leq i\leq 3$), which is an extremely important parameter in practical applications of coded caching. We mark this work as another attempt to exploit the well-developed theory of combinatorial designs for the problem of constructing caching schemes, utilizing the binary caching model we develop.Comment: 10 pages, Appeared in Proceedings of IEEE ISIT 201

Exceptional orthogonal polynomials, QHJ formalism and SWKB quantization condition

We study the quantum Hamilton-Jacobi (QHJ) equation of the recently obtained exactly solvable models, related to the newly discovered exceptional polynomials and show that the QHJ formalism reproduces the exact eigenvalues and the eigenfunctions. The fact that the eigenfunctions have zeros and poles in complex locations leads to an unconventional singularity structure of the quantum momentum function $p(x)$, the logarithmic derivative of the wave function, which forms the crux of the QHJ approach to quantization. A comparison of the singularity structure for these systems with the known exactly solvable and quasi-exactly solvable models reveals interesting differences. We find that the singularities of the momentum function for these new potentials lie between the above two distinct models, sharing similarities with both of them. This prompted us to examine the exactness of the supersymmetric WKB (SWKB) quantization condition. The interesting singularity structure of $p(x)$ and of the superpotential for these models has important consequences for the SWKB rule and in our proof of its exactness for these quantal systems.Comment: 10 pages with 1 table,i figure. Errors rectified, manuscript rewritten, new references adde