User Tools

Site Tools


This is an old revision of the document!

Foundations of quantum computation

This research is led by profs. Daniel Jonathan and Ernesto F. Galvão.

Random circuits for quantum computation

  • Pseudo-random ensembles of unitaries and how they converge towards a uniform distribution.
  • Characterizing physically the non-local character of two-qubit gates

Recent papers:
Comment on the paper “Random Quantum Circuits are Approximate 2-designs”. Diniz, Jonathan, Comm. Math. Phys.304, 281–293 (2011). Preprint arXiv:1006.4202v1

Alternative models for quantum computation

  • Measurement-based quantum computation
  • Simulability results for restricted classes of quantum computation
  • Experimental implementations of photonic quantum computers

Recent papers:
General rules for bosonic bunching in multimode interferometers, Phys. Rev. Lett. 111, 130503 (2013)
Integrated multimode interferometers with arbitrary designs for photonic boson sampling, Crespi et al., Nature Photonics 7, 545–549 (2013).
Geometries for universal quantum computation with matchgates. Brod, Galvão, Phys. Rev. A 86, 052307 (2012).
Extending matchgates into universal quantum computation. Brod, Galvão, Phys. Rev. A 84, 022310 (2011).
Closed timelike curves in measurement-based quantum computation. Dias da Silva, Galvão, Kashefi ; Phys. Rev. A 83, 012316 (2011).

foundationsqc.1383326987.txt.gz · Last modified: 2018/11/09 18:42 (external edit)