Randomized algorithms for Hamiltonian simulation

DOI10.1007/978-3-642-27440-4_42MaRDI QIDQ5326142zbMATH OpenOpenAlexFDO

Authors Chi Zhang

Publication date 31 July 2013

Published in Springer Proceedings in Mathematics & Statistics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-27440-4_42

Mathematics Subject Classification ID

Computational methods for problems pertaining to quantum theory (81-08) Quantum computation (81P68) Closed and approximate solutions to the Schrödinger, Dirac, Klein-Gordon and other equations of quantum mechanics (81Q05)

Recommendations

• On the efficiency of quantum algorithms for Hamiltonian simulation
• Algorithm for quantum simulation
• scientific article; zbMATH DE number 6131346
• Quantum algorithms for Hamiltonian simulation
• Efficient quantum algorithms for simulating sparse Hamiltonians

Cited in

(6)

• Polynomial-time algorithm for simulation of weakly interacting quantum Spin systems
• Simulating Sparse Hamiltonians with Star Decompositions
• On the efficiency of quantum algorithms for Hamiltonian simulation
• scientific article; zbMATH DE number 205220 (Why is no real title available?)
• Hamiltonian simulation with nearly optimal dependence on spectral norm
• Selection and improvement of product formulae for best performance of quantum simulation

This page was built for publication: Randomized algorithms for Hamiltonian simulation

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