Campus Event Calendar
Event Entry
What and Who
Adiabatic Quantum Computation and Graph Isomorphism: a quantum-walk approach
Luca Zanetti
University of Milan
Talk
AG 1, AG 2, AG 3, AG 4, AG 5, RG1, SWS, MMCI
AG Audience
English
Note: We use this to send email in the morning.
Date, Time and Location
Tuesday, 10 September 2013
13:00
30 Minutes
E1 4
024
Saarbrücken
Abstract
Adiabatic Quantum Computation (AQC) is a model of computation equivalent to standard quantum computation and based on the adiabatic theorem of Quantum Mechanics. The idea behind AQC is to prepare the system in the ground state of a simple Hamiltonian and let the system adiabatically evolve to a Hamiltonian whose ground state encodes the solution to the problem of interest. In this talk I will discuss a quantum algorithm for the Graph Isomorphism problem based on AQC. In particular, I will focus on how a careful choice of the initial Hamiltonian can probably reduce the complexity of the problem.
Contact
He Sun
--email hidden
passcode not visible
logged in users only
He Sun, 08/12/2013 09:59 -- Created document.