Matthew F. Pusey

Quantum foundations of measurement-based computation

What features of quantum mechanics enable quantum computers to outperform their classical counterparts? Measurement-based quantum computation is an interesting scheme for quantum computation with a clear seperation between classical and quantum components. It is therefore a sensible starting point to seek answers to this question.

Paper

• Stabilizer notation for Spekkens' toy theory
  Found. Phys. 42, 688, May 2012 (also arXiv:1103.5037)

Pre-print

• On the reality of the quantum state
  with Jonathan Barrett and Terry Rudolph
  arXiv:1111.3328, November 2011 (updated May 2012)

Talks

• Bell inequalities sans computation
  ColLoQuI, Imperial College London, March 2011
• The quantum state cannot be interpreted statistically
  Philosophy of Physics research seminar, Oxford, November 2011
  Q+ Hangout, Google+, November 2011
  CDT board meeting student talk, Imperial College London, January 2012
  High Energy Physics seminar, Imperial College London, January 2012
  Quantum Information seminar, University College London, January 2012
  Quantum Computation & Information seminar, Bristol, February 2012
• Comparing two explanations for qubits
  LARSIM / QuPa workshop "Foundational questions of quantum information", Télécom ParisTech, April 2012
• On the reality of the quantum state
  New Directions in the Foundations of Physics, Mathematical Association of America Carriage House, May 2012

Posters

• Every Stabilizer Circuit Admits a Local Hidden Variable Model (for computational basis inputs and outputs)
  DTC Summer School, Imperial College London, September 2010
• Stabilizer notation for Spekkens' toy theory
  Conceptual Foundations and Foils for Quantum Information Processing, Perimiter Institute, May 2011