Quantum information reading group: Spring 2005

Quantum information reading group: Spring 2005

Schedule: First the hidden subgroup problem (see quant-ph/0411037for a review) and then fault tolerance.

Date	Who	Topic
16 Feb	Aram Harrow	The quantum query complexity of the hidden subgroup problem is polynomial, quant-ph/0401083 (and quant-ph/9901034)
3 Mar	Josh Grochow	A Subexponential Time Algorithm for the Dihedral Hidden Subgroup Problem with Polynomial Space, quant-ph/0406151
9 Mar	Stephen Jordan	Quantum Computation and Lattice Problems, FOCS 2002
30 Mar	Aram Harrow	POVM compression (quant-ph/0109050)
6 Apr	Krysta Svore	Knill FTQC: erasure errors (q-ph/0312190)
13 Apr	Andrew Landahl	Knill FTQC: schemes (q-ph/0402171).
27 Apr	Krysta Svore	Knill FTQC: analysis (q-ph/0404104) and the 3% threshold (q-ph/0410199)
4 May	Andrew Cross	Fault-Tolerant Quantum Computation For Local Non-Markovian Noise (quant-ph/0402104)
11 May	Bill Kaminsky	Quantum error correction fails for Hamiltonian models (quant-ph/0411008)

Coordinates

Contact information

For information, email qread-request@mit.edu
Mailing list: qread@mit.edu
To be added or removed, use the web form (MIT certificates required) or send email to qread-request@mit.edu.

Links

Possible papers

Exponential separation of quantum and classical communication complexity, Raz, STOC 1999
The Spectra of Density Operators and the Kronecker Coefficients of the Symmetric Group, quant-ph/0409016
Qubit Channels Which Require Four Inputs to Achieve Capacity: Implications for Additivity Conjectures, quant-ph/0403176
Commitment Capacity of Discrete Memoryless Channels, cs.CR/0304014
Quantum and Classical Message Identification via Quantum Channels, quant-ph/0401060; and/or Identification via Quantum Channels in the Presence of Prior Correlation and Feedback quant-ph/0403203
Estimation of SU(2) action by using entanglement, quant-ph/0407053

Previous terms