Remote Entanglement in Lattice Surgery: To Distill, or Not to Distill
- URL: http://arxiv.org/abs/2603.06513v1
- Date: Fri, 06 Mar 2026 17:53:27 GMT
- Title: Remote Entanglement in Lattice Surgery: To Distill, or Not to Distill
- Abstract summary: lattice-surgery operations at logical qubit boundaries tolerate significantly higher error rates than previously assumed.<n>We identify the fidelity crossover point separating the two regimes and show that choosing the right strategy can reduce resource overhead by up to two orders of magnitude.<n>These results provide co-design principles for optimizing photonic interconnects and fault-tolerant architectures in distributed quantum computers.
- Score: 2.0394759582275723
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Distributed quantum computing can potentially address the scalability challenge by networking processors through photon-mediated remote entanglement. Prior approaches assumed that remote Bell pairs require distillation, resulting in substantial overhead, to achieve sufficiently high fidelity before use. However, recent results show that lattice-surgery operations at logical qubit boundaries tolerate significantly higher error rates than previously assumed. We quantify the resource trade-offs between distillation overhead and surface-code distance requirements under realistic constraints including probabilistic entanglement generation and memory decoherence. We identify the fidelity crossover point separating the two regimes and show that choosing the right strategy can reduce resource overhead by up to two orders of magnitude at low fidelities and up to 68% at high fidelities. We briefly describe the application of these methods to ion-trap and neutral-atom platforms. These results provide co-design principles for optimizing photonic interconnects and fault-tolerant architectures in distributed quantum computers.
Related papers
- Remote entanglement need not be the bottleneck for modular trapped-ion quantum computing [2.4030726909042492]
Trapped ions hold the best photonic links, yet they rely on bulky optics to cap performance orders.<n>We show how single-photon detection leads to linear probabilitying, allowing compact integrated photonics.<n>We will address entanglement at a local limit in dense, easy-to-parallelize channels.
arXiv Detail & Related papers (2026-07-20T18:00:03Z) - Scalable Graph State Generation with O(1) Local Feedforward in Quantum Networks [20.203909213101337]
We propose a protocol to reduce routing decision delays to levels far below the coherence time of qubits.<n>The proposed protocol performs well in terms of both resource efficiency and time feasibility.<n>This protocol provides a clear path to achieving high-fidelity star subgraphs.
arXiv Detail & Related papers (2026-06-15T08:10:59Z) - Single-Satellite Quantum Repeater Performance Analysis [0.0]
Space-based entanglement distribution has the potential to extend the range of quantum communication beyond that achievable through optical fibres.<n>Quantum repeaters have been proposed to mitigate the effects of channel losses for both fibre and satellite networks.<n>Direct dual downlink entangled pair distribution does not suffer such a latency restriction, hence can brute force'' the problem of high dual channel loss through increased source rate.
arXiv Detail & Related papers (2026-04-17T15:34:52Z) - Fault-tolerant modular quantum computing with surface codes using single-shot emission-based hardware [1.0138727338368827]
Two main types of entanglement distribution protocols exist, emission-based and scattering-based.<n>We introduce protocols that completely eliminate the need for memory-based two-qubit gates.<n>Results show the feasibility of emission-based architectures for scalable fault-tolerant operation.
arXiv Detail & Related papers (2026-01-12T06:23:13Z) - Taming Recoil Effect in Cavity-Assisted Quantum Interconnects [1.2233362977312945]
We derive an analytical model for evaluating the motion-induced infidelity in remote entanglement generation protocols.<n>Our results establish a concrete path towards fault-tolerant quantum networking with scalable trapped-atom qubit systems.
arXiv Detail & Related papers (2025-02-20T18:59:11Z) - Fast quantum interconnects via constant-rate entanglement distillation [0.0]
We develop constant-rate entanglement distillation methods for quantum interconnects.
We prove the scheme has constant-rate in expectation and numerically optimize to achieve low practical overhead.
We find our optimized schemes outperform existing computationally efficient quantum interconnect schemes by an order of magnitude in relevant regimes.
arXiv Detail & Related papers (2024-08-28T16:54:54Z) - LaCoOT: Layer Collapse through Optimal Transport [9.715121047425262]
We present an optimal transport-based method to reduce the depth of over-parametrized deep neural networks.<n>We show that our method achieves better performance/depth trade-off compared to existing techniques.
arXiv Detail & Related papers (2024-06-13T09:03:53Z) - Near-Term Distributed Quantum Computation using Mean-Field Corrections
and Auxiliary Qubits [77.04894470683776]
We propose near-term distributed quantum computing that involve limited information transfer and conservative entanglement production.
We build upon these concepts to produce an approximate circuit-cutting technique for the fragmented pre-training of variational quantum algorithms.
arXiv Detail & Related papers (2023-09-11T18:00:00Z) - Quantum Gate Optimization for Rydberg Architectures in the Weak-Coupling
Limit [55.05109484230879]
We demonstrate machine learning assisted design of a two-qubit gate in a Rydberg tweezer system.
We generate optimal pulse sequences that implement a CNOT gate with high fidelity.
We show that local control of single qubit operations is sufficient for performing quantum computation on a large array of atoms.
arXiv Detail & Related papers (2023-06-14T18:24:51Z) - Entangled Pair Resource Allocation under Uncertain Fidelity Requirements [59.83361663430336]
In quantum networks, effective entanglement routing facilitates communication between quantum source and quantum destination nodes.
We propose a resource allocation model for entangled pairs and an entanglement routing model with a fidelity guarantee.
Our proposed model can reduce the total cost by at least 20% compared to the baseline model.
arXiv Detail & Related papers (2023-04-10T07:16:51Z) - Iterative Soft Shrinkage Learning for Efficient Image Super-Resolution [91.3781512926942]
Image super-resolution (SR) has witnessed extensive neural network designs from CNN to transformer architectures.
This work investigates the potential of network pruning for super-resolution iteration to take advantage of off-the-shelf network designs and reduce the underlying computational overhead.
We propose a novel Iterative Soft Shrinkage-Percentage (ISS-P) method by optimizing the sparse structure of a randomly network at each and tweaking unimportant weights with a small amount proportional to the magnitude scale on-the-fly.
arXiv Detail & Related papers (2023-03-16T21:06:13Z) - Semantic Strengthening of Neuro-Symbolic Learning [85.6195120593625]
Neuro-symbolic approaches typically resort to fuzzy approximations of a probabilistic objective.
We show how to compute this efficiently for tractable circuits.
We test our approach on three tasks: predicting a minimum-cost path in Warcraft, predicting a minimum-cost perfect matching, and solving Sudoku puzzles.
arXiv Detail & Related papers (2023-02-28T00:04:22Z) - Hardware-Efficient, Fault-Tolerant Quantum Computation with Rydberg
Atoms [55.41644538483948]
We provide the first complete characterization of sources of error in a neutral-atom quantum computer.
We develop a novel and distinctly efficient method to address the most important errors associated with the decay of atomic qubits to states outside of the computational subspace.
Our protocols can be implemented in the near-term using state-of-the-art neutral atom platforms with qubits encoded in both alkali and alkaline-earth atoms.
arXiv Detail & Related papers (2021-05-27T23:29:53Z) - Fully Quantized Image Super-Resolution Networks [81.75002888152159]
We propose a Fully Quantized image Super-Resolution framework (FQSR) to jointly optimize efficiency and accuracy.
We apply our quantization scheme on multiple mainstream super-resolution architectures, including SRResNet, SRGAN and EDSR.
Our FQSR using low bits quantization can achieve on par performance compared with the full-precision counterparts on five benchmark datasets.
arXiv Detail & Related papers (2020-11-29T03:53:49Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.