**Are you an EPFL student looking for a semester project?**

Work with us on data science and visualisation projects, and deploy your project as an app on top of GraphSearch.

Concept# Bell state

Summary

The Bell's states or EPR pairs are specific quantum states of two qubits that represent the simplest examples of quantum entanglement; conceptually, they fall under the study of quantum information science. The Bell's states are a form of entangled and normalized basis vectors. This normalization implies that the overall probability of the particle being in one of the mentioned states is 1: . Entanglement is a basis-independent result of superposition. Due to this superposition, measurement of the qubit will "collapse" it into one of its basis states with a given probability. Because of the entanglement, measurement of one qubit will "collapse" the other qubit to a state whose measurement will yield one of two possible values, where the value depends on which Bell's state the two qubits are in initially. Bell's states can be generalized to certain quantum states of multi-qubit systems, such as the GHZ state for 3 or more subsystems.
Understanding of Bell's states is useful in analysis of quantum communication, such as superdense coding and quantum teleportation. The no-communication theorem prevents this behavior from transmitting information faster than the speed of light.
The Bell states are four specific maximally entangled quantum states of two qubits. They are in a superposition of 0 and 1 - a linear combination of the two states. Their entanglement means the following:
The qubit held by Alice (subscript "A") can be in a superposition of 0 and 1. If Alice measured her qubit in the standard basis, the outcome would be either 0 or 1, each with probability 1/2; if Bob (subscript "B") also measured his qubit, the outcome would be the same as for Alice. Thus, Alice and Bob would each seemingly have random outcome. Through communication they would discover that, although their outcomes separately seemed random, these were perfectly correlated.
This perfect correlation at a distance is special: maybe the two particles "agreed" in advance, when the pair was created (before the qubits were separated), which outcome they would show in case of a measurement.

Official source

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Related concepts (22)

Related publications (1)

Related courses (19)

Bell state

The Bell's states or EPR pairs are specific quantum states of two qubits that represent the simplest examples of quantum entanglement; conceptually, they fall under the study of quantum information science. The Bell's states are a form of entangled and normalized basis vectors. This normalization implies that the overall probability of the particle being in one of the mentioned states is 1: . Entanglement is a basis-independent result of superposition.

Controlled NOT gate

In computer science, the controlled NOT gate (also C-NOT or CNOT), controlled-X gate, controlled-bit-flip gate, Feynman gate or controlled Pauli-X is a quantum logic gate that is an essential component in the construction of a gate-based quantum computer. It can be used to entangle and disentangle Bell states. Any quantum circuit can be simulated to an arbitrary degree of accuracy using a combination of CNOT gates and single qubit rotations. The gate is sometimes named after Richard Feynman who developed an early notation for quantum gate diagrams in 1986.

Superdense coding

In quantum information theory, superdense coding (also referred to as dense coding) is a quantum communication protocol to communicate a number of classical bits of information by only transmitting a smaller number of qubits, under the assumption of sender and receiver pre-sharing an entangled resource. In its simplest form, the protocol involves two parties, often referred to as Alice and Bob in this context, which share a pair of maximally entangled qubits, and allows Alice to transmit two bits (i.e.

CS-308: Introduction to quantum computation

The course introduces the paradigm of quantum computation in an axiomatic way. We introduce the notion of quantum bit, gates, circuits and we treat the most important quantum algorithms. We also touch

PHYS-454: Quantum optics and quantum information

This lecture describes advanced concepts and applications of quantum optics. It emphasizes the connection with ongoing research, and with the fast growing field of quantum technologies. The topics cov

COM-309: Introduction to quantum information processing

Information is processed in physical devices. In the quantum regime the concept of classical bit is replaced by the quantum bit. We introduce quantum principles, and then quantum communications, key d

Related lectures (163)

Quantum Measurement: General DescriptionPHYS-758: Advanced Course on Quantum Communication

Explores the general description of quantum measurements, including post-measurement states and Kraus operators.

Quantum Computation Delegation

Explores fully classical qubits, blind quantum computing, and verifiability in quantum delegation protocols.

Quantum Source CodingPHYS-758: Advanced Course on Quantum Communication

Covers entropic notions in quantum sources, Shannon entropy, Von Neumann entropy, and source coding.

Frédéric Mila, Pierre Marcel Nataf, Kianna Wan

We present a method for the exact diagonalization of the SU(N) Heisenberg interaction Hamiltonian using Young tableaus to work directly in each irreducible representation of the global SU(N) group. This generalized scheme is applicable to chains consisting of several particles per site, with any SU(N) symmetry at each site. Extending some of the key results of substitutional analysis, we demonstrate how basis states can be efficiently constructed for the relevant SU(N) subsector, which, especially with increasing values of N or numbers of sites, has a much smaller dimension than the full Hilbert space. This allows us to analyze systems of larger sizes than can be handled by existing techniques. We apply this method to investigate the presence of edge states in SU(N) Heisenberg and Affleck-Kennedy-Lieb-Tasaki Hamiltonians.

2017