Schedule May 3, 2006
Putting Weirdness to Work: Quantum Information Science
Dr. John Preskill, Caltech

Quantum physics, information theory, and computer science are among the crowning intellectual achievements of the 20th century. Now, a new synthesis of these themes is underway. The emerging field of quantum information science is providing important insights into fundamental issues at the interface of computation and physical science, and may guide the way to revolutionary technological advances.

The quantum laws that govern atoms and other tiny objects differ radically from the classical laws that govern our ordinary experience. In particular, quantum information (information encoded in a quantum system) has weird properties that contrast sharply with the familiar properties of classical information. Physicists, who for many years have relished this weirdness, have begun to recognize in recent years that we can put the weirdness to work: There are tasks involving the acquisition, transmission, and processing of information that are achievable in principle because Nature is quantum mechanical, but that would be impossible in a less weird classical world.

I will describe the properties of quantum bits (“qubits”), the indivisible units of quantum information, and explain the essential ways in which qubits differ from classical bits. For one thing, it is impossible to read or copy the state of a qubit without disturbing it. This property is the basis of “quantum cryptography,” wherein the privacy of secret information can be founded on principles of fundamental physics.

Qubits can be “entangled” with one another. This means that the qubits can exhibit subtle quantum correlations that have no classical analogue; roughly speaking, when two qubits are entangled, their joint state is more definite than the state of either qubit by itself. Because of quantum entanglement, a vast amount of classical information would be needed to describe completely the quantum state of just a few hundred qubits. Therefore, a “quantum computer” operating on just a few hundred qubits could perform tasks that ordinary digital computers could not possibly emulate.

Constructing practical quantum computers will be tremendously challenging; a particularly daunting difficulty is that quantum computers are far more susceptible to making errors than conventional digital computers. But newly developed principles of fault-tolerant quantum computation may enable a properly designed quantum computer with imperfect components to achieve good reliability.
John Preskill received the A.B. degree in physics from Princeton University in 1975, and the Ph.D. degree in physics from Harvard University in 1980. In 1983, he joined the faculty of the California Institute of Technology, where he is now the John D. MacArthur Professor of Theoretical Physics, Director of the Institute for Quantum Information, and Director of the Center for the Physics of Information. Prof. Preskill is a two-time recipient of the Associated Students of Caltech Teaching Award. He has been the Lorentz Lecturer at the University of Leiden, the Rouse Ball Lecturer at the University of Cambridge, the Biedenharn Lecturer at the University of Texas at Austin, and the Loeb Lecturer at Harvard University. His research interests include elementary particles, the very early universe, black holes, quantum information, and quantum computation.

Begin streaming QuickTime of the whole talk (high bandwidth).
(Or, right-click to download the movie.) (Or, right-click to download the podcast.)

Begin streaming RealMedia for the whole talk: high bandwidth or medium bandwidth.
Or, stream audio only for the whole talk: high bandwidth or low bandwidth. (Or, right-click to download the whole audio file.)

To begin viewing slides, click on the first slide below. (Or, view as pdf.)


[01] [02] [03] [04] [05] [06] [07] [08] [09] [10] [11] [12] [13] [14] [15] [16] [17] [18] [19] [20] [21] [22] [23] [24] [25] [26] [27] [28] [29] [30] [31] [32] [33] [34] [35] [36] [37] [38] [39] [40] [41] [42] [43] [44] [45] [46] [47] [48] [49] [50] [51] [52] [53] [54] [55] [56] [57] [58] [59] [60] [61] [62] [63] [64] [65] [66] [67] [68] [69] [70] [71] [72] [73] [74] [75] [76] [77] [78] [79] [80] [81] [82] [83] [84] [85] [86] [87] [88] [89] [90] [91] [92] [93] [94] [95] [96] [97] [98] [99] [100] [101] [102] [103] [104] [105] [106] [107] [108] [109] [110] [111] [112] [113] [114] [115] [116] [117] [118] [119] [120] [121] [122] [123] [124] [125] [126] [127] [128] [129] [130] [131] [132] [133] [134] [135] [136] [137] [138] [139] [140] [141] [142] [143] [144] [145]

Author entry (protected)