Recovery With Incomplete Knowledge: Fundamental Bounds on Real-Time Quantum Memories
arXiv:2208.04427 · doi:10.22331/q-2023-12-04-1195
Abstract
The recovery of fragile quantum states from decoherence is the basis of building a quantum memory, with applications ranging from quantum communications to quantum computing. Many recovery techniques, such as quantum error correction, rely on the apriori knowledge of the environment noise parameters to achieve their best performance. However, such parameters are likely to drift in time in the context of implementing long-time quantum memories. This necessitates using a "spectator" system, which estimates the noise parameter in real-time, then feed-forwards the outcome to the recovery protocol as a classical side-information. The memory qubits and the spectator system hence comprise the building blocks for a real-time (i.e. drift-adapting) quantum memory. In this article, I consider spectator-based (incomplete knowledge) recovery protocols as a real-time parameter estimation problem (generally with nuisance parameters present), followed by the application of the "best-guess" recovery map to the memory qubits, as informed by the estimation outcome. I present information-theoretic and metrological bounds on the performance of this protocol, quantified by the diamond distance between the "best-guess" recovery and optimal recovery outcomes, thereby identifying the cost of adaptation in real-time quantum memories. Finally, I provide fundamental bounds for multi-cycle recovery in the form of recurrence inequalities. The latter suggests that incomplete knowledge of the noise could be an advantage, as errors from various cycles can cohere. These results are illustrated for the approximate [4,1] code of the amplitude-damping channel and relations to various fields are discussed.
42 pages, 10 figures, and 2 tables. Accepted in Quantum (11/12/2023)
References in corpus (23)
- Surface codes: Towards practical large-scale quantum computation
- Randomized Benchmarking of Quantum Gates
- Restrictions on Transversal Encoded Quantum Gate Sets
- Quantum Process Tomography: Resource Analysis of Different Strategies
- Evenly distributed unitaries: on the structure of unitary designs
- Transforming quantum operations: quantum supermaps
- Symmetrised Characterisation of Noisy Quantum Processes
- Robust multi-qubit quantum network node with integrated error detection
- Asymptotic teleportation scheme as a universal programmable quantum processor
- Mid-circuit correction of correlated phase errors using an array of spectator qubits
- Optimum Quantum Error Recovery using Semidefinite Programming
- Robust Quantum Error Correction via Convex Optimization
- Structured Near-Optimal Channel-Adapted Quantum Error Correction
- Quantum Error Correction via Convex Optimization
- Computing the distance between quantum channels: Usefulness of the Fano representation
- Two-sided estimates of minimum-error distinguishability of mixed quantum states via generalized Holevo-Curlander bounds
- Tight Cramér-Rao type bounds for multiparameter quantum metrology through conic programming
- Time-delayed single satellite quantum repeater node for global quantum communications
- Approximate reconstructability of quantum states and noisy quantum secret sharing schemes
- Optimized mitigation of random-telegraph-noise dephasing by spectator-qubit sensing and control
- Continuous Real-Time Sensing with a Nitrogen Vacancy Center via Coherent Population Trapping
- Noise-adapted recovery circuits for quantum error correction
- Greedy versus Map-based Optimized Adaptive Algorithms for random-telegraph-noise mitigation by spectator qubits