Efficient classical algorithms for simulating symmetric quantum systems

Abstract

In light of recently proposed quantum algorithms that incorporate symmetries in the hope of quantum advantage, we show that with symmetries that are restrictive enough, classical algorithms can efficiently emulate their quantum counterparts given certain classical descriptions of the input. Specifically, we give classical algorithms that calculate ground states and time-evolved expectation values for permutation-invariant Hamiltonians specified in the symmetrized Pauli basis with runtimes polynomial in the system size. We use tensor-network methods to transform symmetry-equivariant operators to the block-diagonal Schur basis that is of polynomial size, and then perform exact matrix multiplication or diagonalization in this basis. These methods are adaptable to a wide range of input and output states including those prescribed in the Schur basis, as matrix product states, or as arbitrary quantum states when given the power to apply low depth circuits and single qubit measurements.

12 pages, 3 figures

References in corpus (8)

• Beyond Barren Plateaus: Quantum Variational Algorithms Are Swamped With Traps
• Exploiting symmetry in variational quantum machine learning
• Efficient Quantum Circuits for Schur and Clebsch-Gordan Transforms
• Group-Invariant Quantum Machine Learning
• Collective processes of an ensemble of spin-1/2 particles
• Weak Fourier-Schur sampling, the hidden subgroup problem, and the quantum collision problem
• Interpretable Quantum Advantage in Neural Sequence Learning
• Steady-state spin synchronization through the collective motion of trapped ions

Cited by in corpus (22)

• Barren Plateaus in Variational Quantum Computing
• Theoretical Guarantees for Permutation-Equivariant Quantum Neural Networks
• Does provable absence of barren plateaus imply classical simulability?
• The Adjoint Is All You Need: Characterizing Barren Plateaus in Quantum Ansätze
• Provably Trainable Rotationally Equivariant Quantum Machine Learning
• Effects of noise on the overparametrization of quantum neural networks
• Classically estimating observables of noiseless quantum circuits
• Generalization of Quantum Machine Learning Models Using Quantum Fisher Information Metric
• Lie-algebraic classical simulations for quantum computing
• Potential and limitations of random Fourier features for dequantizing quantum machine learning
• Trainability and Expressivity of Hamming-Weight Preserving Quantum Circuits for Machine Learning
• On the universality of $S_n$-equivariant $k$-body gates
• Non-Unitary Quantum Machine Learning
• Constrained and Vanishing Expressivity of Quantum Fourier Models
• Splitting and Parallelizing of Quantum Convolutional Neural Networks for Learning Translationally Symmetric Data
• Efficient quantum-enhanced classical simulation for patches of quantum landscapes
• Architectures and random properties of symplectic quantum circuits
• Analyzing the free states of one quantum resource theory as resource states of another
• Exact Many-body Quantum Dynamics in One-Dimensional Baths via Collective Spins
• Efficient Online Quantum Circuit Learning with No Upfront Training
• Improving the trainability of VQE on NISQ computers for solving portfolio optimization using convex interpolation
• Equivalence between exponential concentration in quantum machine learning kernels and barren plateaus in variational algorithms