Logical CCZ state cultivation
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, allo...
Description / Details
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 -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 at acceptance and at acceptance for single-qubit, CZ, and CCZ error rates of , , and , respectively. At the output-infidelity target of our smallest factory, its estimated spacetime cost per CCZ state is lower than that of -state cultivation followed by CCZ conversion, providing an efficient route to logical CCZ states for fault-tolerant quantum computation.
Source: arXiv:2610.20591v1 - http://arxiv.org/abs/2610.20591v1 PDF: https://arxiv.org/pdf/2610.20591v1 Original Link: http://arxiv.org/abs/2610.20591v1
Please sign in to join the discussion.
No comments yet. Be the first to share your thoughts!
Oct 15, 2026
Quantum Computing
Quantum Physics
0