Special Session: Noisy Intermediate-Scale Quantum (NISQ) Computers -- How They Work, How They Fail, How to Test Them?
arXiv:2301.11739 · doi:10.1109/VTS50974.2021.9441047
Abstract
First quantum computers very recently have demonstrated "quantum supremacy" or "quantum advantage": Executing a computation that would have been impossible on a classical machine. Today's quantum computers follow the NISQ paradigm: They exhibit error rates that are much higher than in conventional electronics and have insufficient quantum resources to support powerful error correction protocols. This raises questions which relevant computations are within the reach of NISQ architectures. Several "NISQ-era algorithms" are assumed to match the specifics of such computers; for instance, variational optimisers are based on intertwining relatively short quantum and classical computations, thus maximizing the chances of success. This paper will critically assess the promise and challenge of NISQ computing. What has this field achieved so far, what are we likely to achieve soon, where do we have to be skeptical and wait for the advent of larger-scale fully error-corrected architectures?
References in corpus (35)
- Quantum Computing in the NISQ era and beyond
- Supplementary information for "Quantum supremacy using a programmable superconducting processor"
- Quantum Mechanics helps in searching for a needle in a haystack
- Surface codes: Towards practical large-scale quantum computation
- Hardware-efficient Variational Quantum Eigensolver for Small Molecules and Quantum Magnets
- Quantum computational advantage using photons
- Improved Simulation of Stabilizer Circuits
- Error mitigation for short-depth quantum circuits
- Characterizing Quantum Supremacy in Near-Term Devices
- Robust randomized benchmarking of quantum processes
- Quantum Error Correction for Beginners
- Hartree-Fock on a superconducting qubit quantum computer
- Validating quantum computers using randomized model circuits
- Complete Characterization of a Quantum Process: the Two-Bit Quantum Gate
- Characterizing Quantum Gates via Randomized Benchmarking
- Efficient measurement of quantum gate error by interleaved randomized benchmarking
- Quantum advantage with shallow circuits
- Quantum algorithms for electronic structure calculations: particle/hole Hamiltonian and optimized wavefunction expansions
- An approximate Fourier transform useful in quantum factoring
- Blueprint for a microwave trapped-ion quantum computer
- The Bitter Truth About Quantum Algorithms in the NISQ Era
- Photonic architecture for scalable quantum information processing in NV-diamond
- Efficient learning of quantum noise
- Quantum phase estimation of multiple eigenvalues for small-scale (noisy) experiments
- Leveraging Secondary Storage to Simulate Deep 54-qubit Sycamore Circuits
- Tensor Networks in a Nutshell
- Tutorial: Gate-based superconducting quantum computing
- Requirements for fault-tolerant factoring on an atom-optics quantum computer
- Introduction to Quantum Gate Set Tomography
- A Roadmap for Automating the Selection of Quantum Computers for Quantum Algorithms
- Simulating the Sycamore quantum supremacy circuits
- 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
- ArsoNISQ: Analyzing Quantum Algorithms on Near-Term Architectures