BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Qureca - ECPv5.9.0//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-WR-CALNAME:Qureca
X-ORIGINAL-URL:https://platform.qureca.com
X-WR-CALDESC:Events for Qureca
BEGIN:VTIMEZONE
TZID:Europe/Paris
BEGIN:DAYLIGHT
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
TZNAME:CEST
DTSTART:20200329T010000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
TZNAME:CET
DTSTART:20201025T010000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;VALUE=DATE:20200811
DTEND;VALUE=DATE:20200812
DTSTAMP:20230608T044642
CREATED:20200804T184704Z
LAST-MODIFIED:20200804T184704Z
UID:2705-1597104000-1597190399@platform.qureca.com
SUMMARY:Continuous time quantum computing beyond adiabatic: quantum walks and fast quenches
DESCRIPTION:While the adiabatic theorem provides a useful theoretical handle to understand quantum computing in continuous time\, solving hard problems adiabatically would require an exponentially long runtime and therefore unless P=NP will require either an exponentially long coherence time or a mechanism to restore coherence. On the other hand\, algorithms which only succeed with an exponentially small probability may still be useful on more realistic devices\, for which coherence time either does not scale\, or scales only mildly. \nWe find that even the simplest of this algorithm\, a quantum walk which consists of evolution with a fixed Hamiltonian can provide better scaling on artificial spin glass problems than unstructured Grover-like search\, this implies that the algorithm is using the structure of the problem. When parameters are swept over time rather than held constant\, the scaling becomes dramatically better\, and competitive with state of the art quantum algorithms. \nI will discuss the theoretical reasons why these algorithms perform so well\, which relate to the relative energy expectation of different terms of the Hamiltonian\, and give several examples to demonstrate how the theoretical tools we have developed work\, these results have now been reported in our recent pre-print [https://arxiv.org/abs/2007.11599]. \nFinally\, I briefly discuss the outlook of the field of quantum computing as a whole and what make promising use cases for quantum computers\, based on the discussion in another recent pre-print [https://arxiv.org/abs/2006.05846]. \nAbout the Speaker \n \nNicholas Chancellor is an EPSRC UKRI Innovation fellow at Durham University. Nicholas specializes in continuous time quantum computing\, in particular quantum annealing and hybrid quantum/classical algorithms using continuous time hardware. Nicholas helped pioneer the reverse annealing technique which is currently available on the commercial quantum annealers produced by D-Wave Systems Inc. with his single author paper ‘Modernizing Quantum Annealing using Local Searches’. He also wrote one of\, if not the first papers showing the use of quantum annealers for thermal sampling. \nPrior to being awarded a fellowship\, Nicholas worked as a postdoc for Viv Kendon. Prior to that he was a postdoc at UCL\, where hw focused on experimental quantum annealing\, this postdoc was supervised by Andrew Green and Gabriel Aeppli\, and he also worked closely with Paul Warburton. Nicholas Chancellor attained his PhD from the University of Southern California under the supervision of Stephan Haas. Up to date information about Nicholas’s work can be found at: http://nicholas-chancellor.me.
URL:https://platform.qureca.com/event/continuous-time-quantum-computing-beyond-adiabatic-quantum-walks-and-fast-quenches/
END:VEVENT
END:VCALENDAR