Infoptics

User Tools

Site Tools

Trace:
foundationsqc

Differences

This shows you the differences between two versions of the page.

Link to this comparison view

Both sides previous revisionPrevious revision
Next revision		Previous revision
foundationsqc [2016/05/10 17:48] – infopticsfoundationsqc [2018/11/09 20:42] (current) – external edit 127.0.0.1
Line 7: Line 7:
 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. 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 +{{ ::line-2-ref-1b.jpg?250|}} 
-optimization in quantum annealing", arXiv:1602.07942 (2016).\\+Selected publications:\\ 
 +\\ 
 +* I. Hen, M. S. Sarandy, [[http://arxiv.org/abs/1602.07942|Driver Hamiltonians for constrained 
 +optimization in quantum annealing]], arXiv:1602.07942 (2016).\\ 
 +* A. C. Santos, R. D. Silva, M. S. Sarandy,  
 +[[http://journals.aps.org/pra/abstract/10.1103/PhysRevA.93.012311|Shortcut to adiabatic 
 +gate teleportation]], //Phys. Rev. A // **93**, 012311 (2016).\\ 
 +* A. C. Santos, M. S. Sarandy, {{ ::line-2-ref-2.png?250|}} 
 +[[http://www.nature.com/articles/srep15775|Superadiabatic Controlled Evolutions 
 +and Universal Quantum Computation]], //Sci. Rep. // **5**, 15775 (2015).\\  
 +* M. Herrera, M. S. Sarandy, E. I. Duzzioni, R. M. Serra,  
 +[[http://journals.aps.org/pra/abstract/10.1103/PhysRevA.89.022323| 
 +Nonadiabatic quantum state engineering driven by fast quench 
 +dynamics]], // Phys. Rev. A // **89**, 022323 (2014).\\
  
-(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 ===== ===== Random circuits for quantum computation =====
 {{ randomu.png?200}} {{ randomu.png?200}}
Line 26: Line 29:
    * Characterizing physically the non-local character of two-qubit gates    * Characterizing physically the non-local character of two-qubit gates
  
-Recent papers:\\+Recent publications:\\
 Comment on the paper "Random Quantum Circuits are Approximate 2-designs". Diniz, Jonathan, //Comm. Math. Phys.//304, 281–293 (2011). Preprint [[http://arxiv.org/abs/1006.4202|arXiv:1006.4202v1]] Comment on the paper "Random Quantum Circuits are Approximate 2-designs". Diniz, Jonathan, //Comm. Math. Phys.//304, 281–293 (2011). Preprint [[http://arxiv.org/abs/1006.4202|arXiv:1006.4202v1]]
  
Line 37: Line 40:
    * Experimental implementations of photonic quantum computers    * Experimental implementations of photonic quantum computers
  
-Recent papers:\\+Recent publications:\\
 [[http://arxiv.org/abs/1505.03708|Experimental scattershot boson sampling]]. [[http://advances.sciencemag.org/content/1/3/e1400255|Science Advances 1 (3), e1400255 (2015)]].\\ [[http://arxiv.org/abs/1505.03708|Experimental scattershot boson sampling]]. [[http://advances.sciencemag.org/content/1/3/e1400255|Science Advances 1 (3), e1400255 (2015)]].\\
 [[http://arxiv.org/abs/1311.1622|Experimental validation of photonic boson sampling]], [[http://www.nature.com/nphoton/journal/v8/n8/full/nphoton.2014.135.html|Nature Photonics 8, 615–620 (2014)]].\\ [[http://arxiv.org/abs/1311.1622|Experimental validation of photonic boson sampling]], [[http://www.nature.com/nphoton/journal/v8/n8/full/nphoton.2014.135.html|Nature Photonics 8, 615–620 (2014)]].\\
-[[http://arxiv.org/abs/1305.3188|General rules for bosonic bunching in multimode interferometers]], //[[http://journals.aps.org/prl/abstract/10.1103/PhysRevLett.111.130503|Phys. Rev. Lett. 111, 130503 (2013)]]\\ +[[http://arxiv.org/abs/1212.2783|Integrated multimode interferometers with arbitrary designs for photonic boson sampling]], [[http://www.nature.com/nphoton/journal/v7/n7/full/nphoton.2013.112.html|Nature Photonics 7, 545–549 (2013)]].\\
-[[http://arxiv.org/abs/1212.2783|Integrated multimode interferometers with arbitrary designs for photonic boson sampling]], Crespi et al., [[http://www.nature.com/nphoton/journal/v7/n7/full/nphoton.2013.112.html|Nature Photonics 7, 545–549 (2013)]].\\+
 [[http://arxiv.org/abs/1207.2126|Geometries for universal quantum computation with matchgates]]. Brod, Galvão, //Phys. Rev. A// 86, 052307 (2012).\\ [[http://arxiv.org/abs/1207.2126|Geometries for universal quantum computation with matchgates]]. Brod, Galvão, //Phys. Rev. A// 86, 052307 (2012).\\
 [[http://arxiv.org/abs/1003.4971|Closed timelike curves in measurement-based quantum computation.]] Dias da Silva, Galvão, Kashefi ; //Phys. Rev. A// **83**, 012316 (2011). [[http://arxiv.org/abs/1003.4971|Closed timelike curves in measurement-based quantum computation.]] Dias da Silva, Galvão, Kashefi ; //Phys. Rev. A// **83**, 012316 (2011).
foundationsqc.1462902482.txt.gz · Last modified: 2018/11/09 20:42 (external edit)