On the efficiency of quantum algorithms for Hamiltonian simulation

DOI10.1007/S11128-011-0263-9zbMath1239.81034arXiv1005.1318OpenAlexW1967257224MaRDI QIDQ424226

Chi Zhang, Anargyros Papageorgiou

Publication date: 31 May 2012

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

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

zbMATH Keywords

complexitysplitting methodsorder of convergencequantum simulationHamiltonian evolution

Mathematics Subject Classification ID

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

Related Items (9)

A fast algorithm for approximating the ground state energy on a quantum computer ⋮ Digital Simulation of Single Qubit Markovian Open Quantum Systems: A Tutorial ⋮ Quantum-circuit design for efficient simulations of many-body quantum dynamics ⋮ A universal quantum circuit scheme for finding complex eigenvalues ⋮ Quantum algorithm and circuit design solving the Poisson equation ⋮ Multiple network alignment on quantum computers ⋮ Product formulas for exponentials of commutators ⋮ Estimating the ground state energy of the Schrödinger equation for convex potentials ⋮ Approximating ground and excited state energies on a quantum computer

Cites Work

• Unnamed Item
• Unnamed Item
• On the relationship between continuous- and discrete-time quantum walk
• Efficient quantum algorithms for simulating sparse Hamiltonians
• An example of the difference between quantum and classical random walks
• BOUNDS ON TAIL PROBABILITIES OF DISCRETE DISTRIBUTIONS
• Universal Quantum Simulators
• Adiabatic quantum state generation and statistical zero knowledge
• General theory of fractal path integrals with applications to many-body theories and statistical physics
• Simulating quantum systems on a quantum computer
• Higher order decompositions of ordered operator exponentials

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