Exploiting anticommutation in Hamiltonian simulation
- URL: http://arxiv.org/abs/2103.07988v2
- Date: Thu, 26 Aug 2021 18:28:40 GMT
- Title: Exploiting anticommutation in Hamiltonian simulation
- Authors: Qi Zhao and Xiao Yuan
- Abstract summary: Quantum computing can efficiently simulate Hamiltonian dynamics of many-body quantum physics.
The hardness lies at the ubiquitous anti-commutative relations of quantum operators.
We find that, contrary to our intuition, anti-commutative relations could also reduce the hardness of Hamiltonian simulation.
- Score: 21.306196108171164
- License: http://creativecommons.org/licenses/by/4.0/
- 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.
Related papers
- Mitigating Errors in Analog Quantum Simulation by Hamiltonian Reshaping or Hamiltonian Rescaling [0.0]
This work introduces two novel error mitigation strategies -- Hamiltonian reshaping and Hamiltonian rescaling -- in analog quantum simulation.
Hamiltonian reshaping uses random unitary transformations to generate new Hamiltonians with identical eigenvalues but varied eigenstates.
Hamiltonian rescaling mitigates errors by comparing eigenvalue estimates from energy-scaled Hamiltonians.
arXiv Detail & Related papers (2024-10-31T08:10:51Z) - Vectorization of the density matrix and quantum simulation of the von
Neumann equation of time-dependent Hamiltonians [65.268245109828]
We develop a general framework to linearize the von-Neumann equation rendering it in a suitable form for quantum simulations.
We show that one of these linearizations of the von-Neumann equation corresponds to the standard case in which the state vector becomes the column stacked elements of the density matrix.
A quantum algorithm to simulate the dynamics of the density matrix is proposed.
arXiv Detail & Related papers (2023-06-14T23:08:51Z) - Extension of exactly-solvable Hamiltonians using symmetries of Lie
algebras [0.0]
We show that a linear combination of operators forming a modest size Lie algebra can be substituted by determinants of the Lie algebra symmetries.
The new class of solvable Hamiltonians can be measured efficiently using quantum circuits with gates that depend on the result of a mid-circuit measurement of the symmetries.
arXiv Detail & Related papers (2023-05-29T17:19:56Z) - A hybrid quantum-classical algorithm for multichannel quantum scattering
of atoms and molecules [62.997667081978825]
We propose a hybrid quantum-classical algorithm for solving the Schr"odinger equation for atomic and molecular collisions.
The algorithm is based on the $S$-matrix version of the Kohn variational principle, which computes the fundamental scattering $S$-matrix.
We show how the algorithm could be scaled up to simulate collisions of large polyatomic molecules.
arXiv Detail & Related papers (2023-04-12T18:10:47Z) - Higher-order quantum transformations of Hamiltonian dynamics [0.8192907805418581]
We present a quantum algorithm to achieve higher-order transformations of Hamiltonian dynamics.
By way of example, we demonstrate the simulation of negative time-reversal, and perform a Hamiltonian learning task.
arXiv Detail & Related papers (2023-03-17T06:01:59Z) - Simultaneous Stoquasticity [0.0]
Stoquastic Hamiltonians play a role in the computational complexity of the local Hamiltonian problem.
We address the question of whether two or more Hamiltonians may be made simultaneously stoquastic via a unitary transformation.
arXiv Detail & Related papers (2022-02-17T19:08:30Z) - Variational Adiabatic Gauge Transformation on real quantum hardware for
effective low-energy Hamiltonians and accurate diagonalization [68.8204255655161]
We introduce the Variational Adiabatic Gauge Transformation (VAGT)
VAGT is a non-perturbative hybrid quantum algorithm that can use nowadays quantum computers to learn the variational parameters of the unitary circuit.
The accuracy of VAGT is tested trough numerical simulations, as well as simulations on Rigetti and IonQ quantum computers.
arXiv Detail & Related papers (2021-11-16T20:50:08Z) - Hybridized Methods for Quantum Simulation in the Interaction Picture [69.02115180674885]
We provide a framework that allows different simulation methods to be hybridized and thereby improve performance for interaction picture simulations.
Physical applications of these hybridized methods yield a gate complexity scaling as $log2 Lambda$ in the electric cutoff.
For the general problem of Hamiltonian simulation subject to dynamical constraints, these methods yield a query complexity independent of the penalty parameter $lambda$ used to impose an energy cost.
arXiv Detail & Related papers (2021-09-07T20:01:22Z) - Fixed Depth Hamiltonian Simulation via Cartan Decomposition [59.20417091220753]
We present a constructive algorithm for generating quantum circuits with time-independent depth.
We highlight our algorithm for special classes of models, including Anderson localization in one dimensional transverse field XY model.
In addition to providing exact circuits for a broad set of spin and fermionic models, our algorithm provides broad analytic and numerical insight into optimal Hamiltonian simulations.
arXiv Detail & Related papers (2021-04-01T19:06:00Z) - Simulating nonnative cubic interactions on noisy quantum machines [65.38483184536494]
We show that quantum processors can be programmed to efficiently simulate dynamics that are not native to the hardware.
On noisy devices without error correction, we show that simulation results are significantly improved when the quantum program is compiled using modular gates.
arXiv Detail & Related papers (2020-04-15T05:16:24Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.