Lorentz Chair since 19552019

Seth Lloyd [Colloquium]

2018

Tom Lubensky [lectures]

2017

Renata Kallosh [lectures]

2016

Charles L. Kane [lectures]

2015

John B. Pendry [lectures]

2014

2013

H. Eugene Stanley

2012

Subir Sachdev [lectures]

2011

Roger Penrose

2010

Thomas A. Witten [lectures]

2009

2008

2007

Thomas W.B. Kibble

2006

David R. Nelson

2005

Peter Zoller [lectures]

2004

Leonard Susskind

2003

Leo P. Kadanoff

2002

John P. Preskill

2001

Howard C. Berg

2000

Chandra M. Varma

1999

Michael V. Berry

1998

1997

Bertrand I. Halperin

1996

Yoseph Imry

1995

N. David Mermin

1994

Julius Wess

1993

Michael E. Fisher

1992

Alexander F. Andreev

1991

Pierre C. Hohenberg

1990

Bernie J. Alder

1989

1988

1987

Raymond L. Orbach

1986

Philippe Nozières

1985

Ben Widom

1984

1983

Irwin Oppenheim

1982

Léon van Hove

1981

Ryogo Kubo

1980

Anatole Abragam

1979

Ezechiel G.D. Cohen

1978

1977

Victor F. Weisskopf

1976

Rudolf E. Peierls

1975

1974

1973

1972

1971

David Pines

1970

1969

Isaak M. Khalatnikov

1968

Elliott W. Montroll

1967

Christian Møller

1966

Herbert Fröhlich

1965

Wladyslaw Opechowski

1964

Oskar Klein

1963

Mark Kac

1962

Léon Rosenfeld

1961

Elliott W. Montroll

1960

1959

John G. Kirkwood

1958

Walter H. Heitler

1957

1956

John A. Wheeler [reminiscence]

1955

George E. Uhlenbeck

» portrait gallery « of Nobel laureate Lorentz professors photo: Dmitry Rozhkov, Wikipedia Each year an eminent theoretical physicist holds the Lorentz Chair. The 2019 Lorentz professor is

Seth Lloyd, from MIT.Professor Lloyd will present a Colloquium Ehrenfestii on Wednesday evening June 5, 19:30 hours:

Quantum computing: past, present, and futureQuantum computers store and process information at the level of individual atoms, photons, and spins. The strange and counter-intuitive nature of quantum mechanics allows quantum computers to perform computations in ways that classical computers can't. This talk reviews the history of quantum computing, including how they can be constructed, and why quantum algorithms give exponential speed ups over their classical counterparts. The talk presents the current state of the art in experimental realizations of quantum computers and quantum algorithms, and discusses various possible futures for quantum information processing.

The Lorentz chair lecture course will develop this topic in greater depth:

- Tuesday June 11, 14:00-16:00 hours:
Quantum algorithmsThis lecture reviews the basic features of quantum algorithms and shows how they provide exponential and polynomial speed ups over classical computers. The fundamental point is that the states of quantum systems are vectors in high dimensional complex vector spaces: for example, the state of 300 spins/qubits corresponds to a vector in a 2^300 ~ 10^90 dimensional vector space (by comparison, 10^90 is the number of particles in the universe). The dynamics of those vectors is implemented by multiplying them by large matrices. The linear algebraic nature of quantum mechanics translates into the ability of quantum computers to perform a large variety of linear algebraic tasks -- Fourier transforms, finding eigenvectors and eigenvalues, solving linear systems of equations -- exponentially faster than their classical counterparts.

- Tuesday June 18, 14:00-16:00 hours:
Building quantum computersWhen quantum computers were first proposed in the 1980s, Feynman pointed out that we had no clue how to build them. The situation changed in the 1990s when it shown that interactions between atoms, solid state systems, and light could be used to perform quantum computation using techniques of electromagnetic resonance. This lecture reviews the basic methods for performing quantum computation, and reviews different quantum computational platforms -- atomic, superconducting, solid-state, and quantum optical. The lecture presents the physical and theoretical challenges required to build large scale quantum computers.

- Tuesday June 25, 14:00-16:00 hours:
The future of quantum computingCurrent quantum computers have 50-100 qubits and are not yet scalable to larger devices. This lecture presents quantum algorithms including quantum simulation and quantum machine learning techniques that could be performed on this generation of quantum computers. This lecture presents the physical and theoretical challenges required to build large scale quantum computers, including the implementation of quantum error correcting codes.

Location: De Sitterzaal, Oortgebouw, Niels Bohrweg 2, Leiden

Signatures of the Lorentz professors on the wall of our old colloquium room.

To activate the magnifying glass, reduce the width of the browser window.