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:2104.03241 · PRX Quantum

Fault-Tolerant Quantum Computation with Static Linear Optics

Ilan Tzitrin, Takaya Matsuura, Rafael N. Alexander, Guillaume Dauphinais, J. Eli Bourassa, Krishna Kumar Sabapathy, Nicolas C. Menicucci, Ish Dhand

Published Dec 16, 2021• 76 citations
arXivHTMLPDF

Abstract

The scalability of photonic implementations of fault-tolerant quantum computing based on Gottesman-Kitaev-Preskill (GKP) qubits is injured by the requirements of inline squeezing and reconfigurability of the linear optical network.In this work we propose a topologically error-corrected architecture that does away with these elements at no cost-in fact, at an advantage-to state preparation overheads.Our computer consists of three modules: a two-dimensional (2D) array of probabilistic sources of GKP states; a depthfour circuit of static beam splitters, phase shifters, and short delay lines; and a 2D array of homodyne detectors.The symmetry of our proposed circuit allows us to combine the effects of finite squeezing and uniform photon loss within the noise model, resulting in more comprehensive threshold estimates.These jumps over both architectural and analytical hurdles considerably expedite the construction of a photonic quantum computer.

DOI
10.1103/prxquantum.2.040353

Related papers

Fault-Tolerant Continuous-Variable Measurement-based Quantum Computation Architecture

Mikkel V. Larsen, Christopher Chamberland, Kyungjoo Noh +2 more

Continuous-variable measurement-based quantum computation on cluster states has in recent years shown great potential for scalable, universal, and fault-tolerant quantum computation when combined with the Gottesman-Kitaev-Preskill (GKP) code and quantum error correction.However, no complete fault-tolerant architecture exists that includes everything from cluster-state generation with finite squeezing to gate implementations with realistic noise and error correction.In this work, we propose a simple architecture for the preparation of a cluster state in three dimensions in which gates can be efficiently implemented by gate teleportation.To accommodate scalability, we propose architectures that allow both spatial and temporal multiplexing, with the temporally encoded version requiring as little as two squeezed light sources.Because of its three-dimensional structure, the architecture supports topological qubit error correction, while GKP error correction is efficiently realized within the architecture by teleportation.To validate fault tolerance, the architecture is simulated using surface-GKP codes, including noise from GKP states as well as gate noise caused by finite squeezing in the cluster state.We find a fault-tolerant squeezing threshold of 12.7 dB, with room for further improvement.

arXiv:2101.03014•PRX Quantum•Aug 11, 2021•124 citations

Resource-efficient high-threshold fault-tolerant quantum computation with weak nonlinear optics

Kosuke Fukui, Peter van Loock

Quantum computation with light, compared with other platforms, offers the unique benefit of natural high-speed operations at room temperature and large clock rate, but a big obstacle of photonics is the lack of strong nonlinearities which also makes loss-tolerant or generally fault-tolerant quantum computation (FTQC) complicated in an all-optical setup. Typical current approaches to optical FTQC that aim at building suitable large multi-qubit cluster states by linearly fusing small elementary resource states would still demand either fairly expensive initial resources or rather low loss and error rates. Here we propose reintroducing weakly nonlinear operations, such as a weak cross-Kerr interaction, to achieve small initial resource cost and high error thresholds at the same time. More specifically, we propose an approach to generate a large-scale cluster state by hybridizing Gottesman-Kitaev-Preskill (GKP) and single-photon qubits. Our approach enables us to implement FTQC based on GKP squeezing of 7.4 and 8.4 dB and a photon loss rate of 1.0 and 5.0 %, respectively. In addition, our scheme has a reduced resource cost, i.e., number of physical qubits/photons per logical qubit or initial entanglement, compared to high-threshold FTQC with optical GKP qubits or fusion-based quantum computation with encoded single-photon-qubit states, respectively. Furthermore, our approach, when assuming very low photon loss, allows to employ GKP squeezing as little as 3.8 dB, which cannot be achieved by using GKP qubits alone.

arXiv:2412.16536•Dec 21, 2024•4 citations

Polylog-overhead highly fault-tolerant measurement-based quantum computation: all-Gaussian implementation with Gottesman-Kitaev-Preskill code

Hayata Yamasaki, Kosuke Fukui, Yuki Takeuchi +2 more

Scalability of flying photonic quantum systems in generating quantum entanglement offers a potential for implementing large-scale fault-tolerant quantum computation, especially by means of measurement-based quantum computation (MBQC). However, existing protocols for MBQC inevitably impose a polynomial overhead cost in implementing quantum computation due to geometrical constraints of entanglement structures used in the protocols, and the polynomial overhead potentially cancels out useful polynomial speedups in quantum computation. To implement quantum computation without this cancellation, we construct a protocol for photonic MBQC that achieves as low as poly-logarithmic overhead, by introducing an entanglement structure for low-overhead qubit permutation. Based on this protocol, we design a fault-tolerant photonic MBQC protocol that can be performed by experimentally tractable homodyne detection and Gaussian entangling operations combined with the Gottesman-Kitaev-Preskill (GKP) quantum error-correcting code, which we concatenate with the $7$-qubit code. Our fault-tolerant protocol achieves the threshold $7.8$ dB in terms of the squeezing level of the GKP code, outperforming $8.3$ dB of the best existing protocol for fault-tolerant quantum computation with the GKP surface code. Thus, bridging a gap between theoretical progress on MBQC and photonic experiments towards implementing MBQC, our results open a new way towards realization of a large class of quantum speedups including those polynomial.

arXiv:2006.05416•Jun 9, 2020•29 citations

A Flexible GKP-State-Embedded Fault-Tolerant Quantum Computation Configuration Based on a Three-Dimensional Cluster State

Peilin Du, Jing Zhang, Tiancai Zhang +3 more

The integration of diverse quantum resources and the exploitation of more degrees of freedom provide key operational flexibility for universal fault-tolerant quantum computation. In this work, we propose a flexible Gottesman-Kitaev-Preskill-state-embedded fault-tolerant quantum computation architecture based on a three-dimensional cluster state constructed in polarization, frequency, and orbital angular momentum domains. Specifically, we design optical entanglement generators to produce three diverse entangled pairs, and subsequently construct a three-dimensional cluster state via a beam-splitter network with several time delays. Furthermore, we present a partially squeezed surface-GKP code to achieve fault-tolerant quantum computation and ultimately find the optimal choice of implementing the squeezing gate to give the best fault-tolerant performance (the fault-tolerant squeezing threshold is 11.5 dB). Our scheme is flexible, scalable, and experimentally feasible, providing versatile options for future optical fault-tolerant quantum computation architecture.

quant-pharXiv:2603.18778•Mar 20, 2026•0 citations

Integrated photonic source of Gottesman–Kitaev–Preskill qubits

Mikkel V. Larsen, J. Eli Bourassa, Sacha Kocsis +33 more

Building a useful photonic quantum computer requires robust techniques to synthesize optical states that can encode qubits. Gottesman–Kitaev–Preskill (GKP) states1 offer one of the most attractive classes of such qubit encodings, as they enable the implementation of universal gate sets with straightforward, deterministic and room temperature-compatible Gaussian operations2. Existing pioneering demonstrations generating optical GKP states3 and other complex non-Gaussian states4–11 have relied on free-space optical components, hindering the scaling eventually required for a utility-scale system. Here we use an ultra-low-loss integrated photonic chip fabricated on a customized multilayer silicon nitride 300-mm wafer platform, coupled over fibre with high-efficiency photon number resolving detectors, to generate GKP qubit states. These states show critical mode-level features necessary for fault tolerance, including at least four resolvable peaks in both p and q quadratures, and a clear lattice structure of negative Wigner function regions, in this case a 3 × 3 grid. We also show that our GKP states show sufficient structure to indicate that the devices used to make them could, after further reduction in optical losses, yield states for the fault-tolerant regime. This experiment validates a key pillar of bosonic architectures for photonic quantum computing2,12, paving the way for arrays of GKP sources that will supply future fault-tolerant machines. An ultra-low-loss integrated photonic chip fabricated on a customized multilayer silicon nitride 300-mm wafer platform, coupled over fibre with high-efficiency photon number resolving detectors, is used to generate Gottesman–Kitaev–Preskill qubit states.

Nature•Jun 4, 2025•112 citations

LiDMaS: Architecture-Level Modeling of Fault-Tolerant Magic-State Injection in GKP Photonic Qubits

Dennis Delali Kwesi Wayo

Fault-tolerant quantum computation in photonic architectures requires efficient preparation of high-fidelity logical magic states under realistic constraints of finite squeezing and photon loss. We present LiDMaS (Lightweight Density-Matrix Simulator), an architecture-level study of logical $T$-gate magic-state preparation in Gottesman--Kitaev--Preskill (GKP)-encoded photonic qubits using a repeat-until-success (RUS) injection protocol combined with outer surface-code protection. A density-matrix simulator based on standard numerical linear algebra is employed, mapping finite squeezing to effective logical dephasing, incorporating logical depolarizing noise, and treating photon loss as a heralded erasure process. Parameter sweeps are performed over squeezing values from $8$ to $16$~dB, baseline loss probabilities between $0.005$ and $0.03$, and surface-code distances $d=1,3,5,$ and $7$. Across this regime, RUS success probabilities range from about $0.90$ to $0.99$, with average injection overhead between $1.15$ and $1.21$ rounds per successful attempt. After outer-code protection, logical fidelities reach $F_{\mathrm{log}} \approx 0.765\text{--}0.796$, exhibiting weak sensitivity to moderate photon loss but strong monotonic dependence on squeezing. Sensitivity analysis identifies finite squeezing as the dominant continuous error source, while loss primarily impacts heralded failure rates. Phase-boundary diagrams determine minimum squeezing requirements to achieve success probability $\ge 0.95$ and logical fidelity $\ge 0.79$ as a function of code distance, providing quantitative design guidance for scalable photonic fault-tolerant architectures.

quant-pharXiv:2601.16244•Jan 23, 2026•4 citations
The scalability of photonic implementations of fault-tolerant quantum computing based on Gottesman-Kitaev-Preskill (GKP) qubits is injured by the requirements of inline squeezing and reconfigurability of the linear optical network.In this work we propose a topologically error-corrected architecture that does away with these elements at no cost-in fact, at an advantage-to state preparation overheads.Our computer consists of three modules: a two-dimensional (2D) array of probabilistic sources of GKP states; a depthfour circuit of static beam splitters, phase shifters, and short delay lines; and a 2D array of homodyne detectors.The symmetry of our proposed circuit allows us to combine the effects of finite squeezing and uniform photon loss within the noise model, resulting in more comprehensive threshold estimates.These jumps over both architectural and analytical hurdles considerably expedite the construction of a photonic quantum computer.
Continuous-variable measurement-based quantum computation on cluster states has in recent years shown great potential for scalable, universal, and fault-tolerant quantum computation when combined with the Gottesman-Kitaev-Preskill (GKP) code and quantum error correction.However, no complete fault-tolerant architecture exists that includes everything from cluster-state generation with finite squeezing to gate implementations with realistic noise and error correction.In this work, we propose a simple architecture for the preparation of a cluster state in three dimensions in which gates can be efficiently implemented by gate teleportation.To accommodate scalability, we propose architectures that allow both spatial and temporal multiplexing, with the temporally encoded version requiring as little as two squeezed light sources.Because of its three-dimensional structure, the architecture supports topological qubit error correction, while GKP error correction is efficiently realized within the architecture by teleportation.To validate fault tolerance, the architecture is simulated using surface-GKP codes, including noise from GKP states as well as gate noise caused by finite squeezing in the cluster state.We find a fault-tolerant squeezing threshold of 12.7 dB, with room for further improvement.
Quantum computation with light, compared with other platforms, offers the unique benefit of natural high-speed operations at room temperature and large clock rate, but a big obstacle of photonics is the lack of strong nonlinearities which also makes loss-tolerant or generally fault-tolerant quantum computation (FTQC) complicated in an all-optical setup. Typical current approaches to optical FTQC that aim at building suitable large multi-qubit cluster states by linearly fusing small elementary resource states would still demand either fairly expensive initial resources or rather low loss and error rates. Here we propose reintroducing weakly nonlinear operations, such as a weak cross-Kerr interaction, to achieve small initial resource cost and high error thresholds at the same time. More specifically, we propose an approach to generate a large-scale cluster state by hybridizing Gottesman-Kitaev-Preskill (GKP) and single-photon qubits. Our approach enables us to implement FTQC based on GKP squeezing of 7.4 and 8.4 dB and a photon loss rate of 1.0 and 5.0 %, respectively. In addition, our scheme has a reduced resource cost, i.e., number of physical qubits/photons per logical qubit or initial entanglement, compared to high-threshold FTQC with optical GKP qubits or fusion-based quantum computation with encoded single-photon-qubit states, respectively. Furthermore, our approach, when assuming very low photon loss, allows to employ GKP squeezing as little as 3.8 dB, which cannot be achieved by using GKP qubits alone.
Scalability of flying photonic quantum systems in generating quantum entanglement offers a potential for implementing large-scale fault-tolerant quantum computation, especially by means of measurement-based quantum computation (MBQC). However, existing protocols for MBQC inevitably impose a polynomial overhead cost in implementing quantum computation due to geometrical constraints of entanglement structures used in the protocols, and the polynomial overhead potentially cancels out useful polynomial speedups in quantum computation. To implement quantum computation without this cancellation, we construct a protocol for photonic MBQC that achieves as low as poly-logarithmic overhead, by introducing an entanglement structure for low-overhead qubit permutation. Based on this protocol, we design a fault-tolerant photonic MBQC protocol that can be performed by experimentally tractable homodyne detection and Gaussian entangling operations combined with the Gottesman-Kitaev-Preskill (GKP) quantum error-correcting code, which we concatenate with the 777-qubit code. Our fault-tolerant protocol achieves the threshold 7.87.87.8 dB in terms of the squeezing level of the GKP code, outperforming 8.38.38.3 dB of the best existing protocol for fault-tolerant quantum computation with the GKP surface code. Thus, bridging a gap between theoretical progress on MBQC and photonic experiments towards implementing MBQC, our results open a new way towards realization of a large class of quantum speedups including those polynomial.
The integration of diverse quantum resources and the exploitation of more degrees of freedom provide key operational flexibility for universal fault-tolerant quantum computation. In this work, we propose a flexible Gottesman-Kitaev-Preskill-state-embedded fault-tolerant quantum computation architecture based on a three-dimensional cluster state constructed in polarization, frequency, and orbital angular momentum domains. Specifically, we design optical entanglement generators to produce three diverse entangled pairs, and subsequently construct a three-dimensional cluster state via a beam-splitter network with several time delays. Furthermore, we present a partially squeezed surface-GKP code to achieve fault-tolerant quantum computation and ultimately find the optimal choice of implementing the squeezing gate to give the best fault-tolerant performance (the fault-tolerant squeezing threshold is 11.5 dB). Our scheme is flexible, scalable, and experimentally feasible, providing versatile options for future optical fault-tolerant quantum computation architecture.
Building a useful photonic quantum computer requires robust techniques to synthesize optical states that can encode qubits. Gottesman–Kitaev–Preskill (GKP) states1 offer one of the most attractive classes of such qubit encodings, as they enable the implementation of universal gate sets with straightforward, deterministic and room temperature-compatible Gaussian operations2. Existing pioneering demonstrations generating optical GKP states3 and other complex non-Gaussian states4–11 have relied on free-space optical components, hindering the scaling eventually required for a utility-scale system. Here we use an ultra-low-loss integrated photonic chip fabricated on a customized multilayer silicon nitride 300-mm wafer platform, coupled over fibre with high-efficiency photon number resolving detectors, to generate GKP qubit states. These states show critical mode-level features necessary for fault tolerance, including at least four resolvable peaks in both p and q quadratures, and a clear lattice structure of negative Wigner function regions, in this case a 3 × 3 grid. We also show that our GKP states show sufficient structure to indicate that the devices used to make them could, after further reduction in optical losses, yield states for the fault-tolerant regime. This experiment validates a key pillar of bosonic architectures for photonic quantum computing2,12, paving the way for arrays of GKP sources that will supply future fault-tolerant machines. An ultra-low-loss integrated photonic chip fabricated on a customized multilayer silicon nitride 300-mm wafer platform, coupled over fibre with high-efficiency photon number resolving detectors, is used to generate Gottesman–Kitaev–Preskill qubit states.
Fault-tolerant quantum computation in photonic architectures requires efficient preparation of high-fidelity logical magic states under realistic constraints of finite squeezing and photon loss. We present LiDMaS (Lightweight Density-Matrix Simulator), an architecture-level study of logical TTT-gate magic-state preparation in Gottesman--Kitaev--Preskill (GKP)-encoded photonic qubits using a repeat-until-success (RUS) injection protocol combined with outer surface-code protection. A density-matrix simulator based on standard numerical linear algebra is employed, mapping finite squeezing to effective logical dephasing, incorporating logical depolarizing noise, and treating photon loss as a heralded erasure process. Parameter sweeps are performed over squeezing values from 888 to 161616~dB, baseline loss probabilities between 0.0050.0050.005 and 0.030.030.03, and surface-code distances d=1,3,5,d=1,3,5,d=1,3,5, and 777. Across this regime, RUS success probabilities range from about 0.900.900.90 to 0.990.990.99, with average injection overhead between 1.151.151.15 and 1.211.211.21 rounds per successful attempt. After outer-code protection, logical fidelities reach Flog≈0.765–0.796F_{\mathrm{log}} \approx 0.765\text{--}0.796Flog​≈0.765–0.796, exhibiting weak sensitivity to moderate photon loss but strong monotonic dependence on squeezing. Sensitivity analysis identifies finite squeezing as the dominant continuous error source, while loss primarily impacts heralded failure rates. Phase-boundary diagrams determine minimum squeezing requirements to achieve success probability ≥0.95\ge 0.95≥0.95 and logical fidelity ≥0.79\ge 0.79≥0.79 as a function of code distance, providing quantitative design guidance for scalable photonic fault-tolerant architectures.