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

Bulletin of the American Physical Society

Calderbank-Steane-Shor Holographic Quantum Error Correcting Codes

Thomas M. Stace

Published Mar 7, 2019• 2 citations
OpenAlex

Related papers

A Search Algorithm for Bases of Calderbank-Shor-Steane Type Quantum Error-Correcting Codes

Kin‐ichiroh Tokiwa

IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences•Mar 1, 2001•0 citations

Error-correctable efficient quantum homomorphic encryption using Calderbank–Shor–Steane codes

IlKwon Sohn, Boseon Kim, Kwangil Bae +2 more

arXiv:2401.08059•Quantum Information Processing•Jan 23, 2025•8 citations

Calderbank-Shor-Steane holographic quantum error-correcting codes

Robert J. Harris, Nathan A. McMahon, Gavin K. Brennen +1 more

We expand the class of holographic quantum error-correcting codes by developing the notion of block perfect tensors, a wider class that includes previously defined perfect tensors. The relaxation of this constraint opens up a range of other holographic codes. We demonstrate this by introducing the self-dual Calderbank-Shor-Steane (CSS) heptagon holographic code, based on the 7-qubit Steane code. Finally, we show promising thresholds for the erasure channel by applying a straightforward, optimal erasure decoder to the heptagon code and benchmark it against existing holographic codes.

arXiv:1806.06472•Physical Review A•Nov 1, 2018•61 citations

Quantum error correction with bosonic-Bacon-Shor codes

Stefanus Tanuarta, Arne L. Grimsmo

Bulletin of the American Physical Society•Mar 15, 2021•0 citations

Foliated Quantum Error-Correcting Codes

A. Bolt, Guillaume Duclos-Cianci, David Poulin +1 more

We show how to construct a large class of quantum error-correcting codes, known as Calderbank-Steane-Shor codes, from highly entangled cluster states. This becomes a primitive in a protocol that foliates a series of such cluster states into a much larger cluster state, implementing foliated quantum error correction. We exemplify this construction with several familiar quantum error-correction codes and propose a generic method for decoding foliated codes. We numerically evaluate the error-correction performance of a family of finite-rate Calderbank-Steane-Shor codes known as turbo codes, finding that they perform well over moderate depth foliations. Foliated codes have applications for quantum repeaters and fault-tolerant measurement-based quantum computation.

arXiv:1607.02579•Physical Review Letters•Aug 10, 2016•111 citations

Constructions for measuring error syndromes in Calderbank-Shor-Steane codes between Shor and Steane methods

Shilin Huang, Kenneth R. Brown

In another work [S. Huang and K. R. Brown, Phys. Rev. Lett. 127, 090505 (2021)] we introduced syndrome extraction methods for Calderbank-Shor-Steane quantum error-correction codes that interpolate between the well-known Shor and Steane syndrome extraction methods. Here we provide detailed proofs of the main theorems and show that up to gate ordering there is a one-to-one correspondence between extraction gadgets and partitions of the parity check matrix. Operationally, all the circuits in our framework can be obtained by merging ancilla qubits of Shor error correction with certain rules, which enables us to design fault-tolerant syndrome extraction circuits for given specific codes. We then apply our construction to the toric code and provide a detailed analysis of the time overhead of fault tolerance. In particular, we construct a syndrome extraction family whose time overhead smoothly varies from Shor to Steane error correction. To understand the potential advantage, we consider two simplified error models: no errors on the ancilla block and uncorrelated errors on the ancilla block. We study the threshold behavior of the family for both error models and show its potential advantage for quantum architectures with long coherence times.

Physical Review A•Aug 25, 2021•7 citations
We expand the class of holographic quantum error-correcting codes by developing the notion of block perfect tensors, a wider class that includes previously defined perfect tensors. The relaxation of this constraint opens up a range of other holographic codes. We demonstrate this by introducing the self-dual Calderbank-Shor-Steane (CSS) heptagon holographic code, based on the 7-qubit Steane code. Finally, we show promising thresholds for the erasure channel by applying a straightforward, optimal erasure decoder to the heptagon code and benchmark it against existing holographic codes.
We show how to construct a large class of quantum error-correcting codes, known as Calderbank-Steane-Shor codes, from highly entangled cluster states. This becomes a primitive in a protocol that foliates a series of such cluster states into a much larger cluster state, implementing foliated quantum error correction. We exemplify this construction with several familiar quantum error-correction codes and propose a generic method for decoding foliated codes. We numerically evaluate the error-correction performance of a family of finite-rate Calderbank-Steane-Shor codes known as turbo codes, finding that they perform well over moderate depth foliations. Foliated codes have applications for quantum repeaters and fault-tolerant measurement-based quantum computation.
In another work [S. Huang and K. R. Brown, Phys. Rev. Lett. 127, 090505 (2021)] we introduced syndrome extraction methods for Calderbank-Shor-Steane quantum error-correction codes that interpolate between the well-known Shor and Steane syndrome extraction methods. Here we provide detailed proofs of the main theorems and show that up to gate ordering there is a one-to-one correspondence between extraction gadgets and partitions of the parity check matrix. Operationally, all the circuits in our framework can be obtained by merging ancilla qubits of Shor error correction with certain rules, which enables us to design fault-tolerant syndrome extraction circuits for given specific codes. We then apply our construction to the toric code and provide a detailed analysis of the time overhead of fault tolerance. In particular, we construct a syndrome extraction family whose time overhead smoothly varies from Shor to Steane error correction. To understand the potential advantage, we consider two simplified error models: no errors on the ancilla block and uncorrelated errors on the ancilla block. We study the threshold behavior of the family for both error models and show its potential advantage for quantum architectures with long coherence times.