Reliable Quantum Memories with Unreliable Components
arXiv:2406.05599 · doi:10.1103/PhysRevA.110.032423
Abstract
Quantum memory systems are vital in quantum information processing for dependable storage and retrieval of quantum states. Inspired by classical reliability theories that synthesize reliable computing systems from unreliable components, we formalize the problem of reliable storage of quantum information using noisy components. We introduce the notion of stable quantum memories and define the storage rate as the ratio of the number of logical qubits to the total number of physical qubits, as well as the circuit complexity of the decoder, which includes both quantum gates and measurements. We demonstrate that a strictly positive storage rate can be achieved by constructing a quantum memory system with quantum expander codes. Moreover, by reducing the reliable storage problem to reliable quantum communication, we provide upper bounds on the achievable storage capacity. In the case of physical qubits corrupted by noise satisfying hypercontractivity conditions, we provide a tighter upper bound on storage capacity using an entropy dissipation argument. Furthermore, observing that the time complexity of the decoder scales non-trivially with the number of physical qubits, achieving asymptotic rates may not be possible due to the induced dependence of the noise on the number of physical qubits. In this constrained non-asymptotic setting, we derive upper bounds on storage capacity using finite blocklength communication bounds. Finally, we numerically analyze the gap between upper and lower bounds in both asymptotic and non-asymptotic cases, and provide suggestions to tighten the gap.
15 pages, 3 figures
References in corpus (15)
- Fault-tolerant quantum computation by anyons
- The Quantum Internet
- Storage of light in atomic vapor
- Quantum Error Correction for Quantum Memories
- Stabilizer Codes and Quantum Error Correction
- High-threshold and low-overhead fault-tolerant quantum memory
- Decoherence benchmarking of superconducting qubits
- Quantum LDPC codes with positive rate and minimum distance proportional to n^{1/2}
- A Hierarchy of Information Quantities for Finite Block Length Analysis of Quantum Tasks
- Mapping a quantum state of light onto a long-lived atomic spin state: towards quantum memory
- Approximate Degradable Quantum Channels
- Quantum Coding with Finite Resources
- An All Linear Optical Quantum Memory Based on Quantum Error Correction
- A Converse for Fault-tolerant Quantum Computation
- Limits of Fault-Tolerance on Resource-Constrained Quantum Circuits for Classical Problems