Jove
Visualize
Contact Us
JoVE
x logofacebook logolinkedin logoyoutube logo
ABOUT JoVE
OverviewLeadershipBlogJoVE Help Center
AUTHORS
Publishing ProcessEditorial BoardScope & PoliciesPeer ReviewFAQSubmit
LIBRARIANS
TestimonialsSubscriptionsAccessResourcesLibrary Advisory BoardFAQ
RESEARCH
JoVE JournalMethods CollectionsJoVE Encyclopedia of ExperimentsArchive
EDUCATION
JoVE CoreJoVE BusinessJoVE Science EducationJoVE Lab ManualFaculty Resource CenterFaculty Site
Terms & Conditions of Use
Privacy Policy
Policies

Related Experiment Videos

Quantum computing classical physics.

David A Meyer1

  • 1Department of Mathematics, University of California, San Diego, La Jolla, CA 92093, USA. dmeyer@math.ucsd.edu

Philosophical Transactions. Series A, Mathematical, Physical, and Engineering Sciences
|October 8, 2005
PubMed
Summary

Quantum algorithms, like quantum lattice-gas automata, can outperform classical methods for simulating classical systems. This research demonstrates their efficient implementation on standard quantum computers.

Related Concept Videos

You might also read

Related Articles

Articles linked to this work by shared authors, journal, and citation graph.

Sort by
Same author

Polynomial Monogamy Relations for Entanglement Negativity.

Physical review letters·2017
Same author

Efficient robust conditional random fields.

IEEE transactions on image processing : a publication of the IEEE Signal Processing Society·2015
Same author

Connectivity is a poor indicator of fast quantum search.

Physical review letters·2015
Same author

Lattice gas simulations of dynamical geometry in two dimensions.

Physical review. E, Statistical, nonlinear, and soft matter physics·2011
Same author

Periodicity and growth in a lattice gas with dynamical geometry.

Physical review. E, Statistical, nonlinear, and soft matter physics·2006
Same author

Towards the simplest hydrodynamic lattice-gas model.

Philosophical transactions. Series A, Mathematical, physical, and engineering sciences·2005

Area of Science:

  • Quantum Computing
  • Computational Physics
  • Algorithm Analysis

Background:

  • Quantum algorithms have demonstrated superior performance over classical algorithms for specific computational problems and quantum system simulations.
  • This success suggests potential applications in simulating classical systems.

Purpose of the Study:

  • To explore the potential of quantum algorithms for accelerating the simulation of classical systems.
  • To introduce and describe quantum lattice-gas automata as a class of discrete quantum algorithms for this purpose.
  • To demonstrate the efficient implementation of these algorithms on standard quantum computers.

Main Methods:

  • Description of a specific class of discrete quantum algorithms: quantum lattice-gas automata.
  • Development of methods for efficient implementation on standard quantum computing hardware.

Main Results:

  • Identification of quantum lattice-gas automata as a viable approach for speeding up classical system simulations.
  • Demonstration of efficient implementation strategies for these quantum algorithms.

Conclusions:

  • Quantum lattice-gas automata represent a promising avenue for leveraging quantum computation to solve classical simulation problems.
  • Efficient implementation on current quantum computers makes this approach practical and accessible.

Related Experiment Videos