Diagnostics of mixed-state topological order and breakdown of quantum memory

• URL: http://arxiv.org/abs/2301.05689v2
• Date: Tue, 12 Mar 2024 06:20:34 GMT
• Title: Diagnostics of mixed-state topological order and breakdown of quantum memory
• Authors: Ruihua Fan, Yimu Bao, Ehud Altman, Ashvin Vishwanath
• Abstract summary: Topological quantum memory can protect information against local errors up to finite error thresholds. We provide an intrinsic characterization of the breakdown of topological quantum memory. We employ three information-theoretical quantities that can be regarded as generalizations of the diagnostics of ground-state topological order.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Topological quantum memory can protect information against local errors up to finite error thresholds. Such thresholds are usually determined based on the success of decoding algorithms rather than the intrinsic properties of the mixed states describing corrupted memories. Here we provide an intrinsic characterization of the breakdown of topological quantum memory, which both gives a bound on the performance of decoding algorithms and provides examples of topologically distinct mixed states. We employ three information-theoretical quantities that can be regarded as generalizations of the diagnostics of ground-state topological order, and serve as a definition for topological order in error-corrupted mixed states. We consider the topological contribution to entanglement negativity and two other metrics based on quantum relative entropy and coherent information. In the concrete example of the 2D Toric code with local bit-flip and phase errors, we map three quantities to observables in 2D classical spin models and analytically show they all undergo a transition at the same error threshold. This threshold is an upper bound on that achieved in any decoding algorithm and is indeed saturated by that in the optimal decoding algorithm for the Toric code.

Related papers

• Topograph: An efficient Graph-Based Framework for Strictly Topology Preserving Image Segmentation [78.54656076915565]
  Topological correctness plays a critical role in many image segmentation tasks. Most networks are trained using pixel-wise loss functions, such as Dice, neglecting topological accuracy. We propose a novel, graph-based framework for topologically accurate image segmentation.
  arXiv  Detail & Related papers  (2024-11-05T16:20:14Z)
• Information dynamics in decohered quantum memory with repeated syndrome measurements: a dual approach [1.1215232994550846]
  We intrinsically characterize the information dynamics in a quantum memory under repeated measurements. We develop a $(d+1)$-dimensional statistical mechanics model for the information-theoretic diagnostics.
  arXiv  Detail & Related papers  (2024-07-10T17:48:54Z)
• A Noisy Approach to Intrinsically Mixed-State Topological Order [0.0]
  We show that the resulting mixed-state can display intrinsically mixed-state topological order (imTO) We find that gauging out anyons generically results in imTO, with the decohered mixed-state strongly symmetric under certain anomalous 1-form symmetries.
  arXiv  Detail & Related papers  (2024-03-20T18:00:01Z)
• Replica topological order in quantum mixed states and quantum error correction [0.0]
  Topological phases of matter offer a promising platform for quantum computation and quantum error correction. We give two definitions for replica topological order in mixed states, which involve $n$ copies of density matrices of the mixed state. We show that in the quantum-topological phase, there exists a postselection-based error correction protocol that recovers the quantum information, while in the classical-topological phase, the quantum information has decohere and cannot be fully recovered.
  arXiv  Detail & Related papers  (2024-02-14T19:00:03Z)
• Lossy Quantum Source Coding with a Global Error Criterion based on a Posterior Reference Map [7.646713951724011]
  We consider the lossy quantum source coding problem where the task is to compress a given quantum source below its von Neumann entropy. Inspired by the duality connections between the rate-distortion and channel coding problems in the classical setting, we propose a new formulation for the problem.
  arXiv  Detail & Related papers  (2023-02-01T17:44:40Z)
• 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)
• Numerical Simulations of Noisy Quantum Circuits for Computational Chemistry [51.827942608832025]
  Near-term quantum computers can calculate the ground-state properties of small molecules. We show how the structure of the computational ansatz as well as the errors induced by device noise affect the calculation.
  arXiv  Detail & Related papers  (2021-12-31T16:33:10Z)
• Topological graph states and quantum error correction codes [0.0]
  We derive necessary and sufficient conditions for a family of graph states to be in TQO-1. TQO-1 is a class of quantum error correction code states whose code distance scales macroscopically with the number of physical qubits.
  arXiv  Detail & Related papers  (2021-12-05T07:43:24Z)
• Bridging the gap between topological non-Hermitian physics and open quantum systems [62.997667081978825]
  We show how to detect a transition between different topological phases by measuring the response to local perturbations. Our formalism is exemplified in a 1D Hatano-Nelson model, highlighting the difference between the bosonic and fermionic cases.
  arXiv  Detail & Related papers  (2021-09-22T18:00:17Z)
• Joint Network Topology Inference via Structured Fusion Regularization [70.30364652829164]
  Joint network topology inference represents a canonical problem of learning multiple graph Laplacian matrices from heterogeneous graph signals. We propose a general graph estimator based on a novel structured fusion regularization. We show that the proposed graph estimator enjoys both high computational efficiency and rigorous theoretical guarantee.
  arXiv  Detail & Related papers  (2021-03-05T04:42:32Z)
• Cellular automaton decoders for topological quantum codes with noisy measurements and beyond [68.8204255655161]
  We propose an error correction procedure based on a cellular automaton, the sweep rule, which is applicable to a broad range of codes beyond topological quantum codes. For simplicity, we focus on the three-dimensional (3D) toric code on the rhombic dodecahedral lattice with boundaries and prove that the resulting local decoder has a non-zero error threshold. We find that this error correction procedure is remarkably robust against measurement errors and is also essentially insensitive to the details of the lattice and noise model.
  arXiv  Detail & Related papers  (2020-04-15T18:00:01Z)

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.