Perturbative quantum simulation
arXiv:2106.05938 · doi:10.1103/PhysRevLett.129.120505
Abstract
Approximation based on perturbation theory is the foundation for most of the quantitative predictions of quantum mechanics, whether in quantum many-body physics, chemistry, quantum field theory or other domains. Quantum computing provides an alternative to the perturbation paradigm, yet state-of-the-art quantum processors with tens of noisy qubits are of limited practical utility. Here, we introduce perturbative quantum simulation, which combines the complementary strengths of the two approaches, enabling the solution of large practical quantum problems using limited noisy intermediate-scale quantum hardware. The use of a quantum processor eliminates the need to identify a solvable unperturbed Hamiltonian, while the introduction of perturbative coupling permits the quantum processor to simulate systems larger than the available number of physical qubits. We present an explicit perturbative expansion that mimics the Dyson series expansion and involves only local unitary operations, and show its optimality over other expansions under certain conditions. We numerically benchmark the method for interacting bosons, fermions, and quantum spins in different topologies, and study different physical phenomena, such as information propagation, charge-spin separation, and magnetism, on systems of up to qubits only using an qubit quantum hardware. We experimentally demonstrate our scheme on the IBM quantum cloud, verifying its noise robustness and illustrating its potential for benchmarking large quantum processors with smaller ones.
39 pages, 12 figures
References in corpus (24)
- Supplementary information for "Quantum supremacy using a programmable superconducting processor"
- Variational Quantum Algorithms
- Quantum computational advantage using photons
- Noisy intermediate-scale quantum (NISQ) algorithms
- Strong quantum computational advantage using a superconducting quantum processor
- Lieb-Robinson bounds and the generation of correlations and topological quantum order
- Phase-Programmable Gaussian Boson Sampling Using Stimulated Squeezed Light
- Quantum walks on a programmable two-dimensional 62-qubit superconducting processor
- Information Scrambling in Computationally Complex Quantum Circuits
- Unbiasing Fermionic Quantum Monte Carlo with a Quantum Computer
- Numerical Linked-Cluster Approach to Quantum Lattice Models
- Doubling the size of quantum simulators by entanglement forging
- Numerical Linked-Cluster Algorithms. I. Spin systems on square, triangular, and kagome lattices
- Observation of separated dynamics of charge and spin in the Fermi-Hubbard model
- Dynamical mean field theory algorithm and experiment on quantum computers
- A Hybrid Classical/Quantum Approach for Large-Scale Studies of Quantum Systems with Density Matrix Embedding Theory
- A variational quantum eigensolver for dynamic correlation functions
- Quantum algorithm for time-dependent Hamiltonian simulation by permutation expansion
- Quantum-assisted Monte Carlo algorithms for fermions
- Binding of holons and spinons in the one-dimensional anisotropic t-J model
- Holographic quantum simulation
- Exponential challenges in unbiasing quantum Monte Carlo algorithms with quantum computers
- Entanglement Forging with generative neural network models
- Quantum algorithm for calculation of transition amplitudes in hybrid tensor networks
Cited by in corpus (17)
- Variational quantum eigensolver for the Heisenberg antiferromagnet on the kagome lattice
- Overlapped grouping measurement: A unified framework for measuring quantum states
- Low-depth Hamiltonian Simulation by Adaptive Product Formula
- Towards a variational Jordan-Lee-Preskill quantum algorithm
- Perturbation theory with quantum signal processing
- Quantum computing quantum Monte Carlo with hybrid tensor network for electronic structure calculations
- Efficient quantum imaginary time evolution by drifting real time evolution: an approach with low gate and measurement complexity
- Fault-tolerant quantum algorithms for quantum molecular systems: A survey
- Overhead-constrained circuit knitting for variational quantum dynamics
- Optimal quantum circuit cuts with application to clustered Hamiltonian simulation
- Quantum annealing-based computed tomography using variational approach for a real-number image reconstruction
- Quantum error mitigation for rotation symmetric bosonic codes with symmetry expansion
- Resource-efficient Generalized Quantum Subspace Expansion
- Sequency Hierarchy Truncation (SeqHT) for Adiabatic State Preparation and Time Evolution in Quantum Simulations
- Non-perturbative Quantum Dynamics on Embedded Submanifolds: From Geometric Mass to Higgs Potentials
- Correcting and extending Trotterized quantum many-body dynamics
- Unitary-transformed projective squeezing: applications for circuit-knitting and state-preparation of non-Gaussian states