Related papers: Constant Overhead Entanglement Distillation via Scrambling

Constant Overhead Entanglement Distillation via Scrambling

URL: http://arxiv.org/abs/2502.09483v1
Date: Thu, 13 Feb 2025 16:46:15 GMT
Title: Constant Overhead Entanglement Distillation via Scrambling
Authors: Andi Gu, Lorenzo Leone, Kenneth Goodenough, Sumeet Khatri,
Abstract summary: 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.
Score: 0.6249768559720122
License:
Abstract: High-fidelity quantum entanglement enables key quantum networking capabilities such as secure communication and distributed quantum computing, but distributing entangled states through optical fibers is limited by noise and loss. Entanglement distillation protocols address this problem by extracting high-fidelity Bell pairs from multiple noisy ones. The primary objective is minimizing the resource overhead: the number of noisy input pairs needed to distill each high-fidelity output pair. While protocols achieving optimal overhead are known in theory, they often require complex decoding operations that make practical implementation challenging. We circumvent this challenge by introducing protocols that use quantum scrambling - the spreading of quantum information under chaotic dynamics - through random Clifford operations. Based on this scrambling mechanism, we design a distillation protocol that maintains asymptotically constant overhead, independent of the desired output error rate $\bar{\varepsilon}$, and can be implemented with shallow quantum circuits of depth $O(\operatorname{poly} \log \log \bar{\varepsilon}^{-1})$ and memory $O(\operatorname{poly} \log \bar{\varepsilon}^{-1})$. We show this protocol remains effective even with noisy quantum gates, making it suitable for near-term devices. Furthermore, by incorporating partial error correction, our protocol achieves state-of-the-art performance: starting with pairs of 10% initial infidelity, we require only 7 noisy inputs per output pair to distill a single Bell pair with infidelity $\bar{\varepsilon}=10^{-12}$, substantially outperforming existing schemes. Finally, we demonstrate the utility of our protocols through applications to quantum repeater networks.

Related papers

Constant-Overhead Fault-Tolerant Bell-Pair Distillation using High-Rate Codes [3.4338109681532027]
We present a fault-tolerant Bell-pair distillation scheme achieving constant overhead through high-rate quantum low-density parity-check (qLDPC) codes. Our approach maintains a constant distillation rate equal to the code rate while requiring no additional overhead beyond the physical qubits of the code. Results establish qLDPC-based distillation as a practical route toward resource-efficient quantum networks and distributed quantum computing.
arXiv Detail & Related papers (2025-02-13T17:57:13Z)
Capacity-Achieving Entanglement Purification Protocol for Pauli Dephasing Channel [1.6632263048576381]
A simple entanglement swapping protocol via a central node is not effective against the Pauli dephasing channel. This highlights the importance of purifying distributed Bell states before performing entanglement swapping. We introduce an entanglement purification protocol assisted by two-way classical communication that not only purifies the states but also achieves the channel capacities.
arXiv Detail & Related papers (2024-11-21T20:41:16Z)
QuantumSEA: In-Time Sparse Exploration for Noise Adaptive Quantum Circuits [82.50620782471485]
QuantumSEA is an in-time sparse exploration for noise-adaptive quantum circuits. It aims to achieve two key objectives: (1) implicit circuits capacity during training and (2) noise robustness. Our method establishes state-of-the-art results with only half the number of quantum gates and 2x time saving of circuit executions.
arXiv Detail & Related papers (2024-01-10T22:33:00Z)
Fast Flux-Activated Leakage Reduction for Superconducting Quantum Circuits [84.60542868688235]
leakage out of the computational subspace arising from the multi-level structure of qubit implementations. We present a resource-efficient universal leakage reduction unit for superconducting qubits using parametric flux modulation. We demonstrate that using the leakage reduction unit in repeated weight-two stabilizer measurements reduces the total number of detected errors in a scalable fashion.
arXiv Detail & Related papers (2023-09-13T16:21:32Z)
Data post-processing for the one-way heterodyne protocol under composable finite-size security [62.997667081978825]
We study the performance of a practical continuous-variable (CV) quantum key distribution protocol. We focus on the Gaussian-modulated coherent-state protocol with heterodyne detection in a high signal-to-noise ratio regime. This allows us to study the performance for practical implementations of the protocol and optimize the parameters connected to the steps above.
arXiv Detail & Related papers (2022-05-20T12:37:09Z)
Realization of arbitrary doubly-controlled quantum phase gates [62.997667081978825]
We introduce a high-fidelity gate set inspired by a proposal for near-term quantum advantage in optimization problems. By orchestrating coherent, multi-level control over three transmon qutrits, we synthesize a family of deterministic, continuous-angle quantum phase gates acting in the natural three-qubit computational basis.
arXiv Detail & Related papers (2021-08-03T17:49:09Z)
Error rate reduction of single-qubit gates via noise-aware decomposition into native gates [0.0]
knowledge of a qubit's initial quantum state and the standard parameters describing its decoherence can be leveraged to mitigate the noise present during the execution of a single-qubit gate. We demonstrate a reduction of the single-qubit error rate by $38%$, from $1.6 times 10 -3$ to $1.0 times 10 -3$, provided the initial state of the input qubit is known.
arXiv Detail & Related papers (2021-04-14T18:00:01Z)
Composably secure data processing for Gaussian-modulated continuous variable quantum key distribution [58.720142291102135]
Continuous-variable quantum key distribution (QKD) employs the quadratures of a bosonic mode to establish a secret key between two remote parties. We consider a protocol with homodyne detection in the general setting of composable finite-size security. In particular, we analyze the high signal-to-noise regime which requires the use of high-rate (non-binary) low-density parity check codes.
arXiv Detail & Related papers (2021-03-30T18:02:55Z)
Recycling qubits in near-term quantum computers [1.2891210250935146]
We propose a protocol that can unitarily reset qubits when the circuit has a common convolutional form. This protocol generates fresh qubits from used ones by partially applying the time-reversed quantum circuit over qubits that are no longer in use.
arXiv Detail & Related papers (2020-12-03T03:24:50Z)
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)
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)

This list is automatically generated from the titles and abstracts of the papers in this site.