qis.mit.edu homepeopleseminarscoursesvisitorslinks

Seminar Listing

(single keywords like: Ambainis, adiabatic...)

[photo of a speaker] (c) D.Nagaj

Typical Weekly Calendar

other seminars:


2015 - 2016 (academic year)


:: Fri 9/11/15, 1:30pm in 6C-442

Chris Monroe and Jungsang Kim (University of Maryland; Duke)
Time to Build: Co-designing a Quantum Computer with Trapped Ions

:: Fri 9/18/15, 1:30pm in 6C-442

Or Sattath (MIT)
When must a local Hamiltonian be unfrustrated?

Frustration free Hamiltonians play an important role in many aspects of quantum information theory and condensed matter. Determining whether a given Hamiltonian is frustration free is, however, a complexity theoretically intractable problem. Here, we prove a general criterion under which a local Hamiltonian must be frustration free. Surprisingly, this quantum property is diagnosed by a combinatorial property: analyzing the roots of the matching polynomial of the interaction graph, or in condensed matter terminology, analyzing the partition function of a classical hard-core lattice gas at negative fugacity living on the same interaction graph. We apply this to analyze when local Hamiltonians on various regular lattices and random graphs must be frustration free

:: Fri 10/2/15, 2:10pm in MSR, Horace Mann Conference Room, One Memorial Drive (note different place and time)

Ryan O'Donnell (CMU)
Quantum tomography and random Young diagrams

In quantum mechanics, the state rho of a d-dimensional particle is given by a d x d PSD matrix of trace 1. The "quantum tomography problem" is to estimate rho accurately using as few "copies" of the state as possible. The special case of "quantum spectrum estimation" involves just estimating the eigenvalues alpha_1, ..., alpha_d of rho, which form a probability distribution. By virtue of some representation theory, understanding these problems mostly boils down to understanding certain statistics of random words with i.i.d. letters drawn from the alpha_i distribution. These statistics involve longest increasing subsequences, and more generally, the shape of Young tableaus produced by the Robinson-Schensted-Knuth algorithm. In this talk we will discuss new probabilistic, combinatorial, and representation-theoretic tools for these problems, and the consequent new upper and lower bounds for quantum tomography. This is joint work with John Wright

:: Fri 10/9/15, 1:30 in 6C-442

Barry Sanders (University of Calgary)
Multi-Channel Photon Interferometry for Quantum Information Processing

Quantum information processing is possible via multi-channel linear (passive) interferometry with photon number states as some or all of the inputs and photon-coincidence detection at the output ports. The Knill-Laflamme-Milburn nonlinear sign gate on dual-rail photonic qubits and the Aaronson-Arkhipov BosonSampling scheme are salient examples of linear photonic quantum information processing. Implementations of quantum walks also make use of linear photon interferometry. The famous Hong-Ou-Mandel dip presents the heart of what makes linear photon interferometry quantum and furthermore serves as an indispensable characterization tool for sources and interferometers. Our aim is to advance linear photonic quantum interferometry to serve as a precise and accurate tool for optical quantum information processing. To this end we develop and experimentally test a theory for accurate and precise characterization of the Hong-Ou-Mandel dip setup, extend this theory for accurate and precise characterization of multi-channel interferometry based on photon coincidences, extend the Hong-Ou-Mandel dip concept beyond two-channel to multi-channel interferometry, develop theory and (classical) algorithms for computing irreducible representations of SU(m) whose elements represent all m-channel interferometers, and determine the effects of extraneous multi-photon contributions to the desired outputs. Our approach allows for non-simultaneous photon arrival times, which removes the typical symmetrization assumption in photon interferometry and leads to photon coincidence rates depending on immanants of SU(m) matrices or submatrices; immanants generalize the concepts of permanents and determinants to allow for partial symmetries. For linear photon interferometry to move beyond the proof-of-principle stage to solving computational problems, they need to be reliable, accurate and precise within known error. Furthermore their performance needs to be benchmarked against the best classical simulation algorithms. Our results are enabling the field to advance in this direction.

:: Fri 10/23/15, 1:30pm in 6C-442

Michael Walter (Stanford)


:: Fri 10/30/15, 1:30pm in 6C-442

Ashley Montanaro (U. Bristol)


:: Fri 11/6/15, 1:30pm in 6C-442

Beni Yoshida (Caltech)


:: Fri 11/13/15, 1:30pm in 6C-442



:: Fri 11/20/15, 1:30pm in 6C-442

David Gosset (Caltech)



home :: people :: seminars :: courses :: visitors :: links

qis@mit MIT