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

A random walk approach to quantum algorithms.

Vivien M Kendon1

  • 1School of Physics and Astronomy, University of Leeds, Leeds LS2 9JT, UK. v.kendon@leeds.ac.uk

Philosophical Transactions. Series A, Mathematical, Physical, and Engineering Sciences
|November 9, 2006
PubMed
Summary
This summary is machine-generated.

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

Quantum-assisted biomolecular modelling.

Philosophical transactions. Series A, Mathematical, physical, and engineering sciences·2010
Same author

Quantum analogue computing.

Philosophical transactions. Series A, Mathematical, physical, and engineering sciences·2010
Same journal

Correction to: 'Stokes settling and particle-laden plumes: implications for deep-sea mining and volcanic eruption plumes' (2020), by Mingotti et al.

Philosophical transactions. Series A, Mathematical, physical, and engineering sciences·2026
Same journal

A stable hothouse triggered by a tipping mechanism.

Philosophical transactions. Series A, Mathematical, physical, and engineering sciences·2026
Same journal

Beyond distance: quantifying point cloud dynamics with persistent homology and dynamic optimal transport.

Philosophical transactions. Series A, Mathematical, physical, and engineering sciences·2026
Same journal

Global stability of the Atlantic overturning circulation: edge state, long transients and boundary crisis under CO2 forcing.

Philosophical transactions. Series A, Mathematical, physical, and engineering sciences·2026
Same journal

Morse index classification and landscape of Kuramoto system for Hebbian-based binary pattern recognition.

Philosophical transactions. Series A, Mathematical, physical, and engineering sciences·2026
Same journal

Interpretable and equation-free response theory for complex systems.

Philosophical transactions. Series A, Mathematical, physical, and engineering sciences·2026
See all related articles

Quantum random walks offer a speedup for quantum computing algorithms by enabling quantum walkers to move further than classical ones. Optimizing quantum walks, even with slight imperfections, enhances their algorithmic potential.

Area of Science:

  • Quantum Computing
  • Quantum Information Science
  • Algorithm Development

Background:

  • Quantum algorithms leverage quantum versions of random walks within the emerging field of quantum computing.
  • Defining quantum random walks is complex, as pure quantum dynamics are deterministic, with randomness introduced only during measurement.
  • Quantum random walks exhibit distinct behaviors from classical counterparts due to quantum interference.

Purpose of the Study:

  • To explore the principles and applications of quantum random walks in quantum computing.
  • To investigate how quantum interference affects the behavior of quantum walkers.
  • To identify methods for optimizing quantum walks for algorithmic advantages.

Main Methods:

  • Developing quantum algorithms based on quantum random walks.

Related Experiment Videos

  • Analyzing the probabilistic outcomes of quantum random walks, considering quantum interference.
  • Investigating the impact of deviations from perfect quantum dynamics on walk properties.

    • Main Results:

    • Quantum walkers, on average, achieve greater displacement from their starting point compared to classical walkers.
    • Quantum interference significantly influences the path diversity and spread of quantum walks.
    • Slightly imperfect quantum walks can exhibit optimized properties beneficial for algorithmic applications.

    Conclusions:

    • Quantum random walks provide a foundation for achieving quantum speedups in computation.
    • The unique interference patterns in quantum walks are key to their enhanced performance.
    • Further development of quantum walk algorithms, even on small quantum computers, holds promise for solving complex problems efficiently.