User Tools

Site Tools


foundationsqc

This is an old revision of the document!


Foundations of quantum computation

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

Quantum annealing and adiabatic quantum computation

The aim of this research area is to investigate quantum information processing and simulation of quantum dynamics through quantum annealing methods, either in closed or open systems. More specifically, we focus on the adiabatic computation approach, which aims at manipulating a slowly-varying quantum system to attain a desired target state, which contains the solution of a computational problem. Topics of interest include adiabatic algorithms and their physical implementations, adiabatic approximation in open quantum systems, and shortcut methods to adiabaticity.
Recent publications:

(1) I. Hen, M. S. Sarandy, “Driver Hamiltonians for constrained optimization in quantum annealing”, arXiv:1602.07942 (2016).
(2) A. C. Santos, R. D. Silva, M. S. Sarandy, “Shortcut to adiabatic gate teleportation”, Phys. Rev. A 93, 012311 (2016).
(3) A. C. Santos, M. S. Sarandy, “Superadiabatic Controlled Evolutions and Universal Quantum Computation”, Sci. Rep. 5, 15775 (2015).
(4) M. Herrera, M. S. Sarandy, E. I. Duzzioni, R. M. Serra, “Nonadiabatic quantum state engineering driven by fast quench dynamics”, Phys. Rev. A 89, 022323 (2014).

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

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