BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//wp-events-plugin.com//6.4.7.2//EN
TZID:Europe/Paris
X-WR-TIMEZONE:Europe/Paris
BEGIN:VEVENT
UID:1-143@lptms.universite-paris-saclay.fr
DTSTART:20130422T120000Z
DTEND:20130422T124500Z
DTSTAMP:20130418T123051Z
URL:http://www.lptms.universite-paris-saclay.fr/seminars/journal-club-du-l
 ptms-dmitry-petrov/
SUMMARY:Journal Club du LPTMS: Dmitry Petrov - LPTMS\, salle 201\, 2ème é
 tage\, Bât 100\, Campus d'Orsay - 22 Avr 13 12:00
DESCRIPTION:Dmitry Petrov\, CNRS researcher LPTMS\nTitle: Quantum annealing
  with more than one hundred qubits\nAuthors: Sergio Boixo\, Troels F. Ronn
 ow\, Sergei V. Isakov\, Zhihui Wang\, David Wecker\, Daniel A. Lidar\, Joh
 n M. Martinis\, and Matthias Troyer\nThe paper is not publicly available a
 s it is submitted to Nature\, but I explained Matthias our Journal Club id
 ea and he sent me the preprint asking to keep it for our private use. I wi
 ll put the preprint on our coffee table together with the D-Wave Systems w
 ikipedia page. Enjoy.\nAbstract: At a time when quantum effects start to p
 ose limits to further miniaturisation of devices and the exponential perfo
 rmance increase due to Moore's law\, quantum technology is maturing to the
  point where quantum devices\, such as quantum communication systems\, qua
 ntum random number generators and quantum simulators\, may be built with p
 owers exceeding the performance of classical computers. A quantum annealer
 \, in particular\, finds solutions to hard optimisation problems by evolvi
 ng a known initial configuration towards the ground state of a Hamiltonian
  that encodes an optimisation problem. Here\, we present results from expe
 riments on a 108 qubit D-Wave One device based on superconducting flux qub
 its. The correlations between the device and a simulated quantum annealer 
 demonstrate that the device performs quantum annealing: unlike classical t
 hermal annealing it exhibits a bimodal separation of hard and easy problem
 s\, with small-gap avoided level crossings characterizing the hard problem
 s. To assess the computational power of the quantum annealer we compare it
  to optimised classical algorithms. We discuss how quantum speedup could b
 e detected on devices scaled to a larger number of qubits where the limits
  of classical algorithms are reached.\nSee also http://en.wikipedia.org/wi
 ki/D-Wave_Systems http://www.nytimes.com/2013/03/22/technology/testing-a-n
 ew-class-of-speedy-computer.html?pagewanted=all&amp\;_r=2&amp\; http://www
 .nature.com/nature/journal/v473/n7346/full/nature10012.html http://arxiv.o
 rg/abs/1302.5843 http://arxiv.org/abs/1102.1296
LOCATION:LPTMS\, salle 201\, 2ème étage\, Bât 100\, Campus d'Orsay\, 15 
 Rue Georges Clemenceau\, Orsay\, 91405\, France
GEO:48.698185;2.181768
X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=15 Rue Georges Clemenceau\,
  Orsay\, 91405\, France;X-APPLE-RADIUS=100;X-TITLE=LPTMS\, salle 201\, 2è
 me étage\, Bât 100\, Campus d'Orsay:geo:48.698185,2.181768
END:VEVENT
END:VCALENDAR