qSWIFT: High-order randomized compiler for Hamiltonian simulation

Abstract

Hamiltonian simulation is known to be one of the fundamental building blocks of a variety of quantum algorithms such as its most immediate application, that of simulating many-body systems to extract their physical properties. In this work, we present qSWIFT, a high-order randomized algorithm for Hamiltonian simulation. In qSWIFT, the required number of gates for a given precision is independent of the number of terms in Hamiltonian, while the systematic error is exponentially reduced with regards to the order parameter. In this respect, our qSWIFT is a higher-order counterpart of the previously proposed quantum stochastic drift protocol (qDRIFT), in which the number of gates scales linearly with the inverse of the precision required. We construct the qSWIFT channel and establish a rigorous bound for the systematic error quantified by the diamond norm. qSWIFT provides an algorithm to estimate given physical quantities using a system with one ancilla qubit, which is as simple as other product-formula-based approaches such as regular Trotter-Suzuki decompositions and qDRIFT. Our numerical experiment reveals that the required number of gates in qSWIFT is significantly reduced compared to qDRIFT. Particularly, the advantage is significant for problems where high precision is required; for example, to achieve a systematic relative propagation error of $10^{-6}$, the required number of gates in third-order qSWIFT is 1000 times smaller than that of qDRIFT.

23 pages, 7 figures

References in corpus (18)

• Fermionic quantum computation
• Hamiltonian Simulation by Qubitization
• Optimal Hamiltonian Simulation by Quantum Signal Processing
• Simulating Hamiltonian dynamics with a truncated Taylor series
• Efficient quantum algorithms for simulating sparse Hamiltonians
• Universal digital quantum simulation with trapped ions
• Toward the first quantum simulation with quantum speedup
• A Theory of Trotter Error
• A random compiler for fast Hamiltonian simulation
• Digital quantum simulation of fermionic models with a superconducting circuit
• Qulacs: a fast and versatile quantum circuit simulator for research purpose
• Even more efficient quantum computations of chemistry through tensor hypercontraction
• Faster quantum simulation by randomization
• Limitations of Quantum Simulation Examined by Simulating a Pairing Hamiltonian using Nuclear Magnetic Resonance
• A randomized quantum algorithm for statistical phase estimation
• Hybridized Methods for Quantum Simulation in the Interaction Picture
• Black-box Hamiltonian simulation and unitary implementation
• Randomizing multi-product formulas for Hamiltonian simulation

Cited by in corpus (16)

• Continuous Hamiltonian dynamics on digital quantum computers without discretization error
• Quantum error mitigation for Fourier moment computation
• Early Fault-Tolerant Quantum Algorithms in Practice: Application to Ground-State Energy Estimation
• Halving the Cost of Quantum Algorithms with Randomization
• Ansatz-free Hamiltonian learning with Heisenberg-limited scaling
• Accelerating two-dimensional electronic spectroscopy simulations with a probe qubit protocol
• Unifying framework for quantum simulation algorithms for time-dependent Hamiltonian dynamics
• Quantum Computing Beyond Ground State Electronic Structure: A Review of Progress Toward Quantum Chemistry Out of the Ground State
• Chemically Motivated Simulation Problems are Efficiently Solvable by a Quantum Computer
• Faster Algorithmic Quantum and Classical Simulations by Corrected Product Formulas
• Adaptive random compiler for Hamiltonian simulation
• Simulating sparse SYK model with a randomized algorithm on a trapped-ion quantum computer
• Quantum algorithms based on quantum trajectories
• Fluctuation-guided adaptive random compiler for Hamiltonian simulation
• A Randomized Method for Simulating Lindblad Equations and Thermal State Preparation
• Resource-efficient Quantum Algorithms for Selected Hamiltonian Subspace Diagonalization