Randomized algorithms for Hamiltonian simulation

DOI10.1007/978-3-642-27440-4_42zbMATH Open1270.81065OpenAlexW150687560MaRDI QIDQ5326142FDOQ5326142

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

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

Mathematics Subject Classification ID

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

Cited In (5)

• Simulating Sparse Hamiltonians with Star Decompositions
• Title not available (Why is that?)
• On the efficiency of quantum algorithms for Hamiltonian simulation
• Hamiltonian simulation with nearly optimal dependence on spectral norm
• Polynomial-time algorithm for simulation of weakly interacting quantum Spin systems

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)