Difference between revisions of "Journal Club Winter 2013"

From Quantum Computing Theory Group
Jump to: navigation, search
 
(28 intermediate revisions by 3 users not shown)
Line 1: Line 1:
This quarter we will be focusing on Quantum Information Theory not Quantum Expanders, but the editing is yet to be completed so until then, confusion shall reign.  
+
This season we will be focusing on quantum information theory.  Classical information theory is ubiquitous in science and mathematics with applications ranging from characterizing ensembles of particles to answering how many bits can be sent reliably over a noisy channel.  It is even useful as an estimation technique for gauging the difficulty of a research problem. For instance, one may ask, how many bits are necessary to specify a quantum circuit acting on n bits(with bit flips Toffoli and Hadamard gates) and how does that compare to the number of bits required to specify a classical circuit(just bit flips and Tofolli gates)? This question already leads to a naive bound on the average quantum speed-up attainable over classical circuits, e.g. there isn't enough information in the specification of constant depth quantum circuits to characterize all reversible function on n-bits and so we conclude that there are deterministic functions that require more than constant quantum depth. Although this example is rather simple, it already gives the researcher some perspective about a very broad and difficult problem, that of finding quantum speed-ups. If classical information theory can quickly give us insight into the classical resources needed for a task, perhaps quantum information theory would be equally useful in giving us insight into the quantum resources needed for a quantum task?
  
'''Place:''' Fridays at 1:30pm in CSE 674 ("the Irish room").
+
'''Place and Time:''' Thursday at 2:45pm in the Cosman room(6C-442) or in cyberspace via Google Hangouts.
 
==Schedule==
 
==Schedule==
 
{|border="1"
 
{|border="1"
Line 8: Line 8:
 
!Date
 
!Date
 
|-
 
|-
|[http://theoryofcomputing.org/articles/v006a003/ Quantum Expanders: Motivation and Construction]
+
|[http://arxiv.org/abs/quant-ph/9511030 Concentrating Partial Entanglement with Local Operations] and [http://quantum.cs.washington.edu/wiki/uploads/f/fd/ConcentratingPartialEntanglement.pdf lecture notes]
|Isaac
+
|Kamil Michnicki
|March 30
+
|2/21
 
|-
 
|-
|[http://theoryofcomputing.org/articles/v006a003/ Continue Review]
+
|[http://arxiv.org/abs/quant-ph/0404076 Consequences and Limits of Nonlocal Strategies]
|Kamil
+
|Henry Yuen
|April 6
+
|2/28
 
|-
 
|-
|Continue Review
+
|Quantum [http://arxiv.org/abs/quant-ph/0703069 De Finetti Theorems] and [http://arxiv.org/abs/1210.6367 recent work]
|Kamil
+
|Aram Harrow
|April 13
+
|3/7
 
|-
 
|-
|[http://arxiv.org/abs/0709.1142 Quantum expanders from any classical Cayley graph expander]
+
|[http://arxiv.org/abs/1206.5236 Quantum Compiling]
|Kevin
+
|Vadym Kliuchnikov
|April 20
+
|3/14
 
|-
 
|-
|[http://arxiv.org/abs/0706.0556 Random Unitaries Give Quantum Expanders], [[:media:RandomUnitariesQuantumExpanders-QCJC-printout.pdf | Slides]]
+
|[http://arxiv.org/abs/quant-ph/0512247 Quantum state merging] with [http://arxiv.org/abs/quant-ph/0606225 background]
|Isaac
+
|Cedric Yen-Yu Lin
|April 27
+
|3/21
 
|-
 
|-
|[http://arxiv.org/abs/cond-mat/0701055 Quantum Expander States], [[:media:QuantumExpanderStates-QCJC.pdf‎ | Slides]]
+
|[http://arxiv.org/abs/0809.3019 Post-selection technique for quantum channels with applications to quantum cryptography]
|Isaac
+
|Shelby Kimmel
|May 11
+
|3/28
 
|-
 
|-
|[http://arxiv.org/abs/0804.0011 Classical and Quantum Tensor Product Expanders]
+
|[]
|Kevin
+
|????
|May 11
+
|4/4
 
|-
 
|-
|[http://arxiv.org/abs/0804.0011 TPEs and Solovay-Kitaev]
+
|[]
|Kevin
+
|Isaac Crosson
|May 25
+
|4/11
 
|-
 
|-
 +
|[]
 
|
 
|
|
+
|4/18
|Jun 1
 
 
|-
 
|-
 +
|[]
 
|
 
|
|
+
|4/25
|
 
|-
 
 
|}
 
|}
  
 
==Papers==
 
==Papers==
===Classical Information Theory and Review===
+
===General Background===
http://www.youtube.com/user/classxteam#p/c/51268CD78FA180BF/0/yhvqwolUnHc
+
[http://arxiv.org/abs/1106.1445 From Classical to Quantum Shannon Theory] - A thorough and up-to-date (2012) free textbook by Mark Wilde. 
Video lectures by the legendary Thomas Cover. He uses his own book Elements of Information Theory 2nd Edition, which is also a pretty great book.  
+
 
 +
[http://www.youtube.com/user/classxteam#p/c/51268CD78FA180BF/0/yhvqwolUnHc Video lectures] by Thomas Cover on classical information theory.
  
 
Nielson and Chuang, Quantum Computing and Quantum Information: Part III
 
Nielson and Chuang, Quantum Computing and Quantum Information: Part III
  
===Quantum Information Theory===
+
===Papers===
 
 
"The Wilde book reviews a lot of them, but here are some good papers.
 
The last one is a real classic." - Aram
 
 
 
http://arxiv.org/abs/quant-ph/0606225
 
The mother of all protocols: Restructuring quantum information's family tree
 
Anura Abeyesinghe, Igor Devetak, Patrick Hayden, Andreas Winter
 
  
http://arxiv.org/abs/quant-ph/0407049
+
'''April 1996:''' [http://arxiv.org/abs/quant-ph/9604024 Mixed State Entanglement and Quantum Error Correction] - C. Bennett, D. DiVincenzo, J. Smolin, W. Wootters
Aspects of generic entanglement
 
Patrick Hayden, Debbie W. Leung, Andreas Winter
 
  
http://arxiv.org/abs/1003.4994
+
'''Sept 2003:''' [http://arxiv.org/abs/quant-ph/0309110 Secure key from bound entanglement] K. Horodecki, M. Horodecki, P. Horodecki, J. Oppenheim
Weak Decoupling Duality and Quantum Identification
 
Patrick Hayden, Andreas Winter
 
  
http://arxiv.org/abs/0912.5537
+
'''July 2004:''' [http://arxiv.org/abs/quant-ph/0407049 Aspects of generic entanglement] - P. Hayden, D. Leung, A. Winter
Quantum Reverse Shannon Theorem
 
Charles H. Bennett, Igor Devetak, Aram W. Harrow, Peter W. Shor, Andreas Winter
 
  
http://arxiv.org/abs/quant-ph/0512247
+
'''Dec 2005:''' [http://arxiv.org/abs/quant-ph/0512247 Quantum state merging and negative information] - M. Horodecki, J. Oppenheim, A. Winter
Quantum state merging and negative information
 
Michal Horodecki, Jonathan Oppenheim, Andreas Winter
 
  
http://arxiv.org/abs/quant-ph/0012127 (just the appendix)
+
'''June 2006:''' [http://arxiv.org/abs/quant-ph/0606225 The mother of all protocols: Restructuring quantum information's family tree] - A. Abeyesinghe, I. Devetak, P. Hayden, A. Winter
Strong Converse for Identification via Quantum Channels
 
R. Ahlswede, A. Winter
 
  
http://arxiv.org/abs/0809.3019
+
'''March 2007:''' [http://arxiv.org/abs/quant-ph/0703069 Symmetry implies independence] - R. Renner
Post-selection technique for quantum channels with applications to
 
quantum cryptography
 
Matthias Christandl, Robert Koenig, Renato Renner
 
  
http://arxiv.org/abs/quant-ph/0703069
+
'''Aug 2008:''' [http://arxiv.org/abs/0807.1338 The operational meaning of min- and max-entropy] - R. Koenig, R. Renner, C. Schaffner
Symmetry implies independence
 
Renato Renner
 
  
http://arxiv.org/abs/0807.1338
+
'''Sept 2008:''' [http://arxiv.org/abs/0809.3019 Post-selection technique for quantum channels with applications to quantum cryptography] - M. Christandl, R. Koenig, R. Renner
The operational meaning of min- and max-entropy
 
Robert Koenig, Renato Renner, Christian Schaffner
 
  
http://arxiv.org/abs/0904.0281
+
'''April 2009:''' [http://arxiv.org/abs/0904.0281 A Generalization of Quantum Stein's Lemma] - F. Brandao, M. Plenio
A Generalization of Quantum Stein's Lemma
 
Fernando G.S.L. Brandao, Martin B. Plenio
 
  
http://arxiv.org/abs/1003.4925
+
'''Dec 2009:''' [http://arxiv.org/abs/0912.5537 Quantum Reverse Shannon Theorem] - C. Bennett, I. Devetak, A. Harrow, P. Shor, A. Winter
Hastings' additivity counterexample via Dvoretzky's theorem
 
Guillaume Aubrun, Stanislaw Szarek, Elisabeth Werner
 
  
http://arxiv.org/abs/quant-ph/0309110
+
'''March 2010:''' [http://arxiv.org/abs/1003.4925 Hastings' additivity counterexample via Dvoretzky's theorem] - G. Aubrun, S. Szarek, E. Werner
Secure key from bound entanglement
 
Karol Horodecki, Michal Horodecki, Pawel Horodecki, Jonathan Oppenheim
 
  
http://arxiv.org/abs/1010.3007
+
'''March 2010:''' [http://arxiv.org/abs/1003.4994 Weak Decoupling Duality and Quantum Identification] - P. Hayden, A. Winter
From Low-Distortion Norm Embeddings to Explicit Uncertainty Relations
 
and Efficient Information Locking
 
Omar Fawzi, Patrick Hayden, Pranab Sen
 
  
http://arxiv.org/abs/quant-ph/9604024
+
'''Oct 2010:''' [http://arxiv.org/abs/1010.3007 From Low-Distortion Norm Embeddings to Explicit Uncertainty Relations and Efficient Information Locking] - O. Fawzi, P. Hayden, P. Sen
Mixed State Entanglement and Quantum Error Correction
 
Charles H. Bennett, David P. DiVincenzo, John A. Smolin, William K. Wootters
 
  
 
==Organizers==
 
==Organizers==
  
'''Organizer(1):''' [[User:Icrosson|Isaac Crosson]]
+
'''Organizer:''' [[User:kpm3|Kamil Michnicki]]
  
'''Organizer(2):''' [[User:kpm3|Kamil Michnicki]]
+
'''Wiki Page:''' [[User:Icrosson|Isaac Crosson]]
  
'''Faculty Advisor:''' [http://www.cs.washington.edu/homes/aram/ Aram Harrow]
+
'''Faculty Advisor:''' [http://www.mit.edu/~aram/ Aram Harrow]

Latest revision as of 19:32, 28 March 2013

This season we will be focusing on quantum information theory. Classical information theory is ubiquitous in science and mathematics with applications ranging from characterizing ensembles of particles to answering how many bits can be sent reliably over a noisy channel. It is even useful as an estimation technique for gauging the difficulty of a research problem. For instance, one may ask, how many bits are necessary to specify a quantum circuit acting on n bits(with bit flips Toffoli and Hadamard gates) and how does that compare to the number of bits required to specify a classical circuit(just bit flips and Tofolli gates)? This question already leads to a naive bound on the average quantum speed-up attainable over classical circuits, e.g. there isn't enough information in the specification of constant depth quantum circuits to characterize all reversible function on n-bits and so we conclude that there are deterministic functions that require more than constant quantum depth. Although this example is rather simple, it already gives the researcher some perspective about a very broad and difficult problem, that of finding quantum speed-ups. If classical information theory can quickly give us insight into the classical resources needed for a task, perhaps quantum information theory would be equally useful in giving us insight into the quantum resources needed for a quantum task?

Place and Time: Thursday at 2:45pm in the Cosman room(6C-442) or in cyberspace via Google Hangouts.

Schedule

Subject Speaker Date
Concentrating Partial Entanglement with Local Operations and lecture notes Kamil Michnicki 2/21
Consequences and Limits of Nonlocal Strategies Henry Yuen 2/28
Quantum De Finetti Theorems and recent work Aram Harrow 3/7
Quantum Compiling Vadym Kliuchnikov 3/14
Quantum state merging with background Cedric Yen-Yu Lin 3/21
Post-selection technique for quantum channels with applications to quantum cryptography Shelby Kimmel 3/28
[] ???? 4/4
[] Isaac Crosson 4/11
[] 4/18
[] 4/25

Papers

General Background

From Classical to Quantum Shannon Theory - A thorough and up-to-date (2012) free textbook by Mark Wilde.

Video lectures by Thomas Cover on classical information theory.

Nielson and Chuang, Quantum Computing and Quantum Information: Part III

Papers

April 1996: Mixed State Entanglement and Quantum Error Correction - C. Bennett, D. DiVincenzo, J. Smolin, W. Wootters

Sept 2003: Secure key from bound entanglement K. Horodecki, M. Horodecki, P. Horodecki, J. Oppenheim

July 2004: Aspects of generic entanglement - P. Hayden, D. Leung, A. Winter

Dec 2005: Quantum state merging and negative information - M. Horodecki, J. Oppenheim, A. Winter

June 2006: The mother of all protocols: Restructuring quantum information's family tree - A. Abeyesinghe, I. Devetak, P. Hayden, A. Winter

March 2007: Symmetry implies independence - R. Renner

Aug 2008: The operational meaning of min- and max-entropy - R. Koenig, R. Renner, C. Schaffner

Sept 2008: Post-selection technique for quantum channels with applications to quantum cryptography - M. Christandl, R. Koenig, R. Renner

April 2009: A Generalization of Quantum Stein's Lemma - F. Brandao, M. Plenio

Dec 2009: Quantum Reverse Shannon Theorem - C. Bennett, I. Devetak, A. Harrow, P. Shor, A. Winter

March 2010: Hastings' additivity counterexample via Dvoretzky's theorem - G. Aubrun, S. Szarek, E. Werner

March 2010: Weak Decoupling Duality and Quantum Identification - P. Hayden, A. Winter

Oct 2010: From Low-Distortion Norm Embeddings to Explicit Uncertainty Relations and Efficient Information Locking - O. Fawzi, P. Hayden, P. Sen

Organizers

Organizer: Kamil Michnicki

Wiki Page: Isaac Crosson

Faculty Advisor: Aram Harrow