Quantum algorithm
In quantum computing, a quantum algorithm is an algorithm which runs on a realistic model of quantum computation, the most commonly used model being the quantum circuit model of computation. A classical (or non-quantum) 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 usually used for those algorithms which seem inherently quantum, or use some essential feature of quantum computation such as quantum superposition or quantum entanglement.
- Comment
- enIn quantum computing, a quantum algorithm is an algorithm which runs on a realistic model of quantum computation, the most commonly used model being the quantum circuit model of computation. A classical (or non-quantum) 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 usually used for those algorithms which seem inherently quantum, or use some essential feature of quantum computation such as quantum superposition or quantum entanglement.
- Depiction
- Has abstract
- enIn quantum computing, a quantum algorithm is an algorithm which runs on a realistic model of quantum computation, the most commonly used model being the quantum circuit model of computation. A classical (or non-quantum) 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 usually used for those algorithms which seem inherently quantum, or use some essential feature of quantum computation such as quantum superposition or quantum entanglement. Problems which are undecidable using classical computers remain undecidable using quantum computers. What makes quantum algorithms interesting is that they might be able to solve some problems faster than classical algorithms because the quantum superposition and quantum entanglement that quantum algorithms exploit probably cannot be efficiently simulated on classical computers (see Quantum supremacy). The best-known algorithms are Shor's algorithm for factoring and Grover's algorithm for searching an unstructured database or an unordered list. Shor's algorithms runs much (almost exponentially) faster than the best-known classical algorithm for factoring, the general number field sieve. Grover's algorithm runs quadratically faster than the best possible classical algorithm for the same task, a linear search.
- Hypernym
- Algorithm
- Is primary topic of
- Quantum algorithm
- Label
- enQuantum algorithm
- Link from a Wikipage to an external page
- bastion.center/the-quantum-search-algorithm/
- www.cs.umd.edu/~amchilds/qa/
- quantumalgorithmzoo.org
- Link from a Wikipage to another Wikipage
- Abelian group
- Algorithm
- Amplitude amplification
- Andris Ambainis
- Ansatz
- Aram Harrow
- Black-box
- Black box group
- Boson
- BPP (complexity)
- BQP
- Category:Emerging technologies
- Category:Quantum algorithms
- Category:Quantum computing
- Category:Theoretical computer science
- Chern-Simons
- Clique (graph theory)
- Commutativity
- Complexity class
- Computer
- Condition number
- De Broglie–Bohm theory
- Decision problems
- Dihedral group
- Discrete Fourier transform
- Discrete logarithm
- Exponential sum
- File:Deutsch-Jozsa-algorithm-quantum-circuit.png
- Fock state
- Gauss sum
- General number field sieve
- GF(2)
- Graph isomorphism
- Grover's algorithm
- Hadamard transform
- Hamiltonian oracle model
- Hidden subgroup problem
- HOMFLY polynomial
- Integer factorization
- Jones polynomial
- Lattice problems
- Linear optical quantum computing
- Linear search
- Measurement
- NP-complete
- NP-completeness
- Oracle machine
- Oracle separation
- P (complexity)
- Pell's equation
- Permanent (mathematics)
- Phase kick-back
- Polynomial time
- Primality test
- Principal ideal
- Probability distribution
- Quantum algorithm for linear systems of equations
- Quantum approximate optimization algorithm
- Quantum circuit
- Quantum complexity theory
- Quantum computation
- Quantum computer
- Quantum computing
- Quantum counting
- Quantum entanglement
- Quantum Fourier transform
- Quantum gate
- Quantum invariant
- Quantum logic gate
- Quantum machine learning
- Quantum optimization algorithms
- Quantum phase estimation algorithm
- Quantum sort
- Quantum superposition
- Quantum supremacy
- Quantum walk
- Qubit
- Random walk
- Reduction (complexity)
- Ring (mathematics)
- Seth Lloyd
- Shor's algorithm
- Sparse matrix
- Symmetric group
- System of linear equations
- Topological quantum field theory
- Turaev-Viro invariant
- Undecidable problem
- Unitarity
- Variational quantum eigensolver
- Yaoyun Shi
- Other
- enyes
- Quantum
- enyes
- SameAs
- 2Te55
- Algorisme quàntic
- Algoritmo cuántico
- Algoritmo quântico
- Algoritmo quantistico
- Algorytm kwantowy
- Kvantalgoritm
- Kvanttialgoritmi
- Kwantumalgoritme
- m.04f730w
- Q2623817
- Quantenalgorithmus
- Quantum algorithm
- Thuật toán lượng tử
- Квантовый алгоритм
- الگوریتم کوانتومی
- خوارزمية الكم
- কোয়ান্টাম অ্যালগোরিদম
- குவாண்டம் படிமுறைத்தீர்வு
- ക്വാണ്ടം അൽഗോരിതം
- 量子演算法
- Subject
- Category:Emerging technologies
- Category:Quantum algorithms
- Category:Quantum computing
- Category:Theoretical computer science
- Thumbnail
- WasDerivedFrom
- Quantum algorithm?oldid=1112307775&ns=0
- WikiPageLength
- 37841
- Wikipage page ID
- 632489
- Wikipage revision ID
- 1112307775
- WikiPageUsesTemplate
- Template:Citation needed
- Template:Cite book
- Template:Cite journal
- Template:Emerging technologies
- Template:Main
- Template:Quantum computing
- Template:Quantum mechanics topics
- Template:Reflist
- Template:Rp
- Template:Short description
- Template:Use American English
- Template:Use dmy dates
