Quantum supremacy

136nodes240rels

100%

Community · Quantum supremacy

Summary

In quantum computing, quantum supremacy or quantum advantage is the goal of demonstrating that a programmable quantum computer can solve a problem that no classical computer can solve in any feasible amount of time, irrespective of the usefulness of the problem.

41 words

SourcesWikipedia

Connections12

Coined the term quantum supremacy
The theoretical physicist introduced the term in 2012 to describe the milestone where quantum devices perform tasks that classical computers cannot.
SourcesWikipedia Wikidata Wikipedia Wikidata
First experimental demonstration of quantum supremacy
This 53-qubit processor developed by Google was used in 2019 to perform a specific calculation in 200 seconds that would take a classical supercomputer thousands of years.
SourcesWikipedia Wikidata Wikipedia Wikidata
Field of study defining the goal of quantum supremacy
Quantum supremacy is the primary benchmark used to validate the progress and potential of the broader field of quantum computing.
SourcesWikipedia Wikidata Wikipedia Wikidata
demonstrated by Google Quantum AI using the Sycamore processor
Google Quantum AI famously claimed to have achieved quantum supremacy in 2019 by performing a specific calculation on the Sycamore processor that would be infeasible for classical supercomputers.
SourcesWikipedia Wikidata Wikipedia Wikidata
Era of hardware where quantum supremacy is pursued
Quantum supremacy is currently sought using Noisy Intermediate-Scale Quantum devices, which lack full error correction but possess enough qubits to potentially outperform classical systems.
SourcesWikipedia Wikidata Wikipedia Wikidata
Benchmark problem used to prove quantum supremacy
This specific task involves sampling from the output distribution of a random quantum circuit, which is computationally difficult for classical machines to simulate efficiently.
SourcesWikipedia Wikidata Wikipedia Wikidata
Model used to execute quantum supremacy experiments
Quantum supremacy is typically demonstrated by running complex quantum circuits that are too deep or wide for classical simulation.
SourcesWikipedia Wikidata Wikipedia Wikidata
Benchmark for measuring quantum advantage
The claim of quantum supremacy is validated by showing that the best-known classical algorithms for simulating the quantum circuit are significantly slower than the quantum hardware.
SourcesWikipedia Wikidata Wikipedia Wikidata
Theoretical foundation for defining quantum advantage
Quantum supremacy relies on the gap between complexity classes, specifically demonstrating that quantum circuits can solve problems outside the reach of classical polynomial-time algorithms.
SourcesWikipedia Wikidata Wikipedia Wikidata
Primary obstacle to achieving quantum supremacy
Decoherence limits the number of gates that can be performed before the quantum state collapses, making it difficult to maintain the fidelity required for supremacy experiments.
SourcesWikipedia Wikidata Wikipedia Wikidata
Tools used to achieve quantum supremacy
Specific quantum algorithms, such as those for random circuit sampling, are designed to demonstrate the computational advantage over classical algorithms.
SourcesWikipedia Wikidata Wikipedia Wikidata
Necessary technology for future quantum supremacy
While current supremacy experiments are performed on noisy devices, error correction is required to scale quantum computers to solve useful, non-trivial problems.
SourcesWikipedia Wikidata Wikipedia Wikidata

Facts