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:2610.20591

Logical CCZ state cultivation

Yuta Hirasaki, Jong Yeon Lee

quant-phSubmitted Oct 14, 2026• Announced Oct 15, 2026• 0 citations
arXivHTMLPDF

Abstract

Logical CCZ states enable Toffoli gates, a central building block of fault-tolerant quantum arithmetic. We introduce an end-to-end protocol for direct CCZ-state preparation on bivariate tricycle and bicycle (BT/BB) codes. Our factory combines the cup-product CCZ gates native to BT codes with two novel ingredients, both enabled by engineering the logical coupling between BT and BB codes through projection-preserving lifts. Index-2 lifted BB ancillas enable selective $Z$-basis initialization, allowing the native cup-product gates to directly prepare two disjoint logical CCZ states. The prepared CCZ states are faithfully transferred to index-3 lifted BB memories with high code distance. We use decoder-based postselection to obtain high-fidelity output states with low overhead. We perform exact simulations of our factory under a circuit-level noise model motivated by neutral-atom hardware, obtaining joint infidelities of $1.84\times10^{-5}$ at $21.94\%$ acceptance and $4.10\times10^{-7}$ at $8.89\%$ acceptance for single-qubit, CZ, and CCZ error rates of $0.01\%$, $0.1\%$, and $0.5\%$, respectively. At the output-infidelity target of our smallest factory, its estimated spacetime cost per CCZ state is lower than that of $T$-state cultivation followed by CCZ conversion, providing an efficient route to logical CCZ states for fault-tolerant quantum computation.

AI Summary

The paper addresses direct preparation of logical CCZ resource states for fault-tolerant Toffoli gates, avoiding conversion from cultivated $T$ states. It constructs an end-to-end factory combining native cup-product CCZ gates on bivariate tricycle (BT) codes with lifted bivariate bicycle (BB) ancillas and memories. The construction engineers logical couplings using projection-preserving lifts. Index-2 lifts selectively initialize one logical qubit in each of three BT blocks, reducing the native six-CCZ logical interaction to two disjoint CCZ-state preparations in physical CCZ depth two. Index-3 lifts transfer the retained logical qubits into higher-distance BB memories. Decoder-based postselection suppresses faults during preparation and escape. Circuit-level Monte Carlo simulations retain interference exactly using a four-term stabilizer decomposition with a residual subsystem of at most six qubits. At single-qubit, CZ, and CCZ error rates of $10^{-4}$, $10^{-3}$, and $5\times10^{-3}$, respectively, the distance-3 factory uses 405 peak qubits and achieves joint two-output infidelity $1.84\times10^{-5}$ at 21.94% acceptance. The distance-4 factory uses 675 qubits and achieves $4.10\times10^{-7}$ at 8.89% acceptance, with six observed corrupted outputs. Estimated spacetime costs per CCZ are $5.54\times10^4$ and $1.72\times10^5$ qubit-gate steps: the former is $1.6\times$ lower than the selected $T$-cultivation-plus-conversion benchmark, while the latter is higher. Limitations include zero assumed idle noise, low acceptance, correlated outputs, and escape-decoding failures. Fidelities include noiseless terminal recovery; comparison costs depend on scheduling assumptions and omit conversion-induced infidelity and additional $T$-input buffering.

Little sign of AI-generated textStrong assumptions

Error found: The smallest factory's estimated spacetime advantage is benchmark-dependent: the T-cultivation schedules are not uniformly recompiled, and the assumed conversion syndrome-extraction cadence is not established as necessary.

Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.

Related papers

Structure-Aware Placement and Routing of Multi-Controlled Toffoli on Bivariate Bicycle Code Architectures

Anik Basu Bhaumik, Suman Dutta, Siyi Wang +1 more

The multi-controlled Toffoli (MCT) gate is a fundamental primitive in quantum circuit design, with applications in quantum arithmetic, cryptanalysis, and algorithmic implementations. Being a high-level logical operation, the efficient decomposition of MCT gates into lower-level netlists has remained a major optimization challenge for decades. While emerging quantum error-correcting codes such as bivariate bicycle (BB) codes drastically reduce fault-tolerance overhead, realizing non-Clifford circuits on modular BB-code architectures introduces complex compilation bottlenecks governed by inter-module routing, factory density, and layout. Consequently, the mapping of MCT gates onto BB-code architectures remains relatively unexplored. In this paper, we overcome these challenges by mapping optimal-Toffoli-depth MCT decompositions (Dutta et al., PRA, 2025) onto BB-code-based fault-tolerant architectures via direct $\lvert \mathrm{CCZ} \rangle$ state injection from an external magic state factory. We introduce a targeted placement strategy that exploits the binary-tree structure of MCT decompositions to co-locate interacting subtrees. This approach reduces inter-module instruction counts by up to $\mathbf{16.02}\%$ compared to a naive sequential first-fit placement. We also evaluate the impact of factory placement across different topologies, demonstrating that grid-based layouts yield up to a $\mathbf{23.7}\%$ reduction in inter-module instructions relative to linear architectures (Yoder et al., arXiv, 2025). Finally, we validate the practical viability of our compiled circuits by analyzing aggregate execution errors and logical failure probabilities using the bicycle-ISA error estimator bicycle_numerics provided by the Qiskit community, https://github.com/qiskit-community/bicycle-architecture-compiler.

quant-pharXiv:2609.00852•Sep 2, 2026•0 citations

Single-shot magic state factories for quantum LDPC codes

Varun Menon, Rohan Mehta, Andi Gu +8 more

Quantum low-density parity-check (qLDPC) codes can substantially reduce the qubit overhead of fault-tolerant quantum computation, but any useful architecture based on such codes also requires an efficient mechanism to implement non-Clifford gates in a fault-tolerant manner. We introduce a space-time-efficient magic state factory for high-rate qLDPC codes by combining the transversal non-Clifford gates of recently developed tricycle codes with single-shot four-dimensional balanced product quadcycle codes. The key ingredient is an efficient "escape" mechanism that teleports postselected logical magic states from tricycle codes to larger distance quadcycle codes. Under a standard circuit-level noise model at physical error rate $10^{-3}$, our factories produce $\mathrm{CCZ}$ states at logical error rates as low as $10^{-9}$ with 10-40 times lower space-time cost than state-of-the-art magic state generation methods. The resulting states are directly encoded in high-rate blocks suitable for computation. We identify the quadcycle codes by an AI-assisted search and show that they can serve as excellent memories capable of single-shot error correction. Finally, we present a concrete implementation of the entire factory with highly efficient atom transport on reconfigurable neutral-atom quantum computers. Together, these results provide an end-to-end, practical protocol for producing and utilizing high-fidelity magic states within a high-rate qLDPC architecture, with the lowest space-time cost to date.

quant-pharXiv:2610.10731•Oct 9, 2026•0 citations

Transversal dimension jump for product qLDPC codes

Christine Li, John P. Preskill, Qian Xu

We introduce transversal dimension jump, a code-switching protocol for lifted product (LP) quantum low-density parity-check (qLDPC) codes across different chain-complex dimensions, enabling universal fault-tolerant quantum computation with low overhead. The construction leverages the product structure of LP codes to implement one-way transversal CNOTs between a 3D code and its 2D component codes, enabling teleportation-based switching with geometrically nonlocal gates. Combined with constant-depth CCZ gates in 3D LP codes and low-overhead transversal Clifford gates in 2D LP codes, this yields universal, high-rate quantum logical computation with high thresholds and low space-time costs. Beyond asymptotic schemes, we identify explicit 3D-2D LP code pairs supporting cup-product CCZ gates, including bivariate tricycle-bicycle families such as the $[[81,3,5]]$-$[[54,2,6]]$ pair, where the 3D tricycle codes admit depth-2 CCZ, weight-6 stabilizers, and pseudo-thresholds $\gtrsim 0.4\%$. As a byproduct, we show that the 3D codes enable highly efficient magic-state preparation: a single round of stabilizer measurements followed by depth-2 CCZ and postselection produces states with error $<10^{-9}$ and success probability $\sim 35\%$. Our results establish a native integration of qLDPC codes with complementary transversal gates-covering nearly all practically relevant families known so far-and open a broad design space for scalable, low-overhead universal quantum computation.

arXiv:2510.07269•Oct 8, 2025•29 citations

Distilling Magic States in the Bicycle Architecture

Shifan Xu, Kun Liu, Patrick Rall +2 more

Magic State Distillation is considered to be one of the promising methods for supplying the non-Clifford resources required to achieve universal fault tolerance. Conventional MSD protocols implemented in surface codes often require multiple code blocks and lattice surgery rounds, resulting in substantial qubit overhead, especially at low target error rates. In this work, we present practical magic state distillation factories on Bivariate Bicycle (BB) codes that execute Pauli-measurement-based Clifford circuits inside a single BB code block. We formulate distillation circuit design as a joint optimization of logical qubit mapping, gate scheduling, measurement nativization, and protocol compression via qubit recycling. Based on detailed resource analysis and simulations, our BB factories have space-time volume comparable to that of leading distillation factories while delivering lower target error at a smaller qubit footprint, and are particularly compelling as second-round distillers following magic state cultivations.

quant-pharXiv:2602.20546•Feb 25, 2026•16 citations

Magic State Distillation via Codes over Binary Extension Fields

Anqi Gong, Christopher A. Pattison, Patrick Rall +1 more

Fault-tolerant quantum computation architectures are frequently bottlenecked by the overhead of producing high-fidelity magic states. In this work, we use algebraic geometric techniques to construct codes over binary extension fields $\mathbb{F}_{2^s}$, thus discovering new protocols for the distillation of qubit magic states, where our focus is on the regime of practical qubit-based quantum computing architectures. To do this, we show that multi-qubit gates of interest such as $\text{CS}$, $\text{CCZ}$, and $\text{TOF}\# = \text{CCZ}_{123}\text{CCZ}_{345}$, can be packaged into simple gates over the larger fields, and we derive simple algebraic conditions in the extension fields allowing the distillation of these gates. Because they are derived from Galois qudits, the corresponding qubits codes naturally handle the correlated errors present on such multi-qubit states. Moreover, the protocols we discover are extremely compact; for example, we show that 4 $\text{CS}$ states can be distilled to 1 $\text{CS}$ state at distance 2, using only 4 logical qubits. For a case study, we consider the distillation of $\text{CS}$ and $\text{CCZ}$ states from injected $\text{T}$ and $\text{CS}$ states. When optimized for magic state production per unit time, or logical spacetime volume, we find that our protocols outperform the state-of-the-art in almost every situation, both at input error rates $10^{-3}$ (direct injection), and $10^{-6}$ (allowing some cultivation pre-injection).

quant-pharXiv:2608.09727•Aug 11, 2026•7 citations

Magic Tricycles: Efficient Magic-State Generation with Finite Block-Length Quantum LDPC Codes

Varun Menon, J. Pablo Bonilla Ataides, Rohan Mehta +3 more

The preparation of high-fidelity non-Clifford (magic) states is an essential subroutine for universal quantum computation but imposes substantial space-time overhead. Magic-state factories based on high-rate and -distance quantum low-density parity-check (LDPC) codes equipped with transversal non-Clifford gates can potentially reduce these overheads significantly, by circumventing the need for multiple rounds of distillation and by producing a large number of magic states in a single code block. As a step toward realizing efficient, fault-tolerant magic-state production, we introduce a class of finite block-length quantum LDPC codes which we name tricycle codes, generalizing the well-known bicycle codes to three homological dimensions. These codes can support constant-depth physical circuits that implement logical C C Z gates between three code blocks. To construct these constant-depth C C Z circuits, we develop analytical and numerical techniques that apply to a broad class of three-dimensional homological and balanced-product codes. We further show that tricycle codes enable single-shot state preparation and error correction, leading to a highly efficient magic-state generation protocol. Numerical simulations of specific codes confirm robust performance under circuit-level noise, demonstrating a high circuit-noise threshold of > 0.5 % . With modest postselection, certain tricycle codes of block lengths of only approximately 50–100 qubits are shown to produce | C C Z ¯ ⟩ magic states with logical error rates ranging from 2 × 10 − 8 to below 3 × 10 − 11 . Finally, we construct optimal depth syndrome extraction circuits for tricycle codes and present a protocol for implementing them efficiently on a reconfigurable neutral-atom platform.

arXiv:2508.10714•Physical Review X•Mar 3, 2026•31 citations
Logical CCZ states enable Toffoli gates, a central building block of fault-tolerant quantum arithmetic. We introduce an end-to-end protocol for direct CCZ-state preparation on bivariate tricycle and bicycle (BT/BB) codes. Our factory combines the cup-product CCZ gates native to BT codes with two novel ingredients, both enabled by engineering the logical coupling between BT and BB codes through projection-preserving lifts. Index-2 lifted BB ancillas enable selective ZZZ-basis initialization, allowing the native cup-product gates to directly prepare two disjoint logical CCZ states. The prepared CCZ states are faithfully transferred to index-3 lifted BB memories with high code distance. We use decoder-based postselection to obtain high-fidelity output states with low overhead. We perform exact simulations of our factory under a circuit-level noise model motivated by neutral-atom hardware, obtaining joint infidelities of 1.84×10−51.84\times10^{-5}1.84×10−5 at 21.94%21.94\%21.94% acceptance and 4.10×10−74.10\times10^{-7}4.10×10−7 at 8.89%8.89\%8.89% acceptance for single-qubit, CZ, and CCZ error rates of 0.01%0.01\%0.01%, 0.1%0.1\%0.1%, and 0.5%0.5\%0.5%, respectively. At the output-infidelity target of our smallest factory, its estimated spacetime cost per CCZ state is lower than that of TTT-state cultivation followed by CCZ conversion, providing an efficient route to logical CCZ states for fault-tolerant quantum computation.
The paper addresses direct preparation of logical CCZ resource states for fault-tolerant Toffoli gates, avoiding conversion from cultivated TTT states. It constructs an end-to-end factory combining native cup-product CCZ gates on bivariate tricycle (BT) codes with lifted bivariate bicycle (BB) ancillas and memories.
The construction engineers logical couplings using projection-preserving lifts. Index-2 lifts selectively initialize one logical qubit in each of three BT blocks, reducing the native six-CCZ logical interaction to two disjoint CCZ-state preparations in physical CCZ depth two. Index-3 lifts transfer the retained logical qubits into higher-distance BB memories. Decoder-based postselection suppresses faults during preparation and escape. Circuit-level Monte Carlo simulations retain interference exactly using a four-term stabilizer decomposition with a residual subsystem of at most six qubits.
At single-qubit, CZ, and CCZ error rates of 10−410^{-4}10−4, 10−310^{-3}10−3, and 5×10−35\times10^{-3}5×10−3, respectively, the distance-3 factory uses 405 peak qubits and achieves joint two-output infidelity 1.84×10−51.84\times10^{-5}1.84×10−5 at 21.94% acceptance. The distance-4 factory uses 675 qubits and achieves 4.10×10−74.10\times10^{-7}4.10×10−7 at 8.89% acceptance, with six observed corrupted outputs. Estimated spacetime costs per CCZ are 5.54×1045.54\times10^45.54×104 and 1.72×1051.72\times10^51.72×105 qubit-gate steps: the former is 1.6×1.6\times1.6× lower than the selected TTT-cultivation-plus-conversion benchmark, while the latter is higher.
Limitations include zero assumed idle noise, low acceptance, correlated outputs, and escape-decoding failures. Fidelities include noiseless terminal recovery; comparison costs depend on scheduling assumptions and omit conversion-induced infidelity and additional TTT-input buffering.
The multi-controlled Toffoli (MCT) gate is a fundamental primitive in quantum circuit design, with applications in quantum arithmetic, cryptanalysis, and algorithmic implementations. Being a high-level logical operation, the efficient decomposition of MCT gates into lower-level netlists has remained a major optimization challenge for decades. While emerging quantum error-correcting codes such as bivariate bicycle (BB) codes drastically reduce fault-tolerance overhead, realizing non-Clifford circuits on modular BB-code architectures introduces complex compilation bottlenecks governed by inter-module routing, factory density, and layout. Consequently, the mapping of MCT gates onto BB-code architectures remains relatively unexplored. In this paper, we overcome these challenges by mapping optimal-Toffoli-depth MCT decompositions (Dutta et al., PRA, 2025) onto BB-code-based fault-tolerant architectures via direct ∣CCZ⟩\lvert \mathrm{CCZ} \rangle∣CCZ⟩ state injection from an external magic state factory. We introduce a targeted placement strategy that exploits the binary-tree structure of MCT decompositions to co-locate interacting subtrees. This approach reduces inter-module instruction counts by up to 16.02%\mathbf{16.02}\%16.02% compared to a naive sequential first-fit placement. We also evaluate the impact of factory placement across different topologies, demonstrating that grid-based layouts yield up to a 23.7%\mathbf{23.7}\%23.7% reduction in inter-module instructions relative to linear architectures (Yoder et al., arXiv, 2025). Finally, we validate the practical viability of our compiled circuits by analyzing aggregate execution errors and logical failure probabilities using the bicycle-ISA error estimator bicycle_numerics provided by the Qiskit community, https://github.com/qiskit-community/bicycle-architecture-compiler.
Quantum low-density parity-check (qLDPC) codes can substantially reduce the qubit overhead of fault-tolerant quantum computation, but any useful architecture based on such codes also requires an efficient mechanism to implement non-Clifford gates in a fault-tolerant manner. We introduce a space-time-efficient magic state factory for high-rate qLDPC codes by combining the transversal non-Clifford gates of recently developed tricycle codes with single-shot four-dimensional balanced product quadcycle codes. The key ingredient is an efficient "escape" mechanism that teleports postselected logical magic states from tricycle codes to larger distance quadcycle codes. Under a standard circuit-level noise model at physical error rate 10−310^{-3}10−3, our factories produce CCZ\mathrm{CCZ}CCZ states at logical error rates as low as 10−910^{-9}10−9 with 10-40 times lower space-time cost than state-of-the-art magic state generation methods. The resulting states are directly encoded in high-rate blocks suitable for computation. We identify the quadcycle codes by an AI-assisted search and show that they can serve as excellent memories capable of single-shot error correction. Finally, we present a concrete implementation of the entire factory with highly efficient atom transport on reconfigurable neutral-atom quantum computers. Together, these results provide an end-to-end, practical protocol for producing and utilizing high-fidelity magic states within a high-rate qLDPC architecture, with the lowest space-time cost to date.
We introduce transversal dimension jump, a code-switching protocol for lifted product (LP) quantum low-density parity-check (qLDPC) codes across different chain-complex dimensions, enabling universal fault-tolerant quantum computation with low overhead. The construction leverages the product structure of LP codes to implement one-way transversal CNOTs between a 3D code and its 2D component codes, enabling teleportation-based switching with geometrically nonlocal gates. Combined with constant-depth CCZ gates in 3D LP codes and low-overhead transversal Clifford gates in 2D LP codes, this yields universal, high-rate quantum logical computation with high thresholds and low space-time costs. Beyond asymptotic schemes, we identify explicit 3D-2D LP code pairs supporting cup-product CCZ gates, including bivariate tricycle-bicycle families such as the [[81,3,5]][[81,3,5]][[81,3,5]]-[[54,2,6]][[54,2,6]][[54,2,6]] pair, where the 3D tricycle codes admit depth-2 CCZ, weight-6 stabilizers, and pseudo-thresholds ≳0.4%\gtrsim 0.4\%≳0.4%. As a byproduct, we show that the 3D codes enable highly efficient magic-state preparation: a single round of stabilizer measurements followed by depth-2 CCZ and postselection produces states with error <10−9<10^{-9}<10−9 and success probability ∼35%\sim 35\%∼35%. Our results establish a native integration of qLDPC codes with complementary transversal gates-covering nearly all practically relevant families known so far-and open a broad design space for scalable, low-overhead universal quantum computation.
Magic State Distillation is considered to be one of the promising methods for supplying the non-Clifford resources required to achieve universal fault tolerance. Conventional MSD protocols implemented in surface codes often require multiple code blocks and lattice surgery rounds, resulting in substantial qubit overhead, especially at low target error rates. In this work, we present practical magic state distillation factories on Bivariate Bicycle (BB) codes that execute Pauli-measurement-based Clifford circuits inside a single BB code block. We formulate distillation circuit design as a joint optimization of logical qubit mapping, gate scheduling, measurement nativization, and protocol compression via qubit recycling. Based on detailed resource analysis and simulations, our BB factories have space-time volume comparable to that of leading distillation factories while delivering lower target error at a smaller qubit footprint, and are particularly compelling as second-round distillers following magic state cultivations.
Fault-tolerant quantum computation architectures are frequently bottlenecked by the overhead of producing high-fidelity magic states. In this work, we use algebraic geometric techniques to construct codes over binary extension fields F2s\mathbb{F}_{2^s}F2s​, thus discovering new protocols for the distillation of qubit magic states, where our focus is on the regime of practical qubit-based quantum computing architectures. To do this, we show that multi-qubit gates of interest such as CS\text{CS}CS, CCZ\text{CCZ}CCZ, and TOF#=CCZ123CCZ345\text{TOF}\# = \text{CCZ}_{123}\text{CCZ}_{345}TOF#=CCZ123​CCZ345​, can be packaged into simple gates over the larger fields, and we derive simple algebraic conditions in the extension fields allowing the distillation of these gates. Because they are derived from Galois qudits, the corresponding qubits codes naturally handle the correlated errors present on such multi-qubit states. Moreover, the protocols we discover are extremely compact; for example, we show that 4 CS\text{CS}CS states can be distilled to 1 CS\text{CS}CS state at distance 2, using only 4 logical qubits. For a case study, we consider the distillation of CS\text{CS}CS and CCZ\text{CCZ}CCZ states from injected T\text{T}T and CS\text{CS}CS states. When optimized for magic state production per unit time, or logical spacetime volume, we find that our protocols outperform the state-of-the-art in almost every situation, both at input error rates 10−310^{-3}10−3 (direct injection), and 10−610^{-6}10−6 (allowing some cultivation pre-injection).
The preparation of high-fidelity non-Clifford (magic) states is an essential subroutine for universal quantum computation but imposes substantial space-time overhead. Magic-state factories based on high-rate and -distance quantum low-density parity-check (LDPC) codes equipped with transversal non-Clifford gates can potentially reduce these overheads significantly, by circumventing the need for multiple rounds of distillation and by producing a large number of magic states in a single code block. As a step toward realizing efficient, fault-tolerant magic-state production, we introduce a class of finite block-length quantum LDPC codes which we name tricycle codes, generalizing the well-known bicycle codes to three homological dimensions. These codes can support constant-depth physical circuits that implement logical C C Z gates between three code blocks. To construct these constant-depth C C Z circuits, we develop analytical and numerical techniques that apply to a broad class of three-dimensional homological and balanced-product codes. We further show that tricycle codes enable single-shot state preparation and error correction, leading to a highly efficient magic-state generation protocol. Numerical simulations of specific codes confirm robust performance under circuit-level noise, demonstrating a high circuit-noise threshold of > 0.5 % . With modest postselection, certain tricycle codes of block lengths of only approximately 50–100 qubits are shown to produce | C C Z ¯ ⟩ magic states with logical error rates ranging from 2 × 10 − 8 to below 3 × 10 − 11 . Finally, we construct optimal depth syndrome extraction circuits for tricycle codes and present a protocol for implementing them efficiently on a reconfigurable neutral-atom platform.