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.
In this talk we will discuss the (local) construction of a calibrated G_2 structure on the 7-dimensional quotient of an 8-dimensional quaternion-Kahler (QK) manifold M under the action of a group S^1 of isometries. The idea is to construct explicitly a 3-form of type G_2, using the data associated to the S^1 action and to the QK structure on M. In the same spirit, we can consider the level sets of the QK moment-map square-norm function on M, and again take the S^1 quotient: we will discuss in this case the construction of half-flat metrics in dimension 6, under suitable circumstances.
This is joint work with Francois Lalonde. Using an analogue of Seidel's homomorphism in Lagrangian Floer homology for one Lagrangian, we give a condition for a diffeomorphism on a Lagrangian to extend to a Hamiltonian diffeomorphism on the whole symplectic manifold.
This talk is a report on joint work with Mohammed Abouzaid and Ludmil Katzarkov about mirror symmetry for blowups, from the perspective of the Strominger-Yau-Zaslow conjecture. Namely, we first describe how to construct a Lagrangian torus fibration on the blowup of a toric variety X along a codimension 2 subvariety S contained in a toric hypersurface. Then we discuss the SYZ mirror and its instanton corrections, to provide an explicit description of the mirror Landau-Ginzburg model (possibly up to higher order corrections to the superpotential).
Quantum random walks have received much interest due to their non-
intuitive dynamics, which may hold a key to radically new quantum
algorithms. What remains a major challenge is a physical realization
that is experimentally viable, readily scalable, and not limited to
specific connectivity criteria. In this seminar, I will present an
implementation scheme for quantum walking on arbitrarily complex
graphs. This scheme is particularly elegant since the walker is not
required to physically step between the nodes; only flipping coins is
Recently methods of integrability were shown to be useful for solving gauge theories in various dimensions. I will make an introduction into integrability in two dimensions and demonstrate how the integrability works also for some three and four dimensional gauge theories.
Researchers in quantum foundations claim (D'Ariano, Fuchs, ...):
Quantum = probability theory + x
x = Quantum - probability theory
Guided by the metaphorical analogy:
probability theory / x = flesh / bones
we introduce a notion of quantum measurement within x, which, when flesing it with Hilbert spaces, provides orthodox quantum mechanical probability calculus.
A modified version of PQCD considered in previous works is further investigated in the case of a vanishing gluon condensate, by retaining only the quark one. In this case the Green functions generating functional is expressed in a simple form in which Dirac’s delta functions are now absent from the free propagators. The new expansion implements the dimensional transmutation effect through a single interaction vertex in addition to the standard ones in mass less QCD. The results of an ongoing two loop evaluation of the vacuum energy will be presented.
Solving linear systems of equations is a common problem that arises both on its own and as a subroutine in more complex problems: given a matrix A and a vector b, find a vector x such that Ax=b. Often, one does not need to know the solution x itself, but rather an approximation of the expectation value of some operator associated with x, e.g., x'Mx for some matrix M. In this case, when A is sparse and well-conditioned, with largest dimension N, the best known classical algorithms can find x and estimate x'Mx in O(N * poly(log(N))) time.