Everything About ___
Live briefing

Everything about Quantum algorithm

Algorithm to be run on quantum computers

In quantum computing, a quantum algorithm is an algorithm that runs on a realistic model of quantum computation, the most commonly used model being the quantum circuit model of computation. A classical algorithm is a finite sequence of instructions, or a step-by-step procedure for solving a problem, where each step or instruction can be performed on a classical computer. Similarly, a quantum algorithm is a step-by-step procedure, where each of the steps can be performed on a quantum computer. Although all classical algorithms can also be performed on a quantum computer, the term quantum algorithm is generally reserved for algorithms that seem inherently quantum, or use some essential feature of quantum computation such as quantum superposition or quantum entanglement. Wikipedia →

🧭 Start here: a 6-step reading path

  1. Read the overview: Quantum algorithmA 5-minute orientation
  2. Skim a recent paper: Noisy intermediate-scale quantum algorithmsInfluential work since 2022
  3. Pick up a classic book: Quantum Walks and Search AlgorithmsThe most-reprinted book on the subject
  4. Read the landmark paper: Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum ComputerCited 6,082 times
  5. Go sideways: Quantum complexity theoryA closely related topic
  6. Go sideways: Quantum supremacyA closely related topic

đź“– Definitions

No dictionary entry for this exact phrase.

🗂️ The subject at a glance

  1. Overview
  2. Algorithms based on the quantum Fourier transform
  3. Algorithms based on amplitude amplification
  4. Algorithms based on quantum walks
  5. BQP-complete problems
  6. Hybrid quantum/classical algorithms

🏆 Landmark papers (most cited)

🆕 Influential since 2022

đź“š Books worth reading

Ranked by number of editions on Open Library, a rough measure of how lasting a book is.

đź”— Related topics