Bounding the costs of quantum simulation of many-body physics in real space

DOI10.1088/1751-8121/AA77B8zbMATH Open1371.81081arXiv1608.05696OpenAlexW3098852652MaRDI QIDQ4978604FDOQ4978604

Authors: Ian D. Kivlichan, Nathan Wiebe, Ryan Babbush, Alán Aspuru-Guzik 

Publication date: 25 August 2017

Published in: Journal of Physics A: Mathematical and Theoretical (Search for Journal in Brave)

Abstract: We present a quantum algorithm for simulating the dynamics of a first-quantized Hamiltonian in real space based on the truncated Taylor series algorithm. We avoid the possibility of singularities by applying various cutoffs to the system and using a high-order finite difference approximation to the kinetic energy operator. We find that our algorithm can simulate $eta$ interacting particles using a number of calculations of the pairwise interactions that scales, for a fixed spatial grid spacing, as $ildeO(et{a}^2)$, versus the $ildeO(et{a}^5)$ time required by previous methods (assuming the number of orbitals is proportional to $eta$), and scales super-polynomially better with the error tolerance than algorithms based on the Lie-Trotter-Suzuki product formula. Finally, we analyze discretization errors that arise from the spatial grid and show that under some circumstances these errors can remove the exponential speedups typically afforded by quantum simulation.

Full work available at URL: https://arxiv.org/abs/1608.05696

Recommendations

• Quantum simulation of simple many-body dynamics
• Algorithm for quantum simulation
• Quantum algorithm for simulating real time evolution of lattice Hamiltonians
• Exponentially more precise quantum simulation of fermions in second quantization
• Efficient quantum algorithms for simulating sparse Hamiltonians

zbMATH Keywords

quantum algorithmsquantum computingmany-body physicsHamiltonian simulation

Mathematics Subject Classification ID

Quantum algorithms and complexity in the theory of computing (68Q12) Quantum computation (81P68) Finite difference methods for boundary value problems involving PDEs (65N06) Many-body theory; quantum Hall effect (81V70)

Cites Work

• Simulating quantum mechanics on a quantum computer.
• Universal Quantum Simulators
• Adiabatic quantum state generation and statistical zero knowledge
• Simulating quantum systems on a quantum computer
• On the relationship between continuous- and discrete-time quantum walk
• Efficient quantum algorithms for simulating sparse Hamiltonians
• General theory of fractal path integrals with applications to many-body theories and statistical physics
• Title not available (Why is that?)
• Simulating Sparse Hamiltonians with Star Decompositions
• Title not available (Why is that?)
• General explicit difference formulas for numerical differentiation
• Higher order decompositions of ordered operator exponentials
• Black-box Hamiltonian simulation and unitary implementation
• Simulating quantum dynamics on a quantum computer
• Faster quantum chemistry simulation on fault-tolerant quantum computers
• Exponentially more precise quantum simulation of fermions in second quantization
• A Trotter-Suzuki approximation for Lie groups with applications to Hamiltonian simulation

Cited In (8)

• Dense outputs from quantum simulations
• Quantum simulation of simple many-body dynamics
• Toward prethreshold gate-based quantum simulation of chemical dynamics: using potential energy surfaces to simulate few-channel molecular collisions
• Quantum algorithm for simulating real time evolution of lattice Hamiltonians
• Quantum-circuit design for efficient simulations of many-body quantum dynamics
• Exponentially more precise quantum simulation of fermions in second quantization
• Application of fermionic marginal constraints to hybrid quantum algorithms
• The variational quantum eigensolver: a review of methods and best practices

This page was built for publication: Bounding the costs of quantum simulation of many-body physics in real space

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4978604)