Exact Calculations of Coherent Information for Toric Codes under Decoherence: Identifying the Fundamental Error Threshold

• URL: http://arxiv.org/abs/2402.16937v1
• Date: Mon, 26 Feb 2024 19:00:00 GMT
• Title: Exact Calculations of Coherent Information for Toric Codes under Decoherence: Identifying the Fundamental Error Threshold
• Authors: Jong Yeon Lee
• Abstract summary: The toric code is a canonical example of a topological error-correcting code. Recent studies have explored such a threshold behavior as an intrinsic information-theoretic transition. We present the first analytic expression for the coherent information of a decohered toric code.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: The toric code is a canonical example of a topological error-correcting code. Two logical qubits stored within the toric code are robust against local decoherence, ensuring that these qubits can be faithfully retrieved as long as the error rate remains below a certain threshold. Recent studies have explored such a threshold behavior as an intrinsic information-theoretic transition, independent of the decoding protocol. These studies have shown that information-theoretic metrics, calculated using the Renyi (replica) approximation, demonstrate sharp transitions at a specific error rate. However, an exact analytic expression that avoids using the replica trick has not been shown, and the connection between the transition in information-theoretic capacity and the random bond Ising model (RBIM) has only been indirectly established. In this work, we present the first analytic expression for the coherent information of a decohered toric code, thereby establishing a rigorous connection between the fundamental error threshold and the criticality of the RBIM.

Related papers

• A blindness property of the Min-Sum decoding for the toric code [3.543432625843538]
  Kitaev's toric code is one of the most prominent models for fault-tolerant quantum computation. Recent efforts have been devoted to improving the error correction performance of the toric code under message-passing decoding.
  arXiv  Detail & Related papers  (2024-06-21T08:28:31Z)
• Extracting Error Thresholds through the Framework of Approximate Quantum Error Correction Condition [0.0]
  robustness of quantum memory against physical noises is measured by two methods. exact and approximate quantum error correction (QEC) conditions for error recoverability. decoder-dependent error threshold which assesses if the logical error rate diminishes with system size.
  arXiv  Detail & Related papers  (2023-12-28T12:37:49Z)
• Disentanglement via Latent Quantization [60.37109712033694]
  In this work, we construct an inductive bias towards encoding to and decoding from an organized latent space. We demonstrate the broad applicability of this approach by adding it to both basic data-re (vanilla autoencoder) and latent-reconstructing (InfoGAN) generative models.
  arXiv  Detail & Related papers  (2023-05-28T06:30:29Z)
• Estimating Coherent Contributions to the Error Profile Using Cycle Error Reconstruction [0.0]
  We present a scalable and cycle-centric methodology for obtaining a detailed estimate of the coherent contribution to the error profile of a hard computing cycle. We perform proof-of-concept experiments on three IBM chips, namely ibmq_guadalupe, ibmq_manila, and ibmq_montreal.
  arXiv  Detail & Related papers  (2023-03-17T13:04:19Z)
• 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)
• Diagnostics of mixed-state topological order and breakdown of quantum memory [0.0]
  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.
  arXiv  Detail & Related papers  (2023-01-13T18:21:23Z)
• Mitigating the Mutual Error Amplification for Semi-Supervised Object Detection [92.52505195585925]
  We propose a Cross Teaching (CT) method, aiming to mitigate the mutual error amplification by introducing a rectification mechanism of pseudo labels. In contrast to existing mutual teaching methods that directly treat predictions from other detectors as pseudo labels, we propose the Label Rectification Module (LRM)
  arXiv  Detail & Related papers  (2022-01-26T03:34:57Z)
• Error-rate-agnostic decoding of topological stabilizer codes [0.0]
  We develop a decoder that depends on the bias, i.e., the relative probability of phase-flip to bit-flip errors, but is agnostic to error rate. Our decoder is based on counting the number and effective weight of the most likely error chains in each equivalence class of a given syndrome.
  arXiv  Detail & Related papers  (2021-12-03T15:45:12Z)
• Performance of teleportation-based error correction circuits for bosonic codes with noisy measurements [58.720142291102135]
  We analyze the error-correction capabilities of rotation-symmetric codes using a teleportation-based error-correction circuit. We find that with the currently achievable measurement efficiencies in microwave optics, bosonic rotation codes undergo a substantial decrease in their break-even potential.
  arXiv  Detail & Related papers  (2021-08-02T16:12:13Z)
• Neural Distributed Source Coding [59.630059301226474]
  We present a framework for lossy DSC that is agnostic to the correlation structure and can scale to high dimensions. We evaluate our method on multiple datasets and show that our method can handle complex correlations and state-of-the-art PSNR.
  arXiv  Detail & Related papers  (2021-06-05T04:50:43Z)
• Autoregressive Belief Propagation for Decoding Block Codes [113.38181979662288]
  We revisit recent methods that employ graph neural networks for decoding error correcting codes. Our method violates the symmetry conditions that enable the other methods to train exclusively with the zero-word. Despite not having the luxury of training on a single word, and the inability to train on more than a small fraction of the relevant sample space, we demonstrate effective training.
  arXiv  Detail & Related papers  (2021-01-23T17:14:55Z)

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.