Subexponential rate versus distance with time-multiplexed quantum repeaters

• URL: http://arxiv.org/abs/2105.01002v2
• Date: Fri, 19 Nov 2021 16:27:21 GMT
• Title: Subexponential rate versus distance with time-multiplexed quantum repeaters
• Authors: Prajit Dhara, Ashlesha Patil, Hari Krovi, Saikat Guha
• Abstract summary: 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.
• Score: 0.9634859579172252
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• Abstract: 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. The rate achieved using a linear chain of quantum repeaters equipped with quantum memories, probabilistic Bell state measurements (BSMs) and switches used for spatial multiplexing, but no quantum error correction, was shown to surpass the direct-transmission capacity. However, this rate still decays exponentially with the end-to-end distance, viz., $R \sim e^{-s{\alpha L}}$, with $s < 1$. We show that the introduction of temporal multiplexing - i.e., the ability to perform BSMs among qubits at a repeater node that were successfully entangled with qubits at distinct neighboring nodes at {\em different} time steps - leads to a sub-exponential rate-vs.-distance scaling, i.e., $R \sim e^{-t\sqrt{\alpha L}}$, which is not attainable with just spatial or spectral multiplexing. We evaluate analytical upper and lower bounds to this rate, and obtain the exact rate by numerically optimizing the time-multiplexing block length and the number of repeater nodes. We further demonstrate that incorporating losses in the optical switches used to implement time multiplexing degrades the rate-vs.-distance performance, eventually falling back to exponential scaling for very lossy switches. We also examine models for quantum memory decoherence and describe optimal regimes of operation to preserve the desired boost from temporal multiplexing. Quantum memory decoherence is seen to be more detrimental to the repeater's performance over switching losses.

Related papers

• Multiplexed quantum repeaters with hot multimode alkali-noble gas memories [45.49722819849123]
  We propose a non-cryogenic optical quantum memory for noble-gas nuclear spins based on the Atomic Frequency Comb protocol. We discuss how these quantum memories can enhance rates in satellite quantum communication networks.
  arXiv  Detail & Related papers  (2024-02-27T18:39:15Z)
• Towards large-scale quantum optimization solvers with few qubits [59.63282173947468]
  We introduce a variational quantum solver for optimizations over $m=mathcalO(nk)$ binary variables using only $n$ qubits, with tunable $k>1$. We analytically prove that the specific qubit-efficient encoding brings in a super-polynomial mitigation of barren plateaus as a built-in feature.
  arXiv  Detail & Related papers  (2024-01-17T18:59:38Z)
• Enhancing Dispersive Readout of Superconducting Qubits Through Dynamic Control of the Dispersive Shift: Experiment and Theory [47.00474212574662]
  A superconducting qubit is coupled to a large-bandwidth readout resonator. We show a beyond-state-of-the-art two-state-readout error of only 0.25,%$ in 100 ns integration time. The presented results are expected to further boost the performance of new and existing algorithms and protocols.
  arXiv  Detail & Related papers  (2023-07-15T10:30:10Z)
• Continuous dynamical decoupling of optical $^{171}$Yb$^{+}$ qudits with radiofrequency fields [45.04975285107723]
  We experimentally achieve a gain in the efficiency of realizing quantum algorithms with qudits. Our results are a step towards the realization of qudit-based algorithms using trapped ions.
  arXiv  Detail & Related papers  (2023-05-10T11:52:12Z)
• 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)
• Zero-Added-Loss Entangled Photon Multiplexing for Ground- and Space-Based Quantum Networks [2.4075366828302482]
  We propose a scheme for optical entanglement distribution in quantum networks based on a quasi-deterministic entangled photon pair source. Our architecture presents a blueprint for realizing global-scale quantum networks in the near-term.
  arXiv  Detail & Related papers  (2022-06-08T04:38:39Z)
• A lower bound on the space overhead of fault-tolerant quantum computation [51.723084600243716]
  The threshold theorem is a fundamental result in the theory of fault-tolerant quantum computation. We prove an exponential upper bound on the maximal length of fault-tolerant quantum computation with amplitude noise.
  arXiv  Detail & Related papers  (2022-01-31T22:19:49Z)
• Implementing a Fast Unbounded Quantum Fanout Gate Using Power-Law Interactions [0.9634136878988853]
  Power-law interactions with strength decaying as $1/ralpha$ in the distance provide an experimentally realizable resource for information processing. We leverage the power of these interactions to implement a fast quantum fanout gate with an arbitrary number of targets. We show that power-law systems with $alpha le D$ are difficult to simulate classically even for short times, under a standard assumption that factoring is classically intractable.
  arXiv  Detail & Related papers  (2020-07-01T18:00:00Z)
• Entanglement distribution with wavevector-multiplexed quantum memory [0.0]
  We show the WV-MUX-QM platform to provide quasi-deterministic entanglement generation over extended distances. We establish the entangled-bit (ebit) rate per number of employed nodes as a practical figure of merit.
  arXiv  Detail & Related papers  (2020-07-01T15:03:58Z)
• Efficient optimization of cut-offs in quantum repeater chains [0.0]
  We develop an algorithm for computing the probability distribution of the waiting time and fidelity of entanglement produced by repeater chain protocols. We use the algorithm to optimize cut-offs in order to maximize secret-key rate between the end nodes of the repeater chain.
  arXiv  Detail & Related papers  (2020-05-11T09:17:21Z)
• 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.