This HTML5 document contains 54 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

PrefixIRI
dcthttp://purl.org/dc/terms/
yago-reshttp://yago-knowledge.org/resource/
dbohttp://dbpedia.org/ontology/
foafhttp://xmlns.com/foaf/0.1/
dbthttp://dbpedia.org/resource/Template:
rdfshttp://www.w3.org/2000/01/rdf-schema#
freebasehttp://rdf.freebase.com/ns/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
owlhttp://www.w3.org/2002/07/owl#
n11http://en.wikipedia.org/wiki/
dbphttp://dbpedia.org/property/
dbchttp://dbpedia.org/resource/Category:
provhttp://www.w3.org/ns/prov#
xsdhhttp://www.w3.org/2001/XMLSchema#
n13http://api.nytimes.com/svc/semantic/v2/concept/name/nytd_des/
dbpedia-commonshttp://commons.dbpedia.org/resource/
dbrhttp://dbpedia.org/resource/
n14http://d-nb.info/gnd/

Statements

Subject Item
dbr:Quantum_computing
rdf:type
owl:Thing
rdfs:label
Quantum computing
rdfs:comment
Quantum computing is a type of computation that harnesses the collective properties of quantum states, such as superposition, interference, and entanglement, to perform calculations. The devices that perform quantum computations are known as quantum computers. Though current quantum computers are too small to outperform usual (classical) computers for practical applications, they are believed to be capable of solving certain computational problems, such as integer factorization (which underlies RSA encryption), substantially faster than classical computers. The study of quantum computing is a subfield of quantum information science.
rdfs:seeAlso
dbr:Quantum_state dbr:Computability_theory
owl:sameAs
freebase:m.02pr80l freebase:m.069kd n13:Quantum%20Computing n14:4533372-5 yago-res:Quantum_computing dbpedia-commons:Quantum_computer
dbp:wikiPageUsesTemplate
dbt:Main dbt:Mvar dbt:Anchor dbt:Quantum_computing dbt:Short_description dbt:Emerging_technologies dbt:Commons dbt:Citation_needed dbt:Springer dbt:Use_dmy_dates dbt:Who dbt:Authority_control dbt:Self-published_inline dbt:Colend dbt:Refbegin dbt:Refend dbt:Cite_book dbt:See_also dbt:Reflist dbt:Tmath dbt:Computer_science dbt:Cite_journal dbt:Rp dbt:Cite_web dbt:Quantum_mechanics_topics dbt:Cols
dct:subject
dbc:Quantum_computing dbc:Quantum_information_science dbc:Computational_complexity_theory dbc:Quantum_cryptography dbc:Emerging_technologies dbc:Classes_of_computers dbc:Models_of_computation dbc:Theoretical_computer_science dbc:Computer-related_introductions_in_1980 dbc:Open_problems dbc:Information_theory
prov:wasDerivedFrom
n11:Quantum_computing?oldid=1074043806&ns=0
dbo:wikiPageID
25220
dbo:wikiPageLength
90760
dbo:wikiPageRevisionID
1074043806
dbo:abstract
Quantum computing is a type of computation that harnesses the collective properties of quantum states, such as superposition, interference, and entanglement, to perform calculations. The devices that perform quantum computations are known as quantum computers. Though current quantum computers are too small to outperform usual (classical) computers for practical applications, they are believed to be capable of solving certain computational problems, such as integer factorization (which underlies RSA encryption), substantially faster than classical computers. The study of quantum computing is a subfield of quantum information science. Quantum computing began in 1980 when physicist Paul Benioff proposed a quantum mechanical model of the Turing machine. Richard Feynman and Yuri Manin later suggested that a quantum computer had the potential to simulate things a classical computer could not feasibly do. In 1994, Peter Shor developed a quantum algorithm for finding the prime factors of an integer with the potential to decrypt RSA-encrypted communications. In 1998 Isaac Chuang, Neil Gershenfeld and Mark Kubinec created the first two-qubit quantum computer that could perform computations. Despite ongoing experimental progress since the late 1990s, most researchers believe that "fault-tolerant quantum computing [is] still a rather distant dream." In recent years, investment in quantum computing research has increased in the public and private sectors. On 23 October 2019, Google AI, in partnership with the U.S. National Aeronautics and Space Administration (NASA), claimed to have performed a quantum computation that was infeasible on any classical computer, but whether this claim was or is still valid is a topic of active research. There are several types of quantum computers (also known as quantum computing systems), including the quantum circuit model, quantum Turing machine, adiabatic quantum computer, one-way quantum computer, and various quantum cellular automata. The most widely used model is the quantum circuit, based on the quantum bit, or "qubit", which is somewhat analogous to the bit in classical computation. A qubit can be in a 1 or 0 quantum state, or in a superposition of the 1 and 0 states. When it is measured, however, it is always 0 or 1; the probability of either outcome depends on the qubit's quantum state immediately prior to measurement. Efforts towards building a physical quantum computer focus on technologies such as transmons, ion traps and topological quantum computers, which aim to create high-quality qubits. These qubits may be designed differently, depending on the full quantum computer's computing model, whether quantum logic gates, quantum annealing, or adiabatic quantum computation. There are currently a number of significant obstacles to constructing useful quantum computers. It is particularly difficult to maintain qubits' quantum states, as they suffer from quantum decoherence and state fidelity. Quantum computers therefore require error correction. Any computational problem that can be solved by a classical computer can also be solved by a quantum computer. Conversely, any problem that can be solved by a quantum computer can also be solved by a classical computer, at least in principle given enough time. In other words, quantum computers obey the Church–Turing thesis. This means that while quantum computers provide no additional advantages over classical computers in terms of computability, quantum algorithms for certain problems have significantly lower time complexities than corresponding known classical algorithms. Notably, quantum computers are believed to be able to quickly solve certain problems that no classical computer could solve in any feasible amount of time—a feat known as "quantum supremacy." The study of the computational complexity of problems with respect to quantum computers is known as quantum complexity theory.
foaf:isPrimaryTopicOf
n11:Quantum_computing