Efficient quantum-enhanced classical simulation for patches of quantum landscapes
arXiv:2411.19896 · doi:10.1103/fhc5-8sm6
Abstract
Understanding the capabilities of classical simulation methods is key to identifying where quantum computers are advantageous. Not only does this ensure that quantum computers are used only where necessary, but also one can potentially identify subroutines that can be offloaded onto a classical device. In this work, we show that it is always possible to generate a classical surrogate of a sub-region (dubbed a "patch") of an expectation landscape produced by a parameterized quantum circuit. That is, we provide a quantum-enhanced classical algorithm which, after simple measurements on a quantum device, allows one to classically simulate approximate expectation values of a subregion of a landscape. We provide time and sample complexity guarantees for a range of families of circuits of interest, and further numerically demonstrate our simulation algorithms on an exactly verifiable simulation of a Hamiltonian variational ansatz and long-time dynamics simulation on a 127-qubit heavy-hex topology.
12 + 57 pages, 5 + 4 figures
References in corpus (61)
- Variational Quantum Algorithms
- Barren plateaus in quantum neural network training landscapes
- Improved Simulation of Stabilizer Circuits
- Predicting Many Properties of a Quantum System from Very Few Measurements
- Cost Function Dependent Barren Plateaus in Shallow Parametrized Quantum Circuits
- Dynamics of a Quantum Phase Transition
- Towards Practical Quantum Variational Algorithms
- Connecting ansatz expressibility to gradient magnitudes and barren plateaus
- The randomized measurement toolbox
- Variational Fast Forwarding for Quantum Simulation Beyond the Coherence Time
- Diagnosing Barren Plateaus with Tools from Quantum Optimal Control
- Barren Plateaus in Variational Quantum Computing
- Trainability of Dissipative Perceptron-Based Quantum Neural Networks
- Equivalence of quantum barren plateaus to cost concentration and narrow gorges
- A Lie Algebraic Theory of Barren Plateaus for Deep Parameterized Quantum Circuits
- Efficient tensor network simulation of IBM's Eagle kicked Ising experiment
- Entanglement Devised Barren Plateau Mitigation
- Variational Quantum State Eigensolver
- Application of fermionic marginal constraints to hybrid quantum algorithms
- Barren plateaus preclude learning scramblers
- Higher Order Derivatives of Quantum Neural Networks with Barren Plateaus
- Fast and converged classical simulations of evidence for the utility of quantum computing before fault tolerance
- A polynomial-time classical algorithm for noisy random circuit sampling
- Does provable absence of barren plateaus imply classical simulability?
- Barren plateaus in quantum tensor network optimization
- Hamiltonian variational ansatz without barren plateaus
- Shadows of quantum machine learning
- Avoiding barren plateaus via transferability of smooth solutions in Hamiltonian Variational Ansatz
- The Adjoint Is All You Need: Characterizing Barren Plateaus in Quantum Ansätze
- Simulation of Qubit Quantum Circuits via Pauli Propagation
- Quantum Analytic Descent
- Classical surrogates for quantum learning models
- Expressibility and trainability of parameterized analog quantum systems for machine learning applications
- Trainability barriers and opportunities in quantum generative modeling
- Quantum-to-Classical Correspondence and Hubbard-Stratonovich Dynamical Systems, a Lie-Algebraic Approach
- Efficient solvability of Hamiltonians and limits on the power of some quantum computational models
- Trainability Enhancement of Parameterized Quantum Circuits via Reduced-Domain Parameter Initialization
- Quantum utility -- definition and assessment of a practical quantum advantage
- Noisy intermediate-scale quantum algorithm for semidefinite programming
- Efficient classical algorithms for simulating symmetric quantum systems
- Simulating Noisy Variational Quantum Algorithms: A Polynomial Approach
- On fundamental aspects of quantum extreme learning machines
- Benchmarking digital quantum simulations above hundreds of qubits using quantum critical dynamics
- Fourier expansion in variational quantum algorithms
- Variational quantum simulation: a case study for understanding warm starts
- Surrogate-based optimization for variational quantum algorithms
- Tight and Efficient Gradient Bounds for Parameterized Quantum Circuits
- Classically estimating observables of noiseless quantum circuits
- Magic Resources of the Heisenberg Picture
- Quantum Convolutional Neural Networks are Effectively Classically Simulable
- Lie-algebraic classical simulations for quantum computing
- Inference-Based Quantum Sensing
- Potential and limitations of random Fourier features for dequantizing quantum machine learning
- Pauli path simulations of noisy quantum circuits beyond average case
- Constrained and Vanishing Expressivity of Quantum Fourier Models
- Faster variational quantum algorithms with quantum kernel-based surrogate models
- Unraveling long-time quantum dynamics using flow equations
- Improve Variational Quantum Eigensolver by Many-Body Localization
- Learning unitaries with quantum statistical queries
- Pitfalls when tackling the exponential concentration of parameterized quantum models
- More buck-per-shot: Why learning trumps mitigation in noisy quantum sensing