Feasibility of Logical Bell State Generation in Memory Assisted Quantum Networks

Abstract

This study explores the feasibility of utilizing quantum error correction (QEC) to generate and store logical Bell states in heralded quantum entanglement protocols, crucial for quantum repeater networks. Two lattice surgery-based protocols (local and non-local) are introduced to establish logical Bell states between distant nodes using an intermediary node. We simulate the protocols using realistic experimental parameters, including ion trap memories, noisy optical channels, frequency conversion, and non-destructive detection of photonic qubits. The study evaluates rotated and planar surface codes alongside Bacon-Shor codes for small code distances ($d=3,5$) under depolarizing and physical noise models. Pseudo-thresholds are identified, with physical error rates above $p_{\text{err}}\sim 10^{-3}$ offering no advantage over unencoded Bell states under depolarizing noise. Pseudo-thresholds are also reevaluated in terms of gate error rates $p_{{\text{err}}_H}$, $p_{{\text{err}}_{CX}}$, and $p_{{\text{err}}_M}$. For a distance of 1 km between the end node and the intermediary, an advantage over unencoded Bell-state heralded protocols requires reducing gate error rates by an order of magnitude ($0.1p_{{\text{err}}_H}$, $0.1p_{{\text{err}}_{CX}}$, and $0.1p_{{\text{err}}_M}$). These results highlight the need for significant hardware improvements to implement logical Bell state protocols with quantum memories. Additionally, the non-local protocol rate was analyzed, achieving rates up to $(32.53\pm 1.53)\mathrm{Hz}$ over distances of $1$ to $80\mathrm{km}$ between the end node and the intermediary node.

References in corpus (49)

• Surface codes: Towards practical large-scale quantum computation
• QuTiP: An open-source Python framework for the dynamics of open quantum systems
• Quantum Teleportation is a Universal Computational Primitive
• Universal Quantum Computation with ideal Clifford gates and noisy ancillas
• Suppressing quantum errors by scaling a surface code logical qubit
• Realization of a multi-node quantum network of remote solid-state qubits
• Topological fault-tolerance in cluster state quantum computation
• Surface code quantum computing by lattice surgery
• Quantum repeaters: From quantum networks to the quantum internet
• Efficient long distance quantum communication
• High-threshold and low-overhead fault-tolerant quantum memory
• A Game of Surface Codes: Large-Scale Quantum Computing with Lattice Surgery
• Stim: a fast stabilizer circuit simulator
• A photon-photon quantum gate based on a single atom in an optical resonator
• Telecom-heralded entanglement between remote multimode solid-state quantum memories
• NetSquid, a NETwork Simulator for QUantum Information using Discrete events
• Nondestructive Detection of an Optical Photon
• Heralded entanglement distribution between two absorptive quantum memories
• Entanglement of trapped-ion qubits separated by 230 meters
• Subsystem fault tolerance with the Bacon-Shor code
• High-fidelity entanglement between a trapped ion and a telecom photon via quantum frequency conversion
• Surface code quantum communication
• A multinode quantum network over a metropolitan area
• Efficient synthesis of universal Repeat-Until-Success circuits
• Balanced Product Quantum Codes
• Entangling logical qubits with lattice surgery
• SeQUeNCe: A Customizable Discrete-Event Simulator of Quantum Networks
• A telecom-wavelength quantum repeater node based on a trapped-ion processor
• Sparse Blossom: correcting a million errors per core second with minimum-weight matching
• Low-overhead fault-tolerant quantum computing using long-range connectivity
• SimulaQron - A simulator for developing quantum internet software
• QuNetSim: A Software Framework for Quantum Networks
• Towards a deterministic interface between trapped-ion qubits and travelling photons
• Robust Quantum Memory in a Trapped-Ion Quantum Network Node
• A Quantum Repeater Node Demonstrating Unconditionally Secure Key Distribution
• The ZX calculus is a language for surface code lattice surgery
• Nondestructive detection of photonic qubits
• Surface code compilation via edge-disjoint paths
• Decoding algorithms for surface codes
• Transversality and lattice surgery: exploring realistic routes towards coupled logical qubits with trapped-ion quantum processors
• Quantum teleportation of physical qubits into logical code-spaces
• Efficient polarisation-preserving frequency conversion from a trapped-ion-compatible wavelength to the telecom C band
• Synthesis of Arbitrary Quantum Circuits to Topological Assembly
• Quantum repeaters and computation by a single module
• Direct measurement of Bacon-Shor code stabilizers
• Creating entangled logical qubits in the heavy-hex lattice with topological codes
• A High Performance Compiler for Very Large Scale Surface Code Computations
• Architecture for fast implementation of qLDPC codes with optimized Rydberg gates
• CSS code surgery as a universal construction

Cited by in corpus (2)

• Secure authentication via Quantum Physical Unclonable Functions: a review
• Logical entanglement distribution between distant 2D array qubits