Error correction for encoded quantum annealing revisited

• URL: http://arxiv.org/abs/2407.15480v2
• Date: Tue, 23 Jul 2024 15:26:49 GMT
• Title: Error correction for encoded quantum annealing revisited
• Authors: Yoshihiro Nambu,
• Abstract summary: A parity-encoded spin system, known as the Sourlas-Lechner-Hauke-Zoller (SLHZ) system, exhibits error-correcting capability. We propose a very simple decoding algorithm to eliminate errors in the readout of SLHZ systems. Our new algorithm can be thought of as a bit-flipping algorithm for LDPC codes.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: F. Pastawski and J. Preskill discussed error correction of quantum annealing (QA) based on a parity-encoded spin system, known as the Sourlas-Lechner-Hauke-Zoller (SLHZ) system. They pointed out that the SLHZ system is closely related to a classical low-density parity-check (LDPC) code and demonstrated its error-correcting capability through a belief propagation (BP) algorithm assuming independent random spin-flip errors. In contrast, Ablash et al. suggested that the SLHZ system does not receive the benefits of post-readout decoding. The reason is that independent random spin-flips are not the most relevant error arising from sampling excited states during the annealing process, whether in closed or open system cases. In this work, we revisit this issue: we propose a very simple decoding algorithm to eliminate errors in the readout of SLHZ systems and show experimental evidence suggesting that SLHZ system exhibits error-correcting capability in decoding annealing readouts. Our new algorithm can be thought of as a bit-flipping algorithm for LDPC codes. Assuming an independent and identical noise model, we found that the performance of our algorithm is comparable to that of the BP algorithm. The error correcting-capability for the sampled readouts was investigated using Monte Carlo calculations that simulate the final time distribution of QA. The results show that the algorithm successfully eliminates errors in the sampled readouts under conditions where error-free state or even code state is not sampled at all. Our simulation suggests that decoding of annealing readouts will be successful if the correctable states can be sampled by annealing, and annealing can be considered to play a role as a pre-process of the classical decoding process. This knowledge will be useful for designing and developing practical QA based on the SLHZ system in the near future.

Related papers

• Lightcone shading for classically accelerated quantum error mitigation [1.1801688624472007]
  Quantum error mitigation (QEM) can recover accurate expectation values from a noisy quantum computer by trading off bias for variance. Probabilistic error cancellation (PEC) stands out among QEM methods as an especially robust means of controllably eliminating bias. We present an algorithm providing a practical benefit for some problems even with modest classical resources.
  arXiv  Detail & Related papers  (2024-09-06T16:48:09Z)
• Investigate the Performance of Distribution Loading with Conditional Quantum Generative Adversarial Network Algorithm on Quantum Hardware with Error Suppression [0.26013878609420266]
  The study examines the efficacy of the Fire Opal error suppression and AI circuit optimization system integrated with IBM's quantum computing platform. The results indicate that Fire Opal can improve on the time-dependent distributions generated by our Conditional Quantum Generative Adversarial algorithm by 30-40% in comparison with the results on the simulator.
  arXiv  Detail & Related papers  (2024-06-13T17:21:43Z)
• Error Correction Capabilities of Non-Linear Cryptographic Hash Functions [56.368766255147555]
  Linear hashes are known to possess error-correcting capabilities. In most applications, non-linear hashes with pseudorandom outputs are utilized instead. We show that non-linear hashes might also exhibit good error-correcting capabilities.
  arXiv  Detail & Related papers  (2024-05-02T17:26:56Z)
• Bit-flipping Decoder Failure Rate Estimation for (v,w)-regular Codes [84.0257274213152]
  We propose a new technique to provide accurate estimates of the DFR of a two-iterations (parallel) bit flipping decoder. We validate our results, providing comparisons of the modeled and simulated weight of the syndrome, incorrectly-guessed error bit distribution at the end of the first iteration, and two-itcrypteration Decoding Failure Rates (DFR)
  arXiv  Detail & Related papers  (2024-01-30T11:40:24Z)
• Incoherent Approximation of Leakage in Quantum Error Correction [0.03922370499388702]
  Quantum error correcting codes typically do not account for quantum state transitions - leakage - out of the computational subspace. We introduce a Random Phase Approximation (RPA) on quantum channels that preserves the incoherence between the computational and leakage subspaces. We show that RPA yields accurate error correction statistics in the repetition and surface codes with physical error parameters.
  arXiv  Detail & Related papers  (2023-12-16T00:52:23Z)
• Testing the Accuracy of Surface Code Decoders [55.616364225463066]
  Large-scale, fault-tolerant quantum computations will be enabled by quantum error-correcting codes (QECC) This work presents the first systematic technique to test the accuracy and effectiveness of different QECC decoding schemes.
  arXiv  Detail & Related papers  (2023-11-21T10:22:08Z)
• 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)
• The Accuracy vs. Sampling Overhead Trade-off in Quantum Error Mitigation Using Monte Carlo-Based Channel Inversion [84.66087478797475]
  Quantum error mitigation (QEM) is a class of promising techniques for reducing the computational error of variational quantum algorithms. We consider a practical channel inversion strategy based on Monte Carlo sampling, which introduces additional computational error. We show that when the computational error is small compared to the dynamic range of the error-free results, it scales with the square root of the number of gates.
  arXiv  Detail & Related papers  (2022-01-20T00:05:01Z)
• 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)
• Leveraging Randomized Compiling for the QITE Algorithm [0.0]
  Iterative algorithms like Quantum Imaginary Time Evolution are susceptible to coherent errors. This article presents the combination of both noise tailoring using Randomized Compiling and error mitigation with a purification. We show how combining noise tailoring and error mitigation will push forward the performance of NISQ devices.
  arXiv  Detail & Related papers  (2021-04-18T09:26:25Z)
• Optimal noise estimation from syndrome statistics of quantum codes [0.7264378254137809]
  Quantum error correction allows to actively correct errors occurring in a quantum computation when the noise is weak enough. Traditionally, this information is obtained by benchmarking the device before operation. We address the question of what can be learned from only the measurements done during decoding.
  arXiv  Detail & Related papers  (2020-10-05T18:00:26Z)

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.