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

Conference on Lasers and Electro-Optics

Generating foliated quantum error-correcting codes with quantum optics

F. Brunel, Miller Eaton, Hussain Zaidi, Olivier Pfister

Published Jan 1, 2024• 0 citations
Publisher

Abstract

We present a graph generation algorithm, using quantum optical circuits, for general continuous-variable cluster states of arbitrary dimension. We describe its application to the large-scale generation of the foliated toric code for quantum error correction.
DOI
10.1364/cleo_fs.2024.ff1h.4

Related papers

Foliated Quantum Error Correction for Qudits

Gözde Üstün, Simon J. Devitt, Jason Saied

We present a framework for foliating any Pauli-based quantum error-correcting code over prime-dimensional qudits. For any such code, we obtain a qudit graph state that can be measured to perform fault-tolerant measurement-based quantum computing. Such a paradigm is of interest in platforms such as photonics, where measurement-based protocols are natural and high-dimensional states are readily available. We discuss several examples for arbitrary prime dimension $d$, such as the qudit toric code (stabilizer, CSS), the $d$-dimensional perfect $[[5,1,3]]$ code (stabilizer, non-CSS), and a straightforward $d$-dimensional generalization of the CSS honeycomb code (dynamical, CSS). Under a simple error model, we numerically calculate thresholds for the foliated qudit toric code and demonstrate that they are comparable to the non-foliated version.

quant-pharXiv:2607.13784•Jul 16, 2026•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

Single-shot and measurement-based quantum error correction via fault complexes

Timo Hillmann, Guillaume Dauphinais, Ilan Tzitrin +1 more

Photonics provides a viable path to a scalable fault-tolerant quantum computer. The natural framework for this platform is measurement-based quantum computation, where fault-tolerant graph states supersede traditional quantum error-correcting codes. However, the existing formalism for foliation—the construction of fault-tolerant graph states—does not reveal how certain properties, such as single-shot error correction, manifest in the measurement-based setting. We introduce the fault complex, a representation of dynamic quantum error-correction protocols particularly well suited to describe foliation. Our approach enables precise computation of fault tolerance properties of foliated codes and provides insights into circuit-based quantum computation. Analyzing the fault complex yields improved thresholds for three- and four-dimensional toric codes, a generalization of stability experiments, and the existence of single-shot lattice surgery with higher-dimensional topological codes.

arXiv:2410.12963•Physical Review A•Sep 16, 2025•30 citations

Quantum circuit for toric code state preparation via graph states

Pengcheng Liao, David L. Feder

Given the wide applicability of topological states for fault-tolerant quantum computation, an important outstanding question is how to generate these states within the quantum circuit model, and if it is possible to do so efficiently. In this work, toric code states on the torus are mapped to an equivalent graph state under local Clifford operations. The graph is composed of only two subgraphs, both of which can be generated in log depth, assuming geometrically non-local gates. Including ancillae and measurements, the circuit depth can be reduced to a constant at the cost of increasing the circuit width. Among many insights, the toric code graph structure reveals a close connection between repetition and topological codes. Due to their local equivalence to the toric code, all two-dimensional translationally invariant topological stabilizer codes are therefore efficiently preparable on a quantum circuit. The results provide a new graph-theoretic framework for the development of novel topological error correction codes, beyond geometrical considerations.

•Mar 23, 2021•1 citation

Quantum-error-correcting codes using qudit graph states

Shiang Yong Looi, Li Zhi Yu, Vlad Gheorghiu +1 more

Graph states are generalized from qubits to collections of $n$ qudits of arbitrary dimension $D$, and simple graphical methods are used to construct both additive and nonadditive, as well as degenerate and nondegenerate, quantum-error-correcting codes. Codes of distance 2 saturating the quantum Singleton bound for arbitrarily large $n$ and $D$ are constructed using simple graphs, except when $n$ is odd and $D$ is even. Computer searches have produced a number of codes with distances 3 and 4, some previously known and some new. The concept of a stabilizer is extended to general $D$, and shown to provide a dual representation of an additive graph code.

arXiv:0712.1979•Physical Review A•Oct 7, 2008•118 citations

A quantum stabilizer code associated with cluster states

Dan Song, Zhengwen Cao, Shuanghao Zhang +3 more

We present a construction scheme for quantum error-correcting code of cluster states, which is a similar method of splicing stepwise as the Toric code. The stabilizer codes space can be founded by a Hamiltonian, which is constructed with a finite abelian group. A principal code space is set up by the entanglement among cluster state particles. Then a complete stabilizer code matrix can be found by supplement of computing analysis which satisfies the error-correcting conditions. This allows a simple verification for 1 - error correcting property in any dimension. Furthermore, we can obtain a suitable quantum stabilizer code.

International Conference on the Frontiers and Advances in Data Science (FADS)•Oct 1, 2017•2 citations
We present a framework for foliating any Pauli-based quantum error-correcting code over prime-dimensional qudits. For any such code, we obtain a qudit graph state that can be measured to perform fault-tolerant measurement-based quantum computing. Such a paradigm is of interest in platforms such as photonics, where measurement-based protocols are natural and high-dimensional states are readily available. We discuss several examples for arbitrary prime dimension ddd, such as the qudit toric code (stabilizer, CSS), the ddd-dimensional perfect [[5,1,3]][[5,1,3]][[5,1,3]] code (stabilizer, non-CSS), and a straightforward ddd-dimensional generalization of the CSS honeycomb code (dynamical, CSS). Under a simple error model, we numerically calculate thresholds for the foliated qudit toric code and demonstrate that they are comparable to the non-foliated version.
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.
Photonics provides a viable path to a scalable fault-tolerant quantum computer. The natural framework for this platform is measurement-based quantum computation, where fault-tolerant graph states supersede traditional quantum error-correcting codes. However, the existing formalism for foliation—the construction of fault-tolerant graph states—does not reveal how certain properties, such as single-shot error correction, manifest in the measurement-based setting. We introduce the fault complex, a representation of dynamic quantum error-correction protocols particularly well suited to describe foliation. Our approach enables precise computation of fault tolerance properties of foliated codes and provides insights into circuit-based quantum computation. Analyzing the fault complex yields improved thresholds for three- and four-dimensional toric codes, a generalization of stability experiments, and the existence of single-shot lattice surgery with higher-dimensional topological codes.
Given the wide applicability of topological states for fault-tolerant quantum computation, an important outstanding question is how to generate these states within the quantum circuit model, and if it is possible to do so efficiently. In this work, toric code states on the torus are mapped to an equivalent graph state under local Clifford operations. The graph is composed of only two subgraphs, both of which can be generated in log depth, assuming geometrically non-local gates. Including ancillae and measurements, the circuit depth can be reduced to a constant at the cost of increasing the circuit width. Among many insights, the toric code graph structure reveals a close connection between repetition and topological codes. Due to their local equivalence to the toric code, all two-dimensional translationally invariant topological stabilizer codes are therefore efficiently preparable on a quantum circuit. The results provide a new graph-theoretic framework for the development of novel topological error correction codes, beyond geometrical considerations.
Graph states are generalized from qubits to collections of nnn qudits of arbitrary dimension DDD, and simple graphical methods are used to construct both additive and nonadditive, as well as degenerate and nondegenerate, quantum-error-correcting codes. Codes of distance 2 saturating the quantum Singleton bound for arbitrarily large nnn and DDD are constructed using simple graphs, except when nnn is odd and DDD is even. Computer searches have produced a number of codes with distances 3 and 4, some previously known and some new. The concept of a stabilizer is extended to general DDD, and shown to provide a dual representation of an additive graph code.
We present a construction scheme for quantum error-correcting code of cluster states, which is a similar method of splicing stepwise as the Toric code. The stabilizer codes space can be founded by a Hamiltonian, which is constructed with a finite abelian group. A principal code space is set up by the entanglement among cluster state particles. Then a complete stabilizer code matrix can be found by supplement of computing analysis which satisfies the error-correcting conditions. This allows a simple verification for 1 - error correcting property in any dimension. Furthermore, we can obtain a suitable quantum stabilizer code.