Discover published sets by community

The fundamental unit of quantum information, analogous to a bit in classical computing. Qubits can exist in a superposition of states, enabling complex computations.

A principle of quantum mechanics where a quantum system can be in multiple states at once. In quantum computing, it allows a qubit to represent both 0 and 1 simultaneously, increasing computational power.

A quantum phenomenon where two qubits become linked, such that the state of one qubit can instantaneously affect the state of another, regardless of distance. Essential for quantum teleportation and certain quantum algorithms.

An operation that changes the state of qubits, similar to logic gates in classical computing. Quantum gates are reversible and can manipulate the probabilities of a qubit's state.

A sequence of quantum gates applied to qubits to perform a quantum algorithm. A quantum circuit models computations in a way that takes advantage of quantum properties like superposition and entanglement.

A geometric representation of a qubit's state as a point on the surface of a sphere. The poles represent the classical states 0 and 1, while any other point on the surface represents a superposition.

The process by which quantum information is lost to the surrounding environment, causing a qubit to lose its quantum properties and behave classically. It is a significant challenge for quantum computing.

A set of methods to protect quantum information from errors due to decoherence and other quantum noise. These techniques allow for the maintenance of coherent quantum states over longer periods.

A principle stating that it is impossible to create an identical copy of an arbitrary unknown quantum state. This theorem has profound implications for quantum communication and cryptography.

A protocol for transferring quantum information from one qubit to another, over any distance, without moving the physical qubits themselves. Relies on entanglement and classical communication.

A step-by-step procedure, designed for execution on a quantum computer, that leverages quantum phenomena to outperform classical algorithms for specific problems.

A quantum algorithm that determines whether a given function is constant or balanced (producing an equal number of outputs of 0s and 1s) with a single query, showcasing quantum parallelism.

The milestone where a quantum computer performs a task or calculation that is prohibitively difficult for classical computers, demonstrating a potential advantage of quantum over classical computing.

A quantum algorithm that can efficiently factor large numbers, significantly faster than the best-known classical algorithms. Its implications for cryptography are notable, threatening the security of many encryption schemes.