Related papers: Quantum codes on a lattice with boundary
Many $q$-ary stabilizer quantum codes can be constructed from Hermitian self-orthogonal $q^2$-ary linear codes. This result can be generalized to $q^{2 m}$-ary linear codes, $m > 1$. We give a result for easily obtaining quantum codes from…
This lecture provides an introduction to quantum chromodynamics (QCD) on the lattice. The continuum limit and Monte Carlo simulations are briefly discussed. Different facets of QCD are nicely exhibited by the potential of a static quark and…
We consider the optimal approximation of certain quantum states of a harmonic oscillator with the superposition of a finite number of coherent states in phase space placed either on an ellipse or on a certain lattice. These scenarios are…
The analysis of mathematical structure of the method of operator manifold guides our discussion. The latter is a still wider generalization of the method of secondary quantization with appropriate expansion over the geometric objects. The…
Classes of self-dual codes and dual-containing codes are constructed. The codes are obtained within group rings and, using an isomorphism between group rings and matrices, equivalent codes are obtained in matrix form. Distances and other…
We investigate how imposing kinetic restrictions on quantum particles that would otherwise hop freely on a two-dimensional lattice can lead to topologically ordered states. The kinetically constrained models introduced here are derived as a…
We suggest concrete models for self-correcting quantum memory by reporting examples of local stabilizer codes in 3D that have no string logical operators. Previously known local stabilizer codes in 3D all have string-like logical operators,…
The existence of bound states in quantum mechanics with no classical counterpart has been a subject of interest for a long time. Cross-wires and cavities connected to infinite leads are typical examples in which open geometries with bulges…
We suggest and study designed defects in an otherwise periodic potential modulation of a two-dimensional electron gas as an alternative approach to electron spin based quantum information processing in the solid-state using conventional…
We construct qubit stabilizer codes with parameters $[[81, 0, 20]]$ and $[[94, 0, 22]]$ for the first time. We use symplectic self-dual additive codes over $\mathbb{F}_4$ built by modifying the adjacency matrices of suitable metacirculant…
In this article, we review the use of numerical techniques to obtain solutions for the quantum Hamiltonian constraint in loop quantum cosmology (LQC). First, we summarize the basic features of LQC, and describe features of the constraint…
Inhomogeneities are introduced in loop quantum cosmology using regular lattice states, with a kinematical arena similar to that in homogeneous models considered earlier. The framework is intended to encapsulate crucial features of…
The quantum constraint equations for a relativistic three-dimensional harmonic oscillator are shown to find concise expression in terms of Lorentz covariant ladder operators. These ladder operators consist of two conjugate 4-vectors that…
Hilbert space operators may be mapped onto a space of ordinary functions (operator symbols) equipped with an associative (but noncommutative) star-product. A unified framework for such maps is reviewed. Because of its clear probabilistic…
We introduce a class of cyclic quantum codes, basing the construction not on the simplicity of the stabilizers, but rather on the simplicity of preparation of a code state (at least in the absence of noise). We show how certain known codes,…
We investigate some properties of geometric operators in canonical quantum gravity in the connection approach \`a la Ashtekar, which are associated with volume, area and length of spatial regions. We motivate the construction of analogous…
Quantum computation has suggested new forms of quantum logic, called quantum computational logics. The basic semantic idea is the following: the meaning of a sentence is identified with a quregister, a system of qubits, representing a…
We survey several problems related to logical aspects of quantum structures. In particular, we consider problems related to completions, decidability and axiomatizability, and embedding problems. The historical development is described, as…
Quantum compiling fills the gap between the computing layer of high-level quantum algorithms and the layer of physical qubits with their specific properties and constraints. Quantum compiling is a hybrid between the general-purpose…
We consider many-body quantum systems on a finite lattice, where the Hilbert space is the tensor product of finite-dimensional Hilbert spaces associated with each site, and where the Hamiltonian of the system is a sum of local terms. We are…