Related papers: Non-Additive Quantum Codes from Goethals and Prepa…
Formalism of differential forms is developed for a variety of Quantum and noncommutative situations.
In this paper we study the quantum graphs of mixed-unitary channels generated by tensor products of Pauli operators, which we call Pauli channels. We show that most quantum graphs arising from Pauli channels have non-trivial quantum cliques…
We develop genetic algorithms for searching quantum circuits, in particular stabilizer quantum error correction codes. Quantum codes equivalent to notable examples such as the 5-qubit perfect code, Shor's code, and the 7-qubit color code…
We define a new family of codes for symmetric classical-quantum channels and establish their optimality. To this end, we extend the classical notion of generalized perfect and quasi-perfect codes to channels defined over some finite…
CSS-T codes are a class of stabilizer codes introduced by Rengaswamy \emph{et al} with desired properties for quantum fault-tolerance. In this work, we comprehensively study non-degenerate CSS-T codes built from Reed-Muller codes. These…
(Abridged abstract.) In this thesis we introduce new models of quantum computation to study the emergence of quantum speed-up in quantum computer algorithms. Our first contribution is a formalism of restricted quantum operations, named…
We consider the symmetry group of a $Z_2Z_4$-linear code with parameters of a $1$-perfect, extended $1$-perfect, or Preparata-like code. We show that, provided the code length is greater than $16$, this group consists only of symmetries…
The stabilizer formalism is a scheme, generalizing well-known techniques developed by Gottesman [quant-ph/9705052] in the case of qubits, to efficiently simulate a class of transformations ("stabilizer circuits", which include the quantum…
We introduce a stabilizer formalism for EAQECCs with noise ebits, using special subgroups of product groups of two Pauli groups. This formalism includes the two coding schemes,given by Lai and Brun (C.Y. Lai and T. A. Brun, PHYSICAL REVIEW…
The standard stabilizer formalism provides a setting to show that quantum computation restricted to operations within the Clifford group are classically efficiently simulable: this is the content of the well-known Gottesman-Knill theorem.…
Coherent errors, which arise from collective couplings, are a dominant form of noise in many realistic quantum systems, and are more damaging than oft considered stochastic errors. Here, we propose integrating stabilizer codes with…
Quantum correlations can be naturally formulated in a classical statistical system of infinitely many degrees of freedom. This realizes the underlying non-commutative structure in a classical statistical setting. We argue that the quantum…
Due to their fast decoding algorithms, quantum generalizations of low-density parity check, or LDPC, codes have been investigated as a solution to the problem of decoherence in fragile quantum states. However, the additional twisted inner…
Large-scale quantum computation is likely to require massive quantum error correction (QEC). QEC codes and circuits are described via the stabilizer formalism, which represents stabilizer states by keeping track of the operators that…
An explicit lattice realization of a non-Abelian topological memory is presented. The correspondence between logical and physical states is seen directly by use of the stabilizer formalism. The resilience of the encoded states against…
We investigate a novel class of quantum error correcting codes to correct errors on both qubits and higher-state quantum systems represented as qudits. These codes arise from an original graph-theoretic representation of sets of quantum…
We present a decoder for nonbinary CWS quantum codes using the structure of union codes. The decoder runs in two steps: first we use a union of stabilizer codes to detect a sequence of errors, and second we build a new code, called union…
One hurdle to performing reliable quantum computations is overcoming noise. One possibility is to reduce the number of particles needing to be protected from noise and instead use systems with more states, so called qudit quantum computers.…
Fault-tolerant quantum computation allows quantum computations to be carried out while resisting unwanted noise. Several error-correcting codes have been developed to achieve this task, but none alone are capable of universal quantum…
The extraction of classical degrees of freedom in quantum mechanics is studied in the stochastic variational method. By using this classicalization, a hybrid model constructed from quantum and classical variables (quantum-classical hybrids)…