Lecture

Introduction to Quantum Computing

Graph Chat

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

In course

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 cover some aspects of quantum information processing, quant ...

Description

This lecture introduces the basics of quantum computing, starting with separable states and moving on to quantum circuits involving single qubit gates, two-qubit gates, measurements, and a universal set of gates. The examples covered include Bell states generation, the no-cloning theorem, and quantum teleportation.

Instructor

Jean-Philippe Brantut

I did my PhD at the Institut d'Optique under the direction of Philippe Bouyer and Alain Aspect, before moving to ETHZ in the group of Tilman Esslinger, first as a post-doc then as a senior scientist. There I developed in particular the method allowing for a quantum simulation of nano-electronic devices with ultracold quantum gases.Since september 2016, I hold the Fondation Sandoz chair in physics of quantum gases at EPFL. There, my group has developed the first cold atoms machine combining Fermi gases with cavity-quantum electrodynamics. We use it to explore new ways of measuring and manipulating quantum matter.

Official source

Ontological neighbourhood

Theoretical computer science

Theory of computation: Quantum computing

Related concepts (26)

Quantum computing

A quantum computer is a computer that exploits quantum mechanical phenomena. At small scales, physical matter exhibits properties of both particles and waves, and quantum computing leverages this behavior, specifically quantum superposition and entanglement, using specialized hardware that supports the preparation and manipulation of quantum states. Classical physics cannot explain the operation of these quantum devices, and a scalable quantum computer could perform some calculations exponentially faster than any modern "classical" computer.

Quantum logic gate

In quantum computing and specifically the quantum circuit model of computation, a quantum logic gate (or simply quantum gate) is a basic quantum circuit operating on a small number of qubits. They are the building blocks of quantum circuits, like classical logic gates are for conventional digital circuits. Unlike many classical logic gates, quantum logic gates are reversible. It is possible to perform classical computing using only reversible gates.

No-cloning theorem

In physics, the no-cloning theorem states that it is impossible to create an independent and identical copy of an arbitrary unknown quantum state, a statement which has profound implications in the field of quantum computing among others. The theorem is an evolution of the 1970 no-go theorem authored by James Park, in which he demonstrates that a non-disturbing measurement scheme which is both simple and perfect cannot exist (the same result would be independently derived in 1982 by Wootters and Zurek as well as Dieks the same year).

No-broadcasting theorem

In physics, the no-broadcasting theorem is a result of quantum information theory. In the case of pure quantum states, it is a corollary of the no-cloning theorem. The no-cloning theorem for pure states says that it is impossible to create two copies of an unknown state given a single copy of the state. Since quantum states cannot be copied in general, they cannot be broadcast. Here, the word "broadcast" is used in the sense of conveying the state to two or more recipients.

No-deleting theorem

In physics, the no-deleting theorem of quantum information theory is a no-go theorem which states that, in general, given two copies of some arbitrary quantum state, it is impossible to delete one of the copies. It is a time-reversed to the no-cloning theorem, which states that arbitrary states cannot be copied. This theorem seems remarkable, because, in many senses, quantum states are fragile; the theorem asserts that, in a particular case, they are also robust. Physicist Arun K. Pati along with Samuel L.

Related lectures (64)

Quantum Circuits: Gates and Teleportation

Covers quantum circuits, gates, qubits, teleportation, and quantum communication principles.

Introduction to Quantum Computing

Covers the basics of quantum computing, including gates, measurements, and key examples.

Quantum Computing: Fundamentals and Applications

Covers the fundamentals of quantum computing, including qubit realization, scalable quantum computers, quantum communication, and quantum algorithms.

Quantum Circuits: Classic Circuits

Explores classic circuits in quantum computing, including Boolean functions and reversible gates.

Quantum Compilation: Synthesis and Decomposition