Exploiting anticommutation in Hamiltonian simulation

Abstract

Quantum computing can efficiently simulate Hamiltonian dynamics of many-body quantum physics, a task that is generally intractable with classical computers. The hardness lies at the ubiquitous anti-commutative relations of quantum operators, in corresponding with the notorious negative sign problem in classical simulation. Intuitively, Hamiltonians with more commutative terms are also easier to simulate on a quantum computer, and anti-commutative relations generally cause more errors, such as in the product formula method. Here, we theoretically explore the role of anti-commutative relation in Hamiltonian simulation. We find that, contrary to our intuition, anti-commutative relations could also reduce the hardness of Hamiltonian simulation. Specifically, Hamiltonians with mutually anti-commutative terms are easy to simulate, as what happens with ones consisting of mutually commutative terms. Such a property is further utilized to reduce the algorithmic error or the gate complexity in the truncated Taylor series quantum algorithm for general problems. Moreover, we propose two modified linear combinations of unitaries methods tailored for Hamiltonians with different degrees of anti-commutation. We numerically verify that the proposed methods exploiting anti-commutative relations could significantly improve the simulation accuracy of electronic Hamiltonians. Our work sheds light on the roles of commutative and anti-commutative relations in simulating quantum systems.

References in corpus (25)

• Quantum computational chemistry
• Simulated Quantum Computation of Molecular Energies
• 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
• Toward the first quantum simulation with quantum speedup
• Quantum Algorithms for Quantum Field Theories
• A Theory of Trotter Error
• Simulating Physical Phenomena by Quantum Networks
• A random compiler for fast Hamiltonian simulation
• Digital quantum simulation of fermionic models with a superconducting circuit
• Gate count estimates for performing quantum chemistry on small quantum computers
• Solving strongly correlated electron models on a quantum computer
• Exponential improvement in precision for simulating sparse Hamiltonians
• Chemical Basis of Trotter-Suzuki Errors in Quantum Chemistry Simulation
• Adiabatic Quantum Simulation of Quantum Chemistry
• Nearly optimal lattice simulation by product formulas
• Faster quantum simulation by randomization
• Quantum localization bounds Trotter errors in digital quantum simulation
• Limitations of Quantum Simulation Examined by Simulating a Pairing Hamiltonian using Nuclear Magnetic Resonance
• Nearly tight Trotterization of interacting electrons
• Shorter gate sequences for quantum computing by mixing unitaries
• Destructive Error Interference in Product-Formula Lattice Simulation
• Polynomial-time classical simulation of quantum ferromagnets

Cited by in corpus (5)

• Efficient Fully-Coherent Quantum Signal Processing Algorithms for Real-Time Dynamics Simulation
• On the complexity of implementing Trotter steps
• Simple and high-precision Hamiltonian simulation by compensating Trotter error with linear combination of unitary operations
• Dilution of error in digital Hamiltonian simulation
• Error Interference in Quantum Simulation