Exponential improvement in precision for simulating sparse Hamiltonians

DOI10.1145/2591796.2591854MaRDI QIDQ6829105zbMATH OpenFDO

Authors Dominic W. Berry, Andrew M. Childs, Richard Cleve, Robin Kothari, R. D. Somma

Publication date 26 June 2015

Published in Proceedings of the forty-sixth annual ACM symposium on Theory of computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/2591796.2591854

zbMATH Keywords

Hamiltonian simulationquantum algorithms

Mathematics Subject Classification ID

Quantum algorithms and complexity in the theory of computing (68Q12) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Quantum computation (81P68)

Cited in

(12)

• Quantum eigenvalue processing
• Finding eigenvectors with a quantum variational algorithm
• Selection and improvement of product formulae for best performance of quantum simulation
• Quantum algorithm for linear non-unitary dynamics with near-optimal dependence on all parameters
• Quantum lower bounds by sample-to-query lifting
• On Schrödingerization-based quantum algorithms for linear dynamical systems with inhomogeneous terms
• Working session: Quantum signal processing and nonlinear Fourier analysis. Abstracts from the working session held October 6--11, 2024
• Uniform observable error bounds of Trotter formulae for the semiclassical Schrödinger equation
• Efficient quantum Gibbs samplers with Kubo-Martin-Schwinger detailed balance condition
• Lower bound for simulation cost of open quantum systems: Lipschitz continuity approach
• VQA\_POISSON: a quantum library for solving two-dimensional Poisson equations with mixed boundary conditions
• Convergence rates for the Trotter splitting for unbounded operators

This page was built for publication: Exponential improvement in precision for simulating sparse Hamiltonians

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