Hamiltonian simulation with nearly optimal dependence on spectral norm

DOI10.1145/3313276.3316386zbMath1433.68149arXiv1807.03967OpenAlexW3098935501MaRDI QIDQ5212791

Guang Hao Low

Publication date: 30 January 2020

Published in: Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing (Search for Journal in Brave)

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

zbMATH Keywords

optimalquantum algorithmsparsityspectral normquery complexityHamiltonian simulationsubordinate norm

Mathematics Subject Classification ID

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

Related Items

Time Complexity Analysis of Quantum Difference Methods for Multiscale Transport Equations, Time complexity analysis of quantum difference methods for linear high dimensional and multiscale partial differential equations