Since 2002 Perimeter Institute has been recording seminars, conference talks, public outreach events such as talks from top scientists 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 and 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.
Accessibly by anyone with internet, Perimeter aims to share the power and wonder of science with this free library.
Development of quantum computing promises, among other things, improvement of scientific computation performance. Indeed, a computer exploiting the proprieties of quantum mechanics would allow for computation power exponentially greater than a classic computer.We develop double lateral quantum dots with micro-magnets to control spin orientation of electrostatically confined electrons. In this talk, an introduction to the mechanisms used in the spin control will be given. Then, methods used to characterize the micro-magnets will be described.
A quantum computer is a computer fabricated using quantum bits (qubits) that uses the quantum properties of matter (entanglement, superposition of states, etc.). Such a computer would allow certain calculations to be done exponentially more quickly than with a classical computer. An electron in a quantum box constitutes a perfect two-level system and can thus be used as a qubit. In my talk, I will give an introduction to lateral quantum dots, their fabrication process and how they can be used as qubits.
TBA
Quantum entanglement is a valuable resource in the field of quantum information science and allows one to accomplish many information processing tasks. In quantum transformations an entangled state A can be converted to another state B through local operations assisted by classical communication (LOCC). It has also been demonstrated that there exist entangled states A, B, C such that state A cannot be converted to a state B, but A otimes C can be converted to B otimes C by LOCC, where C is a suitably chosen entangled state acting as the catalyst.
Thermodynamics is, at heart, a probabilistic theory about the state of physical systems. Traditionally, however, our knowledge of systems is modelled implicitly: for instance, it is often assumed that we only have access to a few macroscopic parameters, like the temperature, energy, or volume of a gas, and that all states satisfying those parameters are equally likely.
We can prove that for certain problems, quantum computers do better than classical computers. I will introduce the query complexity framework, which lets us compare classical and quantum computers, and then describe a problem where quantum computers do better than classical. The problem I will discuss is evaluating boolean trees with a promise on the input.
By exploiting the properties of quantum mechanical systems, two parties can achieve cryptographically secure communication in a manner not possible in a purely classical world, through the process of quantum key distribution. In this talk, I will briefly introduce the field of cryptography and explain one of the most fundamental applications of quantum mechanics to cryptography.
Our understanding of the physical world at the most fundamental level is based on two theories: quantum theory and general relativity. They are impressively successful but only when each is considered on its own. In situations where both play a role, we are reduced to puzzles and absurdity. Hence the search for a quantum theory of gravity, the currently missing theory that will work sensibly in exactly these situations. To the great frustration of researchers in this field, candidate quantum theories of gravity tend to produce more puzzles instead of answers.
I present a proposal, originally motivated by a result in graph theory: the entropy function of a density matrix naturally associated to a simple undirected graph, is maximized, among all graphs with a fixed number of links and nodes, by regular graphs.I recover this result starting from the Hamiltonian operator of a non-relativistic quantum particle interacting with the loop-quantized gravitational field and setting elementary area and volume eigenvalues to a fixed value.
Check back for details on the next lecture in Perimeter's Public Lectures Series