swap_horiz boson sampling Alternatives

1

Shor's algorithm

Shor's algorithm is a quantum computation method designed for integer factorization. It achieves an exponential speedup...

Algorithm Cryptography Factoring Speedup

9.6 Brilliant

2

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.5 Brilliant

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.4 Excellent

4

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.4 Excellent

5

quantum teleportation

Quantum teleportation is a process enabling the transfer of a quantum state between two particles. It relies on the phen...

Communication Protocol Entanglement State Transfer

9.4 Excellent

6

quantum simulation

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

Simulation Chemistry Computing Many Body

9.4 Excellent

7

density matrix

The density matrix is a mathematical tool used in quantum mechanics to represent the state of a quantum system. It accou...

Mixed Formalism State Open Systems

9.3 Excellent

8

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.3 Excellent

9

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.3 Excellent

10

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.3 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.3 Excellent

12

integer quantum Hall effect

The integer quantum Hall effect describes a phenomenon in two-dimensional materials where electrical current flow is pre...

Matter Transport Topology Hall

9.2 Excellent

13

Hadamard gate

The Hadamard gate is a core component in quantum computing. It operates on a single qubit, converting its initial state...

Gate Qubit Superposition Clifford

9.2 Excellent

14

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.2 Excellent

15

Grover's algorithm

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

Search Algorithm Speedup Amplitude

9.2 Excellent

16

quantum advantage

Quantum advantage demonstrates that a quantum computer can solve a specific computational problem faster or more efficie...

Performance Computing Application Benchmark

8.1 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.8 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.7 Good

19

random circuit sampling

Random circuit sampling generates output bitstrings from a quantum computer executing randomly generated quantum circuit...

Computing Supremacy Benchmark Sampling

7.6 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.9 Fair