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:quant-ph/0510096 · Physical Review A

Hashing protocol for distilling multipartite Calderbank-Shor-Steane states

Erik Hostens, Jeroen Dehaene, Bart De Moor

Published Apr 18, 2006• 25 citations
arXivHTMLPDF

Abstract

We present a hashing protocol for distilling multipartite Calderbank-Shor-Steane states by means of local Clifford operations, Pauli measurements, and classical communication. It is shown that this hashing protocol outperforms previous versions by exploiting information theory to a full extent and not only applying controlled-NOT gates as local Clifford operations. Using the information-theoretical notion of a strongly typical set, we calculate the asymptotic yield of the protocol as the solution of a linear programming problem.

DOI
10.1103/physreva.73.042316

Related papers

General Entropic Constraints on Calderbank-Shor-Steane Codes within Magic Distillation Protocols

Rhea Alexander, Si Gvirtz-Chen, Nikolaos Koukoulekidis +1 more

Magic states are fundamental building blocks on the road to fault-tolerant quantum computing.Calderbank-Shor-Steane (CSS) codes play a crucial role in the construction of magic distillation protocols.Previous work has cast quantum computing with magic states for odd dimension d within a phase-space setting in which universal quantum computing is described by the statistical mechanics of quasiprobability distributions.Here we extend this framework to the important d = 2 qubit case and show that we can exploit common structures in CSS circuits to obtain distillation bounds capable of outperforming previous monotone bounds in regimes of practical interest.Moreover, in the case of CSS-code projections, we arrive at a novel cutoff result on the code length n of the CSS code in terms of parameters characterizing a desired distillation, which implies that for fixed target error rate and acceptance probability, one needs to consider only CSS codes below a threshold number of qubits.These entropic constraints are not due simply to the data-processing inequality but rely explicitly on the stochastic representation of such protocols.

arXiv:2211.07535•PRX Quantum•Jun 30, 2023•1 citation

Efficient Graph State Purification with Factorized Graph-Preserving Operations across Local Clifford Orbits

Mingyuan Wang, Guus Avis, Kenneth Goodenough +1 more

Graph states form a broad class of multipartite entangled states underlying measurement-based quantum computation, quantum networks, and stabilizer codes. However, systematic entanglement distillation for arbitrary graph states remains challenging because the circuit design space grows rapidly with the number of parties. We introduce a group of Clifford operations that we call "factorized graph-preserving". It enables us to efficiently enumerate and optimize graph-state purification circuits at finite size for realistic noisy hardware. These operations map products of graph-basis states to products of graph-basis states, so their action can be represented as permutations of graph-basis labels. Moreover, this useful gate set admits a compact factorized description determined by simple graph-theoretic features. This structure also allows, after some initial cached precomputation, drastically lower computational complexity for simulating a gate. We further organize these operations over local-complementation (LC) orbits using minimum-edge representatives (MERs), which let us design purification circuits that apply to all locally equivalent graph states (up to a basis change). Using this framework, we optimize noisy finite-size multipartite distillation circuits for several graph-state families. Numerical results show that the resulting graph-preserving circuits can outperform standard recurrence-based purification protocols under realistic gate and measurement noise. Our results establish LC-orbit structure and factorized graph-preserving operations as practical tools for scalable, topology-aware and hardware-constrained graph-state distillation protocol design. Our work can also be interpreted as a graph-based heuristic for finding transversal gates.

quant-pharXiv:2606.23809•Jun 24, 2026•3 citations

Depth reduction for quantum Clifford circuits through Pauli measurements

Yi-Cong Zheng, Ching–Yi Lai, Todd A. Brun +1 more

Clifford circuits play an important role in quantum computation. Gottesman and Chuang proposed a gate teleportation protocol so that a quantum circuit can be implemented by the teleportation circuit with specific ancillary qubits. In particular, an $n$-qubit Clifford circuit $U$ can be implemented by preparing an ancillary stabilizer state $(I\otimes U)|Φ^+\rangle^{\otimes n}$ for teleportation and doing a Pauli correction conditioned on the measurement. In this paper, we provide an alternative procedure to implement a Clifford circuit through Pauli measurements, by preparing $O(1)$ ancillas that are Calderbank-Shor-Steane (CSS) stabilizer states. That is to say, $O(1)$ CSS states are sufficient to implement any Clifford circuit. As an application to fault-tolerant quantum computation, any Clifford circuit can be implemented by $O(1)$ steps of Steane syndrome extraction if clean CSS stabilizer states are available.

arXiv:1805.12082•May 30, 2018•8 citations

Local Clifford equivalence to CSS codes: Polynomial-time classification and conversion

Mingyuan Wang, Stefan Krastanov

Calderbank--Shor--Steane (CSS) codes support decoding and fault-tolerant logical operations through separate pure $X$ and pure $Z$ stabilizer checks. Generator choices and single-qubit Clifford transformations can obscure this structure. We give a deterministic polynomial-time algorithm that decides whether an arbitrary stabilizer code is locally Clifford-equivalent to a CSS code and constructs the required transformation and CSS checks whenever such a form exists. For $m$ possibly redundant generator rows on $n$ qubits, the algorithm uses $O(mn^2+n^4)$ binary field operations. We reduce the problem to affine linear systems by characterizing local projectors that preserve the span of the binary stabilizer labels. The conversion preserves code parameters and check sparsity for quantum low-density parity-check (qLDPC) codes. We demonstrate CSS recovery and decoder reuse and resolve previously open LC-to-CSS classification questions for published code constructions. For graph states, LC-to-CSS equivalence corresponds to the existence of a bipartite graph in the local-complementation orbit. We derive a necessary-and-sufficient adjacency-matrix criterion for this property and construct such a graph whenever one exists. Our algorithm makes CSS decoding and fault-tolerant constructions accessible throughout the local Clifford equivalence classes of CSS codes.

quant-pharXiv:2610.28737•Oct 22, 2026•0 citations

Stabilizer state breeding

Erik Hostens, Jeroen Dehaene, Bart De Moor

We present a breeding protocol that distills pure copies of any stabilizer state from noisy copies and a pool of predistilled pure copies of the same state, by means of local Clifford operations, Pauli measurements, and classical communication.

arXiv:quant-ph/0608145•Physical Review A•Dec 22, 2006•14 citations

Coherent information for Calderbank-Shor-Steane codes under decoherence

Ryotaro Niwa, Jong Yeon Lee

Stabilizer codes lie at the heart of modern quantum-error-correcting codes (QECCs). Of particular importance is a class called Calderbank-Shor-Steane (CSS) codes, which includes many important examples such as toric codes, color codes, and fractons. Recent studies have revealed that the decoding transition for these QECCs could be intrinsically captured by calculating information-theoretic quantities from the mixed state. Here we perform a simple analytic calculation of the coherent information for general CSS codes under local incoherent Pauli errors via diagonalization of the density matrices and mapping to classical statistical mechanical (SM) models. Our result establishes a rigorous connection between the decoding transition of the quantum code and the phase transition in the random classical SM model. It is also directly confirmed for CSS codes that exact error correction is possible if and only if the maximum-likelihood decoder always succeeds in the thermodynamic limit. Thus, the fundamental threshold is saturated by the optimal decoder.

arXiv:2407.02564•Physical Review A•Mar 3, 2025•22 citations
We present a hashing protocol for distilling multipartite Calderbank-Shor-Steane states by means of local Clifford operations, Pauli measurements, and classical communication. It is shown that this hashing protocol outperforms previous versions by exploiting information theory to a full extent and not only applying controlled-NOT gates as local Clifford operations. Using the information-theoretical notion of a strongly typical set, we calculate the asymptotic yield of the protocol as the solution of a linear programming problem.
Magic states are fundamental building blocks on the road to fault-tolerant quantum computing.Calderbank-Shor-Steane (CSS) codes play a crucial role in the construction of magic distillation protocols.Previous work has cast quantum computing with magic states for odd dimension d within a phase-space setting in which universal quantum computing is described by the statistical mechanics of quasiprobability distributions.Here we extend this framework to the important d = 2 qubit case and show that we can exploit common structures in CSS circuits to obtain distillation bounds capable of outperforming previous monotone bounds in regimes of practical interest.Moreover, in the case of CSS-code projections, we arrive at a novel cutoff result on the code length n of the CSS code in terms of parameters characterizing a desired distillation, which implies that for fixed target error rate and acceptance probability, one needs to consider only CSS codes below a threshold number of qubits.These entropic constraints are not due simply to the data-processing inequality but rely explicitly on the stochastic representation of such protocols.
Graph states form a broad class of multipartite entangled states underlying measurement-based quantum computation, quantum networks, and stabilizer codes. However, systematic entanglement distillation for arbitrary graph states remains challenging because the circuit design space grows rapidly with the number of parties. We introduce a group of Clifford operations that we call "factorized graph-preserving". It enables us to efficiently enumerate and optimize graph-state purification circuits at finite size for realistic noisy hardware. These operations map products of graph-basis states to products of graph-basis states, so their action can be represented as permutations of graph-basis labels. Moreover, this useful gate set admits a compact factorized description determined by simple graph-theoretic features. This structure also allows, after some initial cached precomputation, drastically lower computational complexity for simulating a gate. We further organize these operations over local-complementation (LC) orbits using minimum-edge representatives (MERs), which let us design purification circuits that apply to all locally equivalent graph states (up to a basis change). Using this framework, we optimize noisy finite-size multipartite distillation circuits for several graph-state families. Numerical results show that the resulting graph-preserving circuits can outperform standard recurrence-based purification protocols under realistic gate and measurement noise. Our results establish LC-orbit structure and factorized graph-preserving operations as practical tools for scalable, topology-aware and hardware-constrained graph-state distillation protocol design. Our work can also be interpreted as a graph-based heuristic for finding transversal gates.
Clifford circuits play an important role in quantum computation. Gottesman and Chuang proposed a gate teleportation protocol so that a quantum circuit can be implemented by the teleportation circuit with specific ancillary qubits. In particular, an nnn-qubit Clifford circuit UUU can be implemented by preparing an ancillary stabilizer state (I⊗U)∣Φ+⟩⊗n(I\otimes U)|Φ^+\rangle^{\otimes n}(I⊗U)∣Φ+⟩⊗n for teleportation and doing a Pauli correction conditioned on the measurement. In this paper, we provide an alternative procedure to implement a Clifford circuit through Pauli measurements, by preparing O(1)O(1)O(1) ancillas that are Calderbank-Shor-Steane (CSS) stabilizer states. That is to say, O(1)O(1)O(1) CSS states are sufficient to implement any Clifford circuit. As an application to fault-tolerant quantum computation, any Clifford circuit can be implemented by O(1)O(1)O(1) steps of Steane syndrome extraction if clean CSS stabilizer states are available.
Calderbank--Shor--Steane (CSS) codes support decoding and fault-tolerant logical operations through separate pure XXX and pure ZZZ stabilizer checks. Generator choices and single-qubit Clifford transformations can obscure this structure. We give a deterministic polynomial-time algorithm that decides whether an arbitrary stabilizer code is locally Clifford-equivalent to a CSS code and constructs the required transformation and CSS checks whenever such a form exists. For mmm possibly redundant generator rows on nnn qubits, the algorithm uses O(mn2+n4)O(mn^2+n^4)O(mn2+n4) binary field operations. We reduce the problem to affine linear systems by characterizing local projectors that preserve the span of the binary stabilizer labels. The conversion preserves code parameters and check sparsity for quantum low-density parity-check (qLDPC) codes. We demonstrate CSS recovery and decoder reuse and resolve previously open LC-to-CSS classification questions for published code constructions. For graph states, LC-to-CSS equivalence corresponds to the existence of a bipartite graph in the local-complementation orbit. We derive a necessary-and-sufficient adjacency-matrix criterion for this property and construct such a graph whenever one exists. Our algorithm makes CSS decoding and fault-tolerant constructions accessible throughout the local Clifford equivalence classes of CSS codes.
Stabilizer codes lie at the heart of modern quantum-error-correcting codes (QECCs). Of particular importance is a class called Calderbank-Shor-Steane (CSS) codes, which includes many important examples such as toric codes, color codes, and fractons. Recent studies have revealed that the decoding transition for these QECCs could be intrinsically captured by calculating information-theoretic quantities from the mixed state. Here we perform a simple analytic calculation of the coherent information for general CSS codes under local incoherent Pauli errors via diagonalization of the density matrices and mapping to classical statistical mechanical (SM) models. Our result establishes a rigorous connection between the decoding transition of the quantum code and the phase transition in the random classical SM model. It is also directly confirmed for CSS codes that exact error correction is possible if and only if the maximum-likelihood decoder always succeeds in the thermodynamic limit. Thus, the fundamental threshold is saturated by the optimal decoder.