2024/10/09 by Théo Dessertaine, Dessertaine, Théo, Boris Bourdoncle +12 · 3 citations
Computer Science · Engineering · Mathematics · #Architecture #Code (set theory) #Computer architecture #Computer science #Distributed computing #Fault tolerance #Floquet theory #Materials science #Mathematics #Neural Networks and Reservoir Computing #Optical Network Technologies #Optoelectronics #Parallel computing #Photonic and Optical Devices #Photonics #Physics #Programming language #Quantum #Quantum computer #Quantum mechanics #Set (abstract data type) #Surface (topology)
paper · pdf · doi:10.48550/arxiv.2410.07065
published in arXiv (Cornell University) (Cornell University)
openalex publication_date 2024/10/09 · openalex created_date 2024/10/12 · openalex updated_date 2026/07/28
Fault-tolerant quantum computing is crucial for realizing large-scale quantum computation, and the interplay between hardware architecture and quantum error-correcting codes is a key consideration. We present a comparative study of two quantum error-correcting codes - the surface code and the honeycomb Floquet code - implemented on the spin-optical quantum computing architecture, either with controlled-Z operations or with direct parity measurements. This allows for a direct comparison of the codes using consistent noise models. Notably, we achieve a loss threshold of 6.3% with the honeycomb Floquet code implemented on our tailored architecture, almost twice as high as the loss threshold obtained with the surface code on the previous architecture, all the while requiring less physical qubits. This finding is particularly significant given that photon loss is the primary source of errors in photon-mediated quantum computing. Moreover, we benchmark the general performances of the two codes in a multi-error setting by computing the volume of the fault-tolerant region, and show that the fault-tolerant region of the honeycomb code is over twice as large as that of the surface code.