Journal Club Winter 2011

From Quantum Computing Theory Group
Revision as of 21:31, 10 January 2011 by Lukassvec (talk | contribs) (Schedule)

Jump to: navigation, search

Journal Club Winter 2011

People

Organizer(1): Kamil Michnicki (kpm3@u.washington.edu)

Organizer(2): Lukas Svec (svecl@u.washington.edu)

Faculty Advisor: Dave Bacon (dabacon@cs.washington.edu)

Place

Thursday 12:00 in Computer Science, CSE 403.

Organization

Topic Chosen: Quantum Random Walks

Main ideas:

Theory

Quantum Annealing

Quantum-Quantum Metropolis Algorithm

Universality of Quantum Walks

Relationship between continuous and quantum walks

Schedule

Subject Speaker Date
Organization and classical random walks Lukas Jan 7
Pre-2004 Quantum Walks Lukas Jan 14
Post-2004 Quantum Walks (Szegedy Walk) Lukas Jan 21
Quantum Annealing Kamil Jan 27
Quantum Metropolis Sampling Punya Feb 3
Quantum Quantum Metropolis Algorithm Alex Feb 10
Universality of Quantum Walks(1) Isaac Feb 24
Universality of Quantum Walks (2) Isaac Mar 3
Relationship between continuous and discrete Paul Mar 10

Papers

Theory
(2003) Kempe: Quantum Random Walks - An Introductory Overview, (arXiv:quant-ph/0303081v1)
(2004) Szegedy: Quantum Speed-up of Markov Chain Based Algorithms
(2010) Krovi, Magniez, et al. Finding is as Easy as Detecting for Quantum Walks (arXiv:1002.2419v1)


Hamiltonian NAND Tree and Universal Computation with Quantum Walks
A Quantum Algorithm for the Hamiltonian NAND Tree, http://arxiv.org/abs/quant-ph/0702144
Universal Computation by Quantum Walk


Quantum-Quantum Metropolis Algorithm
(2009) Quantum Metropolis Sampling http://arxiv.org/abs/0911.3635
(2010) A Quantum-Quantum Metropolis Algorithm, http://arxiv.org/abs/1011.1468


Quantum Simulated Annealing
Quantum Simulations of Classical Annealing Processes
Relationship between Discrete and Continuous QW and new simulation technique
(2008) Childs, On the relationship between continuous- and discrete-time quantum walk