Lecture

Quantum and Nanocomputing

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.

Description

This lecture covers the fundamentals of quantum computing, including qubits, superposition, quantum gates, quantum Fourier transform, and Shor's algorithm for communication security. It also discusses conventional discrete Fourier transform and public key encryption using RSA. The lecture explores the quantum Fourier transform, examples of quantum computations, and the implementation of Shor's algorithm in a real quantum computer. The instructor provides insights into the speedup of Shor's algorithm, experimental implementations, and the reduction of qubits in quantum computing.

Official source

Ontological neighbourhood

Theoretical computer science

Theory of computation: Quantum computing

Computer engineering

Computer security: Public-key cryptography

Related concepts (32)

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.

Adiabatic quantum computation

Adiabatic quantum computation (AQC) is a form of quantum computing which relies on the adiabatic theorem to do calculations and is closely related to quantum annealing. First, a (potentially complicated) Hamiltonian is found whose ground state describes the solution to the problem of interest. Next, a system with a simple Hamiltonian is prepared and initialized to the ground state. Finally, the simple Hamiltonian is adiabatically evolved to the desired complicated Hamiltonian.

Quantum supremacy

In quantum computing, quantum supremacy, quantum primacy or quantum advantage is the goal of demonstrating that a programmable quantum computer can solve a problem that no classical computer can solve in any feasible amount of time, irrespective of the usefulness of the problem. The term was coined by John Preskill in 2012, but the concept dates back to Yuri Manin's 1980 and Richard Feynman's 1981 proposals of quantum computing.

Superconducting quantum computing

Superconducting quantum computing is a branch of solid state quantum computing that implements superconducting electronic circuits using superconducting qubits as artificial atoms, or quantum dots. For superconducting qubits, the two logic states are the ground state and the excited state, denoted respectively. Research in superconducting quantum computing is conducted by companies such as Google, IBM, IMEC, BBN Technologies, Rigetti, and Intel. Many recently developed QPUs (quantum processing units, or quantum chips) utilize superconducting architecture.

Quantum algorithm

In quantum computing, a quantum algorithm is an algorithm which runs on a realistic model of quantum computation, the most commonly used model being the quantum circuit model of computation. A classical (or non-quantum) algorithm is a finite sequence of instructions, or a step-by-step procedure for solving a problem, where each step or instruction can be performed on a classical computer. Similarly, a quantum algorithm is a step-by-step procedure, where each of the steps can be performed on a quantum computer.

Related lectures (64)

Quantum and Nanocomputing

Delves into quantum computing fundamentals, including entanglement, quantum gates, and algorithms, emphasizing unitary transformations and quantum coherence.

Quantum Computing: Fundamentals and Applications

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

Quantum Compilation: Synthesis and Decomposition

Covers quantum computing fundamentals, compilation, error correction, unitary synthesis, quantum gates, and FPGA-based ADCs.

Shor's Algorithm: Quantum Circuit & Period Finding

Covers Shor's algorithm for period finding in quantum computing, explaining the quantum circuit and algorithm used.

Quantum and Nanocomputing

Covers the fundamentals of quantum computing, qubit control, readout techniques, qubit controller specifications, Horse Ridge architectures, power breakdown, and more.

Related concepts (32)

Quantum computing

Adiabatic quantum computation

Quantum supremacy

Superconducting quantum computing

Quantum algorithm