Quantum supremacy
In quantum computing, quantum supremacy or quantum advantage is the goal of demonstrating that a programmable quantum device can solve a problem that no classical computer can solve in any feasible amount of time (irrespective of the usefulness of the problem). Conceptually, quantum supremacy involves both the engineering task of building a powerful quantum computer and the computational-complexity-theoretic task of finding a problem that can be solved by that quantum computer and has a superpolynomial speedup over the best known or possible classical algorithm for that task. The term was coined by John Preskill in 2012, but the concept of a quantum computational advantage, specifically for simulating quantum systems, dates back to Yuri Manin's (1980) and Richard Feynman's (1981) proposals
Wikipage disambiguates
Wikipage redirect
2010s in science and technology2017 in science20192019 in science2019 in the United States2020 in scienceAlexis KirkeBuzzwordHartmut NevenHistory of computing hardwareJiuzhang (quantum computer)John PreskillLinear optical quantum computingList of companies involved in quantum computing or communicationMonika Schleier-SmithQuantum Artificial Intelligence LabQuantum advantageQuantum algorithmQuantum computingQuantum contextualityQuantum informationQuantum optimization algorithmsSergio BoixoSuperconducting quantum computingSupremacySycamore processorTimeline of computing 2010–2019Timeline of quantum computing and communication
Link from a Wikipage to another Wikipage
seeAlso
primaryTopic
Quantum supremacy
In quantum computing, quantum supremacy or quantum advantage is the goal of demonstrating that a programmable quantum device can solve a problem that no classical computer can solve in any feasible amount of time (irrespective of the usefulness of the problem). Conceptually, quantum supremacy involves both the engineering task of building a powerful quantum computer and the computational-complexity-theoretic task of finding a problem that can be solved by that quantum computer and has a superpolynomial speedup over the best known or possible classical algorithm for that task. The term was coined by John Preskill in 2012, but the concept of a quantum computational advantage, specifically for simulating quantum systems, dates back to Yuri Manin's (1980) and Richard Feynman's (1981) proposals
has abstract
In quantum computing, quantum ...... cy under significant scrutiny.
@en
Link from a Wikipage to an external page
Wikipage page ID
54,452,801
page length (characters) of wiki page
Wikipage revision ID
1,023,791,397
Link from a Wikipage to another Wikipage
wikiPageUsesTemplate
comment
In quantum computing, quantum ...... ard Feynman's (1981) proposals
@en
label
Quantum supremacy
@en