Discover published sets by community

The quantum analogue of the discrete Fourier transform, a part of many quantum algorithms.

A quantum algorithm providing quadratic speedup for unstructured search problems.

A physical phenomenon that occurs when pairs or groups of particles interact in ways such that the quantum state of each particle cannot be described independently of the others.

Cryptography methods designed to be secure against the potential threat posed by quantum computers.

A step-by-step procedure, based on quantum mechanics principles, used for solving a problem on a quantum computer.

A theorem stating that it's impossible to create an identical copy of an arbitrary unknown quantum state.

A secure communication method that uses quantum mechanics to encrypt and decrypt messages.

A model for quantum computation representing a sequence of quantum gates and measurements applied to qubits.

A specific quantum state of two qubits that are maximally entangled.

The point at which quantum computers perform computations that are unfeasible for classical computers in a reasonable time frame.

A process by which the quantum state of a particle is transmitted exactly from one location to another with the help of classical communication and a previously shared quantum entanglement.

A model of computation that operates by slowly varying the Hamiltonian of the quantum system.

A quantum phenomenon where particles become interconnected and the state of one immediately influences the state of another, regardless of distance.

A mathematical entity that provides a probability distribution for the outcomes of each possible measurement on a system, described by a vector in a Hilbert space

The process by which a quantum system loses its quantum properties due to interaction with an external environment, resulting in a classical state.

A performance metric for quantum computers that measures the size and quality of entangled qubit states they can maintain.

A quantum property allowing a particle to be in a combination of all possible states simultaneously.

A set of methods to protect quantum information against decoherence and other quantum noise.

A fundamental operation on qubits that changes their state and is the quantum equivalent of a classical logic gate.

The first quantum algorithm that illustrates quantum computing's speed advantage for certain problems over classical methods.

A method used to find the global minimum of a function by exploiting quantum tunneling.

A geometrical representation of the pure state space of a two-level quantum mechanical system (qubit).

A quantum phenomenon where particles can cross barriers higher than their kinetic energy, impossible in classical physics.

A one-qubit quantum gate that transforms a qubit into an equal superposition of two states, if it starts from a basis state.

The basic unit of quantum information, representing a two-state quantum-mechanical system.

Using a quantum computer to simulate complex quantum systems that are intractable for classical computers.

A theoretical quantum computer that uses topological states of matter to preserve quantum coherence and perform quantum computations.

The ability of a quantum system to retain the phase relationships between its states, a crucial aspect for quantum computing.

A quantum algorithm for integer factorization exponentially faster than the best-known classical algorithm.