Experimental benchmarking of an automated deterministic error
suppression workflow for quantum algorithms
- URL: http://arxiv.org/abs/2209.06864v2
- Date: Wed, 3 May 2023 19:30:35 GMT
- Title: Experimental benchmarking of an automated deterministic error
suppression workflow for quantum algorithms
- Authors: Pranav S. Mundada, Aaron Barbosa, Smarak Maity, Yulun Wang, T. M.
Stace, Thomas Merkh, Felicity Nielson, Andre R. R. Carvalho, Michael Hush,
Michael J. Biercuk, and Yuval Baum
- Abstract summary: Excitement about the promise of quantum computers is tempered by the reality that the hardware remains exceptionally fragile and error-prone.
We describe and experimentally test a fully autonomous workflow designed to deterministically suppress errors in quantum algorithms from the gate level through to circuit execution and measurement.
- Score: 0.0
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: Excitement about the promise of quantum computers is tempered by the reality
that the hardware remains exceptionally fragile and error-prone, forming a
bottleneck in the development of novel applications. In this manuscript, we
describe and experimentally test a fully autonomous workflow designed to
deterministically suppress errors in quantum algorithms from the gate level
through to circuit execution and measurement. We introduce the key elements of
this workflow, delivered as a software package called Fire Opal, and survey the
underlying physical concepts: error-aware compilation, automated system-wide
gate optimization, automated dynamical decoupling embedding for circuit-level
error cancellation, and calibration-efficient measurement-error mitigation. We
then present a comprehensive suite of performance benchmarks executed on IBM
hardware, demonstrating up to > 1000X improvement over the best alternative
expert-configured techniques available in the open literature. Benchmarking
includes experiments using up to 16 qubit systems executing: Bernstein
Vazirani, Quantum Fourier Transform, Grover's Search, QAOA, VQE, Syndrome
extraction on a five-qubit Quantum Error Correction code, and Quantum Volume.
Experiments reveal a strong contribution of Non-Markovian errors to baseline
algorithmic performance; in all cases the deterministic error-suppression
workflow delivers the highest performance and approaches incoherent error
bounds without the need for any additional sampling or randomization overhead,
while maintaining compatibility with all additional probabilistic error
suppression techniques.
Related papers
- Performance of Quantum Approximate Optimization with Quantum Error Detection [2.0174252910776556]
Quantum approximate optimization algorithm (QAOA) is a promising candidate for scaling up.
achieving better-than-classical performance with QAOA is believed to require fault tolerance.
We demonstrate a partially fault-tolerant implementation of QAOA using the $[[k+2,k,2]]$ Iceberg'' error detection code.
arXiv Detail & Related papers (2024-09-18T16:24:43Z) - 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) - Analysis of Maximum Threshold and Quantum Security for Fault-Tolerant
Encoding and Decoding Scheme Base on Steane Code [10.853582091917236]
The original Steane code is not fault-tolerant because the CNOT gates in an encoded block may cause error propagation.
We first propose a fault-tolerant encoding and decoding scheme, which analyzes all possible errors caused by each quantum gate in an error-correction period.
We then provide the fault-tolerant scheme of the universal quantum gate set, including fault-tolerant preparation and verification of ancillary states.
arXiv Detail & Related papers (2024-03-07T07:46:03Z) - Fast Flux-Activated Leakage Reduction for Superconducting Quantum
Circuits [84.60542868688235]
leakage out of the computational subspace arising from the multi-level structure of qubit implementations.
We present a resource-efficient universal leakage reduction unit for superconducting qubits using parametric flux modulation.
We demonstrate that using the leakage reduction unit in repeated weight-two stabilizer measurements reduces the total number of detected errors in a scalable fashion.
arXiv Detail & Related papers (2023-09-13T16:21:32Z) - 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) - Automatic Implementation and Evaluation of Error-Correcting Codes for
Quantum Computing: An Open-Source Framework for Quantum Error Correction [2.1801327670218855]
Real quantum computers are plagued by frequent noise effects that cause errors during computations.
Quantum error-correcting codes address this problem by providing means to identify and correct corresponding errors.
We propose an open-source framework that automatically applies error-correcting codes for a given application followed by an automatic noise-aware quantum circuit simulation.
arXiv Detail & Related papers (2023-01-13T19:12:22Z) - A Hybrid Quantum-Classical Algorithm for Robust Fitting [47.42391857319388]
We propose a hybrid quantum-classical algorithm for robust fitting.
Our core contribution is a novel robust fitting formulation that solves a sequence of integer programs.
We present results obtained using an actual quantum computer.
arXiv Detail & Related papers (2022-01-25T05:59:24Z) - Measuring NISQ Gate-Based Qubit Stability Using a 1+1 Field Theory and
Cycle Benchmarking [50.8020641352841]
We study coherent errors on a quantum hardware platform using a transverse field Ising model Hamiltonian as a sample user application.
We identify inter-day and intra-day qubit calibration drift and the impacts of quantum circuit placement on groups of qubits in different physical locations on the processor.
This paper also discusses how these measurements can provide a better understanding of these types of errors and how they may improve efforts to validate the accuracy of quantum computations.
arXiv Detail & Related papers (2022-01-08T23:12:55Z) - Sampling Overhead Analysis of Quantum Error Mitigation: Uncoded vs.
Coded Systems [69.33243249411113]
We show that Pauli errors incur the lowest sampling overhead among a large class of realistic quantum channels.
We conceive a scheme amalgamating QEM with quantum channel coding, and analyse its sampling overhead reduction compared to pure QEM.
arXiv Detail & Related papers (2020-12-15T15:51:27Z) - Randomized compiling for scalable quantum computing on a noisy
superconducting quantum processor [0.0]
Coherent errors limit the performance of quantum algorithms in an unpredictable manner.
Average error rates measured by randomized benchmarking and related protocols are not sensitive to the full impact of coherent errors.
Our results demonstrate that randomized compiling can be utilized to leverage and predict the capabilities of modern-day noisy quantum processors.
arXiv Detail & Related papers (2020-10-01T06:52:45Z) - Deterministic correction of qubit loss [48.43720700248091]
Loss of qubits poses one of the fundamental obstacles towards large-scale and fault-tolerant quantum information processors.
We experimentally demonstrate the implementation of a full cycle of qubit loss detection and correction on a minimal instance of a topological surface code.
arXiv Detail & Related papers (2020-02-21T19:48:53Z)
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.