Deterministic high-rate entanglement distillation with neutral atom arrays

• URL: http://arxiv.org/abs/2503.00445v1
• Date: Sat, 01 Mar 2025 10:54:25 GMT
• Title: Deterministic high-rate entanglement distillation with neutral atom arrays
• Authors: Thomas A. Hahn, Ryan White, Hannes Bernien, Rotem Arnon-Friedman,
• Abstract summary: One-way hashing method is known for efficiently and deterministically distill entanglement in the limit.<n>We show how the one-way hashing method can be efficiently implemented with neutral atom arrays.<n>A full coherent implementation of the one-way hashing method is within reach with state-of-the-art quantum technology.
• Score: 1.8999296421549168
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: The goal of an entanglement distillation protocol is to convert large quantities of noisy entangled states into a smaller number of high-fidelity Bell pairs. The celebrated one-way hashing method is one such protocol, and it is known for being able to efficiently and deterministically distill entanglement in the asymptotic limit, i.e., when the size of the quantum system is very large. In this work, we consider setups with finite resources, e.g., a small fixed number of atoms in an atom array, and derive lower bounds on the distillation rate for the one-way hashing method. We provide analytical as well as numerical bounds on its entanglement distillation rate -- both significantly tighter than previously known bounds. We then show how the one-way hashing method can be efficiently implemented with neutral atom arrays. The combination of our theoretical results and the experimental blueprint we provide indicate that a full coherent implementation of the one-way hashing method is within reach with state-of-the-art quantum technology.

Related papers

• Entanglement theory with limited computational resources [0.29998889086656577]
  We show that computational entanglement measures diverge significantly from information-theoretic counterparts.<n>While the von Neumann entropy captures information-theoretic rates for pure-state transformations, we show that under computational constraints, the min-entropy governs optimal entanglement distillation.<n>Our results establish a stark, maximal separation of $tildeOmega(n)$ vs. $o(1)$ between computational and information-theoretic entanglement measures.
  arXiv  Detail & Related papers  (2025-02-17T19:43:59Z)
• A Quantum Super-Krylov Method for Ground State Energy Estimation [0.562479170374811]
  Krylov quantum diagonalization methods for ground state energy estimation have emerged as a compelling use case for quantum computers.<n>We present a quantum Krylov method that uses only time evolutions and recovery probabilities, making it well adapted for current quantum computers.<n>We prove that the resulting ground energy estimate converges in the noise-free regime and provide a classical numerical demonstration of the method in the presence of noise.
  arXiv  Detail & Related papers  (2024-12-23T05:21:43Z)
• Surpassing the fundamental limits of distillation with catalysts [2.107610564835429]
  We show that quantum catalysts can help surpass previously known fundamental limitations on distillation overhead. In particular, in context of magic state distillation, our result indicates that the code-based low-overhead distillation protocols can be promoted to the one-shot setting. We demonstrate that enables a spacetime trade-off between overhead and success probability.
  arXiv  Detail & Related papers  (2024-10-18T15:41:52Z)
• Asymptotic quantification of entanglement with a single copy [8.056359341994941]
  This paper introduces a new way of benchmarking the protocol of entanglement distillation (purification) Instead of measuring its yield, we focus on the best error achievable. We show this solution to be given by the reverse relative entropy of entanglement, a single-letter quantity that can be evaluated using only a single copy of a quantum state.
  arXiv  Detail & Related papers  (2024-08-13T17:57:59Z)
• Quantum circuit design for mixture and preparation of arbitrary pure and mixed quantum states [25.01488143369413]
  This paper addresses the challenge of preparing arbitrary mixed quantum states. Two circuit design methods are presented: one via a mixture of pure states and the other via purification.
  arXiv  Detail & Related papers  (2024-03-28T06:37:00Z)
• Quantum Gate Optimization for Rydberg Architectures in the Weak-Coupling Limit [55.05109484230879]
  We demonstrate machine learning assisted design of a two-qubit gate in a Rydberg tweezer system. We generate optimal pulse sequences that implement a CNOT gate with high fidelity. We show that local control of single qubit operations is sufficient for performing quantum computation on a large array of atoms.
  arXiv  Detail & Related papers  (2023-06-14T18:24:51Z)
• Calculating the many-body density of states on a digital quantum computer [58.720142291102135]
  We implement a quantum algorithm to perform an estimation of the density of states on a digital quantum computer. We use our algorithm to estimate the density of states of a non-integrable Hamiltonian on the Quantinuum H1-1 trapped ion chip for a controlled register of 18bits.
  arXiv  Detail & Related papers  (2023-03-23T17:46:28Z)
• Estimate distillable entanglement and quantum capacity by squeezing useless entanglement [5.086696108576776]
  Quantum Internet relies on quantum entanglement as a fundamental resource for secure and efficient quantum communication. It remains challenging to accurately estimate the distillable entanglement and its closely related essential quantity, the quantum capacity. We propose efficiently computable upper bounds for both quantities based on the idea that the useless entanglement within a state or a quantum channel does not contribute to the distillable entanglement or the quantum capacity.
  arXiv  Detail & Related papers  (2023-03-13T16:02:18Z)
• Guaranteed efficient energy estimation of quantum many-body Hamiltonians using ShadowGrouping [49.36226952764697]
  Estimation of the energy of quantum many-body systems is a paradigmatic task in various research fields.<n>We aim to find the optimal strategy with single-qubit measurements that yields the highest provable accuracy given a total measurement budget.<n>We develop a practical, efficient estimation strategy, which we call ShadowGrouping.
  arXiv  Detail & Related papers  (2023-01-09T14:41:07Z)
• Improved Quantum Algorithms for Fidelity Estimation [77.34726150561087]
  We develop new and efficient quantum algorithms for fidelity estimation with provable performance guarantees. Our algorithms use advanced quantum linear algebra techniques, such as the quantum singular value transformation. We prove that fidelity estimation to any non-trivial constant additive accuracy is hard in general.
  arXiv  Detail & Related papers  (2022-03-30T02:02:16Z)
• Entanglement-assisted entanglement purification [62.997667081978825]
  We present a new class of entanglement-assisted entanglement purification protocols that can generate high-fidelity entanglement from noisy, finite-size ensembles. Our protocols can deal with arbitrary errors, but are best suited for few errors, and work particularly well for decay noise.
  arXiv  Detail & Related papers  (2020-11-13T19:00:05Z)
• Preparation of excited states for nuclear dynamics on a quantum computer [117.44028458220427]
  We study two different methods to prepare excited states on a quantum computer. We benchmark these techniques on emulated and real quantum devices. These findings show that quantum techniques designed to achieve good scaling on fault tolerant devices might also provide practical benefits on devices with limited connectivity and gate fidelity.
  arXiv  Detail & Related papers  (2020-09-28T17:21:25Z)

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.