Efficient quantum simulation for translationally invariant systems
arXiv:2503.14592 · doi:10.1103/cswp-xy7k
Abstract
Discrete translational symmetry plays a fundamental role in condensed matter physics and lattice gauge theories, enabling the analysis of systems that would otherwise be intractable. Despite this, many open problems remain. Quantum simulation promises to offer new insights, but progress is often limited by device connectivity constraints, which lead to prohibitively long computation times. We extend the use of spatial symmetry from the systems to be simulated to the quantum circuits simulating them. One application is that it becomes possible to efficiently and optimally alleviate device connectivity constraints algorithmically. This leads to reductions in quantum computational time by several orders of magnitude even for moderate system sizes, making such simulations feasible, with even greater relative gains for larger systems. This substantially enhances the capabilities of quantum computers in the simulation of condensed matter systems and lattice gauge theories, even before hardware improvements. Our work forms the basis for using spatial symmetry of quantum circuits in other areas of quantum computation, such as in the design and implementation of quantum error correcting codes.
7-page main text (1 figure) and 42-page supplemental material (13 numbered figures). The supplemental material additionally includes a database containing 29 unnumbered figures. Published version
References in corpus (34)
- Supplementary information for "Quantum supremacy using a programmable superconducting processor"
- Quantum Computation with Quantum Dots
- Logical quantum processor based on reconfigurable atom arrays
- Semiconductor Spin Qubits
- Towards Practical Quantum Variational Algorithms
- Quantum error correction below the surface code threshold
- Toward the first quantum simulation with quantum speedup
- A Theory of Trotter Error
- Quantum simulation of a Fermi-Hubbard model using a semiconductor quantum dot array
- The Future of Quantum Computing with Superconducting Qubits
- Demonstrating a Continuous Set of Two-qubit Gates for Near-term Quantum Algorithms
- A universal quantum circuit for two-qubit transformations with three CNOT gates
- Quantum Circuit Simplification and Level Compaction
- Strategies for solving the Fermi-Hubbard model on near-term quantum computers
- Real-time Dynamics in U(1) Lattice Gauge Theories with Tensor Networks
- Towards simulating 2D effects in lattice gauge theories on a quantum computer
- A review of Quantum Cellular Automata
- A resource efficient approach for quantum and classical simulations of gauge theories in particle physics
- Exact thermalization dynamics in the "Rule 54" Quantum Cellular Automaton
- Disorder-Free Localization and Many-Body Quantum Scars from Magnetic Frustration
- Quantum Circuit Placement
- Exact three-colored quantum scars from geometric frustration
- Efficient quantum circuits for quantum computational chemistry
- A Compact Fermion to Qubit Mapping
- Stable Quantum-Correlated Many Body States through Engineered Dissipation
- Dynamics of magnetization at infinite temperature in a Heisenberg spin chain
- Towards near-term quantum simulation of materials
- Quantum simulation of antiferromagnetic Heisenberg chain with gate-defined quantum dots
- Variational quantum eigensolver for the Heisenberg antiferromagnet on the kagome lattice
- Simulating 2D lattice gauge theories on a qudit quantum computer
- Two-dimensional quantum-link lattice Quantum Electrodynamics at finite density
- Compiling Quantum Circuits for Dynamically Field-Programmable Neutral Atoms Array Processors
- Optimal, hardware native decomposition of parameterized multi-qubit Pauli gates
- Recipes for the Digital Quantum Simulation of Lattice Spin Systems