Distance-Independent Entanglement Generation in a Quantum Network using Space-Time Multiplexed Greenberger-Horne-Zeilinger (GHZ) Measurements

• URL: http://arxiv.org/abs/2108.09352v2
• Date: Tue, 24 Aug 2021 16:07:38 GMT
• Title: Distance-Independent Entanglement Generation in a Quantum Network using Space-Time Multiplexed Greenberger-Horne-Zeilinger (GHZ) Measurements
• Authors: Ashlesha Patil, Joshua I. Jacobson, Emily van Milligen, Don Towsley, Saikat Guha
• Abstract summary: 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$
• Score: 12.427456455384805
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: In a quantum network that successfully creates links, shared Bell states between neighboring repeater nodes, with probability $p$ in each time slot, and performs Bell State Measurements at nodes with success probability $q<1$, the end to end entanglement generation rate drops exponentially with the distance between consumers, despite multi-path routing. If repeaters can perform multi-qubit projective measurements in the GHZ basis that succeed with probability $q$, the rate does not change with distance in a certain $(p,q)$ region, but decays exponentially outside. This region where the distance independent rate occurs is the supercritical region of a new percolation problem. We extend this GHZ 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 $k$ increases, the supercritical region expands. For a given $(p,q)$, the entanglement rate initially increases with $k$, and once inside the supercritical region for a high enough $k$, it decays as $1/k$ GHZ states per time slot. When memory coherence time exponentially distributed with mean $\mu$ is incorporated, it is seen that increasing $k$ does not indefinitely increase the supercritical region; it has a hard $\mu$ dependent limit. Finally, we find that incorporating space-division multiplexing, i.e., running the above protocol independently in up to $d$ disconnected network regions, where $d$ is the network's node degree, one can go beyond the 1 GHZ state per time slot rate that the above randomized local link-state protocol cannot surpass. As $(p,q)$ increases, one can approach the ultimate min-cut entanglement generation capacity of $d$ GHZ states per slot.

Related papers

• Proving the Limited Scalability of Centralized Distributed Optimization via a New Lower Bound Construction [57.93371273485736]
  We consider a centralized distributed learning setup where all workers jointly find an unbiased bound LDeltaepsilon2,$ better poly-logarithmically in $n$, even in the homogeneous (i.i.d.) case, where all workers access the same distribution.
  arXiv  Detail & Related papers  (2025-06-30T13:27:39Z)
• Causality, localisation, and universality of monitored quantum walks with long-range hopping [0.0]
  We show that the optimal resetting rate depends on the size of the lattice and diverges as $alphato 0$. We derive simple models reproducing the numerical results, shedding light on the interplay of long-range coherent dynamics, symmetries, and local quantum measurement processes.
  arXiv  Detail & Related papers  (2025-04-16T13:08:42Z)
• 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)
• Improved Algorithm for Adversarial Linear Mixture MDPs with Bandit Feedback and Unknown Transition [71.33787410075577]
  We study reinforcement learning with linear function approximation, unknown transition, and adversarial losses. We propose a new algorithm that attains an $widetildeO(dsqrtHS3K + sqrtHSAK)$ regret with high probability.
  arXiv  Detail & Related papers  (2024-03-07T15:03:50Z)
• Entanglement Routing over Networks with Time Multiplexed Repeaters [8.850295347968808]
  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.
  arXiv  Detail & Related papers  (2023-08-29T05:21:54Z)
• Entanglement distribution in two-dimensional square grid network [1.2792576041526287]
  We study entanglement generation in a quantum network where repeater nodes can perform $n$-qubit Greenberger-Horne-Zeilinger swaps. We show that the distance-independent entanglement distribution rate found previously for this protocol, assuming perfectly-entangled states at the link level, does not survive.
  arXiv  Detail & Related papers  (2023-06-06T00:04:19Z)
• Reinforcement Learning with Delayed, Composite, and Partially Anonymous Reward [41.61653528766776]
  We investigate an infinite-horizon average reward Markov Decision Process (MDP) with delayed, composite, and partially anonymous reward feedback. The delay and compositeness of rewards mean that rewards generated as a result of taking an action at a given state are fragmented into different components.
  arXiv  Detail & Related papers  (2023-05-04T03:31:30Z)
• Observing super-quantum correlations across the exceptional point in a single, two-level trapped ion [48.7576911714538]
  In two-level quantum systems - qubits - unitary dynamics theoretically limit these quantum correlations to $2qrt2$ or 1.5 respectively. Here, using a dissipative, trapped $40$Ca$+$ ion governed by a two-level, non-Hermitian Hamiltonian, we observe correlation values up to 1.703(4) for the Leggett-Garg parameter $K_3$. These excesses occur across the exceptional point of the parity-time symmetric Hamiltonian responsible for the qubit's non-unitary, coherent dynamics.
  arXiv  Detail & Related papers  (2023-04-24T19:44:41Z)
• The Sample Complexity of Online Contract Design [120.9833763323407]
  We study the hidden-action principal-agent problem in an online setting. In each round, the principal posts a contract that specifies the payment to the agent based on each outcome. The agent then makes a strategic choice of action that maximizes her own utility, but the action is not directly observable by the principal.
  arXiv  Detail & Related papers  (2022-11-10T17:59:42Z)
• Reward-Mixing MDPs with a Few Latent Contexts are Learnable [75.17357040707347]
  We consider episodic reinforcement learning in reward-mixing Markov decision processes (RMMDPs) Our goal is to learn a near-optimal policy that nearly maximizes the $H$ time-step cumulative rewards in such a model.
  arXiv  Detail & Related papers  (2022-10-05T22:52:00Z)
• Sharper Convergence Guarantees for Asynchronous SGD for Distributed and Federated Learning [77.22019100456595]
  We show a training algorithm for distributed computation workers with varying communication frequency. In this work, we obtain a tighter convergence rate of $mathcalO!!!(sigma2-2_avg!! . We also show that the heterogeneity term in rate is affected by the average delay within each worker.
  arXiv  Detail & Related papers  (2022-06-16T17:10:57Z)
• Random quantum circuits transform local noise into global white noise [118.18170052022323]
  We study the distribution over measurement outcomes of noisy random quantum circuits in the low-fidelity regime. For local noise that is sufficiently weak and unital, correlations (measured by the linear cross-entropy benchmark) between the output distribution $p_textnoisy$ of a generic noisy circuit instance shrink exponentially. If the noise is incoherent, the output distribution approaches the uniform distribution $p_textunif$ at precisely the same rate.
  arXiv  Detail & Related papers  (2021-11-29T19:26:28Z)
• Unified generation and fast emission of arbitrary single-photon multimode $W$ states [15.154573548076446]
  We propose a scheme to generate arbitrary single-photon multimode $W$ states in circuit QED. We could not only generate $W$ states inside resonators but also release them into transmission lines on demand.
  arXiv  Detail & Related papers  (2021-08-25T11:13:24Z)
• Entanglement between a telecom photon and an on-demand multimode solid-state quantum memory [52.77024349608834]
  We show the first demonstration of entanglement between a telecom photon and a collective spin excitation in a multimode solid-state quantum memory. We extend the entanglement storage in the quantum memory for up to 47.7$mu$s, which could allow for the distribution of entanglement between quantum nodes separated by distances of up to 10 km.
  arXiv  Detail & Related papers  (2021-06-09T13:59:26Z)
• 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)
• Entanglement generation in a quantum network at distance-independent rate [11.583635476962325]
  We develop a protocol for entanglement generation in the quantum internet. It allows a repeater node to use $n$-qubit Greenberger-Horne-Zeilinger measurements. We prove that this powerful network property is not possible to attain with any quantum networking protocol built with Bell measurements and multiplexing alone.
  arXiv  Detail & Related papers  (2020-05-14T20:26:20Z)

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.