About: Quantum algorithm

Facets (new session)
Description
Metadata
Settings
- Rule:
- Inverse Functional Properties:
- "Same As":

About: Quantum algorithm Goto Sponge NotDistinct Permalink

An Entity of Type : dbo:Software, within Data Space : el.dbpedia.org associated with source document(s)

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.

Attributes	Values
rdf:type	software
rdfs:label	Quantum algorithm (en)
rdfs:comment	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. (en)
sameAs	Quantum algorithm Quantum algorithm
dbp:wikiPageUsesTemplate	dbt:Citation_needed dbt:Cite_book dbt:Cite_journal dbt:Main dbt:Reflist dbt:Rp dbt:Short_description dbt:Use_American_English dbt:Use_dmy_dates dbt:Emerging_technologies dbt:Quantum_computing dbt:Quantum_mechanics_topics
Subject	Emerging technologies Quantum algorithms Quantum computing Quantum information science Theoretical computer science
gold:hypernym	Algorithm
prov:wasDerivedFrom	http://en.wikipedia.org/wiki/Quantum_algorithm?oldid=1068864959&ns=0
Wikipage page ID	632489 (xsd:integer)
page length (characters) of wiki page	37374 (xsd:nonNegativeInteger)
Wikipage revision ID	1068864959 (xsd:integer)
has abstract	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. 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. (en)
foaf:isPrimaryTopicOf	http://en.wikipedia.org/wiki/Quantum_algorithm
is Wikipage redirect of	Quantum algorithms
is Link from a Wikipage to another Wikipage of	Aanderaa–Karp–Rosenberg conjecture Aharonov–Jones–Landau algorithm Algorithm Amplitude amplification Ancilla bit Andrew Childs Andris Ambainis Apoorva D. Patel Arrow of time BHT algorithm BQP Bernstein–Vazirani algorithm Binary search algorithm Black box group Centre for Quantum Technologies Giuseppe Carleo David Deutsch Church–Turing thesis Cristopher Moore List of British innovations and discoveries Clifford gates Cloud-based quantum computing Computational complexity Algorithmic complexity Computing Hidden shift problem Hidden subgroup problem List of Wolfson College, Oxford, people List of algorithm general topics List of companies involved in quantum computing or communication Michele Mosca Micius Quantum Prize Element distinctness problem Encryption IBM Quantum Experience Index of physics articles (Q) Deutsch–Jozsa algorithm DiVincenzo's criteria Ewin Tang Exact quantum polynomial time Grover's algorithm Hadamard test (quantum computation) Hadamard transform Hamiltonian simulation
is known for of	Andrew Childs Andris Ambainis

Faceted Search & Find service v1.17_git151 as of Feb 20 2025

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 07.20.3240 as of Nov 11 2024, on Linux (x86_64-ubuntu_focal-linux-gnu), Single-Server Edition (72 GB total memory, 1 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2025 OpenLink Software