ArsoNISQ: Analyzing Quantum Algorithms on Near-Term Architectures
arXiv:2301.07264 · doi:10.1109/ETS50041.2021.9465414
Abstract
While scalable, fully error corrected quantum computing is years or even decades away, there is considerable interest in noisy intermediate-scale quantum computing (NISQ). In this paper, we introduce the ArsoNISQ framework that determines the tolerable error rate of a given quantum algorithm computation, i.e. quantum circuits, and the success probability of the computation given a success criterion and a NISQ computer. ArsoNISQ is based on simulations of quantum circuits subject to errors according to the Pauli error model. ArsoNISQ was evaluated on a set of quantum algorithms that can incur a quantum speedup or are otherwise relevant to NISQ computing. Despite optimistic expectations in recent literature, we did not observe quantum algorithms with intrinsic robustness, i.e. algorithms that tolerate one error on average, in this evaluation. The evaluation demonstrated, however, that the quantum circuit size sets an upper bound for its tolerable error rate and quantified the difference in tolerate error rates for quantum circuits of similar sizes. Thus, the framework can assist quantum algorithm developers in improving their implementation and selecting a suitable NISQ computing platform. Extrapolating the results into the quantum advantage regime suggests that the error rate of larger quantum computers must decrease substantially or active quantum error correction will need to be deployed for most of the evaluated algorithms.
References in corpus (16)
- Quantum Computing in the NISQ era and beyond
- Supplementary information for "Quantum supremacy using a programmable superconducting processor"
- Simulated Quantum Computation of Molecular Energies
- Validating quantum computers using randomized model circuits
- Quantum algorithms for electronic structure calculations: particle/hole Hamiltonian and optimized wavefunction expansions
- The Bitter Truth About Quantum Algorithms in the NISQ Era
- From three-photon GHZ states to ballistic universal quantum computation
- Detecting crosstalk errors in quantum information processors
- Quantum phase estimation of multiple eigenvalues for small-scale (noisy) experiments
- Leveraging Secondary Storage to Simulate Deep 54-qubit Sycamore Circuits
- Efficient estimation of Pauli channels
- A volumetric framework for quantum computer benchmarks
- A Roadmap for Automating the Selection of Quantum Computers for Quantum Algorithms
- Noise effect on Grover algorithm
- Noise-tolerant parity learning with one quantum bit
- Simulating Quantum Algorithms Using Fidelity and Coherence Time as Principle Models for Error