Quantum computing classical physics

From MaRDI portal
Publication:4545346

DOI10.1098/RSTA.2001.0936zbMATH Open1088.81506arXivquant-ph/0111069OpenAlexW2099721081WikidataQ45964127 ScholiaQ45964127MaRDI QIDQ4545346FDOQ4545346

David A. Meyer

Publication date: 15 August 2002

Published in: Philosophical Transactions of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences (Search for Journal in Brave)

Abstract: In the past decade quantum algorithms have been found which outperform the best classical solutions known for certain classical problems as well as the best classical methods known for simulation of certain quantum systems. This suggests that they may also speed up the simulation of some classical systems. I describe one class of discrete quantum algorithms which do so--quantum lattice gas automata--and show how to implement them efficiently on standard quantum computers.


Full work available at URL: https://arxiv.org/abs/quant-ph/0111069




Recommendations





Cited In (11)





This page was built for publication: Quantum computing classical physics

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