Quantum algorithm

수학노트
둘러보기로 가기 검색하러 가기

노트

  • Therefore, an algorithm is a quantum algorithm when it can be performed on a quantum computer.[1]
  • Quantum algorithms are most commonly described by a quantum circuit, of which a simple example is shown in the figure below.[1]
  • Similarly, a quantum algorithm is a step-by-step procedure, where each of the steps can be performed on a quantum computer.[2]
  • Quantum algorithms can be categorized by the main techniques used by the algorithm.[2]
  • Efficient quantum algorithms are known for certain non-abelian groups.[2]
  • With a quantum algorithm however, it can be solved in Θ(N0.5) queries.[2]
  • Because of this, many quantum algorithms are probabilistic: they give the correct answer with a less-than-unity probability.[3]
  • Quantum algorithms can also accelerate more complicated classical algorithms.[4]
  • "Our research has developed a quantum algorithm which can be used to study a class of many-electron quantum systems using quantum computers.[5]
  • It will be established problem by problem, quantum algorithm versus classical algorithm.[6]
  • The original version of this article included an example of a classical version of a quantum algorithm developed by Christian Calude.[6]
  • In this paper, we introduce q-means, a new quantum algorithm for clustering.[7]
  • In this work, we introduce a quantum algorithm for simulating molecular vibrational excitations during vibronic transitions.[8]
  • Reichardt B W, Faster quantum algorithm for evaluating game trees, Proc.[9]
  • et al., Experimental realization of quantum algorithm for solving linear systems of equations, Phys.[9]
  • “Our research has developed a quantum algorithm which can be used to study a class of many-electron quantum systems using quantum computers.[10]
  • We survey 20 different quantum algorithms, attempting to describe each in a succinct and self-contained fashion.[11]
  • Beyond Shor's algorithm, there is a growing body of work on quantum algorithms specifically designed to attack cryptosystems.[12]
  • The first is quantum algorithms providing polynomial or sub-exponential time attacks on cryptosystems under standard assumptions.[12]
  • Amplitude estimation forms the core of most known quantum algorithms related to collision finding and graph properties.[12]
  • This was historically the first well-defined quantum algorithm achieving a speedup over classical computation.[12]
  • So a quantum algorithm has to harness that physical oddity.[13]

소스

메타데이터

위키데이터

Spacy 패턴 목록

  • [{'LOWER': 'quantum'}, {'LEMMA': 'algorithm'}]