Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:1109.1714 · Quantum Information Processing

Encoding an arbitrary state in a [7,1,3] quantum error correction code

Sidney Buchbinder, Channing L. Huang, Yaakov S. Weinstein

Published May 3, 2012• 16 citations
arXivHTMLPDF
DOI
10.1007/s11128-012-0414-7

Related papers

Quantum Error-Correction Codes

Mahn‐Soo Choi

Springer eBooks•Jan 1, 2022•0 citations

Arbitrary-Distance Quantum Error Correction with Gauss's Law for $\mathbb Z_2$ Lattice Gauge Theory

Neel S. Modi, Lento Nagano, Masazumi Honda +2 more

It has previously been shown by Rajput, Roggero, and Wiebe that $\mathbb Z_2$ Gauss's law constraints can be used to build efficient quantum error-correcting codes (QECCs) that are robust against arbitrary single-qubit errors. In this work, we generalize the construction to be robust against arbitrary $t$-qubit errors, where $t$ is any positive integer. This includes a derivation of the optimal Gauss's law code within the considered family by minimizing the number of physical qubits required for a given code distance. Finally, we compare our codes against other efficient QECCs on metrics such as the number of physical qubits, the locality of the encoded Hamiltonian, and the logical error rate in the code capacity setting. Compared to using a domain-agnostic code for every lattice degree of freedom, we find that the Gauss's law code primarily excels at reducing the locality of the encoded Hamiltonian. Moreover, the physical qubit overhead is also reduced for $t \le 3$ (distance $d \le 7$).

hep-latCross-listedarXiv:2608.00165•Aug 4, 2026•2 citations

Nonadditive Quantum Error-Correcting Code

Sixia Yu, Qing Chen, Ching–Yi Lai +1 more

We report the first nonadditive quantum error-correcting code, namely, a ((9, 12, 3)) code which is a 12-dimensional subspace within a 9-qubit Hilbert space, that outperforms the optimal stabilizer code of the same length by encoding more levels while correcting arbitrary single-qubit errors. Taking advantage of the graph states, we construct explicitly a complete encoding-decoding circuit for the proposed nonadditive error-correcting code.

arXiv:0704.2122•Physical Review Letters•Aug 29, 2008•58 citations

Permutationally invariant codes for quantum error correction

Harriet Pollatsek, Mary Beth Ruskai

arXiv:quant-ph/0304153•Linear Algebra and its Applications•Aug 17, 2004•64 citations

A new description of quantum error-correcting codes

Wen-Ching Li

AMS/IP studies in advanced mathematics•Jul 20, 2007•0 citations

Good quantum error-correcting codes exist

A.R. Calderbank, Peter W. Shor

A quantum error-correcting code is defined to be a unitary mapping (encoding) of k qubits (two-state quantum systems) into a subspace of the quantum state space of n qubits such that if any t of the qubits undergo arbitrary decoherence, not necessarily independently, the resulting n qubits can be used to faithfully reconstruct the original quantum state of the k encoded qubits. Quantum error-correcting codes are shown to exist with asymptotic rate k/n=1-2${\mathit{H}}_{2}$(2t/n) where ${\mathit{H}}_{2}$(p) is the binary entropy function -p${\mathrm{log}}_{2}$p-(1-p)${\mathrm{log}}_{2}$(1-p). Upper bounds on this asymptotic rate are given. \textcopyright{} 1996 The American Physical Society.

arXiv:quant-ph/9512032•Physical Review A•Aug 1, 1996•2,708 citations
Arbitrary-Distance Quantum Error Correction with Gauss's Law for Z2\mathbb Z_2Z2​ Lattice Gauge Theory
It has previously been shown by Rajput, Roggero, and Wiebe that Z2\mathbb Z_2Z2​ Gauss's law constraints can be used to build efficient quantum error-correcting codes (QECCs) that are robust against arbitrary single-qubit errors. In this work, we generalize the construction to be robust against arbitrary ttt-qubit errors, where ttt is any positive integer. This includes a derivation of the optimal Gauss's law code within the considered family by minimizing the number of physical qubits required for a given code distance. Finally, we compare our codes against other efficient QECCs on metrics such as the number of physical qubits, the locality of the encoded Hamiltonian, and the logical error rate in the code capacity setting. Compared to using a domain-agnostic code for every lattice degree of freedom, we find that the Gauss's law code primarily excels at reducing the locality of the encoded Hamiltonian. Moreover, the physical qubit overhead is also reduced for t≤3t \le 3t≤3 (distance d≤7d \le 7d≤7).
A quantum error-correcting code is defined to be a unitary mapping (encoding) of k qubits (two-state quantum systems) into a subspace of the quantum state space of n qubits such that if any t of the qubits undergo arbitrary decoherence, not necessarily independently, the resulting n qubits can be used to faithfully reconstruct the original quantum state of the k encoded qubits. Quantum error-correcting codes are shown to exist with asymptotic rate k/n=1-2H2{\mathit{H}}_{2}H2​(2t/n) where H2{\mathit{H}}_{2}H2​(p) is the binary entropy function -plog2{\mathrm{log}}_{2}log2​p-(1-p)log2{\mathrm{log}}_{2}log2​(1-p). Upper bounds on this asymptotic rate are given. \textcopyright{} 1996 The American Physical Society.