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

Portfolios of quantum algorithms.

S M Maurer1, T Hogg, B A Huberman

  • 1Physics Department, Stanford University, Stanford, California 94043, USA.

Physical Review Letters
|December 12, 2001
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

Foci of contamination of Listeria monocytogenes in different cheese processing plants.

International journal of food microbiology·2013
Same author

Wine phenolic compounds influence the production of volatile phenols by wine-related lactic acid bacteria.

Journal of applied microbiology·2011
Same author

Diverse geno- and phenotypes of persistent Listeria monocytogenes isolates from fermented meat sausage production facilities in Portugal.

Applied and environmental microbiology·2011
Same author

Consumer exposure to phthalates from paper packaging: an integrated approach.

Food additives & contaminants. Part A, Chemistry, analysis, control, exposure & risk assessment·2010
Same author

Distribution and characterization of Listeria monocytogenes clinical isolates in Portugal, 1994-2007.

European journal of clinical microbiology & infectious diseases : official publication of the European Society of Clinical Microbiology·2010
Same author

Characterization of microbial population of 'Alheira' (a traditional Portuguese fermented sausage) by PCR-DGGE and traditional cultural microbiological methods.

Journal of applied microbiology·2009
Same journal

Erratum: Bacterial Turbulence at Compressible Fluid Interfaces [Phys. Rev. Lett. 136, 138301 (2026)].

Physical review letters·2026
Same journal

Unveiling Light-Quark Yukawa Flavor Structure via Dihadron Fragmentation at Lepton Colliders.

Physical review letters·2026
Same journal

Adaptable Route to Fast Coherent State Transport via Bang-Bang-Bang Protocols.

Physical review letters·2026
Same journal

Topological Transition and Emergence of Elasticity of Dislocation in Skyrmion Lattice: Beyond Kittel's Magnetic-Polar Analogy.

Physical review letters·2026
Same journal

Pound-Drever-Hall Method for Superconducting-Qubit Readout.

Physical review letters·2026
Same journal

Coupling a ^{73}Ge Nuclear Spin to an Electrostatically Defined Quantum Dot in Silicon.

Physical review letters·2026
See all related articles

Quantum computation can probabilistically solve hard problems. Portfolios of quantum algorithms, like financial ones, can reduce running time and uncertainty for complex tasks like 3-satisfiability.

Area of Science:

  • Quantum Computing
  • Computational Complexity Theory
  • Algorithm Optimization

Background:

  • Quantum computation offers potential solutions for intractable problems.
  • Many quantum algorithms are inherently stochastic, providing probabilistic solutions.
  • Algorithm efficiency requires evaluation of both completion time and variance.

Purpose of the Study:

  • To investigate methods for minimizing running time and uncertainty in quantum algorithms.
  • To explore the application of portfolio strategies to quantum algorithm selection.
  • To assess the performance of quantum algorithm portfolios on NP-complete problems.

Main Methods:

  • Developed a portfolio approach for quantum algorithms, drawing parallels with financial portfolio theory.

Related Experiment Videos

  • Applied the portfolio strategy to NP-complete problems, specifically 3-satisfiability.
  • Analyzed the expected completion time and variance of the portfolio approach compared to single algorithms.

    • Main Results:

    • Quantum algorithm portfolios demonstrated superior performance over single algorithms.
    • The portfolio approach effectively reduced both the expected running time and its uncertainty.
    • Significant improvements were observed when applied to NP-complete problems like 3-satisfiability.

    Conclusions:

    • Portfolio strategies are a viable method for enhancing quantum algorithm efficiency.
    • This approach offers a promising direction for tackling complex computational problems using quantum computers.
    • Further research into quantum portfolio optimization could unlock new computational capabilities.