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

Boosting photonic quantum computation with moderate nonlinearity

Adi Pick, Elisha S. Matekole, Ziv Aqua, Gabriel Guendelman, Ofer Firstenberg, Jonathan P. Dowling, Barak Dayan

Published Jan 1, 2021• 1 citation
Publisher

Abstract

We present a new pathway towards fault-tolerant photonic quantum computing by using moderate nonlinearity to improve elementary computation operations. This improvement can lead to a three orders-of-magnitude reduction of the resource overhead in large-scale computations.
DOI
10.1364/cleo_qels.2021.fth2n.4

Related papers

Boosting Photonic Quantum Computation with Moderate Nonlinearity

Adi Pick, E.S. Matekole, Z. Aqua +4 more

Photonic measurement-based quantum computation (MBQC) is a promising route towards fault-tolerant universal quantum computing. A central challenge in this effort is the huge overhead in the resources required for the construction of large photonic clusters using probabilistic linear-optics gates. Although strong single-photon nonlinearity ideally enables deterministic construction of such clusters, it is challenging to realise in a scalable way. Here we explore the prospects of using moderate nonlinearity (with conditional phase shifts smaller than $\ensuremath{\pi}$) to boost photonic quantum computing and significantly reduce its resources' overhead. The key element in our scheme is a nonlinear router that preferentially directs photonic wavepackets to different output ports depending on their intensity. As a relevant example, we analyze the nonlinearity provided by Rydberg blockade in atomic ensembles, in which the trade-off between the nonlinearity and the accompanying loss is well understood. We present protocols for efficient Bell measurement and GHZ-state preparation---both key elements in the construction of cluster states, as well as for the cnot gate and quantum factorization. Given the large number of entangling operations involved in fault-tolerant MBQC, the increase in success probability provided by our protocols already at moderate nonlinearities can result in a significant reduction in the required resources.

arXiv:2011.06454•Physical Review Applied•May 24, 2021•8 citations

End-to-End Optimization of Partial Fault Tolerance in Neutral-Atom Arrays

Stefano Veroni, Aydin Deger, Andrew J. Daley

Fault-tolerant (FT) quantum computation offers a pathway to quantum advantage, but its realization is hindered by its significant overhead. The partially FT "STAR" architecture reduces the cost of universal computation at the price of relaxing FT requirements for non-Clifford operations, increasing exposure to hardware noise. Therefore, maximizing its performance and applicability demands careful co-design with the underlying hardware. In this work we investigate the co-design of the STAR architecture with neutral-atom platforms, connecting the underlying atomic physics to logical error modeling and application-level performance. At the physical level, we identify a favorable noise bias in $^{171}\mathrm{Yb}$ Rydberg gates, and show how it can be enhanced through error-selective pulse optimization. At the logical level, we identify an intrinsic error suppression mechanism, yielding vanishing logical coherent noise in leading order. Detailed circuit-level simulations of surface code implementations show more than an order of magnitude reduction in logical error relative to previous estimates. As a concrete target application, we focus on the Fermi-Hubbard model with periodic boundaries, for which we design a simulation circuit particularly suited to early implementations. We quantify the resource tradeoff of partially and fully FT approaches to gate synthesis, with the former showing approximately an order of magnitude reduction in state-injection depth, and an even larger reduction in Clifford resources. Comparing with classical and fully FT approaches, we identify regimes where partial fault tolerance provides both lower overheads and lower error rates. In our estimates, this is accessible with moderate error rates $p\sim 10^{-3}$ and a few thousand qubits, underlining that for these types of problems, partial FT approaches provide a compelling pathway to early quantum advantage.

quant-pharXiv:2610.26471•Oct 20, 2026•0 citations

Comparison of schemes for highly loss tolerant photonic fusion based quantum computing

Sara Bartolucci, Bell, Tom, Héctor Bombín +18 more

We summarize the performance of recently-proposed methods for achieving fault tolerant fusions-based quantum computation with high tolerance to qubit loss, specifically aimed at photonic implementations.

arXiv:2506.11975•Jun 13, 2025•0 citations

Fault-Tolerant Qubit from a Constant Number of Components

Kianna Wan, Soonwon Choi, Isaac H. Kim +2 more

A method to construct logical qubits with extremely low logical error rates: The engineering overhead for building fault-tolerant quantum computation can be reduced to a handful of photonic and phononic components currently available.

arXiv:2011.08213•PRX Quantum•Dec 2, 2021•28 citations

Fault-tolerant integrated photonic quantum computing

Jonathan Lavoie, Blair Morrison

Photonics for Quantum (PfQ)•Aug 2, 2024•0 citations

Minimizing Resource Overhead in Fusion-Based Quantum Computation Using Hybrid Spin-Photon Devices

Stephen C. Wein, Timothée Goubault de Brugière, Luka Music +3 more

We present three schemes for constructing a (2,2)-Shor-encoded 6-ring photonic resource state for fusion-based quantum computing, each relying on a different type of photon source. We benchmark these architectures by analyzing their ability to achieve the loss tolerance threshold for fusion-based quantum computation using the target resource state. More precisely, we estimate their minimum hardware requirements for fault-tolerant quantum computation in terms of the number of photon sources to achieve on-demand generation of resource states with a desired generation period. Notably, we find that a group of 12 deterministic single-photon sources containing a single matter qubit degree of freedom can produce the target resource state near-deterministically by exploiting entangling gates that are repeated until success. The approach is fully modular, eliminates the need for lossy large-scale multiplexing, and reduces the overhead for resource-state generation by several orders of magnitude compared to architectures using heralded single-photon sources and probabilistic linear-optical entangling gates. Our work shows that the use of deterministic single-photon sources embedding a qubit substantially shortens the path toward fault-tolerant photonic quantum computation.

arXiv:2412.08611•PRX Quantum•Nov 17, 2025•13 citations
Photonic measurement-based quantum computation (MBQC) is a promising route towards fault-tolerant universal quantum computing. A central challenge in this effort is the huge overhead in the resources required for the construction of large photonic clusters using probabilistic linear-optics gates. Although strong single-photon nonlinearity ideally enables deterministic construction of such clusters, it is challenging to realise in a scalable way. Here we explore the prospects of using moderate nonlinearity (with conditional phase shifts smaller than $\ensuremath{\pi}$) to boost photonic quantum computing and significantly reduce its resources' overhead. The key element in our scheme is a nonlinear router that preferentially directs photonic wavepackets to different output ports depending on their intensity. As a relevant example, we analyze the nonlinearity provided by Rydberg blockade in atomic ensembles, in which the trade-off between the nonlinearity and the accompanying loss is well understood. We present protocols for efficient Bell measurement and GHZ-state preparation---both key elements in the construction of cluster states, as well as for the cnot gate and quantum factorization. Given the large number of entangling operations involved in fault-tolerant MBQC, the increase in success probability provided by our protocols already at moderate nonlinearities can result in a significant reduction in the required resources.
Fault-tolerant (FT) quantum computation offers a pathway to quantum advantage, but its realization is hindered by its significant overhead. The partially FT "STAR" architecture reduces the cost of universal computation at the price of relaxing FT requirements for non-Clifford operations, increasing exposure to hardware noise. Therefore, maximizing its performance and applicability demands careful co-design with the underlying hardware. In this work we investigate the co-design of the STAR architecture with neutral-atom platforms, connecting the underlying atomic physics to logical error modeling and application-level performance. At the physical level, we identify a favorable noise bias in 171Yb^{171}\mathrm{Yb}171Yb Rydberg gates, and show how it can be enhanced through error-selective pulse optimization. At the logical level, we identify an intrinsic error suppression mechanism, yielding vanishing logical coherent noise in leading order. Detailed circuit-level simulations of surface code implementations show more than an order of magnitude reduction in logical error relative to previous estimates. As a concrete target application, we focus on the Fermi-Hubbard model with periodic boundaries, for which we design a simulation circuit particularly suited to early implementations. We quantify the resource tradeoff of partially and fully FT approaches to gate synthesis, with the former showing approximately an order of magnitude reduction in state-injection depth, and an even larger reduction in Clifford resources. Comparing with classical and fully FT approaches, we identify regimes where partial fault tolerance provides both lower overheads and lower error rates. In our estimates, this is accessible with moderate error rates p∼10−3p\sim 10^{-3}p∼10−3 and a few thousand qubits, underlining that for these types of problems, partial FT approaches provide a compelling pathway to early quantum advantage.
We present three schemes for constructing a (2,2)-Shor-encoded 6-ring photonic resource state for fusion-based quantum computing, each relying on a different type of photon source. We benchmark these architectures by analyzing their ability to achieve the loss tolerance threshold for fusion-based quantum computation using the target resource state. More precisely, we estimate their minimum hardware requirements for fault-tolerant quantum computation in terms of the number of photon sources to achieve on-demand generation of resource states with a desired generation period. Notably, we find that a group of 12 deterministic single-photon sources containing a single matter qubit degree of freedom can produce the target resource state near-deterministically by exploiting entangling gates that are repeated until success. The approach is fully modular, eliminates the need for lossy large-scale multiplexing, and reduces the overhead for resource-state generation by several orders of magnitude compared to architectures using heralded single-photon sources and probabilistic linear-optical entangling gates. Our work shows that the use of deterministic single-photon sources embedding a qubit substantially shortens the path toward fault-tolerant photonic quantum computation.