Long-range data transmission in a fault-tolerant quantum bus architecture

• URL: http://arxiv.org/abs/2209.09774v1
• Date: Tue, 20 Sep 2022 14:57:27 GMT
• Title: Long-range data transmission in a fault-tolerant quantum bus architecture
• Authors: Shin Ho Choe and Robert Koenig
• Abstract summary: 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.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We propose a scheme for fault-tolerant long-range entanglement generation at the ends of a rectangular array of qubits of length $R$ and a square cross section of size $d\times d$ with $d=O(\log R)$. Up to an efficiently computable Pauli correction, the scheme generates a maximally entangled state of two qubits using a depth-$6$ circuit consisting of nearest-neighbor Clifford gates and local measurements only. Compared with existing fault-tolerance schemes for quantum communication, the protocol is distinguished by its low latency: starting from a product state, the entangled state is prepared in a time $O(t_{\textrm{local}})$ determined only by the local gate and measurement operation time $t_{\textrm{local}}$. Furthermore, the requirements on local repeater stations are minimal: Each repeater uses only $\Theta(\log^2 R)$ qubits with a lifetime of order $O(t_{\textrm{local}})$. 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 $R$. Furthermore, all operations within a repeater are local when the qubits are arranged in a square lattice. The noise-resilience of our scheme relies on the fault-tolerance properties of the underlying cluster state. We give a full error analysis, establishing a fault-tolerance threshold against general (circuit-level) local stochastic noise affecting preparation, entangling operations and measurements. This includes, in particular, errors correlated in time and space. Our conservative analytical estimates are surprisingly optimistic, suggesting that the scheme is suited for long-range entanglement generation both in and between near-term quantum computing devices.

Related papers

• The Cost of Entanglement Renormalization on a Fault-Tolerant Quantum Computer [0.042855555838080824]
  We perform a detailed estimate for the prospect of using deep entanglement renormalization ansatz on a fault-tolerant quantum computer. For probing a relatively large system size, we observe up to an order of magnitude reduction in the number of qubits. For estimating the energy per site of $epsilon$, $mathcalOleft(fraclog Nepsilon right)$ $T$ gates and $mathcalOleft(log Nright)$ qubits suffice.
  arXiv  Detail & Related papers  (2024-04-15T18:00:17Z)
• Linear gate bounds against natural functions for position-verification [0.0]
  A quantum position-verification scheme attempts to verify the spatial location of a prover. We consider two well-studied position-verification schemes known as $f$-routing and $f$-BB84.
  arXiv  Detail & Related papers  (2024-02-28T19:00:10Z)
• How to fault-tolerantly realize any quantum circuit with local operations [0.0]
  We show how to realize a general quantum circuit involving gates between arbitrary pairs of qubits. We prove that circuit-level local noise modeling is equivalent to local noise in the original circuit.
  arXiv  Detail & Related papers  (2024-02-21T15:12:40Z)
• 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)
• Private Frequency Estimation via Projective Geometry [47.112770141205864]
  We propose a new algorithm ProjectiveGeometryResponse (PGR) for locally differentially private (LDP) frequency estimation. For a universe size of $k$ and with $n$ users, our $varepsilon$-LDP algorithm has communication cost $lceillogkrceil bits in the private coin setting and $varepsilonlog e + O(1)$ in the public coin setting. In many parameter settings used in practice this is a significant improvement over the O(n+k2)$optimal cost that is achieved by the recent PI-
  arXiv  Detail & Related papers  (2022-03-01T02:49:55Z)
• 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)
• 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)
• 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)
• 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 Algorithms for Simulating the Lattice Schwinger Model [63.18141027763459]
  We give scalable, explicit digital quantum algorithms to simulate the lattice Schwinger model in both NISQ and fault-tolerant settings. In lattice units, we find a Schwinger model on $N/2$ physical sites with coupling constant $x-1/2$ and electric field cutoff $x-1/2Lambda$. We estimate observables which we cost in both the NISQ and fault-tolerant settings by assuming a simple target observable---the mean pair density.
  arXiv  Detail & Related papers  (2020-02-25T19:18:36Z)

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.