Lecture

Bloch sphere representation and Larmor precession

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

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 distribution, quantum entropy, and spin dynamics. No prio ...

Description

This lecture covers the Bloch sphere representation and Larmor precession in the context of spin 1/2 systems. It explains the Hamiltonian of spin 1/2, eigenvalues, eigenvectors, and the geometrical representation of qubit states using the Bloch sphere model. The instructor discusses the concept of qubits, two-level systems, and the dynamics of spin systems. The lecture also delves into the solution of the Schrödinger equation, emphasizing the importance of understanding the Bloch sphere representation and Larmor precession in quantum mechanics.

Instructor

Nicolas Macris

Nicolas Macris received the PhD degree in theoretical physics from EPFL and then pursued his scientific activity at the mathematics department of Rutgers University (NJ, USA). He then joined the Faculty of Basic Science of EPFL, working in the field of quantum statistical mechanics and mathematical aspects of the quantum Hall effect. Since 2005 he is with the Communication Theories Laboratory and Information Processing group of the School of Communication and Computer Science and currently works at the interface of statistical mechanics, information theory and error correcting codes, inference and learning theory. He held long-term visiting appointments and collaborations with the University College and the Institute of Advanced studies in Dublin, the Ecole Normale Supérieure de Lyon, the Centre de Physique Theorique Luminy Marseille, Paris XI Orsay, the ETH Zürich and more recently Los Alamos National Lab. CV and publication list.

Official source

Ontological neighbourhood

Theoretical computer science

Theory of computation: Quantum computing

Related concepts (32)

Eigenvalues and eigenvectors

In linear algebra, an eigenvector (ˈaɪgənˌvɛktər) or characteristic vector of a linear transformation is a nonzero vector that changes at most by a constant factor when that linear transformation is applied to it. The corresponding eigenvalue, often represented by , is the multiplying factor. Geometrically, a transformation matrix rotates, stretches, or shears the vectors it acts upon. The eigenvectors for a linear transformation matrix are the set of vectors that are only stretched, with no rotation or shear.

Qubit

In quantum computing, a qubit (ˈkjuːbɪt) or quantum bit is a basic unit of quantum information—the quantum version of the classic binary bit physically realized with a two-state device. A qubit is a two-state (or two-level) quantum-mechanical system, one of the simplest quantum systems displaying the peculiarity of quantum mechanics. Examples include the spin of the electron in which the two levels can be taken as spin up and spin down; or the polarization of a single photon in which the two states can be taken to be the vertical polarization and the horizontal polarization.

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.

Generalized eigenvector

In linear algebra, a generalized eigenvector of an matrix is a vector which satisfies certain criteria which are more relaxed than those for an (ordinary) eigenvector. Let be an -dimensional vector space and let be the matrix representation of a linear map from to with respect to some ordered basis. There may not always exist a full set of linearly independent eigenvectors of that form a complete basis for . That is, the matrix may not be diagonalizable.

Eigendecomposition of a matrix

In linear algebra, eigendecomposition is the factorization of a matrix into a canonical form, whereby the matrix is represented in terms of its eigenvalues and eigenvectors. Only diagonalizable matrices can be factorized in this way. When the matrix being factorized is a normal or real symmetric matrix, the decomposition is called "spectral decomposition", derived from the spectral theorem. Eigenvalue, eigenvector and eigenspace A (nonzero) vector v of dimension N is an eigenvector of a square N × N matrix A if it satisfies a linear equation of the form for some scalar λ.

Related lectures (34)

Untitled

Quantum Mechanics: Measurement

Covers the postulates of quantum mechanics, measurement, collapse of the wave function, qubits, and quantum computing processes.

Untitled

Quantum Mechanics: Self-adjoint Operators and Quantum Information

Offers a crash course on quantum mechanics, emphasizing self-adjoint operators and quantum information.

Quantum Computing Basics