Entanglement Routing over Networks with Time Multiplexed Repeaters

• URL: http://arxiv.org/abs/2308.15028v3
• Date: Thu, 28 Mar 2024 22:54:23 GMT
• Title: Entanglement Routing over Networks with Time Multiplexed Repeaters
• Authors: Emily A Van Milligen, Eliana Jacobson, Ashlesha Patil, Gayane Vardoyan, Don Towsley, Saikat Guha,
• Abstract summary: Quantum networks will be able to service consumers with long-distance entanglement by use of quantum repeaters. Global link state knowledge is required to maximize the rate of entanglement generation between any two consumers. We propose two entanglement routing protocols that require only local link state knowledge to relax the quantum memory coherence time requirements.
• Score: 8.850295347968808
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Quantum networks will be able to service consumers with long-distance entanglement by use of quantum repeaters that generate Bell pairs (or links) with their neighbors, iid with probability $p$ and perform Bell State Measurements (BSMs) on the links that succeed iid with probability $q$. While global link state knowledge is required to maximize the rate of entanglement generation between any two consumers, it increases the protocol latency due to the classical communication requirements and requires long quantum memory coherence times. We propose two entanglement routing protocols that require only local link state knowledge to relax the quantum memory coherence time requirements and reduce the protocol latency. These protocols utilize multi-path routing protocol and time multiplexed repeaters. The time multiplexed repeaters first generate links for $k$-time steps before performing BSMs on any pairs of links. Our two protocols differ in the decision rule used for performing BSMs at the repeater: the first being a static path based routing protocol and second a dynamic distance based routing protocol. The performance of these protocols depends on the quantum network topology and the consumers' location. We observe that the average entanglement rate and the latency increase with the time multiplexing block length, $k$, irrespective of the protocol. When a step function memory decoherence model is introduced such that qubits are held in the quantum memory for an exponentially distributed time with mean $\mu$, an optimal $k$ ($k_\text{opt}$) value appears, such that for increasing $k$ beyond $k_{\rm opt}$ hurts the entanglement rate. $k_{\rm opt}$ decreases with $p$ and increases with $\mu$. $k_{\rm opt}$ appears due to the tradeoff between benefits from time multiplexing and the increased likelihood of previously established Bell pairs decohering due to finite memory coherence times.

Related papers

• Practical Quantum Clock Synchronization Using Weak Coherent Pulses [0.0]
  We numerically evaluate a quantum-enhanced clock synchronization protocol based on attenuated weak coherent pulses.<n>We simulate that sub-nanosecond clock-offset accuracy and precision can be achieved under these operating conditions.
  arXiv  Detail & Related papers  (2025-09-30T19:21:59Z)
• A distillation-teleportation protocol for fault-tolerant QRAM [95.99192129224721]
  We present a protocol for fault-tolerantly implementing the logical quantum random access memory (QRAM) operation.<n>For coherently accessing classical memories of size $2n$, our protocol consumes only $mathrmpoly(n)$ fault-tolerant quantum resources.
  arXiv  Detail & Related papers  (2025-05-26T17:42:56Z)
• A metropolitan-scale trapped-ion quantum network node with hybrid multiplexing enhancements [0.0]
  We experimentally realize a functional $5$-ion quantum network node with two different types of qubits inside. We can generate heralded ion-photon entanglement with a high fidelity of $96.8%$/$94.6%$/$89.8%$ with a success rate of $263,texts-1$/$40,texts-1$/$4.28,texts-1$, over a fiber of $3,$m/$1,$km/$12,$km, respectively.
  arXiv  Detail & Related papers  (2025-03-18T04:51:05Z)
• Feasibility of Logical Bell State Generation in Memory Assisted Quantum Networks [1.6249398255272316]
  Two lattice surgery-based protocols 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. 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.
  arXiv  Detail & Related papers  (2024-12-02T12:16:28Z)
• Complete analysis of a realistic fiber-based quantum repeater scheme [0.8356833388425764]
  We present a quantum repeater protocol for distributing entanglement over long distances. The protocol leaves the emitters disentangled from the qubits and photons, thus allowing them to be reused to entangle other qubits. It is important to reach a qubit memory coherence time of around one second, and two-qubit gate and measurement errors in the order of $10-3$ to obtain reasonable secret key rates over distances longer than achievable with direct transmission.
  arXiv  Detail & Related papers  (2023-09-08T06:31:06Z)
• Trade-offs between Entanglement and Communication [5.88864611435337]
  We show that quantum simultaneous protocols with $tildeTheta(k5 log3 n)$ qubits of entanglement can exponentially outperform two-way randomized protocols with $O(k)$ qubits of entanglement. Prior to our work, only a relational separation was known.
  arXiv  Detail & Related papers  (2023-06-02T01:49:39Z)
• Multi-User Entanglement Distribution in Quantum Networks Using Multipath Routing [55.2480439325792]
  We propose three protocols that increase the entanglement rate of multi-user applications by leveraging multipath routing. The protocols are evaluated on quantum networks with NISQ constraints, including limited quantum memories and probabilistic entanglement generation.
  arXiv  Detail & Related papers  (2023-03-06T18:06:00Z)
• RAMP: A Flat Nanosecond Optical Network and MPI Operations for Distributed Deep Learning Systems [68.8204255655161]
  We introduce a near-exascale, full-bisection bandwidth, all-to-all, single-hop, all-optical network architecture with nanosecond reconfiguration called RAMP. RAMP supports large-scale distributed and parallel computing systems (12.8Tbps per node for up to 65,536 nodes.
  arXiv  Detail & Related papers  (2022-11-28T11:24:51Z)
• Long-range data transmission in a fault-tolerant quantum bus architecture [0.0]
  Scheme generates a maximally entangled state of two qubits using a depth-$6$ circuit consisting of nearest-neighbor Clifford gates and local measurements only. We prove a converse bound $Omega(log R)$ on the number of qubits per repeater among all low-latency schemes for fault-tolerant quantum communication over distance.
  arXiv  Detail & Related papers  (2022-09-20T14:57:27Z)
• 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)
• Distance-Independent Entanglement Generation in a Quantum Network using Space-Time Multiplexed Greenberger-Horne-Zeilinger (GHZ) Measurements [12.427456455384805]
  In a quantum network that successfully creates links, shared Bell states between neighboring repeater nodes, with probability $p$ in each time slot, and perform Bell State Measurements at nodes with success probability $q1$, the end to end entanglement generation rate drops exponentially with the distance between consumers. We extend this protocol to incorporate a time-multiplexing blocklength $k$, the number of time slots over which a repeater can mix-and-match successful links to perform fusion on. As $(p,q)$ increases, one can approach the ultimate min-cut entanglement generation capacity of $d$
  arXiv  Detail & Related papers  (2021-08-20T20:30:55Z)
• Subexponential rate versus distance with time-multiplexed quantum repeaters [0.9634859579172252]
  Quantum communications capacity using direct transmission over length-$L$ optical fiber scales as $R sim e-alpha L$, where $alpha$ is the fiber's loss coefficient. We show that temporal multiplexing leads to a sub-exponential rate-vs.-distance scaling, i.e., $R sim e-tsqrtalpha L$, which is not attainable with just spatial or spectral multiplexing.
  arXiv  Detail & Related papers  (2021-05-03T16:48:07Z)
• Security Limitations of Classical-Client Delegated Quantum Computing [54.28005879611532]
  A client remotely prepares a quantum state using a classical channel. Privacy loss incurred by employing $RSP_CC$ as a sub-module is unclear. We show that a specific $RSP_CC$ protocol can replace the quantum channel at least in some contexts.
  arXiv  Detail & Related papers  (2020-07-03T13:15:13Z)
• Parallelising the Queries in Bucket Brigade Quantum RAM [69.43216268165402]
  Quantum algorithms often use quantum RAMs (QRAM) for accessing information stored in a database-like manner. We show a systematic method to significantly reduce the effective query time by using Clifford+T gate parallelism. We conclude that, in theory, fault-tolerant bucket brigade quantum RAM queries can be performed approximately with the speed of classical RAM.
  arXiv  Detail & Related papers  (2020-02-21T14:50:03Z)
• Communication Cost of Quantum Processes [49.281159740373326]
  A common scenario in distributed computing involves a client who asks a server to perform a computation on a remote computer. An important problem is to determine the minimum amount of communication needed to specify the desired computation. We analyze the total amount of (classical and quantum) communication needed by a server in order to accurately execute a quantum process chosen by a client.
  arXiv  Detail & Related papers  (2020-02-17T08:51:42Z)

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.