Performance of two different quantum annealing correction codes

DOI10.1007/S11128-015-1201-ZMaRDI QIDQ264593zbMATH OpenOpenAlexFDO

Authors Anurag Mishra, Tameem Albash, Daniel A. Lidar

Publication date 1 April 2016

Published in Quantum Information Processing (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1508.02785

zbMATH Keywords

error correctionquantum annealingquantum computationquantum error correctionquantum optimizationspin chainssuperconducting flux qubitstransverse field Ising model

Mathematics Subject Classification ID

Quantum computation (81P68) Quantum coding (general) (81P70) Statistical mechanics of superconductors (82D55) Theory of error-correcting codes and error-detecting codes (94B99)

Abstract: Quantum annealing is a promising approach for solving optimization problems, but like all other quantum information processing methods, it requires error correction to ensure scalability. In this work we experimentally compare two quantum annealing correction codes in the setting of antiferromagnetic chains, using two different quantum annealing processors. The lower temperature processor gives rise to higher success probabilities. The two codes differ in a number of interesting and important ways, but both require four physical qubits per encoded qubit. We find significant performance differences, which we explain in terms of the effective energy boost provided by the respective redundantly encoded logical operators of the two codes. The code with the higher energy boost results in improved performance, at the expense of a lower degree encoded graph. Therefore, we find that there exists an important tradeoff between encoded connectivity and performance for quantum annealing correction codes.

Recommendations

• Benchmarking advantage and D-wave 2000Q quantum annealers with exact cover problems
• Quantum annealing of hard problems
• Enhancing quantum annealing performance for the molecular similarity problem
• Quantum versus classical annealing of Ising spin glasses
• Boosting quantum annealer performance via sample persistence

Cites work

• scientific article; zbMATH DE number 5320186 (Why is no real title available?)
• A quantum adiabatic evolution algorithm applied to random instances of an NP-complete problem
• Adiabatic approximation with exponential accuracy for many-body systems and quantum computation
• Bounds for the adiabatic approximation with applications to quantum computation
• Error suppression and error correction in adiabatic quantum computation: non-equilibrium dynamics
• Noise resistance of adiabatic quantum computation using random matrix theory
• Quantum accuracy threshold for concatenated distance-3 code
• Universal Quantum Simulators

Cited in

(9)

• Quantum pattern recognition with multi-neuron interactions
• Microwave photonics with superconducting quantum circuits
• Reliability of Digitized Quantum Annealing and the Decay of Entanglement
• Boosting quantum annealer performance via sample persistence
• Mind the gap: achieving a super-Grover quantum speedup by jumping to the end
• Thermal entanglement in quantum annealing processor
• Practical integer-to-binary mapping for quantum annealers
• Simulated versus reduced noise quantum annealing in maximum independent set solution to wireless network scheduling
• The travelling salesman problem and adiabatic quantum computation: an algorithm

This page was built for publication: Performance of two different quantum annealing correction codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q264593)