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

Fault-Tolerant One-Shot Entanglement Generation with Constant-Sized Quantum Devices in the Plane

Dylan Harley, Robert Koenig

quant-phSubmitted Apr 7, 2026• Announced Apr 8, 2026• 2 citations
arXivHTMLPDF

Abstract

Consider a rectangular grid of qubits in 2D with single-qubit and nearest-neighbor two-qubit operations subject to local stochastic Pauli noise. At different length scales, this setup describes both a single quantum computing device with geometrically limited connectivity between qubits arranged on a disc, and planar networks composed of quantum repeater stations of constant size. We give a protocol which robustly generates entanglement between distant qubits in this setup. For noise below a constant threshold error strength, it generates a constant-fidelity Bell pair between qubits separated by an arbitrarily large distance $R$. To generate distance-$R$ entanglement, a rectangular grid of qubits of dimensions $Θ(R)\times Θ(\mathsf{poly}(\log R))$ suffices. Our protocol applies quantum operations in one shot, establishing a Bell state in a constant time up to a known Pauli correction. In contrast, existing entanglement generation protocols either require local quantum devices controlling a number of qubits growing with the targeted distance, or are not single-shot, i.e., have a distance-dependent execution time. The protocol leverages many-body entanglement in networks and provides the first example of a short-range entangled state in 2D with long-range localizable entanglement robust to local stochastic Pauli noise. As an immediate corollary, we construct a 2D-local stabilizer Hamiltonian whose Gibbs states possess long-range localizable entanglement at constant positive temperature.

Comments
76 pages, 31 figures

Related papers

Long-range data transmission in a fault-tolerant quantum bus architecture

Shin Ho Choe, Robert König

Abstract We propose a fault-tolerant scheme for generating long-range entanglement at the ends of a rectangular array of qubits of length R with a square cross-section of $$m=O({\log }^{2}R)$$ m = O ( log 2 R ) qubits. It is realized by a constant-depth circuit producing a constant-fidelity Bell-pair (independent of R) for local stochastic noise of strength below an experimentally realistic threshold. The scheme can be viewed as a quantum bus in a quantum computing architecture where qubits are arranged on a rectangular 3D grid, and all operations are between neighboring qubits. Alternatively, it can be seen as a quantum repeater protocol along a line, with neighboring repeaters placed at a short distance to allow constant-fidelity nearest-neighbor operations. To show our protocol uses a number of qubits close to optimal, we show that any noise-resilient distance-R entanglement generation scheme realized by a constant-depth circuit needs at least $$m=\Omega (\log R)$$ m = Ω ( log R ) qubits per repeater.

arXiv:2209.09774•npj Quantum Information•Dec 26, 2024•5 citations

One-shot entanglement generation over long distances in noisy quantum networks

Sébastien Perseguers, Liang Jiang, Norbert Schuch +4 more

We consider the problem of creating a long-distance entangled state between two stations of a network, where neighboring nodes are connected by noisy quantum channels. We show that any two stations can share an entangled pair if the effective probability for the quantum errors is below a certain threshold, which is achieved by a local encoding of the qubits and a global bit-flip correction. In contrast to the conventional quantum-repeater schemes, we do not need to store the qubits in quantum memory for a long time: our protocol is a one-shot process (i.e., the elementary entangled pairs are used only once) involving one-way classical communication. Furthermore, the overhead of local resources increases only logarithmically with the size of the network, making our proposal favorable to long-distance quantum communication.

arXiv:0807.0208•Physical Review A•Dec 12, 2008•35 citations

Fault-tolerant modular quantum computing with surface codes using single-shot emission-based hardware

Siddhant Singh, Rikiya Kashiwagi, Kazufumi Tanji +4 more

Fault-tolerant modular quantum computing requires stabilizer measurements across the modules in a quantum network. For this, entangled states of high quality and rate must be distributed. Currently, two main types of entanglement distribution protocols exist, namely emission-based and scattering-based, each with its own advantages and drawbacks. On the one hand, scattering-based protocols with cavities or waveguides are fast but demand stringent hardware such as high-efficiency integrated circulators or strong waveguide coupling. On the other hand, emission-based platforms are experimentally feasible but so far rely on Bell-pair fusion with extensive use of slow two-qubit memory gates, limiting thresholds to $\approx 0.16\%$. Here, we consider a fully distributed surface code using emission-based entanglement schemes that generate GHZ states in a single shot, i.e., without the need for Bell-pair fusions. We show that our optical setup produces Bell pairs, W states, and GHZ states, enabling both memory-based and optical protocols for distilling high-fidelity GHZ states with significantly improved success rates. Furthermore, we introduce protocols that completely eliminate the need for memory-based two-qubit gates, achieving thresholds of $\approx 0.19\%$ with modest hardware enhancements, increasing to above $\approx 0.24\%$ with photon-number-resolving detectors. These results show the feasibility of emission-based architectures for scalable fault-tolerant operation.

quant-pharXiv:2601.07241•Physical Review Applied•Jan 13, 2026•1 citation

Fidelity threshold for long-range entanglement in quantum networks

Sébastien Perseguers

We present a strategy to generate long-range entanglement in noisy quantum networks. We consider a cubic lattice whose bonds are partially entangled mixed states of two qubits, and where quantum operations can be applied perfectly at the nodes. In contrast to protocols designed for one- or two-dimensional regular lattices, we find that entanglement can be created between arbitrarily distant qubits if the fidelity of the bonds is higher than a critical value, independent of the system size. Therefore, we show that a constant overhead of local resources, together with connections of finite fidelity, is sufficient to achieve long-distance quantum communication in noisy networks.

arXiv:0910.1459•Physical Review A•Jan 15, 2010•36 citations

Entanglement Distribution in Quantum Networks

Sébastien Perseguers

This Thesis contributes to the theory of entanglement distribution in quantum networks, analyzing the generation of long-distance entanglement in particular.We consider that neighboring stations share one partially entangled pair of qubits, which emphasizes the difficulty of creating remote entanglement in realistic settings.The task is then to design local quantum operations at the stations, such that the entanglement present in the links of the whole network gets concentrated between few parties only, regardless of their spatial arrangement.First, we study quantum networks with a two-dimensional lattice structure, where quantum connections between the stations (nodes) are described by non-maximally entangled pure states (links).We show that the generation of a perfectly entangled pair of qubits over an arbitrarily long distance is possible if the initial entanglement of the links is larger than a threshold.This critical value highly depends on the geometry of the lattice, in particular on the connectivity of the nodes, and is related to a classical percolation problem.We then develop a genuine quantum strategy based on multipartite entanglement, improving both the threshold and the success probability of the generation of long-distance entanglement.Second, we consider a mixed-state definition of the connections of the quantum networks.This formalism is well-adapted for a more realistic description of systems in which noise (random errors) inevitably occurs.New techniques are required to create remote entanglement in this setting, and we show how to locally extract and globally process some error syndromes in order to create useful long-distance quantum correlations.Finally, we turn to networks that have a complex topology, which is the case for most real-world communication networks such as the Internet for instance.Besides many other characteristics, these systems have in common the small-world feature, stating that any two nodes are separated by a few links only.Based on the theory of random graphs, we propose a model of quantum complex networks, which exhibit some totally unexpected properties compared to their classical counterparts.5.1 Propagation of a large GHZ state through the lattice . . .5.2 Bit-flip error correction . . . . . . . . . . . . .

•Jan 1, 2010•6 citations

Constant-Overhead Injection into Quantum Codes

Louis Golowich, Venkatesan Guruswami

We construct the first known fault-tolerant scheme for injecting states into quantum error-correcting codes with constant space and time overhead. That is, we construct a family of constant-rate quantum error-correcting codes for which a set of bare physical qubits can be injected, i.e. fault-tolerantly encoded, into a code block. Similarly, a code state can be ejected, i.e. fault-tolerantly decoded, back into bare physical qubits. We show that these injection and ejection procedures succeed under circuit-level locally stochastic noise, while incurring just a small constant probability of corrupting each qubit, which is unavoidable for bare physical qubits. We also show how to perform fault-tolerant error correction and code-state preparation under locally stochastic noise. All of our gadgets can be implemented with constant quantum circuit depth (i.e. are single-shot), and with a number of physical qubits growing linearly with the number of logical qubits, assuming the ability to run polynomial-sized noiseless classical circuits on the side. We construct our quantum codes by taking a high-dimensional hypergraph product of classical LDPC codes, which in turn are a simplified version of Spielman's linear-time encodable codes (STOC'95). As our resulting product codes are only resilient to physical errors occurring with non-uniform probabilities across qubits, we then show how to concatenate with inner codes of various sizes to obtain fault-tolerance against uniform noise.

quant-pharXiv:2609.39345•Oct 1, 2026•0 citations
Consider a rectangular grid of qubits in 2D with single-qubit and nearest-neighbor two-qubit operations subject to local stochastic Pauli noise. At different length scales, this setup describes both a single quantum computing device with geometrically limited connectivity between qubits arranged on a disc, and planar networks composed of quantum repeater stations of constant size. We give a protocol which robustly generates entanglement between distant qubits in this setup. For noise below a constant threshold error strength, it generates a constant-fidelity Bell pair between qubits separated by an arbitrarily large distance RRR. To generate distance-RRR entanglement, a rectangular grid of qubits of dimensions Θ(R)×Θ(poly(log⁡R))Θ(R)\times Θ(\mathsf{poly}(\log R))Θ(R)×Θ(poly(logR)) suffices. Our protocol applies quantum operations in one shot, establishing a Bell state in a constant time up to a known Pauli correction. In contrast, existing entanglement generation protocols either require local quantum devices controlling a number of qubits growing with the targeted distance, or are not single-shot, i.e., have a distance-dependent execution time. The protocol leverages many-body entanglement in networks and provides the first example of a short-range entangled state in 2D with long-range localizable entanglement robust to local stochastic Pauli noise. As an immediate corollary, we construct a 2D-local stabilizer Hamiltonian whose Gibbs states possess long-range localizable entanglement at constant positive temperature.
Abstract We propose a fault-tolerant scheme for generating long-range entanglement at the ends of a rectangular array of qubits of length R with a square cross-section of m=O(log⁡2R)m=O({\log }^{2}R)m=O(log2R) m = O ( log 2 R ) qubits. It is realized by a constant-depth circuit producing a constant-fidelity Bell-pair (independent of R) for local stochastic noise of strength below an experimentally realistic threshold. The scheme can be viewed as a quantum bus in a quantum computing architecture where qubits are arranged on a rectangular 3D grid, and all operations are between neighboring qubits. Alternatively, it can be seen as a quantum repeater protocol along a line, with neighboring repeaters placed at a short distance to allow constant-fidelity nearest-neighbor operations. To show our protocol uses a number of qubits close to optimal, we show that any noise-resilient distance-R entanglement generation scheme realized by a constant-depth circuit needs at least m=Ω(log⁡R)m=\Omega (\log R)m=Ω(logR) m = Ω ( log R ) qubits per repeater.
We consider the problem of creating a long-distance entangled state between two stations of a network, where neighboring nodes are connected by noisy quantum channels. We show that any two stations can share an entangled pair if the effective probability for the quantum errors is below a certain threshold, which is achieved by a local encoding of the qubits and a global bit-flip correction. In contrast to the conventional quantum-repeater schemes, we do not need to store the qubits in quantum memory for a long time: our protocol is a one-shot process (i.e., the elementary entangled pairs are used only once) involving one-way classical communication. Furthermore, the overhead of local resources increases only logarithmically with the size of the network, making our proposal favorable to long-distance quantum communication.
Fault-tolerant modular quantum computing requires stabilizer measurements across the modules in a quantum network. For this, entangled states of high quality and rate must be distributed. Currently, two main types of entanglement distribution protocols exist, namely emission-based and scattering-based, each with its own advantages and drawbacks. On the one hand, scattering-based protocols with cavities or waveguides are fast but demand stringent hardware such as high-efficiency integrated circulators or strong waveguide coupling. On the other hand, emission-based platforms are experimentally feasible but so far rely on Bell-pair fusion with extensive use of slow two-qubit memory gates, limiting thresholds to ≈0.16%\approx 0.16\%≈0.16%. Here, we consider a fully distributed surface code using emission-based entanglement schemes that generate GHZ states in a single shot, i.e., without the need for Bell-pair fusions. We show that our optical setup produces Bell pairs, W states, and GHZ states, enabling both memory-based and optical protocols for distilling high-fidelity GHZ states with significantly improved success rates. Furthermore, we introduce protocols that completely eliminate the need for memory-based two-qubit gates, achieving thresholds of ≈0.19%\approx 0.19\%≈0.19% with modest hardware enhancements, increasing to above ≈0.24%\approx 0.24\%≈0.24% with photon-number-resolving detectors. These results show the feasibility of emission-based architectures for scalable fault-tolerant operation.
We present a strategy to generate long-range entanglement in noisy quantum networks. We consider a cubic lattice whose bonds are partially entangled mixed states of two qubits, and where quantum operations can be applied perfectly at the nodes. In contrast to protocols designed for one- or two-dimensional regular lattices, we find that entanglement can be created between arbitrarily distant qubits if the fidelity of the bonds is higher than a critical value, independent of the system size. Therefore, we show that a constant overhead of local resources, together with connections of finite fidelity, is sufficient to achieve long-distance quantum communication in noisy networks.
This Thesis contributes to the theory of entanglement distribution in quantum networks, analyzing the generation of long-distance entanglement in particular.We consider that neighboring stations share one partially entangled pair of qubits, which emphasizes the difficulty of creating remote entanglement in realistic settings.The task is then to design local quantum operations at the stations, such that the entanglement present in the links of the whole network gets concentrated between few parties only, regardless of their spatial arrangement.First, we study quantum networks with a two-dimensional lattice structure, where quantum connections between the stations (nodes) are described by non-maximally entangled pure states (links).We show that the generation of a perfectly entangled pair of qubits over an arbitrarily long distance is possible if the initial entanglement of the links is larger than a threshold.This critical value highly depends on the geometry of the lattice, in particular on the connectivity of the nodes, and is related to a classical percolation problem.We then develop a genuine quantum strategy based on multipartite entanglement, improving both the threshold and the success probability of the generation of long-distance entanglement.Second, we consider a mixed-state definition of the connections of the quantum networks.This formalism is well-adapted for a more realistic description of systems in which noise (random errors) inevitably occurs.New techniques are required to create remote entanglement in this setting, and we show how to locally extract and globally process some error syndromes in order to create useful long-distance quantum correlations.Finally, we turn to networks that have a complex topology, which is the case for most real-world communication networks such as the Internet for instance.Besides many other characteristics, these systems have in common the small-world feature, stating that any two nodes are separated by a few links only.Based on the theory of random graphs, we propose a model of quantum complex networks, which exhibit some totally unexpected properties compared to their classical counterparts.5.1 Propagation of a large GHZ state through the lattice . . .5.2 Bit-flip error correction . . . . . . . . . . . . .
We construct the first known fault-tolerant scheme for injecting states into quantum error-correcting codes with constant space and time overhead. That is, we construct a family of constant-rate quantum error-correcting codes for which a set of bare physical qubits can be injected, i.e. fault-tolerantly encoded, into a code block. Similarly, a code state can be ejected, i.e. fault-tolerantly decoded, back into bare physical qubits. We show that these injection and ejection procedures succeed under circuit-level locally stochastic noise, while incurring just a small constant probability of corrupting each qubit, which is unavoidable for bare physical qubits. We also show how to perform fault-tolerant error correction and code-state preparation under locally stochastic noise. All of our gadgets can be implemented with constant quantum circuit depth (i.e. are single-shot), and with a number of physical qubits growing linearly with the number of logical qubits, assuming the ability to run polynomial-sized noiseless classical circuits on the side. We construct our quantum codes by taking a high-dimensional hypergraph product of classical LDPC codes, which in turn are a simplified version of Spielman's linear-time encodable codes (STOC'95). As our resulting product codes are only resilient to physical errors occurring with non-uniform probabilities across qubits, we then show how to concatenate with inner codes of various sizes to obtain fault-tolerance against uniform noise.