NISQ Computers: A Path to Quantum Supremacy
arXiv:2310.01431 · doi:10.1109/ACCESS.2024.3432330
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 (158)
- Quantum Computing in the NISQ era and beyond
- Fault-tolerant quantum computation by anyons
- Supplementary information for "Quantum supremacy using a programmable superconducting processor"
- Quantum Machine Learning
- Elementary gates for quantum computation
- Quantum sensing
- Circuit Quantum Electrodynamics: Coherent Coupling of a Single Photon to a Cooper Pair Box
- Quantum Computing
- Charge insensitive qubit design derived from the Cooper pair box
- Quantum algorithm for solving linear systems of equations
- Hardware-efficient Variational Quantum Eigensolver for Small Molecules and Quantum Magnets
- Cavity quantum electrodynamics for superconducting electrical circuits: an architecture for quantum computation
- Quantum Computing in Molecular Magnets
- Quantum Simulation
- Ising formulations of many NP problems
- Efficient classical simulation of slightly entangled quantum computations
- The Physical Implementation of Quantum Computation
- Quantum computational advantage using photons
- The theory of variational hybrid quantum-classical algorithms
- A Quantum Adiabatic Evolution Algorithm Applied to Random Instances of an NP-Complete Problem
- Quantum support vector machine for big data classification
- Satellite-to-ground quantum key distribution
- A Quantum Approximate Optimization Algorithm
- Measurement-based quantum computation with cluster states
- Secure quantum key distribution with realistic devices
- Adiabatic Quantum Computing
- Quantum Chemistry in the Age of Quantum Computing
- Quantum computation with trapped polar molecules
- An introduction to quantum machine learning
- Secure Quantum Key Distribution
- Experimental One-Way Quantum Computing
- Field test of quantum key distribution in the Tokyo QKD Network
- Characterizing Quantum Supremacy in Near-Term Devices
- Strong quantum computational advantage using a superconducting quantum processor
- Parameterized quantum circuits as machine learning models
- Quantum computation with ions in thermal motion
- Circuit-centric quantum classifiers
- Universal Quantum Computation with the Exchange Interaction
- Holonomic Quantum Computation
- Measurement device independent quantum key distribution over 404 km optical fibre
- Electron Spin Resonance Transistors for Quantum Computing in Silicon-Germanium Heterostructures
- Quantum Computational Supremacy
- Geometric quantum computation with NMR
- Real-time dynamics of lattice gauge theories with a few-qubit quantum computer
- Scalable Quantum Simulation of Molecular Energies
- Elucidating Reaction Mechanisms on Quantum Computers
- Power of data in quantum machine learning
- Secure quantum key distribution over 421 km of optical fiber
- Hartree-Fock on a superconducting qubit quantum computer
- Quantum Approximate Optimization Algorithm: Performance, Mechanism, and Implementation on Near-Term Devices
- Quantum algorithm for systems of linear equations with exponentially improved dependence on precision
- Defining and detecting quantum speedup
- Self-Verifying Variational Quantum Simulation of the Lattice Schwinger Model
- Qubit architecture with high coherence and fast tunable coupling
- Separability of very noisy mixed states and implications for NMR quantum computing
- Quantum advantage in learning from experiments
- A rigorous and robust quantum speed-up in supervised machine learning
- Quantum Data Fitting
- Quantum algorithms for supervised and unsupervised machine learning
- Quantum Computation by Adiabatic Evolution
- Gaussian Boson Sampling
- Simulating Lattice Gauge Theories within Quantum Technologies
- Random Quantum Circuits
- Quantum Approximate Optimization of Non-Planar Graph Problems on a Planar Superconducting Processor
- Quiet SDS Josephson Junctions for Quantum Computing
- Quantum-enhanced machine learning
- A blueprint for demonstrating quantum supremacy with superconducting qubits
- Quantum Optimization of Maximum Independent Set using Rydberg Atom Arrays
- Phase-Programmable Gaussian Boson Sampling Using Stimulated Squeezed Light
- A tunable coupling scheme for implementing high-fidelity two-qubit gates
- Security in Quantum Cryptography
- Boson Sampling for Molecular Vibronic Spectra
- Variational quantum algorithms for nonlinear problems
- The Expressive Power of Parameterized Quantum Circuits
- Average-case complexity versus approximate simulation of commuting quantum computations
- Obstacles to State Preparation and Variational Optimization from Symmetry Protection
- Even more efficient quantum computations of chemistry through tensor hypercontraction
- Quantum Supremacy and the Complexity of Random Circuit Sampling
- Solving strongly correlated electron models on a quantum computer
- Controlling open quantum systems: Tools, achievements, and limitations
- Information-theoretic bounds on quantum advantage in machine learning
- Quantum Approximate Optimization of the Long-Range Ising Model with a Trapped-Ion Quantum Simulator
- Quantum computing enhanced computational catalysis
- Stimulated emission of polarization-entangled photons
- Unsupervised Machine Learning on a Hybrid Quantum Computer
- Option Pricing using Quantum Computers
- Qubitization of Arbitrary Basis Quantum Chemistry Leveraging Sparsity and Low Rank Factorization
- Is quantum advantage the right goal for quantum machine learning?
- Variational Quantum Linear Solver
- Solving nonlinear differential equations with differentiable quantum circuits
- Achieving quantum supremacy with sparse and noisy commuting quantum computations
- Hyper-optimized tensor network contraction
- A detailed study of Gaussian Boson Sampling
- Variational algorithms for linear algebra
- Resource-Efficient Quantum Algorithm for Protein Folding
- Standard Model Physics and the Digital Quantum Revolution: Thoughts about the Interface
- First order phase transition in the Quantum Adiabatic Algorithm
- Generalization in Quantum Machine Learning: a Quantum Information Perspective
- Hardware-efficient variational quantum algorithms for time evolution
- A flexible high-performance simulator for verifying and benchmarking quantum circuits implemented on real hardware
- The Born Supremacy: Quantum Advantage and Training of an Ising Born Machine
- Molecular Docking with Gaussian Boson Sampling
- Quantum simulation of a lattice Schwinger model in a chain of trapped ions
- Gaussian Boson Sampling with Pseudo-Photon-Number Resolving Detectors and Quantum Computational Advantage
- Solving the sampling problem of the Sycamore quantum circuits
- Using Gaussian Boson Sampling to Find Dense Subgraphs
- Quantum computers as universal quantum simulators: state-of-art and perspectives
- Leveraging Secondary Storage to Simulate Deep 54-qubit Sycamore Circuits
- Gaussian Boson Sampling using threshold detectors
- The Quantum Adiabatic Algorithm applied to random optimization problems: the quantum spin glass perspective
- Applications of Near-Term Photonic Quantum Computers: Software and Algorithms
- Quantum Computational Advantage via High-Dimensional Gaussian Boson Sampling
- The performance of the quantum adiabatic algorithm on random instances of two optimization problems on regular hypergraphs
- QNLP in Practice: Running Compositional Models of Meaning on a Quantum Computer
- Pattern recognition on a quantum computer
- The Boundary for Quantum Advantage in Gaussian Boson Sampling
- The Quantum Approximate Optimization Algorithm Needs to See the Whole Graph: A Typical Case
- Seeking Quantum Speedup Through Spin Glasses: The Good, the Bad, and the Ugly
- Training A Quantum Optimizer
- Application of Quantum Machine Learning using the Quantum Variational Classifier Method to High Energy Physics Analysis at the LHC on IBM Quantum Computer Simulator and Hardware with 10 qubits
- Quantum Artificial Life in an IBM Quantum Computer
- On the Quantum versus Classical Learnability of Discrete Distributions
- Classical Simulation of Quantum Supremacy Circuits
- Classically optimized Hamiltonian simulation
- Minimizing estimation runtime on noisy quantum computers
- How many qubits are needed for quantum computational supremacy?
- Classical Simulation of Intermediate-Size Quantum Circuits
- Experimental realization of quantum algorithms for linear system inspired by adiabatic quantum computing
- Hybrid quantum-classical machine learning for generative chemistry and drug design
- Variational inference with a quantum computer
- Boundaries of quantum supremacy via random circuit sampling
- Point Processes with Gaussian Boson Sampling
- A quantum alternating operator ansatz with hard and soft constraints for lattice protein folding
- Quantum Algorithm for Simulating Molecular Vibrational Excitations
- Inductive supervised quantum learning
- Training Gaussian Boson Sampling Distributions
- Grammar-aware sentence classification on quantum computers
- An Expressive Ansatz for Low-Depth Quantum Approximate Optimisation
- A Neural-Network Variational Quantum Algorithm for Many-Body Dynamics
- Generalized Quantum Assisted Simulator
- Generalization of the output of variational quantum eigensolver by parameter interpolation with low-depth ansatz
- Quantum supremacy and random circuits
- Variational Quantum-Based Simulation of Waveguide Modes
- Selected topics of quantum computing for nuclear physics
- Coarse-grained lattice protein folding on a quantum annealer
- Variational Quantum Simulation of Partial Differential Equations: Applications in Colloidal Transport
- Quantum Information and Computation for Chemistry
- Knapsack Problem variants of QAOA for battery revenue optimisation
- Finding Small and Large k-Clique Instances on a Quantum Computer
- Solving Multi-Coloring Combinatorial Optimization Problems Using Hybrid Quantum Algorithms
- Efficient unitary paths and quantum computational supremacy: A proof of average-case hardness of Random Circuit Sampling
- 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
- Foundations for Bayesian inference with engineered likelihood functions for robust amplitude estimation
- Entanglement Scaling in Quantum Advantage Benchmarks
- Quantum-Inspired Tensor Neural Networks for Option Pricing
- 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