• current month / next month
• this year / past

• Fri 11:00-12:00, 6-310
  Farhi Group Meeting
  contact: Eddie Farhi
• Fri 1:30-2:30, 6C-442
  Quantum Information Processing Seminar (subscribe to their email announcement list)
  
• Tue 4:15, 32-124 (Stata Center)
  Theory of Computation Seminar
  
• Thu 4:15, 10-250
  Dept. of Physics Colloquium

other seminars:

• CTP seminars
• RLE optics & quantum electronics seminar
• Center for Ultracold Atoms seminar
• EECS seminars
• LIDS seminars
• Boston Area Physics Calendar

:: Fri 4/20/18, 1:30pm in 6C-442

Urmila Mahadev (Berkeley)
Classical Verification of Quantum Computations

We present the first protocol allowing a classical computer to interactively verify the result of an efficient quantum computation. We achieve this by constructing a measurement protocol, which enables a classical verifier to ensure that the quantum prover holds an n qubit quantum state, and correctly reports the results of measuring it in a basis of the verifier's choice. This is enforced based on the assumption that the learning with errors problem is computationally intractable for efficient quantum machines.

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

David Gosset (IBM)
Classical simulation of quantum circuits dominated by Clifford gates

Stabilizer states are a rich class of quantum states which can be efficiently classically represented and manipulated. In this talk I will describe classical simulation algorithms for quantum circuits which are based on expressing a quantum state as a superposition of (as few as possible) stabilizer states. The runtime of these algorithms is polynomial in both the number of qubits and the number of Clifford gates but exponential in the number of non-Clifford gates. Based on arXiv:1601.07601 (with Sergey Bravyi) and work in progress with Sergey Bravyi, Dan Browne, Padraic Calpin, Earl Campbell and Mark Howard.

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