Video Library

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. 

  

 

Thursday May 01, 2008
Speaker(s): 

We consider the question of forward and backward translation between measurement-based quantum computing, called patterns, and quantum circuit computation. It is known that the class of patterns with a particular properties, having flow, is in one-to-one correspondence with quantum circuits. However we show that a more general class of patterns, those having generalised flow, will sometime translate to imaginary circuits, quantum circuits with time-like curves.

Scientific Areas: 

 

Thursday May 01, 2008
Speaker(s): 

I will talk about a scheme of the ground-code measurement-based quantum computer, which enjoys two major advantages. (i) Every logical qubit is encoded in the gapped degenerate ground subspace of a spin-1 chain with nearest-neighbor two-body interactions, so that it equips built-in robustness against noise.

Scientific Areas: 

 

Thursday May 01, 2008
Speaker(s): 

One-way quantum computing allows any quantum algorithm to be implemented by the sole use of single-qubit measurements. The difficult part is to create a universal resource state on which the measurements are made. We propose to use continuous-variable (CV) entanglement in the optical frequency comb of a single optical parametric oscillator with a multimode pump to produce a very large CV graph state with a special 4-regular graph. This scheme is interesting because of its potential for scalability, although issues of error correction and fault tolerance are yet to be fully addressed.

Scientific Areas: 

 

Thursday May 01, 2008
Speaker(s): 

We construct a family of time-independent nearest-neighbor Hamiltonians coupling eight-state systems on a 1D ring that enables universal quantum computation. Hamiltonians in this family can achieve universality either by driving a continuous-time quantum walk or by terminating an adiabatic algorithm. In either case, the universality property can be understood as arising from an efficient simulation of a programmable quantum circuit. Using gadget perturbation theory, one can demonstrate the same kind of universality for related Hamiltonian families acting on qubits in 2D.

Scientific Areas: 

 

Thursday May 01, 2008
Speaker(s): 

In this talk, two specific directions of research in quantum information are presented which could potentially gain from graph theory. The first is the study of quantum communication using systems of perpetually interacting qubits (or spins) as a databus. After introducing the topic through the simplest examples of linear chains of spins as transmitters of quantum information, we briefly mention existing work on quantum communication through more general graphs of spins.

Scientific Areas: 

 

Wednesday Apr 30, 2008
Speaker(s): 

The Hamiltonian of traditionally adopted detector models features out of diagonal elements between the vacuum and the one particle states of the field to be detected. We argue that reasonably good detectors, when written in terms of fundamental fields, have a more trivial response on the vacuum. In particular, the model configuration ``detector in its ground state + vacuum of the field\' generally corresponds to a stable bound state of the underlying theory (e.g.

Scientific Areas: 

 

Wednesday Apr 30, 2008
Speaker(s): 

In arXiv:quant-ph/0608223, quantum network coding was proved to be no more useful than simply routing the quantum transmissions in some directed acyclic networks. This talk will connect this result, monogamity of entanglement, and graph theoretic properties of the networks involved.

Scientific Areas: 

 

Wednesday Apr 30, 2008
Speaker(s): 

It is well-known that if a graph G_1 can be obtained from another graph G_2 by removing a degree-2 vertex and combing its two neighbors, the graph state |G_1> can be obtained from |G_2> through LOCC. In this talk, I will describe how to construct a graph G\' from a given graph G so that (a) The maximum degree of G\', Delta(G\'), is no more than 3. (b) G can be obtained from G\' by a sequence of contraction operations described above. (c) The treewidth of G\', tw(G\'), is no more than tw(G)+1. (d) The construction takes exp(O(tw(G))) time.

Scientific Areas: 

 

Wednesday Apr 30, 2008
Speaker(s): 

It is well known that the toric code model supports abelian anyons. It can be realized on a square lattice of qubits, where the anyons are represented by the endpoints of strings of Pauli operators. We will demonstrate that the non-abelian Ising model can be realized in a similar way, where now the string operators are elements of the Clifford group. The Ising anyons are shown to be essentially superpositions of the abelian toric code ones, reproducing the required fusion, braiding and statistical properties.

Scientific Areas: 

 

Wednesday Apr 30, 2008
Speaker(s): 

One of the main strengths of the ERG is that it admits nonperturbative approximation schemes which preserve renormalizability. I will introduce a particularly powerful scheme, the derivative expansion.

Pages