**Time and place:** Thursdays, 2:30 - 3:30 pm,
APM room 7218 (except for the first meeting, see below).

**First meeting:** Thursday, Sept. 30, in APM 5829.

**Contact:** Yi-Kai Liu, __y9liu (at) cs.ucsd.edu__.

**Papers:** E-mail me papers you'd like to read!

- quant-ph/0408129: Dawson et al, "Quantum computing and polynomial equations over the finite field Z_2"
- quant-ph/0408130: Nielsen and Petz, "A simple proof of the strong subadditivity inequality"
- quant-ph/9801069: Horodecki, Horodecki and Horodecki, "Mixed-state entanglement and distillation: is there a ``bound'' entanglement in nature?"
- Yao, "Classical physics and the Church--Turing Thesis," J. ACM, Volume 50, Issue 1 (Jan. 2003), pp.100-105. Link
- Raussendorf and Briegel, "A One-Way Quantum Computer," Phys. Rev. Lett. 86, pp.5188-5191. Link
- Briegel and Raussendorf, "Persistent Entanglement in Arrays of Interacting Particles," Phys. Rev. Lett. 86, pp.910-913. Link
- quant-ph/0402005: Nielsen, "Optical quantum computation using cluster states"
- quant-ph/0311001: Ambainis, "Quantum walk algorithm for element distinctness"
- quant-ph/0401053:
Szegedy, "Spectra of Quantized Walks and a \sqrt{\delta\epsilon} rule"

(appears in FOCS 2004 as "Quantization of Classical Walk Based Algorithms") - Quantum walks, algorithms
- Quantum information theory
- Foundations