Simulating time evolution on distributed quantum computers
arXiv:2208.07487 · doi:10.1103/PhysRevResearch.5.L022003
Abstract
We study a variation of the Trotter-Suzuki decomposition, in which a Hamiltonian exponential is approximated by an ordered product of two-qubit operator exponentials such that the Trotter step size is enhanced for a small number of terms. Such decomposition directly reflects hardware constraints of distributed quantum computers, where operations on monolithic quantum devices are fast compared to entanglement distribution across separate nodes using interconnects. We simulate non-equilibrium dynamics of transverse-field Ising and XY spin chain models and investigate the impact of locally increased Trotter step sizes that are associated with an increasingly sparse use of the quantum interconnect. We find that the overall quality of the approximation depends smoothly on the local sparsity and that the proliferation of local errors is slow. As a consequence, we show that fast local operations on monolithic devices can be leveraged to obtain an overall improved result fidelity even on distributed quantum computers where the use of interconnects is costly.
arXiv comment6+5 pages, 5+6 figures
References in corpus (32)
- Quantum Computing in the NISQ era and beyond
- Supplementary information for "Quantum supremacy using a programmable superconducting processor"
- Purification of Noisy Entanglement and Faithful Teleportation via Noisy Channels
- Quantum computational advantage using photons
- Noisy intermediate-scale quantum (NISQ) algorithms
- Quantum Chemistry in the Age of Quantum Computing
- Strong quantum computational advantage using a superconducting quantum processor
- Determining eigenstates and thermal states on a quantum computer using quantum imaginary time evolution
- Efficient quantum algorithms for simulating sparse Hamiltonians
- Quantum Teleportation Between Distant Matter Qubits
- Quantum Algorithms for Quantum Field Theories
- A Theory of Trotter Error
- Optimal Quantum Circuits for General Two-Qubit Gates
- Cloud Quantum Computing of an Atomic Nucleus
- Quantum Quench in the Transverse Field Ising chain I: Time evolution of order parameter correlators
- A random compiler for fast Hamiltonian simulation
- Gate count estimates for performing quantum chemistry on small quantum computers
- High-rate, high-fidelity entanglement of qubits across an elementary quantum network
- Simulating quantum many-body dynamics on a current digital quantum computer
- Towards a Distributed Quantum Computing Ecosystem
- Real- and imaginary-time evolution with compressed quantum circuits
- Chemical Basis of Trotter-Suzuki Errors in Quantum Chemistry Simulation
- Local and Distributed Quantum Computation
- Faster quantum simulation by randomization
- Hardware-efficient variational quantum algorithms for time evolution
- Electron-Phonon Systems on a Universal Quantum Computer
- Quantum localization bounds Trotter errors in digital quantum simulation
- Filtering variational quantum algorithms for combinatorial optimization
- Digital Quantum Simulation, Trotter Errors, and Quantum Chaos of the Kicked Top
- Quantum-circuit design for efficient simulations of many-body quantum dynamics
- Compilation by stochastic Hamiltonian sparsification
- First-Order Trotter Error from a Second-Order Perspective