Stabilizer Entanglement Distillation and Efficient Fault-Tolerant Encoder

• URL: http://arxiv.org/abs/2408.06299v1
• Date: Mon, 12 Aug 2024 17:09:24 GMT
• Title: Stabilizer Entanglement Distillation and Efficient Fault-Tolerant Encoder
• Authors: Yu Shi, Ashlesha Patil, Saikat Guha,
• Abstract summary: Entanglement is essential for quantum information processing but is limited by noise. We develop high-yield entanglement distillation protocols with several advancements. We propose a constant-depth decoder for stabilizer codes that transforms logical states into physical ones.
• Score: 3.496737164472548
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Entanglement is essential for quantum information processing but is limited by noise. We address this by developing high-yield entanglement distillation protocols with several advancements. (1) We extend the 2-to-1 recurrence entanglement distillation protocol to higher-rate n-to-(n-1) protocols that can correct any single-qubit errors. These protocols are evaluated through numerical simulations focusing on fidelity and yield. We also outline a method to adapt any classical error-correcting code for entanglement distillation, where the code can correct both bit-flip and phase-flip errors by incorporating Hadamard gates. (2) We propose a constant-depth decoder for stabilizer codes that transforms logical states into physical ones using single-qubit measurements. This decoder is applied to entanglement distillation protocols, reducing circuit depth and enabling protocols derived from advanced quantum error-correcting codes. We demonstrate this by evaluating the circuit complexity for entanglement distillation protocols based on surface codes and quantum convolutional codes. (3) Our stabilizer entanglement distillation techniques advance quantum computing. We propose a fault-tolerant protocol for constant-depth encoding and decoding of arbitrary quantum states, applicable to quantum low-density parity-check (qLDPC) codes and surface codes. This protocol is feasible with state-of-the-art reconfigurable atom arrays and surpasses the limits of conventional logarithmic depth encoders. Overall, our study integrates stabilizer formalism, measurement-based quantum computing, and entanglement distillation, advancing both quantum communication and computing.

Related papers

• Fast quantum interconnects via constant-rate entanglement distillation [0.0]
  We develop constant-rate entanglement distillation methods for quantum interconnects. We prove the scheme has constant-rate in expectation and numerically optimize to achieve low practical overhead. We find our optimized schemes outperform existing computationally efficient quantum interconnect schemes by an order of magnitude in relevant regimes.
  arXiv  Detail & Related papers  (2024-08-28T16:54:54Z)
• Testing the Accuracy of Surface Code Decoders [55.616364225463066]
  Large-scale, fault-tolerant quantum computations will be enabled by quantum error-correcting codes (QECC) This work presents the first systematic technique to test the accuracy and effectiveness of different QECC decoding schemes.
  arXiv  Detail & Related papers  (2023-11-21T10:22:08Z)
• Analog information decoding of bosonic quantum LDPC codes [3.34006871348377]
  We propose novel decoding methods that explicitly exploit the syndrome information obtained from a bosonic qubit readout. Our results lay the foundation for general decoding algorithms using analog information and demonstrate promising results in the direction of fault-tolerant quantum computation.
  arXiv  Detail & Related papers  (2023-11-02T15:41:03Z)
• Near-term $n$ to $k$ distillation protocols using graph codes [0.0]
  Noisy hardware forms one of the main hurdles to the realization of a near-term quantum internet. We consider here an experimentally relevant class of distillation protocols, which distill $n$ to $k$ end-to-end entangled pairs. We leverage this correspondence to find provably optimal distillation protocols in this class for several tasks important for the quantum internet.
  arXiv  Detail & Related papers  (2023-03-20T21:46:17Z)
• Modular decoding: parallelizable real-time decoding for quantum computers [55.41644538483948]
  Real-time quantum computation will require decoding algorithms capable of extracting logical outcomes from a stream of data generated by noisy quantum hardware. We propose modular decoding, an approach capable of addressing this challenge with minimal additional communication and without sacrificing decoding accuracy. We introduce the edge-vertex decomposition, a concrete instance of modular decoding for lattice-surgery style fault-tolerant blocks.
  arXiv  Detail & Related papers  (2023-03-08T19:26:10Z)
• Deep Quantum Error Correction [73.54643419792453]
  Quantum error correction codes (QECC) are a key component for realizing the potential of quantum computing. In this work, we efficiently train novel emphend-to-end deep quantum error decoders. The proposed method demonstrates the power of neural decoders for QECC by achieving state-of-the-art accuracy.
  arXiv  Detail & Related papers  (2023-01-27T08:16:26Z)
• Gaussian conversion protocol for heralded generation of qunaught states [66.81715281131143]
  bosonic codes map qubit-type quantum information onto the larger bosonic Hilbert space. We convert between two instances of these codes GKP qunaught states and four-foldsymmetric binomial states corresponding to a zero-logical encoded qubit. We obtain GKP qunaught states with a fidelity of over 98% and a probability of approximately 3.14%.
  arXiv  Detail & Related papers  (2023-01-24T14:17:07Z)
• Fault-tolerant circuit synthesis for universal fault-tolerant quantum computing [0.0]
  We present a quantum circuit synthesis algorithm for implementing universal fault-tolerant quantum computing based on geometricd codes. We show how to synthesize the set of universal fault-tolerant protocols for $[[7,1,3]]$ Steane code and the syndrome measurement protocol of $[[23, 1, 7]]$ Golay code.
  arXiv  Detail & Related papers  (2022-06-06T15:43:36Z)
• Dense Coding with Locality Restriction for Decoder: Quantum Encoders vs. Super-Quantum Encoders [67.12391801199688]
  We investigate dense coding by imposing various locality restrictions to our decoder. In this task, the sender Alice and the receiver Bob share an entangled state.
  arXiv  Detail & Related papers  (2021-09-26T07:29:54Z)
• Hardware-Efficient, Fault-Tolerant Quantum Computation with Rydberg Atoms [55.41644538483948]
  We provide the first complete characterization of sources of error in a neutral-atom quantum computer. We develop a novel and distinctly efficient method to address the most important errors associated with the decay of atomic qubits to states outside of the computational subspace. Our protocols can be implemented in the near-term using state-of-the-art neutral atom platforms with qubits encoded in both alkali and alkaline-earth atoms.
  arXiv  Detail & Related papers  (2021-05-27T23:29:53Z)
• All-Optical Long-Distance Quantum Communication with Gottesman-Kitaev-Preskill qubits [0.0]
  Quantum repeaters are a promising platform for realizing long-distance quantum communication. In this work, we consider implementing a quantum repeater protocol using Gottesman-Kitaev-Preskill qubits.
  arXiv  Detail & Related papers  (2020-11-30T15:14:34Z)

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.