Lie-algebraic classical simulations for quantum computing

Abstract

The classical simulation of quantum dynamics plays an important role in our understanding of quantum complexity, and in the development of quantum technologies. Efficient techniques such as those based on the Gottesman-Knill theorem for Clifford circuits, tensor networks for low entanglement-generating circuits, or Wick's theorem for fermionic Gaussian states, have become central tools in quantum computing. In this work, we contribute to this body of knowledge by presenting a framework for classical simulations, dubbed "$\mathfrak{g}$-sim", which is based on the underlying Lie algebraic structure of the dynamical process. When the dimension of the algebra grows at most polynomially in the system size, there exists observables for which the simulation is efficient. Indeed, we show that $\mathfrak{g}$-sim enables new regimes for classical simulations, is able to deal with certain forms of noise in the evolution, as well as can be used to tackle several paradigmatic variational and non-variational quantum computing tasks. For the former, we perform Lie-algebraic simulations to train and optimize parametrized quantum circuits (thus effectively showing that some variational models can be dequantized), design enhanced parameter initialization strategies, solve tasks of quantum circuit synthesis, and train a quantum-phase classifier. For the latter, we report large-scale noiseless and noisy simulations on benchmark problems. By comparing the limitations of $\mathfrak{g}$-sim and certain Wick's theorem-based simulations, we find that the two methods become inefficient for different types of states or observables, hinting at the existence of distinct, non-equivalent, resources for classical simulation.

21 pages main text, 13 pages appendices

References in corpus (81)

• Quantum Machine Learning
• A variational eigenvalue solver on a quantum processor
• Variational Quantum Algorithms
• Efficient classical simulation of slightly entangled quantum computations
• Barren plateaus in quantum neural network training landscapes
• Noisy intermediate-scale quantum (NISQ) algorithms
• Improved Simulation of Stabilizer Circuits
• An introduction to quantum machine learning
• Quantum Resource Theories
• Predicting Many Properties of a Quantum System from Very Few Measurements
• Cost Function Dependent Barren Plateaus in Shallow Parametrized Quantum Circuits
• Randomized Benchmarking of Quantum Gates
• Hartree-Fock on a superconducting qubit quantum computer
• Towards Practical Quantum Variational Algorithms
• Challenges and Opportunities in Quantum Machine Learning
• Quantum Approximate Optimization Algorithm: Performance, Mechanism, and Implementation on Near-Term Devices
• Connecting ansatz expressibility to gradient magnitudes and barren plateaus
• Quantum Error Mitigation
• Quantum computing with neutral atoms
• Restrictions on Transversal Encoded Quantum Gate Sets
• Quantum Simulation of Electronic Structure with Linear Depth and Connectivity
• Training variational quantum algorithms is NP-hard
• An initialization strategy for addressing barren plateaus in parametrized quantum circuits
• Quantum-assisted quantum compiling
• Classical simulation of noninteracting-fermion quantum circuits
• Probabilistic error cancellation with sparse Pauli-Lindblad models on noisy quantum processors
• Efficient and Noise Resilient Measurements for Quantum Chemistry on Near-Term Quantum Computers
• Variational Fast Forwarding for Quantum Simulation Beyond the Coherence Time
• Exploring entanglement and optimization within the Hamiltonian Variational Ansatz
• Beyond Barren Plateaus: Quantum Variational Algorithms Are Swamped With Traps
• Diagnosing Barren Plateaus with Tools from Quantum Optimal Control
• Real- and imaginary-time evolution with compressed quantum circuits
• Noise Resilience of Variational Quantum Compiling
• Strategies for solving the Fermi-Hubbard model on near-term quantum computers
• Gradient optimization of analytic controls: the route to high accuracy quantum optimal control
• Theory of overparametrization in quantum neural networks
• Group-Invariant Quantum Machine Learning
• Equivalence of quantum barren plateaus to cost concentration and narrow gorges
• Efficient variational simulation of non-trivial quantum states
• The sign of the overlap of HFB wave functions
• Orbital optimized unitary coupled cluster theory for quantum computer
• Efficient error models for fault-tolerant architectures and the Pauli twirling approximation
• Digital-Analog Quantum Computation
• Digital-Analog Quantum Simulations with Superconducting Circuits
• Nearly Optimal Measurement Scheduling for Partial Tomography of Quantum States
• Theoretical Guarantees for Permutation-Equivariant Quantum Neural Networks
• Symmetry Principles in Quantum Systems Theory
• Does provable absence of barren plateaus imply classical simulability?
• Out-of-distribution generalization for learning quantum dynamics
• Restrictions on realizable unitary operations imposed by symmetry and locality
• Shadows of quantum machine learning
• Avoiding barren plateaus via transferability of smooth solutions in Hamiltonian Variational Ansatz
• Fixed Depth Hamiltonian Simulation via Cartan Decomposition
• Synergy Between Quantum Circuits and Tensor Networks: Short-cutting the Race to Practical Quantum Advantage
• Constructing Smaller Pauli Twirling Sets for Arbitrary Error Channels
• Classical surrogates for quantum learning models
• A differentiable programming method for quantum control
• Matchgate benchmarking: Scalable benchmarking of a continuous family of many-qubit gates
• Fermion Sampling: a robust quantum computational advantage scheme using fermionic linear optics and magic input states
• Expectation Values from the Single-Layer Quantum Approximate Optimization Algorithm on Ising Problems
• Symmetry criteria for quantum simulability of effective interactions
• Provably Trainable Rotationally Equivariant Quantum Machine Learning
• Quantum dynamics simulations beyond the coherence time on NISQ hardware by variational Trotter compression
• Efficient solvability of Hamiltonians and limits on the power of some quantum computational models
• Stabilizer extent is not multiplicative
• Dynamical simulation via quantum machine learning with provable generalization
• Efficient classical algorithms for simulating symmetric quantum systems
• Universal extensions of restricted classes of quantum operations
• Optimal control of families of quantum gates
• Simulating Noisy Variational Quantum Algorithms: A Polynomial Approach
• Classification of dynamical Lie algebras for translation-invariant 2-local spin systems in one dimension
• Variational quantum simulation: a case study for understanding warm starts
• Surrogate-based optimization for variational quantum algorithms
• Effects of noise on the overparametrization of quantum neural networks
• Classical simulation of non-Gaussian fermionic circuits
• Diabatic Quantum Annealing for the Frustrated Ring Model
• Efficient learning of quantum states prepared with few fermionic non-Gaussian gates
• Characterization of variational quantum algorithms using free fermions
• Gate-based quantum simulation of Gaussian bosonic circuits on exponentially many modes
• Characterization of overparametrization in the simulation of realistic quantum systems
• Learning unitaries with quantum statistical queries

Cited by in corpus (16)

• Quantum Convolutional Neural Networks are Effectively Classically Simulable
• Variational quantum computing for quantum simulation: principles, implementations, and challenges
• Analyzing the quantum approximate optimization algorithm: ansätze, symmetries, and Lie algebras
• Efficient quantum-enhanced classical simulation for patches of quantum landscapes
• Backpropagation scaling in parameterised quantum circuits
• The Lie Algebra of XY-mixer Topologies and Warm Starting QAOA for Constrained Optimization
• Analyzing the free states of one quantum resource theory as resource states of another
• Efficient Online Quantum Circuit Learning with No Upfront Training
• Exact Many-body Quantum Dynamics in One-Dimensional Baths via Collective Spins
• Observation of Lie algebraic invariants in Quantum Linear Optics
• Variational decision diagrams for quantum-inspired machine learning applications
• Gradient Scalability and Taylor Surrogation of Quantum Cost Landscapes
• Vortex Detection from Quantum Data
• Quantum simulation of massive Thirring and Gross--Neveu models for arbitrary number of flavors
• A graph-theoretic approach to chaos and complexity in quantum systems
• Learning complexity gradually in quantum machine learning models