Quantum simulation of time-dependent Hamiltonians and the convenient illusion of Hilbert space

Abstract

We consider the manifold of all quantum many-body states that can be generated by arbitrary time-dependent local Hamiltonians in a time that scales polynomially in the system size, and show that it occupies an exponentially small volume in Hilbert space. This implies that the overwhelming majority of states in Hilbert space are not physical as they can only be produced after an exponentially long time. We establish this fact by making use of a time-dependent generalization of the Suzuki-Trotter expansion, followed by a counting argument. This also demonstrates that a computational model based on arbitrarily rapidly changing Hamiltonians is no more powerful than the standard quantum circuit model.

Presented at QIP 2011

References in corpus (8)

• Matrix Product States, Projected Entangled Pair States, and variational renormalization group methods for quantum spin systems
• Entanglement renormalization
• A class of quantum many-body states that can be efficiently simulated
• Efficient quantum algorithms for simulating sparse Hamiltonians
• Effective Hamiltonian Theory and Its Applications in Quantum Information
• Efficient Simulation of Quantum Systems by Quantum Computers
• Renormalization and tensor product states in spin chains and lattices
• Higher Order Decompositions of Ordered Operator Exponentials

Cited by in corpus (181)

• Quantum Simulation
• The theory of variational hybrid quantum-classical algorithms
• A Practical Introduction to Tensor Networks: Matrix Product States and Projected Entangled Pair States
• Quantum computational chemistry
• Quantum Chemistry in the Age of Quantum Computing
• The role of quantum information in thermodynamics --- a topical review
• Programmable Quantum Simulations of Spin Systems with Trapped Ions
• Simulating Hamiltonian dynamics with a truncated Taylor series
• Variational ansatz-based quantum simulation of imaginary time evolution
• Enhancing the charging power of quantum batteries
• A Theory of Trotter Error
• Digitized adiabatic quantum computing with a superconducting circuit
• Theory of variational quantum simulation
• Hamiltonian simulation with nearly optimal dependence on all parameters
• A random compiler for fast Hamiltonian simulation
• Efficient Representation of Quantum Many-body States with Deep Neural Networks
• Reconstructing quantum states with generative models
• Input-output theory for waveguide QED with an ensemble of inhomogeneous atoms
• Contextuality in Measurement-based Quantum Computation
• The iPEPS algorithm, improved: fast full update and gauge fixing
• Exponential improvement in precision for simulating sparse Hamiltonians
• Quantum Computing for High-Energy Physics: State of the Art and Challenges. Summary of the QC4HEP Working Group
• Real- and imaginary-time evolution with compressed quantum circuits
• Optimal adaptive control for quantum metrology with time-dependent Hamiltonians
• Nearly optimal lattice simulation by product formulas
• Standard Model Physics and the Digital Quantum Revolution: Thoughts about the Interface
• Faster quantum simulation by randomization
• Hamiltonian complexity
• High-precision quantum algorithms for partial differential equations
• Linear growth of quantum circuit complexity
• A dissipative quantum Church-Turing theorem
• Simulating chemistry efficiently on fault-tolerant quantum computers
• Quantum Algorithm for Linear Regression
• The Quantum Adiabatic Algorithm applied to random optimization problems: the quantum spin glass perspective
• Efficient measure for the expressivity of variational quantum algorithms
• A Quantum Inspired Approach to Exploit Turbulence Structures
• Adaptive Variational Quantum Dynamics Simulations
• Shortcuts to Adiabaticity in Digitized Adiabatic Quantum Computing
• Models of quantum complexity growth
• Digitized-counterdiabatic quantum approximate optimization algorithm
• Hamiltonian Simulation Using Linear Combinations of Unitary Operations
• An information theoretical analysis of quantum optimal control
• Quantum Dynamics in Krylov Space: Methods and Applications
• Time-dependent Hamiltonian simulation with $L^1$-norm scaling
• Out of equilibrium dynamics with Matrix Product States
• Enhancing Generative Models via Quantum Correlations
• Simulating Quantum Materials with Digital Quantum Computers
• Tensor lattice field theory with applications to the renormalization group and quantum computing
• The power of block-encoded matrix powers: improved regression techniques via faster Hamiltonian simulation
• Quantum entanglement in random physical states
• On quantum mean-field models and their quantum annealing
• Simulating the dynamics of time-dependent Hamiltonians with a truncated Dyson series
• Time-dependent unbounded Hamiltonian simulation with vector norm scaling
• Bounding the costs of quantum simulation of many-body physics in real space
• Quantum Graph Neural Networks
• Simulating Bosonic Baths with Error Bars
• Subspace Variational Quantum Simulator
• Scrambling speed of random quantum circuits
• Simulating hydrodynamics on noisy intermediate-scale quantum devices with random circuits
• Hybridized Methods for Quantum Simulation in the Interaction Picture
• Digitized-Counterdiabatic Quantum Optimization
• Self-Correcting Quantum Many-Body Control using Reinforcement Learning with Tensor Networks
• Randomizing multi-product formulas for Hamiltonian simulation
• Realization of quantum signal processing on a noisy quantum computer
• Time-dependent Hamiltonian Simulation of Highly Oscillatory Dynamics and Superconvergence for Schrödinger Equation
• Constant-Depth Circuits for Dynamic Simulations of Materials on Quantum Computers
• Quantum Simulation of Nuclear Inelastic Scattering
• Complete quantum-inspired framework for computational fluid dynamics
• Towards Dynamic Simulations of Materials on Quantum Computers
• Quantum State Complexity in Computationally Tractable Quantum Circuits
• Tensor networks enable the calculation of turbulence probability distributions
• Quantum algorithm for time-dependent Hamiltonian simulation by permutation expansion
• Continuum tensor network field states, path integral representations and the encoding of spatial symmetries
• Learning quantum states and unitaries of bounded gate complexity
• Digitized Adiabatic Quantum Factorization
• Compressing deep neural networks by matrix product operators
• How much entanglement is needed to reduce the energy variance?
• Benchmarking digital quantum simulations above hundreds of qubits using quantum critical dynamics
• Magic-induced computational separation in entanglement theory
• An Algebraic Quantum Circuit Compression Algorithm for Hamiltonian Simulation
• Ensembles of physical states and random quantum circuits on graphs
• Toward simulating Superstring/M-theory on a quantum computer
• Deep Learning of Quantum Many-Body Dynamics via Random Driving
• Quantum state preparation by adiabatic evolution with customized gates
• Real time evolution with neural-network quantum states
• Quantifying the sensitivity to errors in analog quantum simulation
• The Basics of Quantum Computing for Chemists
• Compact wavefunctions from compressed imaginary time evolution
• Shortcuts to Quantum Approximate Optimization Algorithm
• Product Formulas for Exponentials of Commutators
• Operational Metric for Quantum Chaos and the Corresponding Spatiotemporal Entanglement Structure
• Importance sampling for stochastic quantum simulations
• Approximating local observables on projected entangled pair states
• Spintronics meets density matrix renormalization group: Quantum spin torque driven nonclassical magnetization reversal and dynamical buildup of long-range entanglement
• Fault-tolerant quantum algorithms for quantum molecular systems: A survey
• Typical Correlation Length of Sequentially Generated Tensor Network States
• Approximating open quantum system dynamics in a controlled and efficient way: A microscopic approach to decoherence
• Neural Network Operations and Susuki-Trotter evolution of Neural Network States
• Controlling qubit networks in polynomial time
• Quantum computer-aided design: digital quantum simulation of quantum processors
• Compressed Simulation of evolutions of the XY-model
• State-dependent error bound for digital quantum simulation of driven systems
• A Model Compression Method with Matrix Product Operators for Speech Enhancement
• Computational complexity of time-dependent density functional theory
• Success of digital adiabatic simulation with large Trotter step
• Adaptive Trotterization for time-dependent Hamiltonian quantum dynamics using piecewise conservation laws
• Minimum Trotterization Formulas for a Time-Dependent Hamiltonian
• A Second-Order Distributed Trotter-Suzuki Solver with a Hybrid Kernel
• Variational quantum iterative power algorithms for global optimization
• Well-conditioned multiproduct Hamiltonian simulation
• Fundamental limitations for measurements in quantum many-body systems
• Scattering and perturbation theory for discrete-time dynamics
• Quantum many-body simulations with PauliStrings.jl
• Sample-efficient verification of continuously-parameterized quantum gates for small quantum processors
• Pure state thermodynamics with matrix product states
• Quantum algorithm for linear non-unitary dynamics with near-optimal dependence on all parameters
• Efficient and practical Hamiltonian simulation from time-dependent product formulas
• Quantum simulation for time-dependent Hamiltonians -- with applications to non-autonomous ordinary and partial differential equations
• Complexity is not Enough for Randomness
• Empirical Sample Complexity of Neural Network Mixed State Reconstruction
• Time dependent Markovian master equation beyond the adiabatic limit
• Real-time simulation of light-driven spin chains on quantum computers
• Quantum Distance to Uncontrollability and Quantum Speed Limits
• A quantum algorithm for simulating non-sparse Hamiltonians
• Domain-Specific Compilers for Dynamic Simulations of Quantum Materials on Quantum Computers
• Time-dependent Hamiltonian Simulation via Magnus Expansion: Algorithm and Superconvergence
• The Nonequilibrium Many-Body Problem as a paradigm for extreme data science
• On model reduction for quantum dynamics: symmetries and invariant subspaces
• Entanglement susceptibility: Area laws and beyond
• Parameterized Hamiltonian simulation using quantum optimal control
• Optimal parent Hamiltonians for time-dependent states
• Practicality of quantum adiabatic algorithm for chemistry applications
• Thermal Pure States for Systems with Antiunitary Symmetries and Their Tensor Network Representations
• Gate-based quantum simulation of Gaussian bosonic circuits on exponentially many modes
• Local random quantum circuits: ensemble CP maps and swap algebras
• Estimation of correlations and non-separability in quantum channels via unitarity benchmarking
• Ergodic Equilibration of Rényi Entropies and Replica Wormholes
• Quantum System Compression: A Hamiltonian Guided Walk Through Hilbert Space
• Area laws and efficient descriptions of quantum many-body states
• Quantum simulation of time-dependent Hamiltonians via commutator-free quasi-Magnus operators
• Algorithmic Primitives for Quantum-Assisted Quantum Control
• Segmenting two-dimensional structures with strided tensor networks
• From Stochastic Hamiltonian to Quantum Simulation: Exploring Memory Effects in Exciton Dynamics
• BBGKY chain and kinetic equations for the level dynamics in an externally perturbed quantum system
• Subspace-Based Local Compilation of Variational Quantum Circuits for Large-Scale Quantum Many-Body Simulation
• The continuum limit of a tensor network: a path integral representation
• Practical variational tomography for critical 1D systems
• Simulation of Quantum Many-Body Systems on Amazon Cloud
• Compressing LSTM Networks by Matrix Product Operators
• Symmetries and local transformations of translationally invariant Matrix Product States
• Hamiltonian Forging of a Thermofield Double
• Cost of Emulating a Small Quantum Annealing Problem in the Circuit-Model
• Quantum thermalization must occur in translation-invariant systems at high temperature
• Unifying framework for quantum simulation algorithms for time-dependent Hamiltonian dynamics
• Exact Model Reduction for Continuous-Time Open Quantum Dynamics
• Investigating the Exchange of Ising Chains on a Digital Quantum Computer
• Efficient implementation of unitary transformations
• Adiabatic ground state preparation in an expanding lattice
• Efficient criteria of quantumness for a large system of qubits
• Restrictions on Physical Stochastic Reservoir Computers
• Tree-size complexity of multiqubit states
• Opportunities and Limitations in Broadband Sensing
• Emergence and Control of Complex Behaviours in Driven Systems of Interacting Qubits with Dissipation
• Discrete Superconvergence Analysis for Quantum Magnus Algorithms of Unbounded Hamiltonian Simulation
• Quantum algorithms based on quantum trajectories
• Les Houches Lecture Notes on Tensor Networks
• Quantum algorithms for optimal effective theory of many-body systems
• Quantum Machine Learning For Classical Data
• Exact epidemic models from a tensor product formulation
• Suppression of effective noise in Hamiltonian simulations
• Canonical typicality under general quantum channels
• Towards a Geometrization of Quantum Complexity and Chaos
• Does Quantum Mechanics Breed Larger, More Intricate Quantum Theories? The Case for Experience-Centric Quantum Theory and the Interactome of Quantum Theories
• On the extremal points of the $\Lambda$-polytopes and classical simulation of quantum computation with magic states
• Quantum Machine Learning for State Tomography Using Classical Data
• Energy of fermionic ground states with low-entanglement single-reference expansions, and tensor-based strong-coupling extensions of the coupled-cluster method
• Error and Resource Estimates of Variational Quantum Algorithms for Solving Differential Equations Based on Runge-Kutta Methods
• Comparing quantum complexity and quantum fidelity
• Patch-based Medical Image Segmentation using Matrix Product State Tensor Networks
• paces: Parallelized Application of Co-Evolving Subspaces, a method for computing quantum dynamics on GPUs
• Dynamics of a qubit-oscillator system with periodically varying coupling