Since 2002 Perimeter Institute has been recording seminars, conference talks, and public outreach events using video cameras installed in our lecture theatres. Perimeter now has 7 formal presentation spaces for its many scientific conferences, seminars, workshops and educational outreach activities, all with advanced audio-visual technical capabilities. Recordings of events in these areas are all available On-Demand from this Video Library and on Perimeter Institute Recorded Seminar Archive (PIRSA). PIRSA is a permanent, free, searchable, and citable archive of recorded seminars from relevant bodies in physics. This resource has been partially modelled after Cornell University's arXiv.org.
Teleportation, quantum key distribution, and quantum algorithms.
It is usually expected that nonrelativistic many-body Schroedinger equations emerge from some QFT models in the limit of infinite masses. For instance, from Yukawa\'s QFT, if the initial state contains 2 fermions, we expect to recover a 2-fermion nonrelativistic Schroedinger equation with 2-body Yukawa potential (in the limit of infinite fermion mass). I will give an easy (but still heuristic) derivation of this, based on the analysis of the corresponding Feynman diagrams and on the behaviour of the complete propagators for large spacetime distances.
Teleportation, quantum key distribution, and quantum algorithms.
A single classical system is characterized by its manifold of states; and to combine several systems, we take the product of manifolds. A single quantum system is characterized by its Hilbert space of states; and to combine several systems, we take the tensor product of Hilbert spaces. But what if we choose to combine an infinite number of systems? A naive attempt to describe such combinations fails, for there is apparently no natural notion of an infinite product of manifolds; nor of an infinite tensor product of Hilbert spaces.
The Problem of Time in Quantum Gravity and Cosmology
The Problem of Time in Quantum Gravity and Cosmology
Advanced General Relativity
There are two notions that play a central role in the mathematical theory of computation. One is that of a computable problem, i.e., of a problem that can, in principle, be solved by an (idealized) computer. It is known that there exist problems that \'have answers\', but for which those answers are not computable. The other is that of the difficulty of a computation, i.e. of the number of (idealized) steps required actually to carry out that computation.
Advanced General Relativity