Well-conditioned multiproduct Hamiltonian simulation

Abstract

Product formula approximations of the time-evolution operator on quantum computers are of great interest due to their simplicity, and good scaling with system size by exploiting commutativity between Hamiltonian terms. However, product formulas exhibit poor scaling with the time $t$ and error $\epsilon$ of simulation as the gate cost of a single step scales exponentially with the order $m$ of accuracy. We introduce well-conditioned multiproduct formulas, which are a linear combination of product formulas, where a single step has polynomial cost $\mathcal{O}(m^2\log (m))$ and succeeds with probability $\Omega (1/{\log }^2(m))$. Our multiproduct formulas imply a simple and generic simulation algorithm that simultaneously exploits commutativity in arbitrary systems and has a worst-case cost $\mathcal{O}(t{\log }^2(t/\epsilon ))$ which is optimal up to poly-logarithmic factors. In contrast, prior Trotter and post-Trotter Hamiltonian simulation algorithms realize only one of these two desirable features. A key technical result of independent interest is our solution to a conditioning problem in previous multiproduct formulas that amplified numerical errors by $e^{\Omega (m)}$ in the classical setting, and led to a vanishing success probability $e^{-\Omega (m)}$ in the quantum setting.

arXiv comment9 pages, 2 figures

References in corpus (11)

• Optimal Hamiltonian Simulation by Quantum Signal Processing
• Simulating Hamiltonian dynamics with a truncated Taylor series
• Elucidating Reaction Mechanisms on Quantum Computers
• Toward the first quantum simulation with quantum speedup
• Quantum Algorithms for Quantum Field Theories
• Hamiltonian simulation with nearly optimal dependence on all parameters
• A random compiler for fast Hamiltonian simulation
• Quantum simulation of time-dependent Hamiltonians and the convenient illusion of Hilbert space
• Nearly optimal lattice simulation by product formulas
• Hamiltonian Simulation by Uniform Spectral Amplification
• A Trotter-Suzuki approximation for Lie groups with applications to Hamiltonian simulation

Cited by in corpus (9)

• Quantum computational chemistry
• Emerging quantum computing algorithms for quantum chemistry
• Hamiltonian simulation in the low-energy subspace
• Enhancing the Quantum Linear Systems Algorithm using Richardson Extrapolation
• Well-conditioned multi-product formulas for hardware-friendly Hamiltonian simulation
• Tailoring Term Truncations for Electronic Structure Calculations Using a Linear Combination of Unitaries
• Effects of Cosine Tapering Window on Quantum Phase Estimation
• A Generic Compilation Strategy for the Unitary Coupled Cluster Ansatz
• Semicoherent Symmetric Quantum Processes: Theory and Applications