Recovery With Incomplete Knowledge: Fundamental Bounds on Real-Time Quantum Memories

• URL: http://arxiv.org/abs/2208.04427v2
• Date: Wed, 29 Nov 2023 00:06:32 GMT
• Title: Recovery With Incomplete Knowledge: Fundamental Bounds on Real-Time Quantum Memories
• Authors: Arshag Danageozian
• Abstract summary: I consider spectator-based (incomplete knowledge) recovery protocols as a real-time parameter estimation problem. I present information-theoretic and metrological bounds on the performance of this protocol.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• 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.

Related papers

• Entanglement-enhanced learning of quantum processes at scale [2.2278634757583875]
  We show that entanglement with auxiliary noisy quantum memory combined with error mitigation considerably enhances the learning of quantum processes. Our study demonstrates that entanglement with auxiliary noisy quantum memory combined with error mitigation considerably enhances the learning of quantum processes.
  arXiv  Detail & Related papers  (2024-08-06T18:00:20Z)
• Realizing fracton order from long-range quantum entanglement in programmable Rydberg atom arrays [45.19832622389592]
  Storing quantum information requires battling quantum decoherence, which results in a loss of information over time. To achieve error-resistant quantum memory, one would like to store the information in a quantum superposition of degenerate states engineered in such a way that local sources of noise cannot change one state into another. We show that this platform also allows to detect and correct certain types of errors en route to the goal of true error-resistant quantum memory.
  arXiv  Detail & Related papers  (2024-07-08T12:46:08Z)
• Characterizing randomness in parameterized quantum circuits through expressibility and average entanglement [39.58317527488534]
  Quantum Circuits (PQCs) are still not fully understood outside the scope of their principal application. We analyse the generation of random states in PQCs under restrictions on the qubits connectivities. We place a connection between how steep is the increase on the uniformity of the distribution of the generated states and the generation of entanglement.
  arXiv  Detail & Related papers  (2024-05-03T17:32:55Z)
• Lindblad-like quantum tomography for non-Markovian quantum dynamical maps [46.350147604946095]
  We introduce Lindblad-like quantum tomography (L$ell$QT) as a quantum characterization technique of time-correlated noise in quantum information processors. We discuss L$ell$QT for the dephasing dynamics of single qubits in detail, which allows for a neat understanding of the importance of including multiple snapshots of the quantum evolution in the likelihood function.
  arXiv  Detail & Related papers  (2024-03-28T19:29:12Z)
• A Lie Algebraic Theory of Barren Plateaus for Deep Parameterized Quantum Circuits [37.84307089310829]
  Variational quantum computing schemes train a loss function by sending an initial state through a parametrized quantum circuit. Despite their promise, the trainability of these algorithms is hindered by barren plateaus. We present a general Lie algebra that provides an exact expression for the variance of the loss function of sufficiently deep parametrized quantum circuits.
  arXiv  Detail & Related papers  (2023-09-17T18:14:10Z)
• Near-Term Distributed Quantum Computation using Mean-Field Corrections and Auxiliary Qubits [77.04894470683776]
  We propose near-term distributed quantum computing that involve limited information transfer and conservative entanglement production. We build upon these concepts to produce an approximate circuit-cutting technique for the fragmented pre-training of variational quantum algorithms.
  arXiv  Detail & Related papers  (2023-09-11T18:00:00Z)
• Quantum state preparation via engineered ancilla resetting [0.0]
  We study a protocol that incorporates periodic quantum resetting to prepare ground states of frustration-free parent Hamiltonians. This protocol uses a steering Hamiltonian that enables local coupling between the system and ancillary degrees of freedom. Our numerical results show that ancilla system entanglement is essential for faster convergence.
  arXiv  Detail & Related papers  (2023-05-15T13:34:07Z)
• Bounds on an effective thermalization beyond the Zeno limit [0.0]
  The quantum Zeno effect has emerged as a widely utilized technique to safeguard classical information stored in quantum systems. We derive effective Zeno dynamics for any time interval between operations. These findings enhance our understanding of the practical applicability of the quantum Zeno effect in preserving classical information stored in quantum systems.
  arXiv  Detail & Related papers  (2023-04-12T13:18:11Z)
• 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)
• Time Series Quantum Reservoir Computing with Weak and Projective Measurements [0.0]
  We show that it is possible to exploit the quantumness of the reservoir and to obtain ideal performance. One consists in rewinding part of the dynamics determined by the fading memory of the reservoir and storing the corresponding data of the input sequence. The other employs weak measurements operating online at the trade-off where information can be extracted accurately and without hindering the needed memory.
  arXiv  Detail & Related papers  (2022-05-13T17:57:39Z)
• Information recoverability of noisy quantum states [5.526775342940154]
  We introduce a systematic framework to study how well we can retrieve information from noisy quantum states. We fully characterize the range of recoverable classical information. We also resolve the minimum information retrieving cost, which, along with the corresponding optimal protocol, is efficiently computable by semidefinite programming.
  arXiv  Detail & Related papers  (2022-03-09T16:38:09Z)

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.