swap_horiz quantum supremacy Alternatives

1

quantum error correction

Quantum error correction is a technique used to maintain the integrity of quantum information. It addresses the unavoida...

Fault Tolerance Computing Noise Error Correction

9.48 Excellent

2

quantum simulation

Quantum simulation employs controllable quantum systems to replicate the dynamics of intricate quantum phenomena such as...

Simulation Chemistry Computing Many Body

9.44 Excellent

3

qubit

A qubit is a fundamental unit of quantum information leveraging quantum mechanics. It differs from a classical bit by ex...

Computing Information State Two Level

9.41 Excellent

4

quantum gate

A quantum gate represents a basic building block for quantum computation. It’s a unitary transformation applied to one o...

Operation Computing Circuit Unitary

9.32 Excellent

5

quantum fault tolerance

Quantum fault tolerance is a technique designed for quantum computing. It addresses the significant challenge of maintai...

Computing Reliability Error Correction Threshold

9.29 Excellent

6

quantum Fourier transform

The Quantum Fourier Transform is a subroutine within quantum algorithms. It performs a discrete Fourier transform on qua...

Algorithm Computing Subroutine Transform

9.28 Excellent

7

gate-model quantum computing

The gate model represents a fundamental approach to quantum computing. It describes computation as the sequential applic...

Computing Model Universal Circuit

9.21 Excellent

8

threshold theorem

The threshold theorem is a fundamental concept in quantum error correction. It dictates that for large-scale quantum com...

Theory Fault Tolerance Computing Error Correction

9.14 Excellent

9

quantum phase estimation

Quantum Phase Estimation is a quantum computing algorithm designed to precisely calculate the eigenvalues of unitary ope...

Algorithm Computing Eigenvalue Subroutine

9.12 Excellent

10

Hamiltonian simulation

A Hamiltonian simulation employs quantum circuits to mimic the evolution of quantum systems over time. It precisely mode...

Simulation Algorithm Computing Hamiltonian

9.07 Excellent

11

topological quantum computing

Topological quantum computing explores a new approach to building quantum computers. It leverages anyons – quasiparticle...

Fault Tolerance Computing Braiding Anyon

8.73 Great

12

magic state distillation

Magic state distillation refines the quality of complex entangled quantum states, often termed “magic states.” These sta...

Resource Fault Tolerance Computing Non Clifford

8.71 Great

13

measurement-based quantum computing

Measurement-based quantum computing leverages entanglement for computation. It relies on precisely measuring a pre-exist...

Computing Model Measurement Cluster State

8.58 Great

14

BB84 protocol

The BB84 protocol represents a foundational achievement in quantum cryptography. Developed by Charles Bennett and Gilles...

History Cryptography Photons Qkd

8.56 Great

15

Shor code

Shor’s code is a specific type of quantum circuit designed for stabilizer operations. It’s notable as a fundamental buil...

History Stabilizer Error Correction Nine Qubit

8.54 Great

16

non-Abelian anyon

A non-Abelian anyon is a fundamental particle in quantum mechanics exhibiting unusual properties. It’s notable for its b...

Computing Topological Quasiparticle Braiding

8.47 Great

17

quantum advantage

Quantum advantage signifies a demonstrable capability of quantum computers to outperform classical computers in solving...

Performance Computing Application Benchmark

8.08 Great

18

random circuit sampling

Random circuit sampling is a computational problem used in quantum computing to demonstrate quantum advantage or "suprem...

Computing Supremacy Benchmark Sampling

7.58 Good

19

boson sampling

Boson sampling is a computational task involving measuring the output photon counts of indistinguishable bosons passing...

Photonic Benchmark Sampling Complexity

7.33 Good

20

instantaneous quantum polynomial-time

Instantaneous quantum polynomial-time suggests that certain quantum computations could, theoretically, complete in time...

Computing Sampling Complexity Iqp

6.88 Fair