On the efficiency of quantum algorithms for Hamiltonian simulation

DOI10.1007/S11128-011-0263-9zbMATH Open1239.81034arXiv1005.1318OpenAlexW1967257224MaRDI QIDQ424226FDOQ424226

Authors: A. Papageorgiou, Chi Zhang 

Publication date: 31 May 2012

Published in: Quantum Information Processing (Search for Journal in Brave)

Abstract: We study the efficiency of algorithms simulating a system evolving with Hamiltonian $H=su{m}_{j=1}^m{H}_j$. We consider high order splitting methods that play a key role in quantum Hamiltonian simulation. We obtain upper bounds on the number of exponentials required to approximate $e^{-iHt}$ with error $e$. Moreover, we derive the order of the splitting method that optimizes the cost of the resulting algorithm. We show significant speedups relative to previously known results.

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

Recommendations

• Quantum algorithms for Hamiltonian simulation
• Efficient quantum algorithms for simulating sparse Hamiltonians
• Efficient Algorithms for Universal Quantum Simulation
• Efficient Quantum Algorithms for Simulating Lindblad Evolution
• Randomized algorithms for Hamiltonian simulation
• Time-space efficient simulations of quantum computations
• Efficient classical simulation of the Deutsch-Jozsa and Simon's algorithms
• An algebraic quantum circuit compression algorithm for Hamiltonian simulation
• Efficient discrete-time simulations of continuous-time quantum query algorithms
• Quantum algorithm for simulating real time evolution of lattice Hamiltonians

zbMATH Keywords

complexityquantum simulationorder of convergencesplitting methodsHamiltonian evolution

Mathematics Subject Classification ID

Quantum algorithms and complexity in the theory of computing (68Q12) Quantum computation (81P68)

Cites Work

• Title not available (Why is that?)
• 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
• Title not available (Why is that?)
• Bounds on tail probabilities of discrete distributions
• General theory of fractal path integrals with applications to many-body theories and statistical physics
• An example of the difference between quantum and classical random walks
• Higher order decompositions of ordered operator exponentials

Cited In (27)

• Riemannian quantum circuit optimization for Hamiltonian simulation
• A universal quantum circuit scheme for finding complex eigenvalues
• A generalized circuit for the Hamiltonian dynamics through the truncated series
• Digital Simulation of Single Qubit Markovian Open Quantum Systems: A Tutorial
• Product formulas for exponentials of commutators
• Optimization of quantum Hamiltonian evolution: from two projection operators to local Hamiltonians
• Title not available (Why is that?)
• Necessary conditions for efficient simulation of Hamiltonians using local unitary operations
• Hamiltonian simulation with nearly optimal dependence on spectral norm
• Quantum algorithms for Hamiltonian simulation
• Average-case speedup for product formulas
• Randomized algorithms for Hamiltonian simulation
• Quantum algorithm and circuit design solving the Poisson equation
• Lax dynamics for Cartan decomposition with applications to Hamiltonian simulation
• A fast algorithm for approximating the ground state energy on a quantum computer
• Estimating the ground state energy of the Schrödinger equation for convex potentials
• Quantum-circuit design for efficient simulations of many-body quantum dynamics
• Multiple network alignment on quantum computers
• A Trotter-Suzuki approximation for Lie groups with applications to Hamiltonian simulation
• Title not available (Why is that?)
• Efficient Algorithms for Universal Quantum Simulation
• Title not available (Why is that?)
• Approximating ground and excited state energies on a quantum computer
• A Quantum Hamiltonian Identification Algorithm: Computational Complexity and Error Analysis
• Fast algorithms of bath calculations in simulations of quantum system-bath dynamics
• Algorithm for quantum simulation
• Divide and conquer approach to quantum Hamiltonian simulation

This page was built for publication: On the efficiency of quantum algorithms for Hamiltonian simulation

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