'Adiabatic computation' diaporamas de présentation

Julia Kempe CNRS & LRI, Univ. of Paris-Sud Alexei Kitaev Caltech Oded Regev Tel-Aviv University

FSTTCS, Chennai, December 18 th , 2004 . The Complexity of the Local Hamiltonian Problem. Julia Kempe CNRS & LRI, Univ. of Paris-Sud Alexei Kitaev Caltech Oded Regev Tel-Aviv University. Also implies:. 2-local adiabatic computation is equivalent to standard quantum computation. Results.

770 views • 32 slides

Dorit Aharonov Hebrew Univ. & UC Berkeley

Adiabatic Quantum Computation. Dorit Aharonov Hebrew Univ. & UC Berkeley. Ground State Solutions. Which ?? spin distribution minimizes the number of red edges with similar spins and green edges with opposite spins?. ?. ?. ?. ?. ?. ?. ?. (1 violation.).

490 views • 31 slides

Quantum Computing: Solving Complex Problems David DiVincenzo, IBM Fermilab Colloquium, 4/2007

Quantum Computing: Solving Complex Problems David DiVincenzo, IBM Fermilab Colloquium, 4/2007. x x y y ?x. =. add the bits mod 2. Rules for quantum computing. D. Deutsch, Proc. R. Soc. A 400, 97 (1985) D. Deutsch, Proc. R. Soc. A 425, 73 (1989).

350 views • 26 slides

A Study of Error-Correcting Codes for Quantum Adiabatic Computing

303 views • 15 slides