Feasibility of Logical Bell State Generation in Memory Assisted Quantum Networks

• URL: http://arxiv.org/abs/2412.01434v2
• Date: Tue, 03 Dec 2024 09:09:35 GMT
• Title: Feasibility of Logical Bell State Generation in Memory Assisted Quantum Networks
• Authors: Vladlen Galetsky, Nilesh Vyas, Alberto Comin, Janis Nötzel,
• Abstract summary: Two novel lattice surgery-based protocols are introduced to establish logical Bell states between distant nodes.<n>In the local protocol, the intermediary node creates and directly transmits the logical Bell states to quantum memories.<n>The non-local protocol distributes auxiliary Bell states, merging boundaries between pre-existing codes in the quantum memories.
• Score: 1.6249398255272316
• License: http://creativecommons.org/licenses/by/4.0/
• 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 novel lattice surgery-based protocols (local and non-local) are introduced to establish logical Bell states between distant nodes using an intermediary node. In the local protocol, the intermediary node creates and directly transmits the logical Bell states to quantum memories. In contrast, the non-local protocol distributes auxiliary Bell states, merging boundaries between pre-existing codes in the quantum memories. We simulate the protocols using realistic experimental parameters, including cavity-enhanced atomic frequency comb quantum memories and multimode fiber-optic noisy channels. The study evaluates rotated and planar surface codes alongside Bacon-Shor codes for small code distances $(d = 3, 5)$ under standard and realistic noise models. We observe pseudo-thresholds, indicating that when physical error rates exceed approximately $p_{\text{err}} \sim 10^{-3}$, QEC codes do not provide any benefit over using unencoded Bell states. Moreover, to achieve an advantage over unencoded Bell states for a distance of $1 \, \mathrm{km}$ between the end node and the intermediary, gate error rates must be reduced by an order of magnitude $(0.1p_{\text{err}_H}$, $0.1p_{\text{err}_{CX}}$, and $0.1p_{\text{err}_M}$), highlighting the need for significant hardware improvements to implement logical Bell state protocols with quantum memories. Finally, both protocols were analyzed for their achieved rates, with the non-local protocol showing higher rates, ranging from $6.64 \, \mathrm{kHz}$ to $1.91 \, \mathrm{kHz}$, over distances of $1$ to $9 \, \mathrm{km}$ between the end node and the intermediary node.

Related papers

• Fault-tolerant Preparation of Distant Logical Bell Pair -- with application in the magic square game [0.0]
  We study the impact of low noise on quantum nonlocality in nonlocal games. We introduce an interface circuit and logical entanglement protocol purification (EPP) to efficiently translate between physical and logical qubits. Our framework is adaptable to various quantum error-correcting codes (QECCs) and experimental platforms.
  arXiv  Detail & Related papers  (2025-03-17T19:24:49Z)
• Constant Overhead Entanglement Distillation via Scrambling [0.6249768559720122]
  High-fidelity quantum entanglement enables key quantum networking capabilities such as secure communication and distributed quantum computing. We introduce protocols that use quantum scrambling - the spreading of quantum information under chaotic dynamics. We show this protocol remains effective even with noisy quantum gates, making it suitable for near-term devices.
  arXiv  Detail & Related papers  (2025-02-13T16:46:15Z)
• Universal quantum computation via scalable measurement-free error correction [45.29832252085144]
  We show that universal quantum computation can be made fault-tolerant in a scenario where the error-correction is implemented without mid-circuit measurements. We introduce a measurement-free deformation protocol of the Bacon-Shor code to realize a logical $mathitCCZ$ gate. In particular, our findings support that below-breakeven logical performance is achievable with a circuit-level error rate below $10-3$.
  arXiv  Detail & Related papers  (2024-12-19T18:55:44Z)
• Multipartite entanglement distribution in Bell-pair networks without Steiner trees and with reduced gate cost [0.6827423171182154]
  We present a protocol for producing GHZ states in arbitrary Bell-pair networks provably requiring only $O(N)$ gates. We present numerical evidence that our protocol indeed reduces the gate cost on real-world network models.
  arXiv  Detail & Related papers  (2024-12-05T15:33:03Z)
• Quantum error correction below the surface code threshold [107.92016014248976]
  Quantum error correction provides a path to reach practical quantum computing by combining multiple physical qubits into a logical qubit. We present two surface code memories operating below a critical threshold: a distance-7 code and a distance-5 code integrated with a real-time decoder. Our results present device performance that, if scaled, could realize the operational requirements of large scale fault-tolerant quantum algorithms.
  arXiv  Detail & Related papers  (2024-08-24T23:08:50Z)
• Far from Perfect: Quantum Error Correction with (Hyperinvariant) Evenbly Codes [38.729065908701585]
  We introduce a new class of qubit codes that we call Evenbly codes. Our work indicates that Evenbly codes may show promise for practical quantum computing applications.
  arXiv  Detail & Related papers  (2024-07-16T17:18:13Z)
• Creating entangled logical qubits in the heavy-hex lattice with topological codes [0.0]
  In this work we show how this bug can be turned into a feature. We demonstrate entanglement between logical qubits with code distance up to $d = 4$. We verify the violation of Bell's inequality for both the $d=2$ case with post selection featuring a fidelity of $94%$.
  arXiv  Detail & Related papers  (2024-04-24T17:02:35Z)
• Efficient State Preparation for Metrology and Quantum Error Correction with Global Control [0.0]
  We introduce a simple, experimentally realizable protocol that can prepare any specific superposition of permutationally invariant qubit states, also known as Dicke states. We demonstrate the utility of our protocol by numerically preparing several states with theoretical infidelities $1-mathcalF10-4$. We estimate that the protocol achieves fidelities $gtrsim 95%$ in the presence of typical experimental noise levels.
  arXiv  Detail & Related papers  (2023-12-08T14:28:34Z)
• Complete analysis of a realistic fiber-based quantum repeater scheme [0.8356833388425764]
  We present a quantum repeater protocol for distributing entanglement over long distances. A dedicated communication stage enables trial rates not limited by the travel time between repeater nodes. We analyze the protocol performance for a broad range of experimental parameters and obtain secret key rates ranging from $1 rightarrow 1000$ Hz at a distance of $1000$ km.
  arXiv  Detail & Related papers  (2023-09-08T06:31:06Z)
• Quantum Two-Way Communication Protocol Beyond Superdense Coding [36.25599253958745]
  We introduce a generalization of one-way superdense coding to two-way communication protocols for transmitting classical bits by using entangled quantum pairs. The proposed protocol gives a 50% increase in both data rate and energy efficiency compared to the classical protocol.
  arXiv  Detail & Related papers  (2023-09-06T08:48:07Z)
• Logical Magic State Preparation with Fidelity Beyond the Distillation Threshold on a Superconducting Quantum Processor [20.66929930736679]
  Fault-tolerant quantum computing based on surface code has emerged as an attractive candidate for practical large-scale quantum computers. We present a hardware-efficient and scalable protocol for arbitrary logical state preparation for the rotated surface code. We further experimentally implement it on the textitZuchongzhi 2.1 superconducting quantum processor.
  arXiv  Detail & Related papers  (2023-05-25T12:10:59Z)
• Non-Local Multi-Qubit Quantum Gates via a Driven Cavity [0.0]
  We present two protocols for implementing deterministic non-local multi-qubit quantum gates on qubits coupled to a common cavity mode. The protocols rely only on a classical drive of the cavity modes, while no external drive of the qubits is required. We provide estimates of gate fidelities and durations for atomic and molecular qubits coupled to optical or microwave cavities, and suggest applications for quantum error correction.
  arXiv  Detail & Related papers  (2023-03-23T09:30:42Z)
• Spacetime-Efficient Low-Depth Quantum State Preparation with Applications [93.56766264306764]
  We show that a novel deterministic method for preparing arbitrary quantum states requires fewer quantum resources than previous methods. We highlight several applications where this ability would be useful, including quantum machine learning, Hamiltonian simulation, and solving linear systems of equations.
  arXiv  Detail & Related papers  (2023-03-03T18:23:20Z)
• Compression for Qubit Clocks [55.38708484314286]
  We propose a compression protocol for $n$ identically prepared states of qubit clocks. The protocol faithfully encodes the states into $(1/2)log n$ qubits and $(1/2)log n$ classical bits.
  arXiv  Detail & Related papers  (2022-09-14T09:45:53Z)
• Efficient Bipartite Entanglement Detection Scheme with a Quantum Adversarial Solver [89.80359585967642]
  Proposal reformulates the bipartite entanglement detection as a two-player zero-sum game completed by parameterized quantum circuits. We experimentally implement our protocol on a linear optical network and exhibit its effectiveness to accomplish the bipartite entanglement detection for 5-qubit quantum pure states and 2-qubit quantum mixed states.
  arXiv  Detail & Related papers  (2022-03-15T09:46:45Z)
• Unimon qubit [42.83899285555746]
  Superconducting qubits are one of the most promising candidates to implement quantum computers. Here, we introduce and demonstrate a superconducting-qubit type, the unimon, which combines the desired properties of high non-linearity, full insensitivity to dc charge noise, insensitivity to flux noise, and a simple structure consisting only of a single Josephson junction in a resonator.
  arXiv  Detail & Related papers  (2022-03-11T12:57:43Z)
• Protocols for creating and distilling multipartite GHZ states with Bell pairs [0.0]
  distribution of high-quality Greenberger-Horne-Zeilinger (GHZ) states is at the heart of many quantum communication tasks. We introduce a dynamic programming algorithm to optimize over a large class of protocols that create and purify GHZ states.
  arXiv  Detail & Related papers  (2020-10-23T09:40:01Z)
• Fault-tolerant Coding for Quantum Communication [71.206200318454]
  encode and decode circuits to reliably send messages over many uses of a noisy channel. For every quantum channel $T$ and every $eps>0$ there exists a threshold $p(epsilon,T)$ for the gate error probability below which rates larger than $C-epsilon$ are fault-tolerantly achievable. Our results are relevant in communication over large distances, and also on-chip, where distant parts of a quantum computer might need to communicate under higher levels of noise.
  arXiv  Detail & Related papers  (2020-09-15T15:10:50Z)
• Quantum Gram-Schmidt Processes and Their Application to Efficient State Read-out for Quantum Algorithms [87.04438831673063]
  We present an efficient read-out protocol that yields the classical vector form of the generated state. Our protocol suits the case that the output state lies in the row space of the input matrix. One of our technical tools is an efficient quantum algorithm for performing the Gram-Schmidt orthonormal procedure.
  arXiv  Detail & Related papers  (2020-04-14T11:05:26Z)

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.