swap_horiz boson sampling Alternatives

1

Shor's algorithm

Shor's algorithm uses quantum computation to factor integers efficiently and can also solve discrete logarithm problems....

Algorithm Cryptography Factoring Speedup

9.55 Brilliant

2

quantum error correction

Quantum error correction protects quantum information by encoding a logical state across several physical qubits. The en...

Fault Tolerance Computing Noise Error Correction

9.48 Excellent

3

quantum simulation

Quantum simulation uses a controllable quantum system to investigate the behavior of another quantum system. The target...

Simulation Chemistry Computing Many Body

9.44 Excellent

4

quantum teleportation

Quantum teleportation transfers an unknown quantum state from one system to another using shared entanglement and classi...

Communication Protocol Entanglement State Transfer

9.42 Excellent

5

qubit

The basic unit of quantum information, a qubit is a system with two distinguishable basis states conventionally labeled...

Computing Information State Two Level

9.41 Excellent

6

CNOT gate

The CNOT gate is a core component of quantum computing. It operates on two qubits, creating entanglement by flipping one...

Gate Two Qubit Clifford Entangling

9.36 Excellent

7

CHSH inequality

The CHSH inequality is a mathematical constraint derived from Bell’s theorem. It defines an upper limit for correlations...

Foundation Entanglement Correlation Bell Test

9.34 Excellent

8

quantum gate

Quantum circuits are built from gates that perform controlled operations on qubits. In the standard ideal circuit model,...

Operation Computing Circuit Unitary

9.32 Excellent

9

quantum fault tolerance

Reliable quantum computation requires more than storing information in an error-correcting code. Quantum fault tolerance...

Computing Reliability Error Correction Threshold

9.29 Excellent

10

density matrix

A density matrix represents the state of a quantum system in a form that can describe both pure states and mixed states....

Mixed Formalism State Open Systems

9.28 Excellent

11

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

12

surface code

Surface code represents a leading approach to building practical quantum computers. It employs pairs of entangled qubits...

Fault Tolerance Stabilizer Error Correction Topological

9.24 Excellent

13

Grover's algorithm

Grover's algorithm represents a fundamental advancement in search techniques utilizing quantum mechanics. It provides a...

Search Algorithm Speedup Amplitude

9.22 Excellent

14

Bell state

A Bell state describes a fundamental property in quantum mechanics involving the linked behavior of multiple subatomic p...

Entanglement State Two Qubit Basis

9.21 Excellent

15

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

16

quantum advantage

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

Performance Computing Application Benchmark

8.08 Great

17

linear optical quantum computing

Linear optical quantum computing utilizes photons and beam splitters to perform quantum computations, relying on precise...

Optics Computing Photonic Model

7.82 Good

18

quantum supremacy

Quantum supremacy refers to the theoretical point where a quantum computer can solve a specific problem that no classica...

History Computing Benchmark Complexity

7.70 Good

19

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

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