Hybrid quantum-classical algorithms in the noisy intermediate-scale quantum era and beyond
arXiv:2207.06850 · doi:10.1103/PhysRevA.106.010101
Abstract
Hybrid quantum-classical algorithms are central to much of the current research in quantum computing, particularly when considering the noisy intermediate-scale quantum (NISQ) era, with a number of experimental demonstrations having already been performed. In this perspective, we discuss in a very broad sense what it means for an algorithm to be hybrid quantum-classical. We first explore this concept very directly, by building a definition based on previous work in abstraction/representation theory, arguing that what makes an algorithm hybrid is not directly how it is run (or how many classical resources it consumes), but whether classical components are crucial to an underlying model of the computation. We then take a broader view of this question, reviewing a number of hybrid algorithms and discussing what makes them hybrid, as well as the history of how they emerged, and considerations related to hardware. This leads into a natural discussion of what the future holds for these algorithms. To answer this question, we turn to the use of specialized processors in classical computing.The classical trend is not for new technology to completely replace the old, but to augment it. We argue that the evolution of quantum computing is unlikely to be different: hybrid algorithms are likely here to stay well past the NISQ era and even into full fault-tolerance, with the quantum processors augmenting the already powerful classical processors which exist by performing specialized tasks.
arXiv comment24 pages 6 figures
References in corpus (74)
- Quantum Computing in the NISQ era and beyond
- Supplementary information for "Quantum supremacy using a programmable superconducting processor"
- A variational eigenvalue solver on a quantum processor
- Variational Quantum Algorithms
- Hardware-efficient Variational Quantum Eigensolver for Small Molecules and Quantum Magnets
- Supervised learning with quantum enhanced feature spaces
- Quantum Annealing in the Transverse Ising Model
- Quantum computational advantage using photons
- Experimental realization of Shor's quantum factoring algorithm using nuclear magnetic resonance
- Quantum computational chemistry
- Continuous-time Monte Carlo methods for quantum impurity models
- Adiabatic Quantum Computing
- Quantum Chemistry in the Age of Quantum Computing
- Parallel Tempering: Theory, Applications, and New Perspectives
- Shortcuts to adiabaticity: concepts, methods, and applications
- Extending the computational reach of a noisy superconducting quantum processor
- Scalable Quantum Simulation of Molecular Energies
- Quantum algorithms for quantum chemistry and quantum materials science
- From the Quantum Approximate Optimization Algorithm to a Quantum Alternating Operator Ansatz
- Theory of Quantum Annealing of an Ising Spin Glass
- Experimental entanglement of six photons in graph states
- Quantum Annealing: A New Method for Minimizing Multidimensional Functions
- Quantum Search by Local Adiabatic Evolution
- Connecting ansatz expressibility to gradient magnitudes and barren plateaus
- Hybrid quantum-classical algorithms and quantum error mitigation
- Quantum Approximate Optimization of Non-Planar Graph Problems on a Planar Superconducting Processor
- Quantum Approximate Optimization Algorithm for MaxCut: A Fermionic View
- Quantum Error Correction: An Introductory Guide
- Quantum speedup of Monte Carlo methods
- Observation of topological phenomena in a programmable lattice of 1,800 qubits
- Hybrid quantum-classical approach to correlated materials
- Amplitude estimation without phase estimation
- Reverse Quantum Annealing Approach to Portfolio Optimization Problems
- Effect of barren plateaus on gradient-free optimization
- From transistor to trapped-ion computers for quantum chemistry
- Benchmarking quantum control methods on a 12-qubit system
- Variational Quantum State Diagonalization
- Iterative Quantum Amplitude Estimation
- When does a physical system compute?
- Entanglement in a quantum annealing processor
- -mixers: analytical and numerical results for QAOA
- Quantum simulations of materials on near-term quantum computers
- Doubling the size of quantum simulators by entanglement forging
- Optimizing Variational Quantum Algorithms using Pontryagin's Minimum Principle
- Scaling advantage in quantum simulation of geometrically frustrated magnets
- Large gradients via correlation in random parameterized quantum circuits
- Performing Quantum Computing Experiments in the Cloud
- Near-optimal quantum circuit for Grover's unstructured search using a transverse field
- Prospects for Quantum Enhancement with Diabatic Quantum Annealing
- Demonstrating anyonic fractional statistics with a six-qubit quantum simulator
- Experimental Realization of Deutsch's Algorithm in a One-way Quantum Computer
- Optimal Protocols in Quantum Annealing and QAOA Problems
- Power of Pausing: Advancing Understanding of Thermalization in Experimental Quantum Annealers
- Reverse annealing for the fully connected -spin model
- Modernizing Quantum Annealing using Local Searches
- Population Annealing with Weighted Averages: A Monte Carlo Method for Rough Free Energy Landscapes
- Dynamics of reverse annealing for the fully-connected -spin model
- Low depth algorithms for quantum amplitude estimation
- Reinforcement Learning assisted Quantum Optimization
- Population annealing: Theory and application in spin glasses
- Reverse quantum annealing of the -spin model with relaxation
- Counterdiabatic driving in the quantum annealing of the -spin model: a variational approach
- An FPGA-based Instrumentation Platform for use at Deep Cryogenic Temperatures
- Rapid counter-diabatic sweeps in lattice gauge adiabatic quantum computing
- Reverse Annealing for Nonnegative/Binary Matrix Factorization
- Quantum annealing with longitudinal bias fields
- An energetic perspective on rapid quenches in quantum annealing
- Optimal quantum annealing: A variational shortcut to adiabaticity approach
- Implementation of NMR quantum computation with para-hydrogen derived high purity quantum states
- Modified Grover operator for amplitude estimation
- Standard quantum annealing outperforms adiabatic reverse annealing with decoherence
- Search range in experimental quantum annealing
- Fluctuation guided search in quantum annealing
- A Framework for Heterotic Computing
Cited by in corpus (34)
- NP-hard but no longer hard to solve? Using quantum computing to tackle optimization problems
- Understanding domain-wall encoding theoretically and experimentally
- A preprocessing perspective for quantum machine learning classification advantage using NISQ algorithms
- Entropy production rate and correlations of cavity magnomechanical system
- EHA: Entanglement-variational Hardware-efficient Ansatz for Eigensolvers
- Initial State Encoding via Reverse Quantum Annealing and h-gain Features
- Unitary Coupled Cluster: Seizing the Quantum Moment
- Measurement-based infused circuits for variational quantum eigensolvers
- Hybrid Tree Tensor Networks for quantum simulation
- Improved iterative quantum algorithm for ground-state preparation
- Comparing the hardness of MAX 2-SAT problem instances for quantum and classical algorithms
- Quantum Dynamics Simulation of the Advection-Diffusion Equation
- Quantum optimization with linear Ising penalty functions for customer data science
- On the Baltimore Light RailLink into the quantum future
- Load Balancing For High Performance Computing Using Quantum Annealing
- Zeno-effect Computation: Opportunities and Challenges
- QuForge: A Library for Qudits Simulation
- Anticipative measurements in hybrid quantum-classical computation
- Simplifying a classical-quantum algorithm interpolation with quantum singular value transformations
- A thermodynamic approach to optimization in complex quantum systems
- A Cross-Platform Execution Engine for the Quantum Intermediate Representation
- Quantum Approximation Optimization Algorithm for the Trellis based Viterbi Decoding of Classical Error Correcting Codes
- Integrating Quantum Algorithms Into Classical Frameworks: A Predictor-corrector Approach Using HHL
- An Energy Estimation Benchmark for Quantum Computers
- The Physics of Quantum 2.0: Challenges in understanding Quantum Matter
- Optimal Quantum Likelihood Estimation
- Finding eigenvectors with a quantum variational algorithm
- QTIS: A QAOA-Based Quantum Time Interval Scheduler
- Quantum annealing and condensed matter physics
- Quantum Data Structure for Range Minimum Query
- Explicitly Quantum-parallel Computation by Displacements
- Quantum-Efficient Reinforcement Learning Solutions for Last-Mile On-Demand Delivery
- Q-CHOP: Quantum constrained Hamiltonian optimization
- Performance evaluation of variational quantum eigensolver and quantum dynamics algorithms on the advection-diffusion equation