We develop a comprehensive approach of stabilizer codes and provide a scheme generating equientangled basis interpolating between the product basis and maximally entangled basis. The key ingredient is the theory of phase states for finite-dimensional systems (qudits). In this respect, we derive entangled phase states for a multiqudit system whose dynamics is governed by a two-qudit interaction Hamiltonian. We construct the stabilizer codes for this family of entangled phase states. The stabilizer phase states are defined as the common eigenvectors of the stabilizer group generators which are explicitly specified. Furthermore, we construct equally entangled bases from bipartite as well as multipartite entangled qudit phase states.
We develop a comprehensive approach of stabilizer codes and provide a scheme generating equientangled basis interpolating between the product basis and maximally entangled basis. The key ingredient is the theory of phase states for finite-dimensional systems (qudits). In this respect, we derive entangled phase states for a multiqudit system whose dynamics is governed by a two-qudit interaction Hamiltonian. We construct the stabilizer codes for this family of entangled phase states. The stabilizer phase states are defined as the common eigenvectors of the stabilizer group generators which are explicitly specified. Furthermore, we construct equally entangled bases from bipartite as well as multipartite entangled qudit phase states.
We derive absolutely maximally entangled (AME) states from phase states for a multi-qudit system whose dynamics is governed by a two-qudit interaction Hamiltonian of Heisenberg type. AME states are characterized by being maximally entangled for all bipartitions of the multi-qudit system and present absolute multipartite entanglement. The key ingredient of this approach is the theory of phase states for finite-dimensional systems (qudits). We define further the unitary phase operators of [Formula: see text]-qudit systems and we give next the corresponding separable phase states. Using a qudit–qudit Hamiltonian acting as entangling operator on separable phase states, we generate entangled phase states. Finally, from the labeled entangled phase states, we derive the absolutely maximally entangled states.
We develop a theory of stabilizer codes whose stabilizer groups consist of commuting qudit Paulis, oscillator displacements, and/or planar-rotor displacements. We consider codes whose stabilizer groups form generalized lattices in quantum phase space, a condition that guarantees a finite logical dimension. We construct oscillator-rotor, rotor-qudit, and oscillator-rotor-qubit codes that cannot be decomposed into separate subsystems by generalized Clifford transformations. We also introduce an oscillator-qubit code arising from a partially lifted Golay code, where Construction A is applied to half of the Golay code coordinates. We derive analytical forms of logical operators from the symplectic dual lattice, determine Clifford-Gaussian gates from lattice symmetries, show that the code dimension equals the covolume of the stabilizer lattice, and organize the syndrome subspaces into a vector bundle. Our technique builds on earlier non-commutative geometric results by Rieffel, but it can often be interpreted simply as concatenating a given stabilizer code with a Gottesman-Kitaev-Preskill (GKP) code, applying conventional lattice-theoretic results, and unconcatenating. We formulate distances, optimal decoding, and quantum weight enumerators, recovering the Pauli, qudit, and GKP versions together with known MacWilliams identities. We construct finite-energy codewords whose encoding is an isometry up to an error exponentially small in the inverse damping parameter.
For the space of two identical systems of arbitrary dimensions, we introduce a continuous family of bases with the following properties: (i) the bases are orthonormal, (ii) in each basis, all the states have the same values of entanglement, and (iii) they continuously interpolate between the product basis and the maximally entangled basis. The states thus constructed may find applications in many areas related to the quantum information science including quantum cryptography, optimal Bell tests, and the investigation of the enhancement of channel capacity due to entanglement.
We construct stabilizer states and error-correcting codes on hybrid discrete- and continuous-variable systems, generalizing the Gottesman-Kitaev-Preskill (GKP) lattice formalism. Our framework embeds qudit phase space into a hybrid phase space parameterized by continuous variables, with unit cells that grow with qudit dimension—enabling simultaneous measurement of an arbitrarily large range of noncommuting displacements. Simple hybrid states arise from applying a conditional displacement to a GKP state and a Pauli eigenstate, or by encoding qudits of a stabilizer state into a GKP code; their oscillator-qudit entanglement is non-Gaussian, distinguishing them as a resource beyond tensor products of stabilizer states. Simple hybrid codes are subsystem GKP codes whose gauge factor is entangled with a qudit. Numerical experiments suggest that they can outperform GKP codes against physical noise, with decoders tunable to either qudit or oscillator errors. We also relate stabilizer codes to noncommutative tori, showing that a general construction yields multimode multiqudit GKP extensions. We compute the codes’ logical dimension and operators via Morita equivalence.
There is a connection between classical codes, highly entangled pure states (calledk-uniform or absolutely maximally entangled (AME) states), and quantum error correcting codes (QECCs). This leads to a systematic method to construct stabilizer QECCs by starting from ak-uniform state or the corresponding classical code and tracing out one party at each step. We provide explicit constructions for codewords, encoding procedure and stabilizer formalism of the QECCs by describing the changes that partial traces cause on the corresponding generator matrix of the classical codes. We then modify the method to produce another set of stabilizer QECCs that encode a logical qudit into a subspace spanned by AME states. This construction produces quantum codes starting from an AME state without tracing out any party. Therefore, quantum stabilizer codes with larger codespace can be constructed.
Quantum information science is a rapidly growing research area. It concerns information theory that makes use of quantum nature of the microscopic world. In reality, quantum systems are vulnerable to disturbance from an external environment, which can lead to decoherence in the system. Thus, the system must be protected from the environmental noise to keep information stored in the quantum registers. In order to realize a working quantum computer and dependable quantum information processing, researchers and engineers have to overcome this difficulty. One of the most promising candidates for overcoming decoherence is Quantum Error Correction. The idea of quantum error correction is to protect quantum information from errors due to decoherence and other quantum noise during the transmission of information in quantum channels. One fundamental question of quantum error correction is the existence of quantum error correcting code for a noisy quantum system. Moreover, constructing practical and operational quantum error correcting schemes in actual quantum computing is of great interest to quantum information scientists. In this thesis, stabilizer codes and a scheme for constructing recovery channels without error syndrome detection are studied. The motivation for construction of recovery channel without error syndrome detection is also given. We first review some basic concepts on stabilizer groups and stabilizer codes. In particular, we consider theories and principles involved in the construction of encoding circuits from the generators of stabilizer group, and propose a new procedure to derive recovery channel for a well known quantum code, the [n, k, d] code. First, an algorithm to obtain the generators for a stabilizer code and the corresponding computational basis codewords defined in terms of Pauli operators are reviewed and illustrated in detail. Examples are given to demonstrate the relation between the X- and Z- matrices of generators of stabilizer group and the corresponding encoding circuit. Then based on the general framework of operator quantum error correction, we provide a general scheme on the construction of encoding and decoding circuits for the [n, k, d] codes. Finally, a detailed procedure to construct the recovery channel using encoding circuits and encoded computational basis codewords are demonstrated for [5, 1, 3] code and [8, 3, 3] code step by step as examples, with heuristic explanations based on necessary and sufficient conditions for quantum error correction. Possible future study and open problems will also be mentioned.