NISQ Computers: A Path to Quantum Supremacy

Abstract

The quest for quantum advantage, wherein quantum computers surpass the computational capabilities of classical computers executing state-of-the-art algorithms on well-defined tasks, represents a pivotal race in the domain of quantum computing. NISQ (Noisy Intermediate-Scale Quantum) computing has witnessed remarkable advancements, culminating in significant milestones on the journey towards the realization of universal fault-tolerant quantum computers. This transformative turning point, known as quantum supremacy, has been achieved amid a series of breakthroughs, signifying the dawn of the quantum era. Quantum hardware has undergone substantial integration and architectural evolution, contrasting with its nascent stages. In this review, we critically examine the quantum supremacy experiments conducted thus far, shedding light on their implications and contributions to the evolving landscape of quantum computing. Additionally, we endeavor to illuminate a range of cutting-edge proof-of-principle investigations in the realm of applied quantum computing, providing an insightful overview of the current state of applied quantum research and its prospective influence across diverse scientific, industrial, and technological frontiers.

References in corpus (29)

• Supplementary information for "Quantum supremacy using a programmable superconducting processor"
• Quantum Computing
• Charge insensitive qubit design derived from the Cooper pair box
• Quantum algorithm for solving linear systems of equations
• Quantum computational advantage using photons
• Satellite-to-ground quantum key distribution
• A Quantum Approximate Optimization Algorithm
• An introduction to quantum machine learning
• Secure Quantum Key Distribution
• Strong quantum computational advantage using a superconducting quantum processor
• Measurement device independent quantum key distribution over 404 km optical fibre
• Quantum Data Fitting
• Quantum-enhanced machine learning
• Phase-Programmable Gaussian Boson Sampling Using Stimulated Squeezed Light
• Unsupervised Machine Learning on a Hybrid Quantum Computer
• Leveraging Secondary Storage to Simulate Deep 54-qubit Sycamore Circuits
• The Quantum Adiabatic Algorithm applied to random optimization problems: the quantum spin glass perspective
• The performance of the quantum adiabatic algorithm on random instances of two optimization problems on regular hypergraphs
• The Quantum Approximate Optimization Algorithm Needs to See the Whole Graph: A Typical Case
• Classical Simulation of Quantum Supremacy Circuits
• Training Gaussian Boson Sampling Distributions
• Selected topics of quantum computing for nuclear physics
• Variational Quantum Simulation of Partial Differential Equations: Applications in Colloidal Transport
• Quantum Information and Computation for Chemistry
• Solving Multi-Coloring Combinatorial Optimization Problems Using Hybrid Quantum Algorithms
• A quantum algorithm for training wide and deep classical neural networks
• Leveraging Analog Quantum Computing with Neutral Atoms for Solvent Configuration Prediction in Drug Discovery
• Quantum factorization of 56153 with only 4 qubits
• Quantum-Inspired Tensor Neural Networks for Partial Differential Equations

Cited by in corpus (9)

• IBM Quantum Computers: Evolution, Performance, and Future Directions
• Comprehensive characterization of three-qubit Grover search algorithm on IBM's 127-qubit superconducting quantum computers
• Information processing at the speed of light
• A Toffoli Gate Decomposition via Echoed Cross-Resonance Gates
• Efficient Quantum Circuit Compilation for Near-Term Quantum Advantage
• Full Quantum Process Tomography of a Universal Entangling Gate on an IBM's Quantum Computer
• Quantum correlations in general qubit-qudit axially symmetric states
• Robustness and classical proxy of entanglement in variants of quantum walk
• Jenga-Krotov algorithm: Efficient compilation of multi-qubit gates for exchange-only qubits