Quantum computing classical physics

Simple item page
dc.creatorMeyer, David A.
dc.date2001-11-12
dc.date.accessioned2026-07-07T06:03:00Z
dc.date.available2026-07-07T06:03:00Z
dc.descriptionIn 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.
dc.description13 pages, plain TeX, 10 PostScript figures included with epsf.tex; for related work see http://math.ucsd.edu/~dmeyer/research.html
dc.identifierhttps://arxiv.org/abs/quant-ph/0111069
dc.identifierhttp://arxiv.org/abs/quant-ph/0111069
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/89829
dc.subjectQuantum Physics
dc.titleQuantum computing classical physics
dc.typetext

Files

Collections

arXiv