http://quantum.cs.washington.edu/wiki/api.php?action=feedcontributions&user=Kpm3&feedformat=atomQuantum Computing Theory Group - User contributions [en]2024-03-29T09:36:30ZUser contributionsMediaWiki 1.27.4http://quantum.cs.washington.edu/wiki/index.php?title=Journal_Club_Winter_2013&diff=1578Journal Club Winter 20132013-03-28T19:32:37Z<p>Kpm3: </p>
<hr />
<div>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? <br />
<br />
'''Place and Time:''' Thursday at 2:45pm in the Cosman room(6C-442) or in cyberspace via Google Hangouts.<br />
==Schedule==<br />
{|border="1"<br />
!Subject<br />
!Speaker<br />
!Date<br />
|-<br />
|[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]<br />
|Kamil Michnicki<br />
|2/21<br />
|-<br />
|[http://arxiv.org/abs/quant-ph/0404076 Consequences and Limits of Nonlocal Strategies]<br />
|Henry Yuen<br />
|2/28<br />
|-<br />
|Quantum [http://arxiv.org/abs/quant-ph/0703069 De Finetti Theorems] and [http://arxiv.org/abs/1210.6367 recent work]<br />
|Aram Harrow<br />
|3/7<br />
|-<br />
|[http://arxiv.org/abs/1206.5236 Quantum Compiling]<br />
|Vadym Kliuchnikov<br />
|3/14<br />
|-<br />
|[http://arxiv.org/abs/quant-ph/0512247 Quantum state merging] with [http://arxiv.org/abs/quant-ph/0606225 background]<br />
|Cedric Yen-Yu Lin<br />
|3/21<br />
|-<br />
|[http://arxiv.org/abs/0809.3019 Post-selection technique for quantum channels with applications to quantum cryptography]<br />
|Shelby Kimmel<br />
|3/28<br />
|-<br />
|[]<br />
|????<br />
|4/4<br />
|-<br />
|[]<br />
|Isaac Crosson<br />
|4/11<br />
|-<br />
|[]<br />
|<br />
|4/18<br />
|-<br />
|[]<br />
|<br />
|4/25<br />
|}<br />
<br />
==Papers==<br />
===General Background===<br />
[http://arxiv.org/abs/1106.1445 From Classical to Quantum Shannon Theory] - A thorough and up-to-date (2012) free textbook by Mark Wilde. <br />
<br />
[http://www.youtube.com/user/classxteam#p/c/51268CD78FA180BF/0/yhvqwolUnHc Video lectures] by Thomas Cover on classical information theory.<br />
<br />
Nielson and Chuang, Quantum Computing and Quantum Information: Part III<br />
<br />
===Papers===<br />
<br />
'''April 1996:''' [http://arxiv.org/abs/quant-ph/9604024 Mixed State Entanglement and Quantum Error Correction] - C. Bennett, D. DiVincenzo, J. Smolin, W. Wootters<br />
<br />
'''Sept 2003:''' [http://arxiv.org/abs/quant-ph/0309110 Secure key from bound entanglement] K. Horodecki, M. Horodecki, P. Horodecki, J. Oppenheim<br />
<br />
'''July 2004:''' [http://arxiv.org/abs/quant-ph/0407049 Aspects of generic entanglement] - P. Hayden, D. Leung, A. Winter<br />
<br />
'''Dec 2005:''' [http://arxiv.org/abs/quant-ph/0512247 Quantum state merging and negative information] - M. Horodecki, J. Oppenheim, A. Winter<br />
<br />
'''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<br />
<br />
'''March 2007:''' [http://arxiv.org/abs/quant-ph/0703069 Symmetry implies independence] - R. Renner<br />
<br />
'''Aug 2008:''' [http://arxiv.org/abs/0807.1338 The operational meaning of min- and max-entropy] - R. Koenig, R. Renner, C. Schaffner<br />
<br />
'''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<br />
<br />
'''April 2009:''' [http://arxiv.org/abs/0904.0281 A Generalization of Quantum Stein's Lemma] - F. Brandao, M. Plenio<br />
<br />
'''Dec 2009:''' [http://arxiv.org/abs/0912.5537 Quantum Reverse Shannon Theorem] - C. Bennett, I. Devetak, A. Harrow, P. Shor, A. Winter<br />
<br />
'''March 2010:''' [http://arxiv.org/abs/1003.4925 Hastings' additivity counterexample via Dvoretzky's theorem] - G. Aubrun, S. Szarek, E. Werner<br />
<br />
'''March 2010:''' [http://arxiv.org/abs/1003.4994 Weak Decoupling Duality and Quantum Identification] - P. Hayden, A. Winter<br />
<br />
'''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<br />
<br />
==Organizers==<br />
<br />
'''Organizer:''' [[User:kpm3|Kamil Michnicki]]<br />
<br />
'''Wiki Page:''' [[User:Icrosson|Isaac Crosson]]<br />
<br />
'''Faculty Advisor:''' [http://www.mit.edu/~aram/ Aram Harrow]</div>Kpm3http://quantum.cs.washington.edu/wiki/index.php?title=Journal_Club_Winter_2013&diff=1577Journal Club Winter 20132013-03-28T19:27:26Z<p>Kpm3: </p>
<hr />
<div>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? <br />
<br />
'''Place and Time:''' Thursday at 2:45pm in the Cosman room(6C-442) or in cyberspace via Google Hangouts.<br />
==Schedule==<br />
{|border="1"<br />
!Subject<br />
!Speaker<br />
!Date<br />
|-<br />
|[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]<br />
|Kamil Michnicki<br />
|2/21<br />
|-<br />
|[http://arxiv.org/abs/quant-ph/0404076 Consequences and Limits of Nonlocal Strategies]<br />
|Henry Yuen<br />
|2/28<br />
|-<br />
|Quantum [http://arxiv.org/abs/quant-ph/0703069 De Finetti Theorems] and [http://arxiv.org/abs/1210.6367 recent work]<br />
|Aram Harrow<br />
|3/7<br />
|-<br />
|[]<br />
|Vadym<br />
|3/14<br />
|-<br />
|[]<br />
|Cedric Yen-Yu Lin<br />
|3/21<br />
|-<br />
|[]<br />
|Shelby Kimmel<br />
|3/28<br />
|-<br />
|[]<br />
|????<br />
|4/4<br />
|-<br />
|[]<br />
|Isaac Crosson<br />
|4/11<br />
|-<br />
|[]<br />
|<br />
|4/18<br />
|-<br />
|[]<br />
|<br />
|4/25<br />
|}<br />
<br />
==Papers==<br />
===General Background===<br />
[http://arxiv.org/abs/1106.1445 From Classical to Quantum Shannon Theory] - A thorough and up-to-date (2012) free textbook by Mark Wilde. <br />
<br />
[http://www.youtube.com/user/classxteam#p/c/51268CD78FA180BF/0/yhvqwolUnHc Video lectures] by Thomas Cover on classical information theory.<br />
<br />
Nielson and Chuang, Quantum Computing and Quantum Information: Part III<br />
<br />
===Papers===<br />
<br />
'''April 1996:''' [http://arxiv.org/abs/quant-ph/9604024 Mixed State Entanglement and Quantum Error Correction] - C. Bennett, D. DiVincenzo, J. Smolin, W. Wootters<br />
<br />
'''Sept 2003:''' [http://arxiv.org/abs/quant-ph/0309110 Secure key from bound entanglement] K. Horodecki, M. Horodecki, P. Horodecki, J. Oppenheim<br />
<br />
'''July 2004:''' [http://arxiv.org/abs/quant-ph/0407049 Aspects of generic entanglement] - P. Hayden, D. Leung, A. Winter<br />
<br />
'''Dec 2005:''' [http://arxiv.org/abs/quant-ph/0512247 Quantum state merging and negative information] - M. Horodecki, J. Oppenheim, A. Winter<br />
<br />
'''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<br />
<br />
'''March 2007:''' [http://arxiv.org/abs/quant-ph/0703069 Symmetry implies independence] - R. Renner<br />
<br />
'''Aug 2008:''' [http://arxiv.org/abs/0807.1338 The operational meaning of min- and max-entropy] - R. Koenig, R. Renner, C. Schaffner<br />
<br />
'''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<br />
<br />
'''April 2009:''' [http://arxiv.org/abs/0904.0281 A Generalization of Quantum Stein's Lemma] - F. Brandao, M. Plenio<br />
<br />
'''Dec 2009:''' [http://arxiv.org/abs/0912.5537 Quantum Reverse Shannon Theorem] - C. Bennett, I. Devetak, A. Harrow, P. Shor, A. Winter<br />
<br />
'''March 2010:''' [http://arxiv.org/abs/1003.4925 Hastings' additivity counterexample via Dvoretzky's theorem] - G. Aubrun, S. Szarek, E. Werner<br />
<br />
'''March 2010:''' [http://arxiv.org/abs/1003.4994 Weak Decoupling Duality and Quantum Identification] - P. Hayden, A. Winter<br />
<br />
'''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<br />
<br />
==Organizers==<br />
<br />
'''Organizer:''' [[User:kpm3|Kamil Michnicki]]<br />
<br />
'''Wiki Page:''' [[User:Icrosson|Isaac Crosson]]<br />
<br />
'''Faculty Advisor:''' [http://www.mit.edu/~aram/ Aram Harrow]</div>Kpm3http://quantum.cs.washington.edu/wiki/index.php?title=Journal_Club_Winter_2013&diff=1568Journal Club Winter 20132013-03-11T19:32:50Z<p>Kpm3: </p>
<hr />
<div>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? <br />
<br />
'''Place and Time:''' Thursday at 2:45pm in the Cosman room(6C-442) or in cyberspace via Google Hangouts.<br />
==Schedule==<br />
{|border="1"<br />
!Subject<br />
!Speaker<br />
!Date<br />
|-<br />
|[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]<br />
|Kamil Michnicki<br />
|2/21<br />
|-<br />
|[http://arxiv.org/abs/quant-ph/0404076 Consequences and Limits of Nonlocal Strategies]<br />
|Henry Yuen<br />
|2/28<br />
|-<br />
|Quantum [http://arxiv.org/abs/quant-ph/0703069 De Finetti Theorems] and [http://arxiv.org/abs/1210.6367 recent work]<br />
|Aram Harrow<br />
|3/7<br />
|-<br />
|[]<br />
|Cedric Yen-Yu Lin<br />
|3/14<br />
|-<br />
|[]<br />
|Shelby Kimmel<br />
|3/21<br />
|-<br />
|[]<br />
|Isaac Crosson<br />
|3/28<br />
|-<br />
|[]<br />
|Adam Bouland<br />
|4/4<br />
|}<br />
<br />
==Papers==<br />
===General Background===<br />
[http://arxiv.org/abs/1106.1445 From Classical to Quantum Shannon Theory] - A thorough and up-to-date (2012) free textbook by Mark Wilde. <br />
<br />
[http://www.youtube.com/user/classxteam#p/c/51268CD78FA180BF/0/yhvqwolUnHc Video lectures] by Thomas Cover on classical information theory.<br />
<br />
Nielson and Chuang, Quantum Computing and Quantum Information: Part III<br />
<br />
===Papers===<br />
<br />
'''April 1996:''' [http://arxiv.org/abs/quant-ph/9604024 Mixed State Entanglement and Quantum Error Correction] - C. Bennett, D. DiVincenzo, J. Smolin, W. Wootters<br />
<br />
'''Sept 2003:''' [http://arxiv.org/abs/quant-ph/0309110 Secure key from bound entanglement] K. Horodecki, M. Horodecki, P. Horodecki, J. Oppenheim<br />
<br />
'''July 2004:''' [http://arxiv.org/abs/quant-ph/0407049 Aspects of generic entanglement] - P. Hayden, D. Leung, A. Winter<br />
<br />
'''Dec 2005:''' [http://arxiv.org/abs/quant-ph/0512247 Quantum state merging and negative information] - M. Horodecki, J. Oppenheim, A. Winter<br />
<br />
'''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<br />
<br />
'''March 2007:''' [http://arxiv.org/abs/quant-ph/0703069 Symmetry implies independence] - R. Renner<br />
<br />
'''Aug 2008:''' [http://arxiv.org/abs/0807.1338 The operational meaning of min- and max-entropy] - R. Koenig, R. Renner, C. Schaffner<br />
<br />
'''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<br />
<br />
'''April 2009:''' [http://arxiv.org/abs/0904.0281 A Generalization of Quantum Stein's Lemma] - F. Brandao, M. Plenio<br />
<br />
'''Dec 2009:''' [http://arxiv.org/abs/0912.5537 Quantum Reverse Shannon Theorem] - C. Bennett, I. Devetak, A. Harrow, P. Shor, A. Winter<br />
<br />
'''March 2010:''' [http://arxiv.org/abs/1003.4925 Hastings' additivity counterexample via Dvoretzky's theorem] - G. Aubrun, S. Szarek, E. Werner<br />
<br />
'''March 2010:''' [http://arxiv.org/abs/1003.4994 Weak Decoupling Duality and Quantum Identification] - P. Hayden, A. Winter<br />
<br />
'''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<br />
<br />
==Organizers==<br />
<br />
'''Organizer:''' [[User:kpm3|Kamil Michnicki]]<br />
<br />
'''Wiki Page:''' [[User:Icrosson|Isaac Crosson]]<br />
<br />
'''Faculty Advisor:''' [http://www.mit.edu/~aram/ Aram Harrow]</div>Kpm3http://quantum.cs.washington.edu/wiki/index.php?title=File:ConcentratingPartialEntanglement.pdf&diff=1567File:ConcentratingPartialEntanglement.pdf2013-03-11T19:26:41Z<p>Kpm3: Lecture notes for a journal club talk on concentrating partial entanglement with local operations from a paper with the same title by Bennett et al.</p>
<hr />
<div>Lecture notes for a journal club talk on concentrating partial entanglement with local operations from a paper with the same title by Bennett et al.</div>Kpm3http://quantum.cs.washington.edu/wiki/index.php?title=Journal_Club_Winter_2013&diff=1566Journal Club Winter 20132013-03-11T19:21:52Z<p>Kpm3: </p>
<hr />
<div>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? <br />
<br />
'''Place and Time:''' Thursday at 2:45pm in the Cosman room(6C-442) or in cyberspace via Google Hangouts.<br />
==Schedule==<br />
{|border="1"<br />
!Subject<br />
!Speaker<br />
!Date<br />
|-<br />
|[http://arxiv.org/abs/quant-ph/9511030 Concentrating Partial Entanglement with Local Operations]<br />
|Kamil Michnicki<br />
|2/21<br />
|-<br />
|[http://arxiv.org/abs/quant-ph/0404076 Consequences and Limits of Nonlocal Strategies]<br />
|Henry Yuen<br />
|2/28<br />
|-<br />
|Quantum [http://arxiv.org/abs/quant-ph/0703069 De Finetti Theorems] and [http://arxiv.org/abs/1210.6367 recent work]<br />
|Aram Harrow<br />
|3/7<br />
|-<br />
|[]<br />
|Cedric Yen-Yu Lin<br />
|3/14<br />
|-<br />
|[]<br />
|Shelby Kimmel<br />
|3/21<br />
|-<br />
|[]<br />
|Isaac Crosson<br />
|3/28<br />
|-<br />
|[]<br />
|Adam Bouland<br />
|4/4<br />
|}<br />
<br />
==Papers==<br />
===General Background===<br />
[http://arxiv.org/abs/1106.1445 From Classical to Quantum Shannon Theory] - A thorough and up-to-date (2012) free textbook by Mark Wilde. <br />
<br />
[http://www.youtube.com/user/classxteam#p/c/51268CD78FA180BF/0/yhvqwolUnHc Video lectures] by Thomas Cover on classical information theory.<br />
<br />
Nielson and Chuang, Quantum Computing and Quantum Information: Part III<br />
<br />
===Papers===<br />
<br />
'''April 1996:''' [http://arxiv.org/abs/quant-ph/9604024 Mixed State Entanglement and Quantum Error Correction] - C. Bennett, D. DiVincenzo, J. Smolin, W. Wootters<br />
<br />
'''Sept 2003:''' [http://arxiv.org/abs/quant-ph/0309110 Secure key from bound entanglement] K. Horodecki, M. Horodecki, P. Horodecki, J. Oppenheim<br />
<br />
'''July 2004:''' [http://arxiv.org/abs/quant-ph/0407049 Aspects of generic entanglement] - P. Hayden, D. Leung, A. Winter<br />
<br />
'''Dec 2005:''' [http://arxiv.org/abs/quant-ph/0512247 Quantum state merging and negative information] - M. Horodecki, J. Oppenheim, A. Winter<br />
<br />
'''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<br />
<br />
'''March 2007:''' [http://arxiv.org/abs/quant-ph/0703069 Symmetry implies independence] - R. Renner<br />
<br />
'''Aug 2008:''' [http://arxiv.org/abs/0807.1338 The operational meaning of min- and max-entropy] - R. Koenig, R. Renner, C. Schaffner<br />
<br />
'''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<br />
<br />
'''April 2009:''' [http://arxiv.org/abs/0904.0281 A Generalization of Quantum Stein's Lemma] - F. Brandao, M. Plenio<br />
<br />
'''Dec 2009:''' [http://arxiv.org/abs/0912.5537 Quantum Reverse Shannon Theorem] - C. Bennett, I. Devetak, A. Harrow, P. Shor, A. Winter<br />
<br />
'''March 2010:''' [http://arxiv.org/abs/1003.4925 Hastings' additivity counterexample via Dvoretzky's theorem] - G. Aubrun, S. Szarek, E. Werner<br />
<br />
'''March 2010:''' [http://arxiv.org/abs/1003.4994 Weak Decoupling Duality and Quantum Identification] - P. Hayden, A. Winter<br />
<br />
'''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<br />
<br />
==Organizers==<br />
<br />
'''Organizer:''' [[User:kpm3|Kamil Michnicki]]<br />
<br />
'''Wiki Page:''' [[User:Icrosson|Isaac Crosson]]<br />
<br />
'''Faculty Advisor:''' [http://www.mit.edu/~aram/ Aram Harrow]</div>Kpm3http://quantum.cs.washington.edu/wiki/index.php?title=Journal_Club_Winter_2013&diff=1564Journal Club Winter 20132013-03-04T19:43:37Z<p>Kpm3: </p>
<hr />
<div>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? <br />
<br />
'''Place and Time:''' Thursday at 2:45pm in the Cosman room(6C-442) or in cyberspace via Google Hangouts.<br />
==Schedule==<br />
{|border="1"<br />
!Subject<br />
!Speaker<br />
!Date<br />
|-<br />
|[http://arxiv.org/abs/quant-ph/9511030 Concentrating Partial Entanglement with Local Operations]<br />
|Kamil Michnicki<br />
|2/21<br />
|-<br />
|[http://arxiv.org/abs/quant-ph/0404076 Consequences and Limits of Nonlocal Strategies]<br />
|Henry Yuen<br />
|2/28<br />
|-<br />
|[] Quantum De Finetti Theorems<br />
|Aram Harrow<br />
|3/7<br />
|-<br />
|[]<br />
|Cedric Yen-Yu Lin<br />
|3/14<br />
|-<br />
|[]<br />
|Shelby Kimmel<br />
|3/21<br />
|-<br />
|[]<br />
|Isaac Crosson<br />
|3/28<br />
|-<br />
|[]<br />
|Adam Bouland<br />
|4/4<br />
|}<br />
<br />
==Papers==<br />
===General Background===<br />
[http://arxiv.org/abs/1106.1445 From Classical to Quantum Shannon Theory] - A thorough and up-to-date (2012) free textbook by Mark Wilde. <br />
<br />
[http://www.youtube.com/user/classxteam#p/c/51268CD78FA180BF/0/yhvqwolUnHc Video lectures] by Thomas Cover on classical information theory.<br />
<br />
Nielson and Chuang, Quantum Computing and Quantum Information: Part III<br />
<br />
===Papers===<br />
<br />
'''April 1996:''' [http://arxiv.org/abs/quant-ph/9604024 Mixed State Entanglement and Quantum Error Correction] - C. Bennett, D. DiVincenzo, J. Smolin, W. Wootters<br />
<br />
'''Sept 2003:''' [http://arxiv.org/abs/quant-ph/0309110 Secure key from bound entanglement] K. Horodecki, M. Horodecki, P. Horodecki, J. Oppenheim<br />
<br />
'''July 2004:''' [http://arxiv.org/abs/quant-ph/0407049 Aspects of generic entanglement] - P. Hayden, D. Leung, A. Winter<br />
<br />
'''Dec 2005:''' [http://arxiv.org/abs/quant-ph/0512247 Quantum state merging and negative information] - M. Horodecki, J. Oppenheim, A. Winter<br />
<br />
'''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<br />
<br />
'''March 2007:''' [http://arxiv.org/abs/quant-ph/0703069 Symmetry implies independence] - R. Renner<br />
<br />
'''Aug 2008:''' [http://arxiv.org/abs/0807.1338 The operational meaning of min- and max-entropy] - R. Koenig, R. Renner, C. Schaffner<br />
<br />
'''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<br />
<br />
'''April 2009:''' [http://arxiv.org/abs/0904.0281 A Generalization of Quantum Stein's Lemma] - F. Brandao, M. Plenio<br />
<br />
'''Dec 2009:''' [http://arxiv.org/abs/0912.5537 Quantum Reverse Shannon Theorem] - C. Bennett, I. Devetak, A. Harrow, P. Shor, A. Winter<br />
<br />
'''March 2010:''' [http://arxiv.org/abs/1003.4925 Hastings' additivity counterexample via Dvoretzky's theorem] - G. Aubrun, S. Szarek, E. Werner<br />
<br />
'''March 2010:''' [http://arxiv.org/abs/1003.4994 Weak Decoupling Duality and Quantum Identification] - P. Hayden, A. Winter<br />
<br />
'''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<br />
<br />
==Organizers==<br />
<br />
'''Organizer:''' [[User:kpm3|Kamil Michnicki]]<br />
<br />
'''Wiki Page:''' [[User:Icrosson|Isaac Crosson]]<br />
<br />
'''Faculty Advisor:''' [http://www.mit.edu/~aram/ Aram Harrow]</div>Kpm3http://quantum.cs.washington.edu/wiki/index.php?title=Journal_Club_Winter_2013&diff=1563Journal Club Winter 20132013-03-04T19:27:56Z<p>Kpm3: </p>
<hr />
<div>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? <br />
<br />
'''Place and Time:''' Thursday at 2:45pm in the Cosman room(6C-442) or in cyberspace via Google Hangouts.<br />
==Schedule==<br />
{|border="1"<br />
!Subject<br />
!Speaker<br />
!Date<br />
|-<br />
|[http://arxiv.org/abs/quant-ph/9511030 Concentrating Partial Entanglement with Local Operations]<br />
|Kamil Michnicki<br />
|2/21<br />
|-<br />
|[http://arxiv.org/abs/quant-ph/0404076 Consequences and Limits of Nonlocal Strategies]<br />
|Henry Yuen<br />
|2/28<br />
|-<br />
|[]<br />
|Aram Harrow<br />
|3/7<br />
|-<br />
|[]<br />
|Cedric Yen-Yu Lin<br />
|3/14<br />
|-<br />
|[]<br />
|Shelby Kimmel<br />
|3/21<br />
|-<br />
|[]<br />
|Isaac Crosson<br />
|3/28<br />
|-<br />
|[]<br />
|Adam Bouland<br />
|4/4<br />
|}<br />
<br />
==Papers==<br />
===General Background===<br />
[http://arxiv.org/abs/1106.1445 From Classical to Quantum Shannon Theory] - A thorough and up-to-date (2012) free textbook by Mark Wilde. <br />
<br />
[http://www.youtube.com/user/classxteam#p/c/51268CD78FA180BF/0/yhvqwolUnHc Video lectures] by Thomas Cover on classical information theory.<br />
<br />
Nielson and Chuang, Quantum Computing and Quantum Information: Part III<br />
<br />
===Papers===<br />
<br />
'''April 1996:''' [http://arxiv.org/abs/quant-ph/9604024 Mixed State Entanglement and Quantum Error Correction] - C. Bennett, D. DiVincenzo, J. Smolin, W. Wootters<br />
<br />
'''Sept 2003:''' [http://arxiv.org/abs/quant-ph/0309110 Secure key from bound entanglement] K. Horodecki, M. Horodecki, P. Horodecki, J. Oppenheim<br />
<br />
'''July 2004:''' [http://arxiv.org/abs/quant-ph/0407049 Aspects of generic entanglement] - P. Hayden, D. Leung, A. Winter<br />
<br />
'''Dec 2005:''' [http://arxiv.org/abs/quant-ph/0512247 Quantum state merging and negative information] - M. Horodecki, J. Oppenheim, A. Winter<br />
<br />
'''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<br />
<br />
'''March 2007:''' [http://arxiv.org/abs/quant-ph/0703069 Symmetry implies independence] - R. Renner<br />
<br />
'''Aug 2008:''' [http://arxiv.org/abs/0807.1338 The operational meaning of min- and max-entropy] - R. Koenig, R. Renner, C. Schaffner<br />
<br />
'''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<br />
<br />
'''April 2009:''' [http://arxiv.org/abs/0904.0281 A Generalization of Quantum Stein's Lemma] - F. Brandao, M. Plenio<br />
<br />
'''Dec 2009:''' [http://arxiv.org/abs/0912.5537 Quantum Reverse Shannon Theorem] - C. Bennett, I. Devetak, A. Harrow, P. Shor, A. Winter<br />
<br />
'''March 2010:''' [http://arxiv.org/abs/1003.4925 Hastings' additivity counterexample via Dvoretzky's theorem] - G. Aubrun, S. Szarek, E. Werner<br />
<br />
'''March 2010:''' [http://arxiv.org/abs/1003.4994 Weak Decoupling Duality and Quantum Identification] - P. Hayden, A. Winter<br />
<br />
'''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<br />
<br />
==Organizers==<br />
<br />
'''Organizer:''' [[User:kpm3|Kamil Michnicki]]<br />
<br />
'''Wiki Page:''' [[User:Icrosson|Isaac Crosson]]<br />
<br />
'''Faculty Advisor:''' [http://www.mit.edu/~aram/ Aram Harrow]</div>Kpm3http://quantum.cs.washington.edu/wiki/index.php?title=Journal_Club_Winter_2013&diff=1559Journal Club Winter 20132013-02-26T19:49:54Z<p>Kpm3: </p>
<hr />
<div>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? <br />
<br />
'''Place and Time:''' Thursday at 2:45pm in the Cosman room(6C-442) or in cyberspace via Google Hangouts.<br />
==Schedule==<br />
{|border="1"<br />
!Subject<br />
!Speaker<br />
!Date<br />
|-<br />
|[http://arxiv.org/abs/quant-ph/9511030 Concentrating Partial Entanglement with Local Operations]<br />
|Kamil Michnicki<br />
|2/21<br />
|-<br />
|[http://arxiv.org/abs/quant-ph/0404076 Consequences and Limits of Nonlocal Strategies]<br />
|Henry Yuen<br />
|2/28<br />
|-<br />
|<br />
|<br />
|<br />
|-<br />
|[]<br />
|Cedric<br />
|3/14<br />
|-<br />
|[]<br />
|Shelby<br />
|3/21<br />
<br />
|}<br />
<br />
==Papers==<br />
===General Background===<br />
[http://arxiv.org/abs/1106.1445 From Classical to Quantum Shannon Theory] - A thorough and up-to-date (2012) free textbook by Mark Wilde. <br />
<br />
[http://www.youtube.com/user/classxteam#p/c/51268CD78FA180BF/0/yhvqwolUnHc Video lectures] by Thomas Cover on classical information theory.<br />
<br />
Nielson and Chuang, Quantum Computing and Quantum Information: Part III<br />
<br />
===Papers===<br />
<br />
'''April 1996:''' [http://arxiv.org/abs/quant-ph/9604024 Mixed State Entanglement and Quantum Error Correction] - C. Bennett, D. DiVincenzo, J. Smolin, W. Wootters<br />
<br />
'''Sept 2003:''' [http://arxiv.org/abs/quant-ph/0309110 Secure key from bound entanglement] K. Horodecki, M. Horodecki, P. Horodecki, J. Oppenheim<br />
<br />
'''July 2004:''' [http://arxiv.org/abs/quant-ph/0407049 Aspects of generic entanglement] - P. Hayden, D. Leung, A. Winter<br />
<br />
'''Dec 2005:''' [http://arxiv.org/abs/quant-ph/0512247 Quantum state merging and negative information] - M. Horodecki, J. Oppenheim, A. Winter<br />
<br />
'''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<br />
<br />
'''March 2007:''' [http://arxiv.org/abs/quant-ph/0703069 Symmetry implies independence] - R. Renner<br />
<br />
'''Aug 2008:''' [http://arxiv.org/abs/0807.1338 The operational meaning of min- and max-entropy] - R. Koenig, R. Renner, C. Schaffner<br />
<br />
'''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<br />
<br />
'''April 2009:''' [http://arxiv.org/abs/0904.0281 A Generalization of Quantum Stein's Lemma] - F. Brandao, M. Plenio<br />
<br />
'''Dec 2009:''' [http://arxiv.org/abs/0912.5537 Quantum Reverse Shannon Theorem] - C. Bennett, I. Devetak, A. Harrow, P. Shor, A. Winter<br />
<br />
'''March 2010:''' [http://arxiv.org/abs/1003.4925 Hastings' additivity counterexample via Dvoretzky's theorem] - G. Aubrun, S. Szarek, E. Werner<br />
<br />
'''March 2010:''' [http://arxiv.org/abs/1003.4994 Weak Decoupling Duality and Quantum Identification] - P. Hayden, A. Winter<br />
<br />
'''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<br />
<br />
==Organizers==<br />
<br />
'''Organizer:''' [[User:kpm3|Kamil Michnicki]]<br />
<br />
'''Wiki Page:''' [[User:Icrosson|Isaac Crosson]]<br />
<br />
'''Faculty Advisor:''' [http://www.mit.edu/~aram/ Aram Harrow]</div>Kpm3http://quantum.cs.washington.edu/wiki/index.php?title=Journal_Club_Winter_2013&diff=1558Journal Club Winter 20132013-02-26T19:46:11Z<p>Kpm3: </p>
<hr />
<div>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? <br />
<br />
'''Place and Time:''' Thursday at 2:45pm in the Cosman room(6C-442) or in cyberspace via Google Hangouts.<br />
==Schedule==<br />
{|border="1"<br />
!Subject<br />
!Speaker<br />
!Date<br />
|-<br />
|[http://arxiv.org/abs/quant-ph/9604024 Mixed State Entanglement and Quantum Error Correction]<br />
|Kamil Michnicki<br />
|2/21<br />
|-<br />
|[http://arxiv.org/abs/quant-ph/0404076 Consequences and Limits of Nonlocal Strategies]<br />
|Henry Yuen<br />
|2/28<br />
|-<br />
|<br />
|<br />
|<br />
|-<br />
|[]<br />
|Cedric<br />
|3/14<br />
|-<br />
|[]<br />
|Shelby<br />
|3/21<br />
<br />
|}<br />
<br />
==Papers==<br />
===General Background===<br />
[http://arxiv.org/abs/1106.1445 From Classical to Quantum Shannon Theory] - A thorough and up-to-date (2012) free textbook by Mark Wilde. <br />
<br />
[http://www.youtube.com/user/classxteam#p/c/51268CD78FA180BF/0/yhvqwolUnHc Video lectures] by Thomas Cover on classical information theory.<br />
<br />
Nielson and Chuang, Quantum Computing and Quantum Information: Part III<br />
<br />
===Papers===<br />
<br />
'''April 1996:''' [http://arxiv.org/abs/quant-ph/9604024 Mixed State Entanglement and Quantum Error Correction] - C. Bennett, D. DiVincenzo, J. Smolin, W. Wootters<br />
<br />
'''Sept 2003:''' [http://arxiv.org/abs/quant-ph/0309110 Secure key from bound entanglement] K. Horodecki, M. Horodecki, P. Horodecki, J. Oppenheim<br />
<br />
'''July 2004:''' [http://arxiv.org/abs/quant-ph/0407049 Aspects of generic entanglement] - P. Hayden, D. Leung, A. Winter<br />
<br />
'''Dec 2005:''' [http://arxiv.org/abs/quant-ph/0512247 Quantum state merging and negative information] - M. Horodecki, J. Oppenheim, A. Winter<br />
<br />
'''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<br />
<br />
'''March 2007:''' [http://arxiv.org/abs/quant-ph/0703069 Symmetry implies independence] - R. Renner<br />
<br />
'''Aug 2008:''' [http://arxiv.org/abs/0807.1338 The operational meaning of min- and max-entropy] - R. Koenig, R. Renner, C. Schaffner<br />
<br />
'''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<br />
<br />
'''April 2009:''' [http://arxiv.org/abs/0904.0281 A Generalization of Quantum Stein's Lemma] - F. Brandao, M. Plenio<br />
<br />
'''Dec 2009:''' [http://arxiv.org/abs/0912.5537 Quantum Reverse Shannon Theorem] - C. Bennett, I. Devetak, A. Harrow, P. Shor, A. Winter<br />
<br />
'''March 2010:''' [http://arxiv.org/abs/1003.4925 Hastings' additivity counterexample via Dvoretzky's theorem] - G. Aubrun, S. Szarek, E. Werner<br />
<br />
'''March 2010:''' [http://arxiv.org/abs/1003.4994 Weak Decoupling Duality and Quantum Identification] - P. Hayden, A. Winter<br />
<br />
'''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<br />
<br />
==Organizers==<br />
<br />
'''Organizer:''' [[User:kpm3|Kamil Michnicki]]<br />
<br />
'''Wiki Page:''' [[User:Icrosson|Isaac Crosson]]<br />
<br />
'''Faculty Advisor:''' [http://www.mit.edu/~aram/ Aram Harrow]</div>Kpm3http://quantum.cs.washington.edu/wiki/index.php?title=Journal_Club_Winter_2013&diff=1557Journal Club Winter 20132013-02-26T19:44:14Z<p>Kpm3: </p>
<hr />
<div>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? <br />
<br />
'''Place and Time:''' Thursday at 2:45pm in the Cosman room(6C-442) or in cyberspace via Google Hangouts.<br />
==Schedule==<br />
{|border="1"<br />
!Subject<br />
!Speaker<br />
!Date<br />
|-<br />
|[http://arxiv.org/abs/quant-ph/9604024 Mixed State Entanglement and Quantum Error Correction]<br />
|Kamil Michnicki<br />
|2/21<br />
|-<br />
|[http://arxiv.org/abs/quant-ph/0404076 Consequences and Limits of Nonlocal Strategies]<br />
|Henry Yuen<br />
|2/21<br />
|-<br />
|<br />
|<br />
|<br />
|-<br />
|[]<br />
|Cedric<br />
|2/21<br />
|-<br />
|[]<br />
|Shelby<br />
|2/21<br />
<br />
|}<br />
<br />
==Papers==<br />
===General Background===<br />
[http://arxiv.org/abs/1106.1445 From Classical to Quantum Shannon Theory] - A thorough and up-to-date (2012) free textbook by Mark Wilde. <br />
<br />
[http://www.youtube.com/user/classxteam#p/c/51268CD78FA180BF/0/yhvqwolUnHc Video lectures] by Thomas Cover on classical information theory.<br />
<br />
Nielson and Chuang, Quantum Computing and Quantum Information: Part III<br />
<br />
===Papers===<br />
<br />
'''April 1996:''' [http://arxiv.org/abs/quant-ph/9604024 Mixed State Entanglement and Quantum Error Correction] - C. Bennett, D. DiVincenzo, J. Smolin, W. Wootters<br />
<br />
'''Sept 2003:''' [http://arxiv.org/abs/quant-ph/0309110 Secure key from bound entanglement] K. Horodecki, M. Horodecki, P. Horodecki, J. Oppenheim<br />
<br />
'''July 2004:''' [http://arxiv.org/abs/quant-ph/0407049 Aspects of generic entanglement] - P. Hayden, D. Leung, A. Winter<br />
<br />
'''Dec 2005:''' [http://arxiv.org/abs/quant-ph/0512247 Quantum state merging and negative information] - M. Horodecki, J. Oppenheim, A. Winter<br />
<br />
'''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<br />
<br />
'''March 2007:''' [http://arxiv.org/abs/quant-ph/0703069 Symmetry implies independence] - R. Renner<br />
<br />
'''Aug 2008:''' [http://arxiv.org/abs/0807.1338 The operational meaning of min- and max-entropy] - R. Koenig, R. Renner, C. Schaffner<br />
<br />
'''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<br />
<br />
'''April 2009:''' [http://arxiv.org/abs/0904.0281 A Generalization of Quantum Stein's Lemma] - F. Brandao, M. Plenio<br />
<br />
'''Dec 2009:''' [http://arxiv.org/abs/0912.5537 Quantum Reverse Shannon Theorem] - C. Bennett, I. Devetak, A. Harrow, P. Shor, A. Winter<br />
<br />
'''March 2010:''' [http://arxiv.org/abs/1003.4925 Hastings' additivity counterexample via Dvoretzky's theorem] - G. Aubrun, S. Szarek, E. Werner<br />
<br />
'''March 2010:''' [http://arxiv.org/abs/1003.4994 Weak Decoupling Duality and Quantum Identification] - P. Hayden, A. Winter<br />
<br />
'''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<br />
<br />
==Organizers==<br />
<br />
'''Organizer:''' [[User:kpm3|Kamil Michnicki]]<br />
<br />
'''Wiki Page:''' [[User:Icrosson|Isaac Crosson]]<br />
<br />
'''Faculty Advisor:''' [http://www.mit.edu/~aram/ Aram Harrow]</div>Kpm3http://quantum.cs.washington.edu/wiki/index.php?title=Journal_Club_Winter_2013&diff=1555Journal Club Winter 20132013-02-19T16:09:14Z<p>Kpm3: </p>
<hr />
<div>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? <br />
<br />
'''Place and Time:''' Thursday at 2:45pm in the Cosman room(6C-442) or in cyberspace via Google Hangouts.<br />
==Schedule==<br />
{|border="1"<br />
!Subject<br />
!Speaker<br />
!Date<br />
|-<br />
|[http://arxiv.org/abs/quant-ph/9604024 Mixed State Entanglement and Quantum Error Correction]<br />
|Kamil<br />
|2/21<br />
|-<br />
|<br />
|<br />
|<br />
|-<br />
|}<br />
<br />
==Papers==<br />
===General Background===<br />
[http://arxiv.org/abs/1106.1445 From Classical to Quantum Shannon Theory] - A thorough and up-to-date (2012) free textbook by Mark Wilde. <br />
<br />
[http://www.youtube.com/user/classxteam#p/c/51268CD78FA180BF/0/yhvqwolUnHc Video lectures] by Thomas Cover on classical information theory.<br />
<br />
Nielson and Chuang, Quantum Computing and Quantum Information: Part III<br />
<br />
===Papers===<br />
<br />
'''April 1996:''' [http://arxiv.org/abs/quant-ph/9604024 Mixed State Entanglement and Quantum Error Correction] - C. Bennett, D. DiVincenzo, J. Smolin, W. Wootters<br />
<br />
'''Sept 2003:''' [http://arxiv.org/abs/quant-ph/0309110 Secure key from bound entanglement] K. Horodecki, M. Horodecki, P. Horodecki, J. Oppenheim<br />
<br />
'''July 2004:''' [http://arxiv.org/abs/quant-ph/0407049 Aspects of generic entanglement] - P. Hayden, D. Leung, A. Winter<br />
<br />
'''Dec 2005:''' [http://arxiv.org/abs/quant-ph/0512247 Quantum state merging and negative information] - M. Horodecki, J. Oppenheim, A. Winter<br />
<br />
'''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<br />
<br />
'''March 2007:''' [http://arxiv.org/abs/quant-ph/0703069 Symmetry implies independence] - R. Renner<br />
<br />
'''Aug 2008:''' [http://arxiv.org/abs/0807.1338 The operational meaning of min- and max-entropy] - R. Koenig, R. Renner, C. Schaffner<br />
<br />
'''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<br />
<br />
'''April 2009:''' [http://arxiv.org/abs/0904.0281 A Generalization of Quantum Stein's Lemma] - F. Brandao, M. Plenio<br />
<br />
'''Dec 2009:''' [http://arxiv.org/abs/0912.5537 Quantum Reverse Shannon Theorem] - C. Bennett, I. Devetak, A. Harrow, P. Shor, A. Winter<br />
<br />
'''March 2010:''' [http://arxiv.org/abs/1003.4925 Hastings' additivity counterexample via Dvoretzky's theorem] - G. Aubrun, S. Szarek, E. Werner<br />
<br />
'''March 2010:''' [http://arxiv.org/abs/1003.4994 Weak Decoupling Duality and Quantum Identification] - P. Hayden, A. Winter<br />
<br />
'''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<br />
<br />
==Organizers==<br />
<br />
'''Organizer:''' [[User:kpm3|Kamil Michnicki]]<br />
<br />
'''Wiki Page:''' [[User:Icrosson|Isaac Crosson]]<br />
<br />
'''Faculty Advisor:''' [http://www.mit.edu/~aram/ Aram Harrow]</div>Kpm3http://quantum.cs.washington.edu/wiki/index.php?title=Journal_Club_Winter_2013&diff=1554Journal Club Winter 20132013-02-19T16:04:00Z<p>Kpm3: </p>
<hr />
<div>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 gives 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? <br />
<br />
'''Place and Time:''' Thursday at 2:45pm in the Cosman room(6C-442) or in cyberspace via Google Hangouts.<br />
==Schedule==<br />
{|border="1"<br />
!Subject<br />
!Speaker<br />
!Date<br />
|-<br />
|[http://arxiv.org/abs/quant-ph/9604024 Mixed State Entanglement and Quantum Error Correction]<br />
|Kamil<br />
|2/21<br />
|-<br />
|<br />
|<br />
|<br />
|-<br />
|}<br />
<br />
==Papers==<br />
===General Background===<br />
[http://arxiv.org/abs/1106.1445 From Classical to Quantum Shannon Theory] - A thorough and up-to-date (2012) free textbook by Mark Wilde. <br />
<br />
[http://www.youtube.com/user/classxteam#p/c/51268CD78FA180BF/0/yhvqwolUnHc Video lectures] by Thomas Cover on classical information theory.<br />
<br />
Nielson and Chuang, Quantum Computing and Quantum Information: Part III<br />
<br />
===Papers===<br />
<br />
'''April 1996:''' [http://arxiv.org/abs/quant-ph/9604024 Mixed State Entanglement and Quantum Error Correction] - C. Bennett, D. DiVincenzo, J. Smolin, W. Wootters<br />
<br />
'''Sept 2003:''' [http://arxiv.org/abs/quant-ph/0309110 Secure key from bound entanglement] K. Horodecki, M. Horodecki, P. Horodecki, J. Oppenheim<br />
<br />
'''July 2004:''' [http://arxiv.org/abs/quant-ph/0407049 Aspects of generic entanglement] - P. Hayden, D. Leung, A. Winter<br />
<br />
'''Dec 2005:''' [http://arxiv.org/abs/quant-ph/0512247 Quantum state merging and negative information] - M. Horodecki, J. Oppenheim, A. Winter<br />
<br />
'''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<br />
<br />
'''March 2007:''' [http://arxiv.org/abs/quant-ph/0703069 Symmetry implies independence] - R. Renner<br />
<br />
'''Aug 2008:''' [http://arxiv.org/abs/0807.1338 The operational meaning of min- and max-entropy] - R. Koenig, R. Renner, C. Schaffner<br />
<br />
'''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<br />
<br />
'''April 2009:''' [http://arxiv.org/abs/0904.0281 A Generalization of Quantum Stein's Lemma] - F. Brandao, M. Plenio<br />
<br />
'''Dec 2009:''' [http://arxiv.org/abs/0912.5537 Quantum Reverse Shannon Theorem] - C. Bennett, I. Devetak, A. Harrow, P. Shor, A. Winter<br />
<br />
'''March 2010:''' [http://arxiv.org/abs/1003.4925 Hastings' additivity counterexample via Dvoretzky's theorem] - G. Aubrun, S. Szarek, E. Werner<br />
<br />
'''March 2010:''' [http://arxiv.org/abs/1003.4994 Weak Decoupling Duality and Quantum Identification] - P. Hayden, A. Winter<br />
<br />
'''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<br />
<br />
==Organizers==<br />
<br />
'''Organizer:''' [[User:kpm3|Kamil Michnicki]]<br />
<br />
'''Wiki Page:''' [[User:Icrosson|Isaac Crosson]]<br />
<br />
'''Faculty Advisor:''' [http://www.mit.edu/~aram/ Aram Harrow]</div>Kpm3http://quantum.cs.washington.edu/wiki/index.php?title=Journal_Club_Winter_2013&diff=1553Journal Club Winter 20132013-02-19T15:32:39Z<p>Kpm3: </p>
<hr />
<div>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 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 gives 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? <br />
<br />
'''Place and Time:''' Thursday at 2:45pm in the Cosman room(6C-442) or in cyberspace via Google Hangouts.<br />
==Schedule==<br />
{|border="1"<br />
!Subject<br />
!Speaker<br />
!Date<br />
|-<br />
|[http://arxiv.org/abs/quant-ph/9604024 Mixed State Entanglement and Quantum Error Correction]<br />
|Kamil<br />
|2/21<br />
|-<br />
|<br />
|<br />
|<br />
|-<br />
|}<br />
<br />
==Papers==<br />
===General Background===<br />
[http://arxiv.org/abs/1106.1445 From Classical to Quantum Shannon Theory] - A thorough and up-to-date (2012) free textbook by Mark Wilde. <br />
<br />
[http://www.youtube.com/user/classxteam#p/c/51268CD78FA180BF/0/yhvqwolUnHc Video lectures] by Thomas Cover on classical information theory.<br />
<br />
Nielson and Chuang, Quantum Computing and Quantum Information: Part III<br />
<br />
===Papers===<br />
<br />
'''April 1996:''' [http://arxiv.org/abs/quant-ph/9604024 Mixed State Entanglement and Quantum Error Correction] - C. Bennett, D. DiVincenzo, J. Smolin, W. Wootters<br />
<br />
'''Sept 2003:''' [http://arxiv.org/abs/quant-ph/0309110 Secure key from bound entanglement] K. Horodecki, M. Horodecki, P. Horodecki, J. Oppenheim<br />
<br />
'''July 2004:''' [http://arxiv.org/abs/quant-ph/0407049 Aspects of generic entanglement] - P. Hayden, D. Leung, A. Winter<br />
<br />
'''Dec 2005:''' [http://arxiv.org/abs/quant-ph/0512247 Quantum state merging and negative information] - M. Horodecki, J. Oppenheim, A. Winter<br />
<br />
'''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<br />
<br />
'''March 2007:''' [http://arxiv.org/abs/quant-ph/0703069 Symmetry implies independence] - R. Renner<br />
<br />
'''Aug 2008:''' [http://arxiv.org/abs/0807.1338 The operational meaning of min- and max-entropy] - R. Koenig, R. Renner, C. Schaffner<br />
<br />
'''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<br />
<br />
'''April 2009:''' [http://arxiv.org/abs/0904.0281 A Generalization of Quantum Stein's Lemma] - F. Brandao, M. Plenio<br />
<br />
'''Dec 2009:''' [http://arxiv.org/abs/0912.5537 Quantum Reverse Shannon Theorem] - C. Bennett, I. Devetak, A. Harrow, P. Shor, A. Winter<br />
<br />
'''March 2010:''' [http://arxiv.org/abs/1003.4925 Hastings' additivity counterexample via Dvoretzky's theorem] - G. Aubrun, S. Szarek, E. Werner<br />
<br />
'''March 2010:''' [http://arxiv.org/abs/1003.4994 Weak Decoupling Duality and Quantum Identification] - P. Hayden, A. Winter<br />
<br />
'''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<br />
<br />
==Organizers==<br />
<br />
'''Organizer:''' [[User:kpm3|Kamil Michnicki]]<br />
<br />
'''Wiki Page:''' [[User:Icrosson|Isaac Crosson]]<br />
<br />
'''Faculty Advisor:''' [http://www.mit.edu/~aram/ Aram Harrow]</div>Kpm3http://quantum.cs.washington.edu/wiki/index.php?title=Journal_Club_Winter_2013&diff=1552Journal Club Winter 20132013-02-19T15:01:53Z<p>Kpm3: </p>
<hr />
<div>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 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? 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 an arbitrary reversible function on n-bits and so we conclude that there are classical 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 gives 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? <br />
<br />
'''Place and Time:''' Thursday at 2:45pm in the Cosman room(6C-442) or in cyberspace via Google Hangouts.<br />
==Schedule==<br />
{|border="1"<br />
!Subject<br />
!Speaker<br />
!Date<br />
|-<br />
|[http://arxiv.org/abs/quant-ph/9604024 Mixed State Entanglement and Quantum Error Correction]<br />
|Kamil<br />
|2/21<br />
|-<br />
|<br />
|<br />
|<br />
|-<br />
|}<br />
<br />
==Papers==<br />
===General Background===<br />
[http://arxiv.org/abs/1106.1445 From Classical to Quantum Shannon Theory] - A thorough and up-to-date (2012) free textbook by Mark Wilde. <br />
<br />
[http://www.youtube.com/user/classxteam#p/c/51268CD78FA180BF/0/yhvqwolUnHc Video lectures] by Thomas Cover on classical information theory.<br />
<br />
Nielson and Chuang, Quantum Computing and Quantum Information: Part III<br />
<br />
===Papers===<br />
<br />
'''April 1996:''' [http://arxiv.org/abs/quant-ph/9604024 Mixed State Entanglement and Quantum Error Correction] - C. Bennett, D. DiVincenzo, J. Smolin, W. Wootters<br />
<br />
'''Sept 2003:''' [http://arxiv.org/abs/quant-ph/0309110 Secure key from bound entanglement] K. Horodecki, M. Horodecki, P. Horodecki, J. Oppenheim<br />
<br />
'''July 2004:''' [http://arxiv.org/abs/quant-ph/0407049 Aspects of generic entanglement] - P. Hayden, D. Leung, A. Winter<br />
<br />
'''Dec 2005:''' [http://arxiv.org/abs/quant-ph/0512247 Quantum state merging and negative information] - M. Horodecki, J. Oppenheim, A. Winter<br />
<br />
'''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<br />
<br />
'''March 2007:''' [http://arxiv.org/abs/quant-ph/0703069 Symmetry implies independence] - R. Renner<br />
<br />
'''Aug 2008:''' [http://arxiv.org/abs/0807.1338 The operational meaning of min- and max-entropy] - R. Koenig, R. Renner, C. Schaffner<br />
<br />
'''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<br />
<br />
'''April 2009:''' [http://arxiv.org/abs/0904.0281 A Generalization of Quantum Stein's Lemma] - F. Brandao, M. Plenio<br />
<br />
'''Dec 2009:''' [http://arxiv.org/abs/0912.5537 Quantum Reverse Shannon Theorem] - C. Bennett, I. Devetak, A. Harrow, P. Shor, A. Winter<br />
<br />
'''March 2010:''' [http://arxiv.org/abs/1003.4925 Hastings' additivity counterexample via Dvoretzky's theorem] - G. Aubrun, S. Szarek, E. Werner<br />
<br />
'''March 2010:''' [http://arxiv.org/abs/1003.4994 Weak Decoupling Duality and Quantum Identification] - P. Hayden, A. Winter<br />
<br />
'''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<br />
<br />
==Organizers==<br />
<br />
'''Organizer:''' [[User:kpm3|Kamil Michnicki]]<br />
<br />
'''Wiki Page:''' [[User:Icrosson|Isaac Crosson]]<br />
<br />
'''Faculty Advisor:''' [http://www.mit.edu/~aram/ Aram Harrow]</div>Kpm3http://quantum.cs.washington.edu/wiki/index.php?title=Journal_Club_Winter_2013&diff=1551Journal Club Winter 20132013-02-19T14:56:17Z<p>Kpm3: </p>
<hr />
<div>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 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? 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 an arbitrary reversible function on n-bits and so we conclude that there are classical 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 gives 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? <br />
<br />
'''Place and Time:''' Thursday at 2:45pm in 6C-442 or in cyberspace via Google Hangouts.<br />
==Schedule==<br />
{|border="1"<br />
!Subject<br />
!Speaker<br />
!Date<br />
|-<br />
|[http://arxiv.org/abs/quant-ph/9604024 Mixed State Entanglement and Quantum Error Correction]<br />
|Kamil<br />
|2/21<br />
|-<br />
|<br />
|<br />
|<br />
|-<br />
|}<br />
<br />
==Papers==<br />
===General Background===<br />
[http://arxiv.org/abs/1106.1445 From Classical to Quantum Shannon Theory] - A thorough and up-to-date (2012) free textbook by Mark Wilde. <br />
<br />
[http://www.youtube.com/user/classxteam#p/c/51268CD78FA180BF/0/yhvqwolUnHc Video lectures] by Thomas Cover on classical information theory.<br />
<br />
Nielson and Chuang, Quantum Computing and Quantum Information: Part III<br />
<br />
===Papers===<br />
<br />
'''April 1996:''' [http://arxiv.org/abs/quant-ph/9604024 Mixed State Entanglement and Quantum Error Correction] - C. Bennett, D. DiVincenzo, J. Smolin, W. Wootters<br />
<br />
'''Sept 2003:''' [http://arxiv.org/abs/quant-ph/0309110 Secure key from bound entanglement] K. Horodecki, M. Horodecki, P. Horodecki, J. Oppenheim<br />
<br />
'''July 2004:''' [http://arxiv.org/abs/quant-ph/0407049 Aspects of generic entanglement] - P. Hayden, D. Leung, A. Winter<br />
<br />
'''Dec 2005:''' [http://arxiv.org/abs/quant-ph/0512247 Quantum state merging and negative information] - M. Horodecki, J. Oppenheim, A. Winter<br />
<br />
'''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<br />
<br />
'''March 2007:''' [http://arxiv.org/abs/quant-ph/0703069 Symmetry implies independence] - R. Renner<br />
<br />
'''Aug 2008:''' [http://arxiv.org/abs/0807.1338 The operational meaning of min- and max-entropy] - R. Koenig, R. Renner, C. Schaffner<br />
<br />
'''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<br />
<br />
'''April 2009:''' [http://arxiv.org/abs/0904.0281 A Generalization of Quantum Stein's Lemma] - F. Brandao, M. Plenio<br />
<br />
'''Dec 2009:''' [http://arxiv.org/abs/0912.5537 Quantum Reverse Shannon Theorem] - C. Bennett, I. Devetak, A. Harrow, P. Shor, A. Winter<br />
<br />
'''March 2010:''' [http://arxiv.org/abs/1003.4925 Hastings' additivity counterexample via Dvoretzky's theorem] - G. Aubrun, S. Szarek, E. Werner<br />
<br />
'''March 2010:''' [http://arxiv.org/abs/1003.4994 Weak Decoupling Duality and Quantum Identification] - P. Hayden, A. Winter<br />
<br />
'''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<br />
<br />
==Organizers==<br />
<br />
'''Organizer:''' [[User:kpm3|Kamil Michnicki]]<br />
<br />
'''Wiki Page:''' [[User:Icrosson|Isaac Crosson]]<br />
<br />
'''Faculty Advisor:''' [http://www.mit.edu/~aram/ Aram Harrow]</div>Kpm3http://quantum.cs.washington.edu/wiki/index.php?title=Journal_Club_Winter_2013&diff=1550Journal Club Winter 20132013-02-19T14:50:39Z<p>Kpm3: </p>
<hr />
<div>This season we will be focusing on Quantum Information Theory. Applications of classical information theory are 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 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? This question already puts a 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 an arbitrary reversible function on n-bits and so we conclude that there are classical 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 gives 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? <br />
<br />
'''Place and Time:''' Thursday at 2:45pm in 6C-442 or in cyberspace via Google Hangouts.<br />
==Schedule==<br />
{|border="1"<br />
!Subject<br />
!Speaker<br />
!Date<br />
|-<br />
|[http://arxiv.org/abs/quant-ph/9604024 Mixed State Entanglement and Quantum Error Correction]<br />
|Kamil<br />
|2/21<br />
|-<br />
|<br />
|<br />
|<br />
|-<br />
|}<br />
<br />
==Papers==<br />
===General Background===<br />
[http://arxiv.org/abs/1106.1445 From Classical to Quantum Shannon Theory] - A thorough and up-to-date (2012) free textbook by Mark Wilde. <br />
<br />
[http://www.youtube.com/user/classxteam#p/c/51268CD78FA180BF/0/yhvqwolUnHc Video lectures] by Thomas Cover on classical information theory.<br />
<br />
Nielson and Chuang, Quantum Computing and Quantum Information: Part III<br />
<br />
===Papers===<br />
<br />
'''April 1996:''' [http://arxiv.org/abs/quant-ph/9604024 Mixed State Entanglement and Quantum Error Correction] - C. Bennett, D. DiVincenzo, J. Smolin, W. Wootters<br />
<br />
'''Sept 2003:''' [http://arxiv.org/abs/quant-ph/0309110 Secure key from bound entanglement] K. Horodecki, M. Horodecki, P. Horodecki, J. Oppenheim<br />
<br />
'''July 2004:''' [http://arxiv.org/abs/quant-ph/0407049 Aspects of generic entanglement] - P. Hayden, D. Leung, A. Winter<br />
<br />
'''Dec 2005:''' [http://arxiv.org/abs/quant-ph/0512247 Quantum state merging and negative information] - M. Horodecki, J. Oppenheim, A. Winter<br />
<br />
'''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<br />
<br />
'''March 2007:''' [http://arxiv.org/abs/quant-ph/0703069 Symmetry implies independence] - R. Renner<br />
<br />
'''Aug 2008:''' [http://arxiv.org/abs/0807.1338 The operational meaning of min- and max-entropy] - R. Koenig, R. Renner, C. Schaffner<br />
<br />
'''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<br />
<br />
'''April 2009:''' [http://arxiv.org/abs/0904.0281 A Generalization of Quantum Stein's Lemma] - F. Brandao, M. Plenio<br />
<br />
'''Dec 2009:''' [http://arxiv.org/abs/0912.5537 Quantum Reverse Shannon Theorem] - C. Bennett, I. Devetak, A. Harrow, P. Shor, A. Winter<br />
<br />
'''March 2010:''' [http://arxiv.org/abs/1003.4925 Hastings' additivity counterexample via Dvoretzky's theorem] - G. Aubrun, S. Szarek, E. Werner<br />
<br />
'''March 2010:''' [http://arxiv.org/abs/1003.4994 Weak Decoupling Duality and Quantum Identification] - P. Hayden, A. Winter<br />
<br />
'''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<br />
<br />
==Organizers==<br />
<br />
'''Organizer:''' [[User:kpm3|Kamil Michnicki]]<br />
<br />
'''Wiki Page:''' [[User:Icrosson|Isaac Crosson]]<br />
<br />
'''Faculty Advisor:''' [http://www.mit.edu/~aram/ Aram Harrow]</div>Kpm3http://quantum.cs.washington.edu/wiki/index.php?title=Journal_Club_Winter_2013&diff=1547Journal Club Winter 20132013-02-15T23:13:00Z<p>Kpm3: </p>
<hr />
<div>This quarter we will be focusing on Quantum Information Theory. <br />
<br />
'''Place and Time:''' Thursday at 2:45pm in 6C-442 or in cyberspace via Google Hangouts.<br />
==Schedule==<br />
{|border="1"<br />
!Subject<br />
!Speaker<br />
!Date<br />
|-<br />
|[http://arxiv.org/abs/quant-ph/9604024 Mixed State Entanglement and Quantum Error Correction]<br />
|Kamil<br />
|2/21<br />
|-<br />
|<br />
|<br />
|<br />
|-<br />
|}<br />
<br />
==Papers==<br />
===General Background===<br />
[http://arxiv.org/abs/1106.1445 From Classical to Quantum Shannon Theory] - A thorough and up-to-date (2012) free textbook by Mark Wilde. <br />
<br />
[http://www.youtube.com/user/classxteam#p/c/51268CD78FA180BF/0/yhvqwolUnHc Video lectures] by Thomas Cover on classical information theory.<br />
<br />
Nielson and Chuang, Quantum Computing and Quantum Information: Part III<br />
<br />
===Papers===<br />
<br />
'''April 1996:''' [http://arxiv.org/abs/quant-ph/9604024 Mixed State Entanglement and Quantum Error Correction] - C. Bennett, D. DiVincenzo, J. Smolin, W. Wootters<br />
<br />
'''Sept 2003:''' [http://arxiv.org/abs/quant-ph/0309110 Secure key from bound entanglement] K. Horodecki, M. Horodecki, P. Horodecki, J. Oppenheim<br />
<br />
'''July 2004:''' [http://arxiv.org/abs/quant-ph/0407049 Aspects of generic entanglement] - P. Hayden, D. Leung, A. Winter<br />
<br />
'''Dec 2005:''' [http://arxiv.org/abs/quant-ph/0512247 Quantum state merging and negative information] - M. Horodecki, J. Oppenheim, A. Winter<br />
<br />
'''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<br />
<br />
'''March 2007:''' [http://arxiv.org/abs/quant-ph/0703069 Symmetry implies independence] - R. Renner<br />
<br />
'''Aug 2008:''' [http://arxiv.org/abs/0807.1338 The operational meaning of min- and max-entropy] - R. Koenig, R. Renner, C. Schaffner<br />
<br />
'''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<br />
<br />
'''April 2009:''' [http://arxiv.org/abs/0904.0281 A Generalization of Quantum Stein's Lemma] - F. Brandao, M. Plenio<br />
<br />
'''Dec 2009:''' [http://arxiv.org/abs/0912.5537 Quantum Reverse Shannon Theorem] - C. Bennett, I. Devetak, A. Harrow, P. Shor, A. Winter<br />
<br />
'''March 2010:''' [http://arxiv.org/abs/1003.4925 Hastings' additivity counterexample via Dvoretzky's theorem] - G. Aubrun, S. Szarek, E. Werner<br />
<br />
'''March 2010:''' [http://arxiv.org/abs/1003.4994 Weak Decoupling Duality and Quantum Identification] - P. Hayden, A. Winter<br />
<br />
'''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<br />
<br />
==Organizers==<br />
<br />
'''Organizer:''' [[User:kpm3|Kamil Michnicki]]<br />
<br />
'''Wiki Page:''' [[User:Icrosson|Isaac Crosson]]<br />
<br />
'''Faculty Advisor:''' [http://www.mit.edu/~aram/ Aram Harrow]</div>Kpm3http://quantum.cs.washington.edu/wiki/index.php?title=Journal_Club_Winter_2013&diff=1526Journal Club Winter 20132013-02-08T20:13:48Z<p>Kpm3: </p>
<hr />
<div>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. <br />
<br />
'''Place:''' Fridays at 1:30pm in CSE 674 ("the Irish room").<br />
==Schedule==<br />
{|border="1"<br />
!Subject<br />
!Speaker<br />
!Date<br />
|-<br />
|[http://theoryofcomputing.org/articles/v006a003/ Quantum Expanders: Motivation and Construction]<br />
|Isaac<br />
|March 30<br />
|-<br />
|<br />
|<br />
|<br />
|-<br />
|}<br />
<br />
==Papers==<br />
===Classical Information Theory and Review===<br />
http://www.youtube.com/user/classxteam#p/c/51268CD78FA180BF/0/yhvqwolUnHc<br />
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. <br />
<br />
Nielson and Chuang, Quantum Computing and Quantum Information: Part III<br />
<br />
http://arxiv.org/pdf/1106.1445.pdf<br />
Mark Wilde also has an excellent book available for download.<br />
<br />
===Quantum Information Theory===<br />
<br />
"The Wilde book reviews a lot of them, but here are some good papers.<br />
The last one is a real classic." - Aram<br />
<br />
http://arxiv.org/abs/quant-ph/0606225<br />
The mother of all protocols: Restructuring quantum information's family tree<br />
Anura Abeyesinghe, Igor Devetak, Patrick Hayden, Andreas Winter<br />
<br />
http://arxiv.org/abs/quant-ph/0407049<br />
Aspects of generic entanglement<br />
Patrick Hayden, Debbie W. Leung, Andreas Winter<br />
<br />
http://arxiv.org/abs/1003.4994<br />
Weak Decoupling Duality and Quantum Identification<br />
Patrick Hayden, Andreas Winter<br />
<br />
http://arxiv.org/abs/0912.5537<br />
Quantum Reverse Shannon Theorem<br />
Charles H. Bennett, Igor Devetak, Aram W. Harrow, Peter W. Shor, Andreas Winter<br />
<br />
http://arxiv.org/abs/quant-ph/0512247<br />
Quantum state merging and negative information<br />
Michal Horodecki, Jonathan Oppenheim, Andreas Winter<br />
<br />
http://arxiv.org/abs/quant-ph/0012127 (just the appendix)<br />
Strong Converse for Identification via Quantum Channels<br />
R. Ahlswede, A. Winter<br />
<br />
http://arxiv.org/abs/0809.3019<br />
Post-selection technique for quantum channels with applications to<br />
quantum cryptography<br />
Matthias Christandl, Robert Koenig, Renato Renner<br />
<br />
http://arxiv.org/abs/quant-ph/0703069<br />
Symmetry implies independence<br />
Renato Renner<br />
<br />
http://arxiv.org/abs/0807.1338<br />
The operational meaning of min- and max-entropy<br />
Robert Koenig, Renato Renner, Christian Schaffner<br />
<br />
http://arxiv.org/abs/0904.0281<br />
A Generalization of Quantum Stein's Lemma<br />
Fernando G.S.L. Brandao, Martin B. Plenio<br />
<br />
http://arxiv.org/abs/1003.4925<br />
Hastings' additivity counterexample via Dvoretzky's theorem<br />
Guillaume Aubrun, Stanislaw Szarek, Elisabeth Werner<br />
<br />
http://arxiv.org/abs/quant-ph/0309110<br />
Secure key from bound entanglement<br />
Karol Horodecki, Michal Horodecki, Pawel Horodecki, Jonathan Oppenheim<br />
<br />
http://arxiv.org/abs/1010.3007<br />
From Low-Distortion Norm Embeddings to Explicit Uncertainty Relations<br />
and Efficient Information Locking<br />
Omar Fawzi, Patrick Hayden, Pranab Sen<br />
<br />
http://arxiv.org/abs/quant-ph/9604024<br />
Mixed State Entanglement and Quantum Error Correction<br />
Charles H. Bennett, David P. DiVincenzo, John A. Smolin, William K. Wootters<br />
<br />
==Organizers==<br />
<br />
'''Organizer(1):''' [[User:Icrosson|Isaac Crosson]]<br />
<br />
'''Organizer(2):''' [[User:kpm3|Kamil Michnicki]]<br />
<br />
'''Faculty Advisor:''' [http://www.cs.washington.edu/homes/aram/ Aram Harrow]</div>Kpm3http://quantum.cs.washington.edu/wiki/index.php?title=Journal_Club_Winter_2013&diff=1525Journal Club Winter 20132013-02-08T12:51:04Z<p>Kpm3: </p>
<hr />
<div>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. <br />
<br />
'''Place:''' Fridays at 1:30pm in CSE 674 ("the Irish room").<br />
==Schedule==<br />
{|border="1"<br />
!Subject<br />
!Speaker<br />
!Date<br />
|-<br />
|[http://theoryofcomputing.org/articles/v006a003/ Quantum Expanders: Motivation and Construction]<br />
|Isaac<br />
|March 30<br />
|-<br />
|<br />
|<br />
|<br />
|-<br />
|}<br />
<br />
==Papers==<br />
===Classical Information Theory and Review===<br />
http://www.youtube.com/user/classxteam#p/c/51268CD78FA180BF/0/yhvqwolUnHc<br />
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. <br />
<br />
Nielson and Chuang, Quantum Computing and Quantum Information: Part III<br />
<br />
===Quantum Information Theory===<br />
<br />
"The Wilde book reviews a lot of them, but here are some good papers.<br />
The last one is a real classic." - Aram<br />
<br />
http://arxiv.org/abs/quant-ph/0606225<br />
The mother of all protocols: Restructuring quantum information's family tree<br />
Anura Abeyesinghe, Igor Devetak, Patrick Hayden, Andreas Winter<br />
<br />
http://arxiv.org/abs/quant-ph/0407049<br />
Aspects of generic entanglement<br />
Patrick Hayden, Debbie W. Leung, Andreas Winter<br />
<br />
http://arxiv.org/abs/1003.4994<br />
Weak Decoupling Duality and Quantum Identification<br />
Patrick Hayden, Andreas Winter<br />
<br />
http://arxiv.org/abs/0912.5537<br />
Quantum Reverse Shannon Theorem<br />
Charles H. Bennett, Igor Devetak, Aram W. Harrow, Peter W. Shor, Andreas Winter<br />
<br />
http://arxiv.org/abs/quant-ph/0512247<br />
Quantum state merging and negative information<br />
Michal Horodecki, Jonathan Oppenheim, Andreas Winter<br />
<br />
http://arxiv.org/abs/quant-ph/0012127 (just the appendix)<br />
Strong Converse for Identification via Quantum Channels<br />
R. Ahlswede, A. Winter<br />
<br />
http://arxiv.org/abs/0809.3019<br />
Post-selection technique for quantum channels with applications to<br />
quantum cryptography<br />
Matthias Christandl, Robert Koenig, Renato Renner<br />
<br />
http://arxiv.org/abs/quant-ph/0703069<br />
Symmetry implies independence<br />
Renato Renner<br />
<br />
http://arxiv.org/abs/0807.1338<br />
The operational meaning of min- and max-entropy<br />
Robert Koenig, Renato Renner, Christian Schaffner<br />
<br />
http://arxiv.org/abs/0904.0281<br />
A Generalization of Quantum Stein's Lemma<br />
Fernando G.S.L. Brandao, Martin B. Plenio<br />
<br />
http://arxiv.org/abs/1003.4925<br />
Hastings' additivity counterexample via Dvoretzky's theorem<br />
Guillaume Aubrun, Stanislaw Szarek, Elisabeth Werner<br />
<br />
http://arxiv.org/abs/quant-ph/0309110<br />
Secure key from bound entanglement<br />
Karol Horodecki, Michal Horodecki, Pawel Horodecki, Jonathan Oppenheim<br />
<br />
http://arxiv.org/abs/1010.3007<br />
From Low-Distortion Norm Embeddings to Explicit Uncertainty Relations<br />
and Efficient Information Locking<br />
Omar Fawzi, Patrick Hayden, Pranab Sen<br />
<br />
http://arxiv.org/abs/quant-ph/9604024<br />
Mixed State Entanglement and Quantum Error Correction<br />
Charles H. Bennett, David P. DiVincenzo, John A. Smolin, William K. Wootters<br />
<br />
==Organizers==<br />
<br />
'''Organizer(1):''' [[User:Icrosson|Isaac Crosson]]<br />
<br />
'''Organizer(2):''' [[User:kpm3|Kamil Michnicki]]<br />
<br />
'''Faculty Advisor:''' [http://www.cs.washington.edu/homes/aram/ Aram Harrow]</div>Kpm3http://quantum.cs.washington.edu/wiki/index.php?title=Journal_Club_Winter_2013&diff=1524Journal Club Winter 20132013-02-08T12:48:36Z<p>Kpm3: </p>
<hr />
<div>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. <br />
<br />
'''Place:''' Fridays at 1:30pm in CSE 674 ("the Irish room").<br />
==Schedule==<br />
{|border="1"<br />
!Subject<br />
!Speaker<br />
!Date<br />
|-<br />
|[http://theoryofcomputing.org/articles/v006a003/ Quantum Expanders: Motivation and Construction]<br />
|Isaac<br />
|March 30<br />
|-<br />
|[http://theoryofcomputing.org/articles/v006a003/ Continue Review] <br />
|Kamil<br />
|April 6<br />
|-<br />
|Continue Review<br />
|Kamil<br />
|April 13<br />
|-<br />
|[http://arxiv.org/abs/0709.1142 Quantum expanders from any classical Cayley graph expander]<br />
|Kevin<br />
|April 20<br />
|-<br />
|[http://arxiv.org/abs/0706.0556 Random Unitaries Give Quantum Expanders], [[:media:RandomUnitariesQuantumExpanders-QCJC-printout.pdf | Slides]]<br />
|Isaac<br />
|April 27<br />
|-<br />
|[http://arxiv.org/abs/cond-mat/0701055 Quantum Expander States], [[:media:QuantumExpanderStates-QCJC.pdf | Slides]]<br />
|Isaac<br />
|May 11 <br />
|-<br />
|[http://arxiv.org/abs/0804.0011 Classical and Quantum Tensor Product Expanders]<br />
|Kevin<br />
|May 11<br />
|-<br />
|[http://arxiv.org/abs/0804.0011 TPEs and Solovay-Kitaev]<br />
|Kevin<br />
|May 25<br />
|-<br />
|<br />
|<br />
|Jun 1<br />
|-<br />
|<br />
|<br />
|<br />
|-<br />
|}<br />
<br />
==Papers==<br />
===Classical Information Theory and Review===<br />
http://www.youtube.com/user/classxteam#p/c/51268CD78FA180BF/0/yhvqwolUnHc<br />
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. <br />
<br />
Nielson and Chuang, Quantum Computing and Quantum Information: Part III<br />
<br />
===Quantum Information Theory===<br />
<br />
"The Wilde book reviews a lot of them, but here are some good papers.<br />
The last one is a real classic." - Aram<br />
<br />
http://arxiv.org/abs/quant-ph/0606225<br />
The mother of all protocols: Restructuring quantum information's family tree<br />
Anura Abeyesinghe, Igor Devetak, Patrick Hayden, Andreas Winter<br />
<br />
http://arxiv.org/abs/quant-ph/0407049<br />
Aspects of generic entanglement<br />
Patrick Hayden, Debbie W. Leung, Andreas Winter<br />
<br />
http://arxiv.org/abs/1003.4994<br />
Weak Decoupling Duality and Quantum Identification<br />
Patrick Hayden, Andreas Winter<br />
<br />
http://arxiv.org/abs/0912.5537<br />
Quantum Reverse Shannon Theorem<br />
Charles H. Bennett, Igor Devetak, Aram W. Harrow, Peter W. Shor, Andreas Winter<br />
<br />
http://arxiv.org/abs/quant-ph/0512247<br />
Quantum state merging and negative information<br />
Michal Horodecki, Jonathan Oppenheim, Andreas Winter<br />
<br />
http://arxiv.org/abs/quant-ph/0012127 (just the appendix)<br />
Strong Converse for Identification via Quantum Channels<br />
R. Ahlswede, A. Winter<br />
<br />
http://arxiv.org/abs/0809.3019<br />
Post-selection technique for quantum channels with applications to<br />
quantum cryptography<br />
Matthias Christandl, Robert Koenig, Renato Renner<br />
<br />
http://arxiv.org/abs/quant-ph/0703069<br />
Symmetry implies independence<br />
Renato Renner<br />
<br />
http://arxiv.org/abs/0807.1338<br />
The operational meaning of min- and max-entropy<br />
Robert Koenig, Renato Renner, Christian Schaffner<br />
<br />
http://arxiv.org/abs/0904.0281<br />
A Generalization of Quantum Stein's Lemma<br />
Fernando G.S.L. Brandao, Martin B. Plenio<br />
<br />
http://arxiv.org/abs/1003.4925<br />
Hastings' additivity counterexample via Dvoretzky's theorem<br />
Guillaume Aubrun, Stanislaw Szarek, Elisabeth Werner<br />
<br />
http://arxiv.org/abs/quant-ph/0309110<br />
Secure key from bound entanglement<br />
Karol Horodecki, Michal Horodecki, Pawel Horodecki, Jonathan Oppenheim<br />
<br />
http://arxiv.org/abs/1010.3007<br />
From Low-Distortion Norm Embeddings to Explicit Uncertainty Relations<br />
and Efficient Information Locking<br />
Omar Fawzi, Patrick Hayden, Pranab Sen<br />
<br />
http://arxiv.org/abs/quant-ph/9604024<br />
Mixed State Entanglement and Quantum Error Correction<br />
Charles H. Bennett, David P. DiVincenzo, John A. Smolin, William K. Wootters<br />
<br />
==Organizers==<br />
<br />
'''Organizer(1):''' [[User:Icrosson|Isaac Crosson]]<br />
<br />
'''Organizer(2):''' [[User:kpm3|Kamil Michnicki]]<br />
<br />
'''Faculty Advisor:''' [http://www.cs.washington.edu/homes/aram/ Aram Harrow]</div>Kpm3http://quantum.cs.washington.edu/wiki/index.php?title=Journal_Club_Winter_2013&diff=1523Journal Club Winter 20132012-12-27T04:46:22Z<p>Kpm3: Created page with "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. '''Place:'..."</p>
<hr />
<div>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. <br />
<br />
'''Place:''' Fridays at 1:30pm in CSE 674 ("the Irish room").<br />
==Schedule==<br />
{|border="1"<br />
!Subject<br />
!Speaker<br />
!Date<br />
|-<br />
|[http://theoryofcomputing.org/articles/v006a003/ Quantum Expanders: Motivation and Construction]<br />
|Isaac<br />
|March 30<br />
|-<br />
|[http://theoryofcomputing.org/articles/v006a003/ Continue Review] <br />
|Kamil<br />
|April 6<br />
|-<br />
|Continue Review<br />
|Kamil<br />
|April 13<br />
|-<br />
|[http://arxiv.org/abs/0709.1142 Quantum expanders from any classical Cayley graph expander]<br />
|Kevin<br />
|April 20<br />
|-<br />
|[http://arxiv.org/abs/0706.0556 Random Unitaries Give Quantum Expanders], [[:media:RandomUnitariesQuantumExpanders-QCJC-printout.pdf | Slides]]<br />
|Isaac<br />
|April 27<br />
|-<br />
|[http://arxiv.org/abs/cond-mat/0701055 Quantum Expander States], [[:media:QuantumExpanderStates-QCJC.pdf | Slides]]<br />
|Isaac<br />
|May 11 <br />
|-<br />
|[http://arxiv.org/abs/0804.0011 Classical and Quantum Tensor Product Expanders]<br />
|Kevin<br />
|May 11<br />
|-<br />
|[http://arxiv.org/abs/0804.0011 TPEs and Solovay-Kitaev]<br />
|Kevin<br />
|May 25<br />
|-<br />
|<br />
|<br />
|Jun 1<br />
|-<br />
|<br />
|<br />
|<br />
|-<br />
|}<br />
<br />
==Papers==<br />
===Review and Introduction===<br />
May 2010: '''Quantum Expanders: Motivation and Construction''' - Ben-Aroya, Schwartz, Ta-Shma<br/><br />
''"We define quantum expanders in a natural way and give two constructions of quantum expanders, both based on classical expander constructions."''<br/><br />
http://theoryofcomputing.org/articles/v006a003/<br />
<br />
June 2003: '''Randomizing quantum states: Constructions and applications''' - Hayden, Leung, Shor, Winter<br/><br />
''"The construction of a perfectly secure private quantum channel in dimension d is known to require 2 log d shared random key bits between the sender and receiver. We show that if only near-perfect security is required, the size of the key can be reduced by a factor of two."''<br/><br />
http://arxiv.org/abs/quant-ph/0307104 , http://arxiv.org/abs/0802.4193<br />
<br />
===Expander Constructions===<br />
Jun 2007: '''Random Unitaries Give Quantum Expanders''' - M. B. Hastings<br/><br />
''"We show that randomly choosing the matrices in a completely positive map from the unitary group gives a quantum expander. "''<br/><br />
http://arxiv.org/abs/0706.0556<br />
<br />
Sep 2007: '''Quantum expanders from any classical Cayley graph expander''' - A. W. Harrow<br/><br />
''"We give a simple recipe for translating walks on Cayley graphs of a group G into a quantum operation on any irrep of G. "''<br/><br />
http://arxiv.org/abs/0709.1142 0709.1142<br />
<br />
Apr 2008: '''Classical and Quantum Tensor Product Expanders''' - M. B. Hastings, A. W. Harrow<br/><br />
''"We introduce the concept of quantum tensor product expanders. These are expanders that act on several copies of a given system, where the Kraus operators are tensor products of the Kraus operator on a single system."''<br/><br />
http://arxiv.org/abs/0804.0011<br />
<br />
Nov 2008: '''Efficient Quantum Tensor Product Expanders and k-designs''' - A. W. Harrow, R. A. Low<br/><br />
''"we give an efficient construction of constant-degree, constant-gap quantum k-tensor product expanders."''<br/><br />
http://arxiv.org/abs/0811.2597<br />
<br />
===Entanglement===<br />
<br />
Sep 2004: '''Entanglement in Random Subspaces''' - Hayden<br/><br />
''"The selection of random subspaces plays a role in quantum information theory analogous to the role of random strings in classical information theory."''<br/><br />
http://arxiv.org/abs/quant-ph/0409157<br />
<br />
July 2004: '''Aspects of generic entanglement''' - Hayden, Leung, Winter<br/><br />
'"We study entanglement and other correlation properties of random states in high-dimensional bipartite systems."'<br/><br />
http://arxiv.org/abs/quant-ph/0407049<br />
<br />
Jan 2007: '''Entropy and Entanglement in Quantum Ground States''' - M.B. Hastings<br/><br />
'"We prove that there exist gapped one-dimensional local Hamiltonians such that the entropy is exponentially large in the correlation length"'<br/><br />
http://arxiv.org/abs/cond-mat/0701055<br />
<br />
===Additional Topics===<br />
<br />
Jun 2006: '''The mother of all protocols: Restructuring quantum information's family tree''' - Abeyesinghe, Devetak, Hayden, Winter<br/><br />
http://arxiv.org/abs/quant-ph/0606225<br />
<br />
Oct 2010: '''From Low-Distortion Norm Embeddings to Explicit Uncertainty Relations and Efficient Information Locking''' - Fawzi, Hayden, Sen<br/><br />
http://arxiv.org/abs/1010.3007<br />
<br />
Oct 2009: '''Non-additivity of Renyi entropy and Dvoretzky's Theorem''' - Aubrun, Szarek, Werner<br/><br />
http://arxiv.org/abs/0910.1189<br />
<br />
Mar 2010: '''Hastings' additivity counterexample via Dvoretzky's theorem''' - Aubrun, Szarek, Werner<br/><br />
http://arxiv.org/abs/1003.4925<br />
<br />
Jun 2011: '''Entanglement thresholds for random induced states''' - Aubrun, Szarek, Ye<br/><br />
http://arxiv.org/abs/1106.2264<br />
<br />
Nov 2011: '''Towards the fast scrambling conjecture''' - Lashkari, Stanford, Hastings, Osborne, Hayden<br/><br />
http://arxiv.org/abs/1111.6580<br />
<br />
==Organizers==<br />
<br />
'''Organizer(1):''' [[User:Icrosson|Isaac Crosson]]<br />
<br />
'''Organizer(2):''' [[User:kpm3|Kamil Michnicki]]<br />
<br />
'''Faculty Advisor:''' [http://www.cs.washington.edu/homes/aram/ Aram Harrow]</div>Kpm3http://quantum.cs.washington.edu/wiki/index.php?title=Journal_Club_Spring_2012&diff=1472Journal Club Spring 20122012-04-05T05:56:57Z<p>Kpm3: </p>
<hr />
<div>This quarter we will be focusing on Quantum Expanders and Randomized Constructions.<br />
<br />
'''Place:''' Fridays at 1:30pm in CSE 674 ("the Irish room").<br />
==Schedule==<br />
{|border="1"<br />
!Subject<br />
!Speaker<br />
!Date<br />
|-<br />
|[http://theoryofcomputing.org/articles/v006a003/ Quantum Expanders: Motivation and Construction]<br />
|Group<br />
|March 30<br />
|-<br />
|[http://theoryofcomputing.org/articles/v006a003/ Continue Review] <br />
|Group<br />
|April 6<br />
|-<br />
|<br />
|<br />
|April 13<br />
|-<br />
|<br />
|<br />
|April 20<br />
|-<br />
|<br />
|<br />
|April 27<br />
|-<br />
|<br />
|<br />
|May 4<br />
|-<br />
|<br />
|<br />
|May 11<br />
|-<br />
|<br />
|<br />
|May 18<br />
|-<br />
|<br />
|<br />
|<br />
|-<br />
|}<br />
<br />
==Papers==<br />
===Review and Introduction===<br />
May 2010: '''Quantum Expanders: Motivation and Construction''' - Ben-Aroya, Schwartz, Ta-Shma<br/><br />
''"We define quantum expanders in a natural way and give two constructions of quantum expanders, both based on classical expander constructions."''<br/><br />
http://theoryofcomputing.org/articles/v006a003/<br />
<br />
June 2003: '''Randomizing quantum states: Constructions and applications''' - Hayden, Leung, Shor, Winter<br/><br />
''"The construction of a perfectly secure private quantum channel in dimension d is known to require 2 log d shared random key bits between the sender and receiver. We show that if only near-perfect security is required, the size of the key can be reduced by a factor of two."''<br/><br />
http://arxiv.org/abs/quant-ph/0307104 , http://arxiv.org/abs/0802.4193<br />
<br />
===Expander Constructions===<br />
Jun 2007: '''Random Unitaries Give Quantum Expanders''' - M. B. Hastings<br/><br />
''"We show that randomly choosing the matrices in a completely positive map from the unitary group gives a quantum expander. "''<br/><br />
http://arxiv.org/abs/0706.0556<br />
<br />
Sep 2007: '''Quantum expanders from any classical Cayley graph expander''' - A. W. Harrow<br/><br />
''"We give a simple recipe for translating walks on Cayley graphs of a group G into a quantum operation on any irrep of G. "''<br/><br />
http://arxiv.org/abs/0709.1142 0709.1142<br />
<br />
Apr 2008: '''Classical and Quantum Tensor Product Expanders''' - M. B. Hastings, A. W. Harrow<br/><br />
''"We introduce the concept of quantum tensor product expanders. These are expanders that act on several copies of a given system, where the Kraus operators are tensor products of the Kraus operator on a single system."''<br/><br />
http://arxiv.org/abs/0804.0011<br />
<br />
Nov 2008: '''Efficient Quantum Tensor Product Expanders and k-designs''' - A. W. Harrow, R. A. Low<br/><br />
''"we give an efficient construction of constant-degree, constant-gap quantum k-tensor product expanders."''<br/><br />
http://arxiv.org/abs/0811.2597<br />
<br />
===Entanglement===<br />
<br />
Sep 2004: '''Entanglement in Random Subspaces''' - Hayden<br/><br />
''"The selection of random subspaces plays a role in quantum information theory analogous to the role of random strings in classical information theory."''<br/><br />
http://arxiv.org/abs/quant-ph/0409157<br />
<br />
July 2004: '''Aspects of generic entanglement''' - Hayden, Leung, Winter<br/><br />
'"We study entanglement and other correlation properties of random states in high-dimensional bipartite systems."'<br/><br />
http://arxiv.org/abs/quant-ph/0407049<br />
<br />
Jan 2007: '''Entropy and Entanglement in Quantum Ground States''' - M.B. Hastings<br/><br />
'"We prove that there exist gapped one-dimensional local Hamiltonians such that the entropy is exponentially large in the correlation length"'<br/><br />
http://arxiv.org/abs/cond-mat/0701055<br />
<br />
===Additional Topics===<br />
<br />
Jun 2006: '''The mother of all protocols: Restructuring quantum information's family tree''' - Abeyesinghe, Devetak, Hayden, Winter<br/><br />
http://arxiv.org/abs/quant-ph/0606225<br />
<br />
Oct 2010: '''From Low-Distortion Norm Embeddings to Explicit Uncertainty Relations and Efficient Information Locking''' - Fawzi, Hayden, Sen<br/><br />
http://arxiv.org/abs/1010.3007<br />
<br />
Oct 2009: '''Non-additivity of Renyi entropy and Dvoretzky's Theorem''' - Aubrun, Szarek, Werner<br/><br />
http://arxiv.org/abs/0910.1189<br />
<br />
Mar 2010: '''Hastings' additivity counterexample via Dvoretzky's theorem''' - Aubrun, Szarek, Werner<br/><br />
http://arxiv.org/abs/1003.4925<br />
<br />
Jun 2011: '''Entanglement thresholds for random induced states''' - Aubrun, Szarek, Ye<br/><br />
http://arxiv.org/abs/1106.2264<br />
<br />
Nov 2011: '''Towards the fast scrambling conjecture''' - Lashkari, Stanford, Hastings, Osborne, Hayden<br/><br />
http://arxiv.org/abs/1111.6580<br />
<br />
==Organizers==<br />
<br />
'''Organizer(1):''' [[User:Icrosson|Isaac Crosson]]<br />
<br />
'''Organizer(2):''' [[User:kpm3|Kamil Michnicki]]<br />
<br />
'''Faculty Advisor:''' [http://www.cs.washington.edu/homes/aram/ Aram Harrow]</div>Kpm3http://quantum.cs.washington.edu/wiki/index.php?title=Teaching&diff=1453Teaching2012-03-23T19:55:28Z<p>Kpm3: </p>
<hr />
<div>==Teaching==<br />
<br />
Dave Bacon's teaching page [[User:Dabacon:Teaching|here]]<br />
<br />
==Quantum Computing Journal Club==<br />
*[[Journal Club Spring 2012 | Spring 2012 - ???]]<br />
*[[Journal Club Winter 2012 | Winter 2012 - Hamiltonian Complexity]]<br />
*[[Journal Club Autumn 2011 | Autumn 2011 - Self-Correcting Quantum Memories]]<br />
*[[Journal Club Spring 2011 | Spring 2011 - Quantum Error Correction]]<br />
*[[Journal Club Winter 2011 | Winter 2011 - Quantum Random Walks]]<br />
*[[Journal Club Autumn 2010 | Autumn 2010 - Measurement Based Quantum Computing]]<br />
*[[Journal Club Spring 2010 | Spring 2010 - Decoherence]]<br />
*[[Journal Club Organization| Topic Ideas for Future Quarters]]<br />
<br />
==Lecture Notes for Quantum Computing==<br />
<br />
Lecture notes for [http://www.cs.washington.edu/education/courses/cse599d/06wi/ CSE 599] Quantum Computing<br />
<br />
* [http://www.cs.washington.edu/education/courses/cse599d/06wi/lecturenotes1.pdf Introduction and Basics of Quantum Theory] (updated 1/4/06)<br />
* [http://www.cs.washington.edu/education/courses/cse599d/06wi/lecturenotes2.pdf Dirac Notation and Basic Linear Algebra for Quantum Computing] (updated 1/6/06)<br />
* [http://www.cs.washington.edu/education/courses/cse599d/06wi/lecturenotes3.pdf One qubit, Two qubit] (updated 1/10/06)<br />
* [http://www.cs.washington.edu/education/courses/cse599d/06wi/lecturenotes4.pdf The No-Cloning Theorem, Classical Teleportation and Quantum Teleportation, Superdense Coding] (updated 1/11/06)<br />
* [http://www.cs.washington.edu/education/courses/cse599d/06wi/lecturenotes5.pdf The Quantum Circuit Model and Universal Quantum Computation] (updated 1/20/06)<br />
* [http://www.cs.washington.edu/education/courses/cse599d/06wi/lecturenotes6.pdf Reversible Classical Circuits and the Deutsch-Jozsa Algorithm] (updated 1/20/06)<br />
* [http://www.cs.washington.edu/education/courses/cse599d/06wi/lecturenotes7.pdf The Recursive and Nonrecursive Bernstein-Vazirani Algorithmm] (updated 1/23/06)<br />
* [http://www.cs.washington.edu/education/courses/cse599d/06wi/lecturenotes8.pdf Simon's Algorithm] (updated 1/26/06)<br />
* [http://www.cs.washington.edu/education/courses/cse599d/06wi/lecturenotes9.pdf The Quantum Fourier Transform] (updated 1/26/06)<br />
* [http://www.cs.washington.edu/education/courses/cse599d/06wi/lecturenotes10.pdf Quantum Phase Estimation and Arbitrary Size Quantum Fourier Transforms] (updated 1/26/06)<br />
* [http://www.cs.washington.edu/education/courses/cse599d/06wi/lecturenotes11.pdf Shor's Algorithm] (updated 1/30/06)<br />
* [http://www.cs.washington.edu/education/courses/cse599d/06wi/lecturenotes12.pdf Grover's Algorithm] (updated 1/31/06)<br />
* [http://www.cs.washington.edu/education/courses/cse599d/06wi/lecturenotes13.pdf Mixed States and Open Quantum Systems] (update 2/8/06)<br />
* [http://www.cs.washington.edu/education/courses/cse599d/06wi/lecturenotes14.pdf Quantum Entanglement and Bell's Theorem] (updated updated 2/8/06)<br />
* [http://www.cs.washington.edu/education/courses/cse599d/06wi/lecturenotes15.pdf When Quantum Computers Fall Apart] (updated 2/8/06)<br />
* [http://www.cs.washington.edu/education/courses/cse599d/06wi/lecturenotes16.pdf Introduction to Quantum Error Correction] (updated 2/10/06)<br />
* [http://www.cs.washington.edu/education/courses/cse599d/06wi/lecturenotes17.pdf The Quantum Error Correcting Criteria] (updated 2/13/06)<br />
* [http://www.cs.washington.edu/education/courses/cse599d/06wi/lecturenotes18.pdf Stabilizer Quantum Error Correcting Codes] (updated 2/12/06)<br />
* [http://www.cs.washington.edu/education/courses/cse599d/06wi/lecturenotes19.pdf Fault-Tolerant Quantum Computation and the Threshold Theorem] (updated 2/12/06)<br />
<br />
<br />
==External Resources==<br />
* [http://people.ccmr.cornell.edu/~mermin/qcomp/CS483.html David Mermin lecture notes] (introductory, from a CS perspective)<br />
* [http://theory.caltech.edu/~preskill/ph229/ John Preskill lecture notes] (intermediate, from a physics perspective)</div>Kpm3http://quantum.cs.washington.edu/wiki/index.php?title=Teaching&diff=1452Teaching2012-03-23T19:54:52Z<p>Kpm3: </p>
<hr />
<div>==Teaching==<br />
<br />
Dave Bacon's teaching page [[User:Dabacon:Teaching|here]]<br />
<br />
==Quantum Computing Journal Club==<br />
*[[Journal Club Spring 2012 | Winter 2012 - Hamiltonian Complexity]]<br />
*[[Journal Club Winter 2012 | Winter 2012 - Hamiltonian Complexity]]<br />
*[[Journal Club Autumn 2011 | Autumn 2011 - Self-Correcting Quantum Memories]]<br />
*[[Journal Club Spring 2011 | Spring 2011 - Quantum Error Correction]]<br />
*[[Journal Club Winter 2011 | Winter 2011 - Quantum Random Walks]]<br />
*[[Journal Club Autumn 2010 | Autumn 2010 - Measurement Based Quantum Computing]]<br />
*[[Journal Club Spring 2010 | Spring 2010 - Decoherence]]<br />
*[[Journal Club Organization| Topic Ideas for Future Quarters]]<br />
<br />
==Lecture Notes for Quantum Computing==<br />
<br />
Lecture notes for [http://www.cs.washington.edu/education/courses/cse599d/06wi/ CSE 599] Quantum Computing<br />
<br />
* [http://www.cs.washington.edu/education/courses/cse599d/06wi/lecturenotes1.pdf Introduction and Basics of Quantum Theory] (updated 1/4/06)<br />
* [http://www.cs.washington.edu/education/courses/cse599d/06wi/lecturenotes2.pdf Dirac Notation and Basic Linear Algebra for Quantum Computing] (updated 1/6/06)<br />
* [http://www.cs.washington.edu/education/courses/cse599d/06wi/lecturenotes3.pdf One qubit, Two qubit] (updated 1/10/06)<br />
* [http://www.cs.washington.edu/education/courses/cse599d/06wi/lecturenotes4.pdf The No-Cloning Theorem, Classical Teleportation and Quantum Teleportation, Superdense Coding] (updated 1/11/06)<br />
* [http://www.cs.washington.edu/education/courses/cse599d/06wi/lecturenotes5.pdf The Quantum Circuit Model and Universal Quantum Computation] (updated 1/20/06)<br />
* [http://www.cs.washington.edu/education/courses/cse599d/06wi/lecturenotes6.pdf Reversible Classical Circuits and the Deutsch-Jozsa Algorithm] (updated 1/20/06)<br />
* [http://www.cs.washington.edu/education/courses/cse599d/06wi/lecturenotes7.pdf The Recursive and Nonrecursive Bernstein-Vazirani Algorithmm] (updated 1/23/06)<br />
* [http://www.cs.washington.edu/education/courses/cse599d/06wi/lecturenotes8.pdf Simon's Algorithm] (updated 1/26/06)<br />
* [http://www.cs.washington.edu/education/courses/cse599d/06wi/lecturenotes9.pdf The Quantum Fourier Transform] (updated 1/26/06)<br />
* [http://www.cs.washington.edu/education/courses/cse599d/06wi/lecturenotes10.pdf Quantum Phase Estimation and Arbitrary Size Quantum Fourier Transforms] (updated 1/26/06)<br />
* [http://www.cs.washington.edu/education/courses/cse599d/06wi/lecturenotes11.pdf Shor's Algorithm] (updated 1/30/06)<br />
* [http://www.cs.washington.edu/education/courses/cse599d/06wi/lecturenotes12.pdf Grover's Algorithm] (updated 1/31/06)<br />
* [http://www.cs.washington.edu/education/courses/cse599d/06wi/lecturenotes13.pdf Mixed States and Open Quantum Systems] (update 2/8/06)<br />
* [http://www.cs.washington.edu/education/courses/cse599d/06wi/lecturenotes14.pdf Quantum Entanglement and Bell's Theorem] (updated updated 2/8/06)<br />
* [http://www.cs.washington.edu/education/courses/cse599d/06wi/lecturenotes15.pdf When Quantum Computers Fall Apart] (updated 2/8/06)<br />
* [http://www.cs.washington.edu/education/courses/cse599d/06wi/lecturenotes16.pdf Introduction to Quantum Error Correction] (updated 2/10/06)<br />
* [http://www.cs.washington.edu/education/courses/cse599d/06wi/lecturenotes17.pdf The Quantum Error Correcting Criteria] (updated 2/13/06)<br />
* [http://www.cs.washington.edu/education/courses/cse599d/06wi/lecturenotes18.pdf Stabilizer Quantum Error Correcting Codes] (updated 2/12/06)<br />
* [http://www.cs.washington.edu/education/courses/cse599d/06wi/lecturenotes19.pdf Fault-Tolerant Quantum Computation and the Threshold Theorem] (updated 2/12/06)<br />
<br />
<br />
==External Resources==<br />
* [http://people.ccmr.cornell.edu/~mermin/qcomp/CS483.html David Mermin lecture notes] (introductory, from a CS perspective)<br />
* [http://theory.caltech.edu/~preskill/ph229/ John Preskill lecture notes] (intermediate, from a physics perspective)</div>Kpm3http://quantum.cs.washington.edu/wiki/index.php?title=User:Kpm3&diff=1451User:Kpm32012-03-23T19:50:16Z<p>Kpm3: </p>
<hr />
<div>[[File:KamilProfile.jpg]]<br />
<br />
Interests to come....</div>Kpm3http://quantum.cs.washington.edu/wiki/index.php?title=User:Kpm3&diff=1450User:Kpm32012-03-23T19:49:56Z<p>Kpm3: Created page with "File:KamilProfile.jpg"</p>
<hr />
<div>[[File:KamilProfile.jpg]]</div>Kpm3http://quantum.cs.washington.edu/wiki/index.php?title=File:KamilProfile.jpg&diff=1449File:KamilProfile.jpg2012-03-23T19:48:28Z<p>Kpm3: uploaded a new version of &quot;File:KamilProfile.jpg&quot;: Puna, India</p>
<hr />
<div></div>Kpm3http://quantum.cs.washington.edu/wiki/index.php?title=File:KamilProfile.jpg&diff=1448File:KamilProfile.jpg2012-03-23T19:47:53Z<p>Kpm3: </p>
<hr />
<div></div>Kpm3http://quantum.cs.washington.edu/wiki/index.php?title=People&diff=1447People2012-03-23T19:46:15Z<p>Kpm3: </p>
<hr />
<div>= Faculty =<br />
<br />
{|<br />
|-<br />
|[[File:Aram.jpg|120px]] || '''Aram Harrow'''<br />
Assistant Research Professor<br><br />
[http://www.cs.washington.edu/ Department of Computer Science & Engineering]<br><br />
[http://www.cs.washington.edu/homes/aram/ more info]<br />
|}<br />
<br />
= Postdocs =<br />
<br />
= Graduate Students =<br />
<br />
{|<br />
{|<br />
|-<br />
|[[Image:lukas_profile_pic.jpg|120px]] || '''Lukas Svec'''<br />
Graduate Student<br><br />
[http://www.phys.washington.edu/ Department of Physics]<br><br />
[[User:lukassvec|more info]]<br />
|}<br />
<br />
{|<br />
|-<br />
|[[Image:JohnnyCropped.JPG|120px]] || '''Jijiang (Johnny) Yan'''<br />
Graduate Student<br><br />
[http://www.phys.washington.edu/ Department of Physics]<br><br />
[http://www.cs.washington.edu/homes/jjyan/ more info]<br />
|}<br />
<br />
{|<br />
|-<br />
|[[Image:Crosson2011photo-cropped.jpg|120px]] || '''Isaac Crosson'''<br />
Graduate Student<br><br />
[http://www.phys.washington.edu/ Department of Physics]<br><br />
[[User:icrosson|more info]]<br />
|}<br />
<br />
{|<br />
|-<br />
|[[Image:KamilProfile.jpg|120px]] || '''Kamil Michnicki'''<br />
Graduate Student<br><br />
[http://www.phys.washington.edu/ Department of Physics]<br><br />
[[User:kpm3|more info]]<br />
|}<br />
<br />
{|<br />
|-<br />
|[[Image:paul_science_cropped.png|120px]] || '''Paul Pham'''<br />
Graduate Student<br><br />
[http://cs.washington.edu/ Department of Computer Science & Engineering]<br><br />
[[User:ppham|more info]]<br />
|}<br />
<br />
{|<br />
|-<br />
|[[Image:DJR-Picture-Cropped.jpg|120px]] || '''David Rosenbaum'''<br />
Graduate Student<br><br />
[http://cs.washington.edu/ Department of Computer Science & Engineering]<br><br />
[http://www.cs.washington.edu/homes/djr/ more info]<br />
|}<br />
<br />
{|<br />
|-<br />
|[[Image:Questionmark.jpg|120px]] || '''Kevin Zatloukal'''<br />
Graduate Student<br><br />
[http://cs.washington.edu/ Department of Computer Science & Engineering]<br><br />
[[User:kevinzat|more info]]<br />
|}<br />
<br />
= Undergraduate Students =<br />
<br />
{|<br />
|-<br />
|[[Image:Questionmark.jpg|120px]] || '''Kate Liotta'''<br />
Undergraduate Student<br><br />
[http://www.cs.washington.edu/ Department of Computer Science & Engineering]<br><br />
[http://www.phys.washington.edu/ Department of Physics]<br><br />
[[User:zakwwebb|more info]]<br />
|}<br />
{|<br />
|-<br />
|[[Image:Questionmark.jpg|120px]] || '''Jonathan Shi'''<br />
Undergraduate Student<br><br />
[http://www.cs.washington.edu/ Department of Computer Science & Engineering]<br><br />
[http://www.phys.washington.edu/ Department of Physics]<br><br />
[[User:zakwwebb|more info]]<br />
|}<br />
{|<br />
|-<br />
|[[Image:Questionmark.jpg|120px]] || '''Zak Webb'''<br />
Undergraduate Student<br><br />
[http://www.cs.washington.edu/ Department of Computer Science & Engineering]<br><br />
[http://www.phys.washington.edu/ Department of Physics]<br><br />
[[User:zakwwebb|more info]]<br />
|}<br />
{|<br />
|-<br />
|'''Tom Guo'''<br />
Undergraduate Student<br><br />
[http://www.cs.washington.edu/ Department of Computer Science & Engineering]<br><br />
[[User:zakwwebb|more info]]<br />
|}<br />
<br />
= Past Members =<br />
<br />
'''[[User:dabacon|Dave Bacon]]''' (research scientist 2005-2006, research assistant professor 2006-2011)<br><br />
'''[[User:gcross|Gregory Crosswhite]]''' (Physics PhD student, graduated June 2011)<br><br />
'''Jennifer Hanson''' (undergraduate researcher 2009)<br><br />
'''Alper Sarikaya''' (undergraduate researcher 2007-2009, now working at Microsoft)<br><br />
'''Elizabeth Muhm''' (undergraduate researcher 2007-2009, graduate student at Clemson)<br><br />
'''Alice Neels''' (graduate student in CSE 2007-2009, obtained masters in 2009, currently on leave working in Silicon Valley)<br><br />
'''Roger Wolfson''' (Physics masters student, graduated June 2009)<br><br />
'''William Johnson''' (undergraduate researcher, summer 2008, currently a graduate student at Berkeley)<br><br />
'''Thomas Decker''' (Postdoc, 2007, currently a Research Fellow at the Centre for Quantum Technologies at the National University of Singapore) <br><br />
'''Andrea Casaccino''' (Visiting graduate student, 2006, Ph.D. at the University of Siena)<br><br />
<br />
= Friends and Collaborators at UW =<br />
<br />
{|<br />
|-<br />
|[[Image:Markoskin.jpg|120px]] || '''Mark Oskin'''<br />
Associate Professor<br><br />
Researcher on architectures for quantum computers<br><br />
[http://www.cs.washington.edu/ Department of Computer Science & Engineering]<br><br />
[http://www.cs.washington.edu/homes/oskin/ more info]<br />
|}<br />
<br />
{|<br />
|-<br />
|[[Image:Questionmark.jpg|120px]] || '''CS Theory Group at UW'''<br />
Collection of brilliant brains<br><br />
[http://www.cs.washington.edu/ Department of Computer Science & Engineering]<br><br />
[http://www.cs.washington.edu/research/computation/ more info]<br />
|}<br />
<br />
{|<br />
|-<br />
|[[Image:Bbb.jpg|120px]] || '''Boris Blinov'''<br />
Assistant Professor<br><br />
Ion trapper extraordinaire<br><br />
[http://www.phys.washington.edu/ Department of Physics]<br><br />
[http://faculty.washington.edu/blinov/ more info]<br />
|}</div>Kpm3http://quantum.cs.washington.edu/wiki/index.php?title=Journal_Club_Spring_2012&diff=1444Journal Club Spring 20122012-03-22T21:34:44Z<p>Kpm3: </p>
<hr />
<div>This quarter we will be focusing on ???.<br />
==People==<br />
<br />
'''Organizer(1):''' [[User:Icrosson|Isaac Crosson]]<br />
<br />
'''Organizer(2):''' Kamil Michnicki (kpm3uw@gmail.com)<br />
<br />
'''Faculty Advisor:''' [http://www.cs.washington.edu/homes/aram/ Aram Harrow]<br />
<br />
==Place==<br />
<br />
Friday 1:30pm in Computer Science, CSE 503.<br />
==Schedule==<br />
{|border="1"<br />
!Subject<br />
!Speaker<br />
!Date<br />
|-<br />
|Introduction and Review <br />
|???<br />
|???<br />
|-<br />
|??? <br />
|???<br />
|???<br />
|}<br />
<br />
==Papers==<br />
Note:Papers will change soon.<br />
===Recent Survey===<br />
'''June 2011:''' Hamiltonian Complexity - Tobias Osbourne<br/><br />
''"In recent years we've seen the birth of a new field known as hamiltonian complexity lying at the crossroads between computer science and theoretical physics. Hamiltonian complexity is directly concerned with the question: how hard is it to simulate a physical system?"''<br/><br />
http://arxiv.org/abs/1106.5875<br />
<br />
===Quantum Cook-Levin Theorem===<br />
<p>'''Oct 2002:''' Quantum NP - A Survey - Dorit Aharonov, Tomer Naveh<br/><br />
''"We describe Kitaev's result from 1999, in which he defines the complexity class QMA, the quantum analog of the class NP, and shows that a natural extension of 3-SAT, namely local Hamiltonians, is QMA complete. "''<br/><br />
http://arxiv.org/abs/quant-ph/0210077 </p><br />
<p>'''May 2007:''' The power of quantum systems on a line - Dorit Aharonov, Daniel Gottesman, Sandy Irani, Julia Kempe<br/><br />
''"...with some additional technical effort and 12 states per particle, we show that the problem of approximating the ground state energy of a system composed of a line of quantum particles is QMA-complete..."''<br/><br />
http://arxiv.org/abs//0705.4077</p><br />
<br />
===Bounds on Entanglement Entropy===<br />
<p>'''May 2007''' An Area Law for One Dimensional Quantum Systems - Hastings<br/><br />
''"We prove an area law for the entanglement entropy in gapped one dimensional quantum systems."''<br/><br />
http://arxiv.org/abs/0705.2024</p><br />
<br />
<p>'''Aug 2008''' Area laws for the entanglement entropy - a review - Eisert, Cramer, Plenio<br/><br />
''"A significant proportion of the article is devoted to the quantitative connection between the entanglement content of states and the possibility of their efficient simulation..."''<br/><br />
http://arxiv.org/abs/0808.3773</p><br />
<br />
<p>'''Nov 2010''' Quantum Hamiltonian complexity and the detectability lemma - Aharonov, Arad, Landau, Vazirani<br/><br />
''"We use [the detectability lemma] to provide a simplified and more combinatorial proof of Hastings' 1D area law..."''<br/><br />
http://arxiv.org/abs/1011.3445</p><br />
<br />
===Stoquastic Hamiltonians===<br />
<p>'''Jun 2006''' The Complexity of Stoquastic Local Hamiltonian Problems - Bravyi, DiVincenzo, Oliveira, Terhal<br/><br />
''"We prove that the Local Hamiltonian Problem for stoquastic Hamiltonians belongs to the complexity class AM..."''<br/><br />
http://arxiv.org/abs/quant-ph/0606140</p><br />
<br />
<p>'''Jun 2008''' Complexity of stoquastic frustration-free Hamiltonians - Bravyi, Terhal<br/><br />
''"...we identify a large class of quantum Hamiltonians describing systems of qubits for which the adiabatic evolution can be efficiently simulated on a classical probabilistic computer..."''<br/><br />
http://arxiv.org/abs/0806.1746</p><br />
<br />
===Quantum PCP Conjecture===<br />
<p>'''Nov 2008''' The Detectability Lemma and Quantum Gap Amplification - Aharonov, Arad, Landau, Vazirani<br/><br />
''"...proving a quantum analogue to the PCP theorem is one of the most important challenges in quantum complexity theory. Our quantum gap amplification lemma may be viewed as the quantum analogue of the first of the three main steps in Dinur's PCP proof."''<br/><br />
http://arxiv.org/abs/0811.3412</p><br />
<br />
<p>'''Feb 2011''' On the complexity of Commuting Local Hamiltonians, and tight conditions for Topological Order in such systems - Aharonov, Eldar<br/><br />
''"The local Hamiltonian problem plays the equivalent role of SAT in quantum complexity theory. Understanding the complexity of the intermediate case in which the constraints are quantum but all local terms in the Hamiltonian commute, is of importance for conceptual, physical and computational complexity reasons."''<br/><br />
http://arxiv.org/abs/1102.0770</p></div>Kpm3http://quantum.cs.washington.edu/wiki/index.php?title=Journal_Club_Spring_2012&diff=1443Journal Club Spring 20122012-03-22T21:33:59Z<p>Kpm3: </p>
<hr />
<div>This quarter we will be focusing on Hamiltonian Complexity.<br />
==People==<br />
<br />
'''Organizer(1):''' [[User:Icrosson|Isaac Crosson]]<br />
<br />
'''Organizer(2):''' Kamil Michnicki (kpm3uw@gmail.com)<br />
<br />
'''Faculty Advisor:''' [http://www.cs.washington.edu/homes/aram/ Aram Harrow]<br />
<br />
==Place==<br />
<br />
Friday 1:30pm in Computer Science, CSE 503.<br />
==Schedule==<br />
{|border="1"<br />
!Subject<br />
!Speaker<br />
!Date<br />
|-<br />
|Introduction and Review <br />
|???<br />
|???<br />
|-<br />
|Introduction and Review <br />
|???<br />
|???<br />
|}<br />
<br />
==Papers==<br />
<br />
===Recent Survey===<br />
'''June 2011:''' Hamiltonian Complexity - Tobias Osbourne<br/><br />
''"In recent years we've seen the birth of a new field known as hamiltonian complexity lying at the crossroads between computer science and theoretical physics. Hamiltonian complexity is directly concerned with the question: how hard is it to simulate a physical system?"''<br/><br />
http://arxiv.org/abs/1106.5875<br />
<br />
===Quantum Cook-Levin Theorem===<br />
<p>'''Oct 2002:''' Quantum NP - A Survey - Dorit Aharonov, Tomer Naveh<br/><br />
''"We describe Kitaev's result from 1999, in which he defines the complexity class QMA, the quantum analog of the class NP, and shows that a natural extension of 3-SAT, namely local Hamiltonians, is QMA complete. "''<br/><br />
http://arxiv.org/abs/quant-ph/0210077 </p><br />
<p>'''May 2007:''' The power of quantum systems on a line - Dorit Aharonov, Daniel Gottesman, Sandy Irani, Julia Kempe<br/><br />
''"...with some additional technical effort and 12 states per particle, we show that the problem of approximating the ground state energy of a system composed of a line of quantum particles is QMA-complete..."''<br/><br />
http://arxiv.org/abs//0705.4077</p><br />
<br />
===Bounds on Entanglement Entropy===<br />
<p>'''May 2007''' An Area Law for One Dimensional Quantum Systems - Hastings<br/><br />
''"We prove an area law for the entanglement entropy in gapped one dimensional quantum systems."''<br/><br />
http://arxiv.org/abs/0705.2024</p><br />
<br />
<p>'''Aug 2008''' Area laws for the entanglement entropy - a review - Eisert, Cramer, Plenio<br/><br />
''"A significant proportion of the article is devoted to the quantitative connection between the entanglement content of states and the possibility of their efficient simulation..."''<br/><br />
http://arxiv.org/abs/0808.3773</p><br />
<br />
<p>'''Nov 2010''' Quantum Hamiltonian complexity and the detectability lemma - Aharonov, Arad, Landau, Vazirani<br/><br />
''"We use [the detectability lemma] to provide a simplified and more combinatorial proof of Hastings' 1D area law..."''<br/><br />
http://arxiv.org/abs/1011.3445</p><br />
<br />
===Stoquastic Hamiltonians===<br />
<p>'''Jun 2006''' The Complexity of Stoquastic Local Hamiltonian Problems - Bravyi, DiVincenzo, Oliveira, Terhal<br/><br />
''"We prove that the Local Hamiltonian Problem for stoquastic Hamiltonians belongs to the complexity class AM..."''<br/><br />
http://arxiv.org/abs/quant-ph/0606140</p><br />
<br />
<p>'''Jun 2008''' Complexity of stoquastic frustration-free Hamiltonians - Bravyi, Terhal<br/><br />
''"...we identify a large class of quantum Hamiltonians describing systems of qubits for which the adiabatic evolution can be efficiently simulated on a classical probabilistic computer..."''<br/><br />
http://arxiv.org/abs/0806.1746</p><br />
<br />
===Quantum PCP Conjecture===<br />
<p>'''Nov 2008''' The Detectability Lemma and Quantum Gap Amplification - Aharonov, Arad, Landau, Vazirani<br/><br />
''"...proving a quantum analogue to the PCP theorem is one of the most important challenges in quantum complexity theory. Our quantum gap amplification lemma may be viewed as the quantum analogue of the first of the three main steps in Dinur's PCP proof."''<br/><br />
http://arxiv.org/abs/0811.3412</p><br />
<br />
<p>'''Feb 2011''' On the complexity of Commuting Local Hamiltonians, and tight conditions for Topological Order in such systems - Aharonov, Eldar<br/><br />
''"The local Hamiltonian problem plays the equivalent role of SAT in quantum complexity theory. Understanding the complexity of the intermediate case in which the constraints are quantum but all local terms in the Hamiltonian commute, is of importance for conceptual, physical and computational complexity reasons."''<br/><br />
http://arxiv.org/abs/1102.0770</p></div>Kpm3http://quantum.cs.washington.edu/wiki/index.php?title=Journal_Club_Spring_2012&diff=1442Journal Club Spring 20122012-03-22T21:33:19Z<p>Kpm3: </p>
<hr />
<div>This quarter we will be focusing on Hamiltonian Complexity.<br />
==People==<br />
<br />
'''Organizer(1):''' [[User:Icrosson|Isaac Crosson]]<br />
<br />
'''Organizer(2):''' Kamil Michnicki (kpm3uw@gmail.com)<br />
<br />
'''Faculty Advisor:''' [http://www.cs.washington.edu/homes/aram/ Aram Harrow]<br />
<br />
==Place==<br />
<br />
Friday 1:30pm in Computer Science, CSE 503.<br />
==Schedule==<br />
{|border="1"<br />
!Subject<br />
!Speaker<br />
!Date<br />
|-<br />
|Introduction and Review | Slides]]<br />
|Isaac<br />
|Jan 7<br />
|}<br />
<br />
==Papers==<br />
<br />
===Recent Survey===<br />
'''June 2011:''' Hamiltonian Complexity - Tobias Osbourne<br/><br />
''"In recent years we've seen the birth of a new field known as hamiltonian complexity lying at the crossroads between computer science and theoretical physics. Hamiltonian complexity is directly concerned with the question: how hard is it to simulate a physical system?"''<br/><br />
http://arxiv.org/abs/1106.5875<br />
<br />
===Quantum Cook-Levin Theorem===<br />
<p>'''Oct 2002:''' Quantum NP - A Survey - Dorit Aharonov, Tomer Naveh<br/><br />
''"We describe Kitaev's result from 1999, in which he defines the complexity class QMA, the quantum analog of the class NP, and shows that a natural extension of 3-SAT, namely local Hamiltonians, is QMA complete. "''<br/><br />
http://arxiv.org/abs/quant-ph/0210077 </p><br />
<p>'''May 2007:''' The power of quantum systems on a line - Dorit Aharonov, Daniel Gottesman, Sandy Irani, Julia Kempe<br/><br />
''"...with some additional technical effort and 12 states per particle, we show that the problem of approximating the ground state energy of a system composed of a line of quantum particles is QMA-complete..."''<br/><br />
http://arxiv.org/abs//0705.4077</p><br />
<br />
===Bounds on Entanglement Entropy===<br />
<p>'''May 2007''' An Area Law for One Dimensional Quantum Systems - Hastings<br/><br />
''"We prove an area law for the entanglement entropy in gapped one dimensional quantum systems."''<br/><br />
http://arxiv.org/abs/0705.2024</p><br />
<br />
<p>'''Aug 2008''' Area laws for the entanglement entropy - a review - Eisert, Cramer, Plenio<br/><br />
''"A significant proportion of the article is devoted to the quantitative connection between the entanglement content of states and the possibility of their efficient simulation..."''<br/><br />
http://arxiv.org/abs/0808.3773</p><br />
<br />
<p>'''Nov 2010''' Quantum Hamiltonian complexity and the detectability lemma - Aharonov, Arad, Landau, Vazirani<br/><br />
''"We use [the detectability lemma] to provide a simplified and more combinatorial proof of Hastings' 1D area law..."''<br/><br />
http://arxiv.org/abs/1011.3445</p><br />
<br />
===Stoquastic Hamiltonians===<br />
<p>'''Jun 2006''' The Complexity of Stoquastic Local Hamiltonian Problems - Bravyi, DiVincenzo, Oliveira, Terhal<br/><br />
''"We prove that the Local Hamiltonian Problem for stoquastic Hamiltonians belongs to the complexity class AM..."''<br/><br />
http://arxiv.org/abs/quant-ph/0606140</p><br />
<br />
<p>'''Jun 2008''' Complexity of stoquastic frustration-free Hamiltonians - Bravyi, Terhal<br/><br />
''"...we identify a large class of quantum Hamiltonians describing systems of qubits for which the adiabatic evolution can be efficiently simulated on a classical probabilistic computer..."''<br/><br />
http://arxiv.org/abs/0806.1746</p><br />
<br />
===Quantum PCP Conjecture===<br />
<p>'''Nov 2008''' The Detectability Lemma and Quantum Gap Amplification - Aharonov, Arad, Landau, Vazirani<br/><br />
''"...proving a quantum analogue to the PCP theorem is one of the most important challenges in quantum complexity theory. Our quantum gap amplification lemma may be viewed as the quantum analogue of the first of the three main steps in Dinur's PCP proof."''<br/><br />
http://arxiv.org/abs/0811.3412</p><br />
<br />
<p>'''Feb 2011''' On the complexity of Commuting Local Hamiltonians, and tight conditions for Topological Order in such systems - Aharonov, Eldar<br/><br />
''"The local Hamiltonian problem plays the equivalent role of SAT in quantum complexity theory. Understanding the complexity of the intermediate case in which the constraints are quantum but all local terms in the Hamiltonian commute, is of importance for conceptual, physical and computational complexity reasons."''<br/><br />
http://arxiv.org/abs/1102.0770</p></div>Kpm3http://quantum.cs.washington.edu/wiki/index.php?title=Journal_Club_Spring_2012&diff=1441Journal Club Spring 20122012-03-22T21:32:28Z<p>Kpm3: </p>
<hr />
<div>This quarter we will be focusing on Hamiltonian Complexity.<br />
==People==<br />
<br />
'''Organizer(1):''' [[User:Icrosson|Isaac Crosson]]<br />
<br />
'''Organizer(2):''' Kamil Michnicki (kpm3uw@gmail.com)<br />
<br />
'''Faculty Advisor:''' [http://www.cs.washington.edu/homes/aram/ Aram Harrow]<br />
<br />
==Place==<br />
<br />
Friday 1:30pm in Computer Science, CSE 503.<br />
==Schedule==<br />
{|border="1"<br />
!Subject<br />
!Speaker<br />
!Date<br />
|-<br />
|Introduction and Review , [http://arxiv.org/abs/1106.5875 arXiv:1106.5875] , [[:Media:OverviewHamiltonianComplexity-Printout.pdf | Slides]]<br />
|Isaac<br />
|Jan 7<br />
|}<br />
<br />
==Papers==<br />
<br />
===Recent Survey===<br />
'''June 2011:''' Hamiltonian Complexity - Tobias Osbourne<br/><br />
''"In recent years we've seen the birth of a new field known as hamiltonian complexity lying at the crossroads between computer science and theoretical physics. Hamiltonian complexity is directly concerned with the question: how hard is it to simulate a physical system?"''<br/><br />
http://arxiv.org/abs/1106.5875<br />
<br />
===Quantum Cook-Levin Theorem===<br />
<p>'''Oct 2002:''' Quantum NP - A Survey - Dorit Aharonov, Tomer Naveh<br/><br />
''"We describe Kitaev's result from 1999, in which he defines the complexity class QMA, the quantum analog of the class NP, and shows that a natural extension of 3-SAT, namely local Hamiltonians, is QMA complete. "''<br/><br />
http://arxiv.org/abs/quant-ph/0210077 </p><br />
<p>'''May 2007:''' The power of quantum systems on a line - Dorit Aharonov, Daniel Gottesman, Sandy Irani, Julia Kempe<br/><br />
''"...with some additional technical effort and 12 states per particle, we show that the problem of approximating the ground state energy of a system composed of a line of quantum particles is QMA-complete..."''<br/><br />
http://arxiv.org/abs//0705.4077</p><br />
<br />
===Bounds on Entanglement Entropy===<br />
<p>'''May 2007''' An Area Law for One Dimensional Quantum Systems - Hastings<br/><br />
''"We prove an area law for the entanglement entropy in gapped one dimensional quantum systems."''<br/><br />
http://arxiv.org/abs/0705.2024</p><br />
<br />
<p>'''Aug 2008''' Area laws for the entanglement entropy - a review - Eisert, Cramer, Plenio<br/><br />
''"A significant proportion of the article is devoted to the quantitative connection between the entanglement content of states and the possibility of their efficient simulation..."''<br/><br />
http://arxiv.org/abs/0808.3773</p><br />
<br />
<p>'''Nov 2010''' Quantum Hamiltonian complexity and the detectability lemma - Aharonov, Arad, Landau, Vazirani<br/><br />
''"We use [the detectability lemma] to provide a simplified and more combinatorial proof of Hastings' 1D area law..."''<br/><br />
http://arxiv.org/abs/1011.3445</p><br />
<br />
===Stoquastic Hamiltonians===<br />
<p>'''Jun 2006''' The Complexity of Stoquastic Local Hamiltonian Problems - Bravyi, DiVincenzo, Oliveira, Terhal<br/><br />
''"We prove that the Local Hamiltonian Problem for stoquastic Hamiltonians belongs to the complexity class AM..."''<br/><br />
http://arxiv.org/abs/quant-ph/0606140</p><br />
<br />
<p>'''Jun 2008''' Complexity of stoquastic frustration-free Hamiltonians - Bravyi, Terhal<br/><br />
''"...we identify a large class of quantum Hamiltonians describing systems of qubits for which the adiabatic evolution can be efficiently simulated on a classical probabilistic computer..."''<br/><br />
http://arxiv.org/abs/0806.1746</p><br />
<br />
===Quantum PCP Conjecture===<br />
<p>'''Nov 2008''' The Detectability Lemma and Quantum Gap Amplification - Aharonov, Arad, Landau, Vazirani<br/><br />
''"...proving a quantum analogue to the PCP theorem is one of the most important challenges in quantum complexity theory. Our quantum gap amplification lemma may be viewed as the quantum analogue of the first of the three main steps in Dinur's PCP proof."''<br/><br />
http://arxiv.org/abs/0811.3412</p><br />
<br />
<p>'''Feb 2011''' On the complexity of Commuting Local Hamiltonians, and tight conditions for Topological Order in such systems - Aharonov, Eldar<br/><br />
''"The local Hamiltonian problem plays the equivalent role of SAT in quantum complexity theory. Understanding the complexity of the intermediate case in which the constraints are quantum but all local terms in the Hamiltonian commute, is of importance for conceptual, physical and computational complexity reasons."''<br/><br />
http://arxiv.org/abs/1102.0770</p></div>Kpm3http://quantum.cs.washington.edu/wiki/index.php?title=Journal_Club_Spring_2012&diff=1440Journal Club Spring 20122012-03-22T21:30:57Z<p>Kpm3: Created page with "This quarter we will be focusing on Hamiltonian Complexity. ==People== '''Organizer(1):''' Isaac Crosson '''Organizer(2):''' Kamil Michnicki (kpm3uw@gmail.com..."</p>
<hr />
<div>This quarter we will be focusing on Hamiltonian Complexity.<br />
==People==<br />
<br />
'''Organizer(1):''' [[User:Icrosson|Isaac Crosson]]<br />
<br />
'''Organizer(2):''' Kamil Michnicki (kpm3uw@gmail.com)<br />
<br />
'''Faculty Advisor:''' [http://www.cs.washington.edu/homes/aram/ Aram Harrow]<br />
<br />
==Place==<br />
<br />
Friday 1:30pm in Computer Science, CSE 503.<br />
==Schedule==<br />
{|border="1"<br />
!Subject<br />
!Speaker<br />
!Date<br />
|-<br />
|Introduction and Review , [http://arxiv.org/abs/1106.5875 arXiv:1106.5875] , [[:Media:OverviewHamiltonianComplexity-Printout.pdf | Slides]]<br />
|Isaac<br />
|Jan 7<br />
|-<br />
|Local Hamiltonians and QMA, [http://arxiv.org/abs/quant-ph/0210077 arXiv:quant-ph/0210077v1], [[:Media:QMA-Slides.pdf | Slides]]<br />
|David<br />
|Jan 13<br />
|-<br />
|QMA-Complete in 1D, [http://arxiv.org/abs//0705.4077 arXiv:0705.4077]<br />
|Isaac<br />
|Jan 20<br />
|-<br />
|detectability lemma and area laws, [http://arxiv.org/abs/1011.3445 arXiv:1011.344]<br />
|Kamil<br />
|Jan 27<br />
|-<br />
|detectability lemma and area laws, [http://arxiv.org/abs/1011.3445 arXiv:1011.344]<br />
|Kamil<br />
|Feb 3<br />
|-<br />
|Stoquastic Hamiltonians, [http://arxiv.org/abs/quant-ph/0606140 arXiv:quant-ph/0606140]<br />
|Isaac<br />
|Feb 24<br />
|-<br />
|Quantum PCP, [http://arxiv.org/abs/0811.3412 arXiv:0811.3412]<br />
|Group<br />
|Mar 2<br />
|-<br />
|Quantum PCP, [http://arxiv.org/abs/0811.3412 arXiv:0811.3412]<br />
|Group<br />
|Mar 9<br />
|}<br />
<br />
==Papers==<br />
<br />
===Recent Survey===<br />
'''June 2011:''' Hamiltonian Complexity - Tobias Osbourne<br/><br />
''"In recent years we've seen the birth of a new field known as hamiltonian complexity lying at the crossroads between computer science and theoretical physics. Hamiltonian complexity is directly concerned with the question: how hard is it to simulate a physical system?"''<br/><br />
http://arxiv.org/abs/1106.5875<br />
<br />
===Quantum Cook-Levin Theorem===<br />
<p>'''Oct 2002:''' Quantum NP - A Survey - Dorit Aharonov, Tomer Naveh<br/><br />
''"We describe Kitaev's result from 1999, in which he defines the complexity class QMA, the quantum analog of the class NP, and shows that a natural extension of 3-SAT, namely local Hamiltonians, is QMA complete. "''<br/><br />
http://arxiv.org/abs/quant-ph/0210077 </p><br />
<p>'''May 2007:''' The power of quantum systems on a line - Dorit Aharonov, Daniel Gottesman, Sandy Irani, Julia Kempe<br/><br />
''"...with some additional technical effort and 12 states per particle, we show that the problem of approximating the ground state energy of a system composed of a line of quantum particles is QMA-complete..."''<br/><br />
http://arxiv.org/abs//0705.4077</p><br />
<br />
===Bounds on Entanglement Entropy===<br />
<p>'''May 2007''' An Area Law for One Dimensional Quantum Systems - Hastings<br/><br />
''"We prove an area law for the entanglement entropy in gapped one dimensional quantum systems."''<br/><br />
http://arxiv.org/abs/0705.2024</p><br />
<br />
<p>'''Aug 2008''' Area laws for the entanglement entropy - a review - Eisert, Cramer, Plenio<br/><br />
''"A significant proportion of the article is devoted to the quantitative connection between the entanglement content of states and the possibility of their efficient simulation..."''<br/><br />
http://arxiv.org/abs/0808.3773</p><br />
<br />
<p>'''Nov 2010''' Quantum Hamiltonian complexity and the detectability lemma - Aharonov, Arad, Landau, Vazirani<br/><br />
''"We use [the detectability lemma] to provide a simplified and more combinatorial proof of Hastings' 1D area law..."''<br/><br />
http://arxiv.org/abs/1011.3445</p><br />
<br />
===Stoquastic Hamiltonians===<br />
<p>'''Jun 2006''' The Complexity of Stoquastic Local Hamiltonian Problems - Bravyi, DiVincenzo, Oliveira, Terhal<br/><br />
''"We prove that the Local Hamiltonian Problem for stoquastic Hamiltonians belongs to the complexity class AM..."''<br/><br />
http://arxiv.org/abs/quant-ph/0606140</p><br />
<br />
<p>'''Jun 2008''' Complexity of stoquastic frustration-free Hamiltonians - Bravyi, Terhal<br/><br />
''"...we identify a large class of quantum Hamiltonians describing systems of qubits for which the adiabatic evolution can be efficiently simulated on a classical probabilistic computer..."''<br/><br />
http://arxiv.org/abs/0806.1746</p><br />
<br />
===Quantum PCP Conjecture===<br />
<p>'''Nov 2008''' The Detectability Lemma and Quantum Gap Amplification - Aharonov, Arad, Landau, Vazirani<br/><br />
''"...proving a quantum analogue to the PCP theorem is one of the most important challenges in quantum complexity theory. Our quantum gap amplification lemma may be viewed as the quantum analogue of the first of the three main steps in Dinur's PCP proof."''<br/><br />
http://arxiv.org/abs/0811.3412</p><br />
<br />
<p>'''Feb 2011''' On the complexity of Commuting Local Hamiltonians, and tight conditions for Topological Order in such systems - Aharonov, Eldar<br/><br />
''"The local Hamiltonian problem plays the equivalent role of SAT in quantum complexity theory. Understanding the complexity of the intermediate case in which the constraints are quantum but all local terms in the Hamiltonian commute, is of importance for conceptual, physical and computational complexity reasons."''<br/><br />
http://arxiv.org/abs/1102.0770</p></div>Kpm3http://quantum.cs.washington.edu/wiki/index.php?title=Group_Meeting_Spring_2012&diff=1437Group Meeting Spring 20122012-03-21T02:14:45Z<p>Kpm3: </p>
<hr />
<div>{| border="1"<br />
|- style="background-color:#d0f0d0;"<br />
|Speaker<br />
|Topic<br />
|Date <br />
|Time<br />
|Location<br />
|- <br />
|Kamil<br />
|Adiabatic Cluster State Quantum Computing <br />
http://arxiv.org/abs/0905.0901<br />
<br />
I'll be going over some of the background <br />
behind this paper which includes, the stabilizer formalism and cluster <br />
states, and given time, measurement based QC and adiabatic evolution.<br />
|March 23<br />
|3:30pm<br />
|CSE 503<br />
|-<br />
|Tom<br />
|Preliminaries for Quantum Optics<br />
|March 30<br />
|3:30pm<br />
|CSE 503<br />
|-<br />
|David<br />
|<br />
|April 6<br />
|3:30PM<br />
|CSE 503<br />
|-<br />
|<br />
|<br />
|April 13<br />
|<br />
|<br />
|-<br />
|<br />
|<br />
|April 20<br />
|<br />
|<br />
|-<br />
|<br />
|<br />
|April 27<br />
|<br />
|<br />
|-<br />
|<br />
|<br />
|May 4<br />
|<br />
|<br />
|-<br />
|<br />
|<br />
|May 11<br />
|<br />
|<br />
|-<br />
|<br />
|<br />
|May 18<br />
|<br />
|<br />
|-<br />
|<br />
|<br />
|May 25<br />
|<br />
|<br />
|}<br />
==Abstracts==<br />
===Example Title===<br />
'''Feb 30th''' - Name <br/><br />
Synopsis of talk. [http://arxiv.org/list/quant-ph/new Link to a reference.]</div>Kpm3http://quantum.cs.washington.edu/wiki/index.php?title=Group_Meeting_Spring_2012&diff=1436Group Meeting Spring 20122012-03-21T02:13:39Z<p>Kpm3: </p>
<hr />
<div>{| border="1"<br />
|- style="background-color:#d0f0d0;"<br />
|Speaker<br />
|Topic<br />
|Date <br />
|Time<br />
|Location<br />
|- <br />
|Kamil<br />
|Adiabatic Cluster State Quantum Computing <br />
http://arxiv.org/abs/0905.0901<br />
<br />
I'll be going over some of the background <br />
behind this paper which includes, cluster <br />
states, and given time, measurement based <br />
QC and adiabatic<br />
evolution.<br />
|March 23<br />
|3:30pm<br />
|CSE 503<br />
|-<br />
|Tom<br />
|Preliminaries for Quantum Optics<br />
|March 30<br />
|3:30pm<br />
|CSE 503<br />
|-<br />
|David<br />
|<br />
|April 6<br />
|3:30PM<br />
|CSE 503<br />
|-<br />
|<br />
|<br />
|April 13<br />
|<br />
|<br />
|-<br />
|<br />
|<br />
|April 20<br />
|<br />
|<br />
|-<br />
|<br />
|<br />
|April 27<br />
|<br />
|<br />
|-<br />
|<br />
|<br />
|May 4<br />
|<br />
|<br />
|-<br />
|<br />
|<br />
|May 11<br />
|<br />
|<br />
|-<br />
|<br />
|<br />
|May 18<br />
|<br />
|<br />
|-<br />
|<br />
|<br />
|May 25<br />
|<br />
|<br />
|}<br />
==Abstracts==<br />
===Example Title===<br />
'''Feb 30th''' - Name <br/><br />
Synopsis of talk. [http://arxiv.org/list/quant-ph/new Link to a reference.]</div>Kpm3http://quantum.cs.washington.edu/wiki/index.php?title=Group_Meeting_Spring_2012&diff=1435Group Meeting Spring 20122012-03-21T02:11:28Z<p>Kpm3: </p>
<hr />
<div>{| border="1"<br />
|- style="background-color:#d0f0d0;"<br />
|Speaker<br />
|Topic<br />
|Date <br />
|Time<br />
|Location<br />
|- <br />
|Kamil<br />
|Adiabatic Cluster State Quantum Computing <br />
http://arxiv.org/abs/0905.0901<br />
<br />
I'll be going over some of the background \\<br />
behind this paper which includes, cluster \\<br />
states, and given time, measurement based <br />
QC and adiabatic<br />
evolution.<br />
|March 23<br />
|3:30pm<br />
|CSE 503<br />
|-<br />
|Tom<br />
|Preliminaries for Quantum Optics<br />
|March 30<br />
|3:30pm<br />
|CSE 503<br />
|-<br />
|David<br />
|<br />
|April 6<br />
|3:30PM<br />
|CSE 503<br />
|-<br />
|<br />
|<br />
|April 13<br />
|<br />
|<br />
|-<br />
|<br />
|<br />
|April 20<br />
|<br />
|<br />
|-<br />
|<br />
|<br />
|April 27<br />
|<br />
|<br />
|-<br />
|<br />
|<br />
|May 4<br />
|<br />
|<br />
|-<br />
|<br />
|<br />
|May 11<br />
|<br />
|<br />
|-<br />
|<br />
|<br />
|May 18<br />
|<br />
|<br />
|-<br />
|<br />
|<br />
|May 25<br />
|<br />
|<br />
|}<br />
==Abstracts==<br />
===Example Title===<br />
'''Feb 30th''' - Name <br/><br />
Synopsis of talk. [http://arxiv.org/list/quant-ph/new Link to a reference.]</div>Kpm3http://quantum.cs.washington.edu/wiki/index.php?title=Group_Meeting_Spring_2012&diff=1434Group Meeting Spring 20122012-03-21T02:11:11Z<p>Kpm3: </p>
<hr />
<div>{| border="1"<br />
|- style="background-color:#d0f0d0;"<br />
|Speaker<br />
|Topic<br />
|Date <br />
|Time<br />
|Location<br />
|- <br />
|Kamil<br />
|Adiabatic Cluster State Quantum Computing <br />
http://arxiv.org/abs/0905.0901<br />
<br />
I'll be going over some of the background <br />
behind this paper which includes, cluster<br />
states, and given time, measurement based <br />
QC and adiabatic<br />
evolution.<br />
|March 23<br />
|3:30pm<br />
|CSE 503<br />
|-<br />
|Tom<br />
|Preliminaries for Quantum Optics<br />
|March 30<br />
|3:30pm<br />
|CSE 503<br />
|-<br />
|David<br />
|<br />
|April 6<br />
|3:30PM<br />
|CSE 503<br />
|-<br />
|<br />
|<br />
|April 13<br />
|<br />
|<br />
|-<br />
|<br />
|<br />
|April 20<br />
|<br />
|<br />
|-<br />
|<br />
|<br />
|April 27<br />
|<br />
|<br />
|-<br />
|<br />
|<br />
|May 4<br />
|<br />
|<br />
|-<br />
|<br />
|<br />
|May 11<br />
|<br />
|<br />
|-<br />
|<br />
|<br />
|May 18<br />
|<br />
|<br />
|-<br />
|<br />
|<br />
|May 25<br />
|<br />
|<br />
|}<br />
==Abstracts==<br />
===Example Title===<br />
'''Feb 30th''' - Name <br/><br />
Synopsis of talk. [http://arxiv.org/list/quant-ph/new Link to a reference.]</div>Kpm3http://quantum.cs.washington.edu/wiki/index.php?title=Group_Meeting_Spring_2012&diff=1433Group Meeting Spring 20122012-03-21T02:10:58Z<p>Kpm3: </p>
<hr />
<div>{| border="1"<br />
|- style="background-color:#d0f0d0;"<br />
|Speaker<br />
|Topic<br />
|Date <br />
|Time<br />
|Location<br />
|- <br />
|Kamil<br />
|Adiabatic Cluster State Quantum Computing <br />
http://arxiv.org/abs/0905.0901<br />
I'll be going over some of the background <br />
behind this paper which includes, cluster<br />
states, and given time, measurement based <br />
QC and adiabatic<br />
evolution.<br />
|March 23<br />
|3:30pm<br />
|CSE 503<br />
|-<br />
|Tom<br />
|Preliminaries for Quantum Optics<br />
|March 30<br />
|3:30pm<br />
|CSE 503<br />
|-<br />
|David<br />
|<br />
|April 6<br />
|3:30PM<br />
|CSE 503<br />
|-<br />
|<br />
|<br />
|April 13<br />
|<br />
|<br />
|-<br />
|<br />
|<br />
|April 20<br />
|<br />
|<br />
|-<br />
|<br />
|<br />
|April 27<br />
|<br />
|<br />
|-<br />
|<br />
|<br />
|May 4<br />
|<br />
|<br />
|-<br />
|<br />
|<br />
|May 11<br />
|<br />
|<br />
|-<br />
|<br />
|<br />
|May 18<br />
|<br />
|<br />
|-<br />
|<br />
|<br />
|May 25<br />
|<br />
|<br />
|}<br />
==Abstracts==<br />
===Example Title===<br />
'''Feb 30th''' - Name <br/><br />
Synopsis of talk. [http://arxiv.org/list/quant-ph/new Link to a reference.]</div>Kpm3http://quantum.cs.washington.edu/wiki/index.php?title=Group_Meeting_Spring_2012&diff=1432Group Meeting Spring 20122012-03-21T02:07:55Z<p>Kpm3: </p>
<hr />
<div>{| border="1"<br />
|- style="background-color:#d0f0d0;"<br />
|Speaker<br />
|Topic<br />
|Date <br />
|Time<br />
|Location<br />
|- <br />
|Kamil<br />
|Adiabatic Cluster State Quantum Computing <br />
http://arxiv.org/abs/0905.0901<br />
|March 23<br />
|3:30pm<br />
|CSE 503<br />
|-<br />
|Tom<br />
|Preliminaries for Quantum Optics<br />
|March 30<br />
|3:30pm<br />
|CSE 503<br />
|-<br />
|David<br />
|<br />
|April 6<br />
|3:30PM<br />
|CSE 503<br />
|-<br />
|<br />
|<br />
|April 13<br />
|<br />
|<br />
|-<br />
|<br />
|<br />
|April 20<br />
|<br />
|<br />
|-<br />
|<br />
|<br />
|April 27<br />
|<br />
|<br />
|-<br />
|<br />
|<br />
|May 4<br />
|<br />
|<br />
|-<br />
|<br />
|<br />
|May 11<br />
|<br />
|<br />
|-<br />
|<br />
|<br />
|May 18<br />
|<br />
|<br />
|-<br />
|<br />
|<br />
|May 25<br />
|<br />
|<br />
|}<br />
==Abstracts==<br />
===Example Title===<br />
'''Feb 30th''' - Name <br/><br />
Synopsis of talk. [http://arxiv.org/list/quant-ph/new Link to a reference.]</div>Kpm3http://quantum.cs.washington.edu/wiki/index.php?title=Group_Meeting_Spring_2012&diff=1431Group Meeting Spring 20122012-03-21T02:07:26Z<p>Kpm3: </p>
<hr />
<div>{| border="1"<br />
|- style="background-color:#d0f0d0;"<br />
|Speaker<br />
|Topic<br />
|Date <br />
|Time<br />
|Location<br />
|- <br />
|Kamil<br />
|Adiabatic Cluster State Quantum Computing http://arxiv.org/abs/0905.0901<br />
|March 23<br />
|3:30pm<br />
|CSE 503<br />
|-<br />
|Tom<br />
|Preliminaries for Quantum Optics<br />
|March 30<br />
|3:30pm<br />
|CSE 503<br />
|-<br />
|David<br />
|<br />
|April 6<br />
|3:30PM<br />
|CSE 503<br />
|-<br />
|<br />
|<br />
|April 13<br />
|<br />
|<br />
|-<br />
|<br />
|<br />
|April 20<br />
|<br />
|<br />
|-<br />
|<br />
|<br />
|April 27<br />
|<br />
|<br />
|-<br />
|<br />
|<br />
|May 4<br />
|<br />
|<br />
|-<br />
|<br />
|<br />
|May 11<br />
|<br />
|<br />
|-<br />
|<br />
|<br />
|May 18<br />
|<br />
|<br />
|-<br />
|<br />
|<br />
|May 25<br />
|<br />
|<br />
|}<br />
==Abstracts==<br />
===Example Title===<br />
'''Feb 30th''' - Name <br/><br />
Synopsis of talk. [http://arxiv.org/list/quant-ph/new Link to a reference.]</div>Kpm3http://quantum.cs.washington.edu/wiki/index.php?title=Group_Meeting_Spring_2012&diff=1430Group Meeting Spring 20122012-03-21T02:06:59Z<p>Kpm3: </p>
<hr />
<div>{| border="1"<br />
|- style="background-color:#d0f0d0;"<br />
|Speaker<br />
|Topic<br />
|Date <br />
|Time<br />
|Location<br />
|- <br />
|Kamil<br />
|Adiabatic Cluster States http://arxiv.org/abs/0905.0901<br />
|March 23<br />
|3:30pm<br />
|CSE 503<br />
|-<br />
|Tom<br />
|Preliminaries for Quantum Optics<br />
|March 30<br />
|3:30pm<br />
|CSE 503<br />
|-<br />
|David<br />
|<br />
|April 6<br />
|3:30PM<br />
|CSE 503<br />
|-<br />
|<br />
|<br />
|April 13<br />
|<br />
|<br />
|-<br />
|<br />
|<br />
|April 20<br />
|<br />
|<br />
|-<br />
|<br />
|<br />
|April 27<br />
|<br />
|<br />
|-<br />
|<br />
|<br />
|May 4<br />
|<br />
|<br />
|-<br />
|<br />
|<br />
|May 11<br />
|<br />
|<br />
|-<br />
|<br />
|<br />
|May 18<br />
|<br />
|<br />
|-<br />
|<br />
|<br />
|May 25<br />
|<br />
|<br />
|}<br />
==Abstracts==<br />
===Example Title===<br />
'''Feb 30th''' - Name <br/><br />
Synopsis of talk. [http://arxiv.org/list/quant-ph/new Link to a reference.]</div>Kpm3http://quantum.cs.washington.edu/wiki/index.php?title=Group_Meeting_Spring_2012&diff=1429Group Meeting Spring 20122012-03-21T02:06:33Z<p>Kpm3: </p>
<hr />
<div>{| border="1"<br />
|- style="background-color:#d0f0d0;"<br />
|Speaker<br />
|Topic<br />
|Date <br />
|Time<br />
|Location<br />
|- <br />
|Kamil<br />
|Adiabatic Cluster States <a href='http://arxiv.org/abs/0905.0901'>ref</a><br />
|March 23<br />
|3:30pm<br />
|CSE 503<br />
|-<br />
|Tom<br />
|Preliminaries for Quantum Optics<br />
|March 30<br />
|3:30pm<br />
|CSE 503<br />
|-<br />
|David<br />
|<br />
|April 6<br />
|3:30PM<br />
|CSE 503<br />
|-<br />
|<br />
|<br />
|April 13<br />
|<br />
|<br />
|-<br />
|<br />
|<br />
|April 20<br />
|<br />
|<br />
|-<br />
|<br />
|<br />
|April 27<br />
|<br />
|<br />
|-<br />
|<br />
|<br />
|May 4<br />
|<br />
|<br />
|-<br />
|<br />
|<br />
|May 11<br />
|<br />
|<br />
|-<br />
|<br />
|<br />
|May 18<br />
|<br />
|<br />
|-<br />
|<br />
|<br />
|May 25<br />
|<br />
|<br />
|}<br />
==Abstracts==<br />
===Example Title===<br />
'''Feb 30th''' - Name <br/><br />
Synopsis of talk. [http://arxiv.org/list/quant-ph/new Link to a reference.]</div>Kpm3http://quantum.cs.washington.edu/wiki/index.php?title=Journal_Club_Autumn_2011&diff=1286Journal Club Autumn 20112011-10-10T22:08:56Z<p>Kpm3: </p>
<hr />
<div>Journal Club Spring 2011<br />
<br />
This quarter we will be focusing on Quantum Error Correction.<br />
<br />
Past journal club pages: [[Journal Club Autumn 2010|Autumn 2010]], [[Journal Club Winter 2011|Winter 2011]] <br />
<br />
==People==<br />
<br />
'''Organizer(1):''' Paul Pham (ppham@cs.washington.edu)<br />
<br />
'''Organizer(2):''' Lukas Svec (svecl@u.washington.edu)<br />
<br />
'''Faculty Advisor:''' [[User:harrow|Aram Harrow]] (aram@cs.washington.edu)<br />
<br />
==Place==<br />
<br />
Friday 2:00pm in Computer Science, CSE 503.<br />
<br />
==Organization==<br />
<br />
;Possible Topics:<br />
* Quantum Information (Mark Wilde http://arxiv.org/abs/1106.1445) (2 votes)<br />
* Pro/Con: field has stabilized, stuck on solving additivity problem<br />
* Con: unrealistic models, not as applicable<br />
* Pro: Using asymptotic bounds on entropy can give classical algorithm for approximating separable states. (Brandao, Christandl, Yard)<br />
* Pro: connection to quantum error-correcting codes<br />
* Self-Correcting Quantum Memories (5 votes)<br />
* Pro: hot/active research area right now, possibility of making contribution, not many people working on<br />
* Major breakthrough by Haah http://arxiv.org/abs/1101.1962<br />
* Pro: best way theory can help build a quantum computer<br />
* Pro: nice connections to statistical physics (topological order)<br />
* Matt Hastings / Sergei Bravyi / Alexei Kitaev (Greatest Hits, Vol. 1) (0 votes)<br />
* Hastings: area laws, Lieb-Robinson bounds, additivity, classical algorithms for simulating quantum systems, hamiltonian complexity, self-correcting quantum memory, topological order<br />
* Bravyi: stoquastic hamiltonians, topological codes, Majorana fermions, stability results for topological order<br />
* Kitaev: awesome<br />
* Possibly invite for physics colloquium<br />
* Oded Regev: quantum algorithms, communication complexity, lattice-based crypto (1 vote)<br />
* Following one particular person:<br />
* Pro: can jump around various topics, get good breadth<br />
* Con: might not ever understand anything<br />
* Hamiltonian Complexity (3 votes)<br />
* Pro: has great obscure acronyms, in the intersection of physics and CS (Lieb-Robinson, area laws, etc.), good guide / survey by Tobias Osborne (http://arxiv.org/abs/1106.5875)<br />
* Con: hard! (e.g. quantum PCP)<br />
* Quantum Money / Knots<br />
* Stephen Bartlett<br />
<br />
==Schedule==<br />
<br />
<br />
==Papers==</div>Kpm3http://quantum.cs.washington.edu/wiki/index.php?title=Journal_Club_Winter_2011&diff=1160Journal Club Winter 20112011-01-06T23:31:20Z<p>Kpm3: Created page with "Journal Club Winter 2011 ==People== '''Organizer:''' Kamil Michnicki (kpm3@u.washington.edu) '''Faculty Advisor:''' Dave Bacon (dabacon@cs.washington.edu) ==..."</p>
<hr />
<div>Journal Club Winter 2011<br />
<br />
==People==<br />
<br />
'''Organizer:''' Kamil Michnicki (kpm3@u.washington.edu)<br />
<br />
'''Faculty Advisor:''' [[User:Dabacon|Dave Bacon]] (dabacon@cs.washington.edu)<br />
<br />
==Place==<br />
<br />
Friday 3:45 in Computer Science, CSE 403.<br />
<br />
==Organization==<br />
<br />
Topic Chosen: Quantum Random Walks<br />
<br />
<br />
<br />
==Schedule==<br />
<br />
{|<br />
!Subject<br />
!Speaker<br />
!Date<br />
|-<br />
|<br />
|Lucas Svek <br />
|Jan 7<br />
|-<br />
|<br />
|Lucas Svek <br />
|Jan 14<br />
|-<br />
|<br />
|Lucas Svek <br />
|Jan 21<br />
|-<br />
|<br />
| <br />
|<br />
|-<br />
|<br />
| <br />
|<br />
|-<br />
|<br />
| <br />
|<br />
|-<br />
|<br />
| <br />
|<br />
|-<br />
|<br />
| <br />
|<br />
|-<br />
|<br />
| <br />
|<br />
|-<br />
|}</div>Kpm3http://quantum.cs.washington.edu/wiki/index.php?title=Teaching&diff=1149Teaching2010-11-09T22:29:36Z<p>Kpm3: </p>
<hr />
<div>==Teaching==<br />
<br />
Dave Bacon's teaching page [[User:Dabacon:Teaching|here]]<br />
<br />
==Quantum Computing Journal Club==<br />
<br />
[[Journal Club Spring 2010]]<br />
<br />
[[Journal Club Autumn 2010]]<br />
<br />
==Lecture Notes for Quantum Computing==<br />
<br />
Lecture notes for [http://www.cs.washington.edu/education/courses/cse599d/06wi/ CSE 599] Quantum Computing<br />
<br />
* [http://www.cs.washington.edu/education/courses/cse599d/06wi/lecturenotes1.pdf Introduction and Basics of Quantum Theory] (updated 1/4/06)<br />
* [http://www.cs.washington.edu/education/courses/cse599d/06wi/lecturenotes2.pdf Dirac Notation and Basic Linear Algebra for Quantum Computing] (updated 1/6/06)<br />
* [http://www.cs.washington.edu/education/courses/cse599d/06wi/lecturenotes3.pdf One qubit, Two qubit] (updated 1/10/06)<br />
* [http://www.cs.washington.edu/education/courses/cse599d/06wi/lecturenotes4.pdf The No-Cloning Theorem, Classical Teleportation and Quantum Teleportation, Superdense Coding] (updated 1/11/06)<br />
* [http://www.cs.washington.edu/education/courses/cse599d/06wi/lecturenotes5.pdf The Quantum Circuit Model and Universal Quantum Computation] (updated 1/20/06)<br />
* [http://www.cs.washington.edu/education/courses/cse599d/06wi/lecturenotes6.pdf Reversible Classical Circuits and the Deutsch-Jozsa Algorithm] (updated 1/20/06)<br />
* [http://www.cs.washington.edu/education/courses/cse599d/06wi/lecturenotes7.pdf The Recursive and Nonrecursive Bernstein-Vazirani Algorithmm] (updated 1/23/06)<br />
* [http://www.cs.washington.edu/education/courses/cse599d/06wi/lecturenotes8.pdf Simon's Algorithm] (updated 1/26/06)<br />
* [http://www.cs.washington.edu/education/courses/cse599d/06wi/lecturenotes9.pdf The Quantum Fourier Transform] (updated 1/26/06)<br />
* [http://www.cs.washington.edu/education/courses/cse599d/06wi/lecturenotes10.pdf Quantum Phase Estimation and Arbitrary Size Quantum Fourier Transforms] (updated 1/26/06)<br />
* [http://www.cs.washington.edu/education/courses/cse599d/06wi/lecturenotes11.pdf Shor's Algorithm] (updated 1/30/06)<br />
* [http://www.cs.washington.edu/education/courses/cse599d/06wi/lecturenotes12.pdf Grover's Algorithm] (updated 1/31/06)<br />
* [http://www.cs.washington.edu/education/courses/cse599d/06wi/lecturenotes13.pdf Mixed States and Open Quantum Systems] (update 2/8/06)<br />
* [http://www.cs.washington.edu/education/courses/cse599d/06wi/lecturenotes14.pdf Quantum Entanglement and Bell's Theorem] (updated updated 2/8/06)<br />
* [http://www.cs.washington.edu/education/courses/cse599d/06wi/lecturenotes15.pdf When Quantum Computers Fall Apart] (updated 2/8/06)<br />
* [http://www.cs.washington.edu/education/courses/cse599d/06wi/lecturenotes16.pdf Introduction to Quantum Error Correction] (updated 2/10/06)<br />
* [http://www.cs.washington.edu/education/courses/cse599d/06wi/lecturenotes17.pdf The Quantum Error Correcting Criteria] (updated 2/13/06)<br />
* [http://www.cs.washington.edu/education/courses/cse599d/06wi/lecturenotes18.pdf Stabilizer Quantum Error Correcting Codes] (updated 2/12/06)<br />
* [http://www.cs.washington.edu/education/courses/cse599d/06wi/lecturenotes19.pdf Fault-Tolerant Quantum Computation and the Threshold Theorem] (updated 2/12/06)</div>Kpm3http://quantum.cs.washington.edu/wiki/index.php?title=Calendar&diff=1106Calendar2010-10-28T06:27:12Z<p>Kpm3: </p>
<hr />
<div><googleagenda>7pbn5m092j1qdf2lne1agqf3no@group.calendar.google.com</googleagenda><noinclude><br />
== Group Meeting Fall 2010 ==<br />
{| border="1"<br />
|Date<br />
|Location<br />
|Speaker<br />
|Topic<br />
|-<br />
|Oct 5, 11am<br />
|CSE 674<br />
|<br />
|<br />
|-<br />
|Oct 12, 9am<br />
|CSE 674<br />
|<br />
|<br />
|-<br />
|Oct 19, 11am<br />
|CSE 674<br />
|Aram<br />
|TBA<br />
|-<br />
|Oct 26, 9am<br />
|CSE 674<br />
|Isaac<br />
|Fault-Tolerant Cluster State Computation<br />
|-<br />
|Nov 2, 11am<br />
|CSE 674<br />
|Paul<br />
|Quantum compiling with the Super-Kitaev algorithm<br />
|-<br />
|Nov 9, 9am<br />
|CSE 674<br />
|David Rosenbaum<br />
|<br />
|- <br />
|Nov 16, 11am<br />
|CSE 503<br />
|<br />
|<br />
|-<br />
|Nov 23, 9am<br />
|CSE 674<br />
|Kamil Michnicki<br />
|TBA<br />
|-<br />
|Nov 30, 11am<br />
|CSE 503<br />
|Kate Liotta<br />
|<br />
|-<br />
|Dec 5, 9am<br />
|CSE 674<br />
|Kevin Zatloukal<br />
|<br />
|}</div>Kpm3http://quantum.cs.washington.edu/wiki/index.php?title=Journal_Club_Autumn_2010&diff=1100Journal Club Autumn 20102010-10-12T18:52:17Z<p>Kpm3: </p>
<hr />
<div>Journal Club Autumn 2010<br />
<br />
==People==<br />
<br />
'''Organizer:''' Kamil Michnicki (kpm3@u.washington.edu)<br />
<br />
'''Faculty Advisor:''' [[User:Dabacon|Dave Bacon]] (dabacon@cs.washington.edu)<br />
<br />
==Place==<br />
<br />
Friday 3:45 in Computer Science, CSE 403.<br />
<br />
==Organization==<br />
<br />
Topic Chosen: Measurement Based Quantum Computing<br />
<br />
[[Possible Theoretical Topics and Papers]]<br />
<br />
[[Possible Experimental Topics and Papers]]<br />
<br />
==Schedule==<br />
<br />
{|<br />
!Subject<br />
!Speaker<br />
!Date<br />
|-<br />
|<br />
|Isaac Crosson <br />
|Oct 15<br />
|-<br />
|<br />
|Isaac Crosson <br />
|Oct 22<br />
|-<br />
|<br />
|Lucas Svek <br />
|Oct 29<br />
|-<br />
|<br />
|Kamil Michnicki <br />
|Nov 5<br />
|-<br />
|<br />
|Kamil Michnicki <br />
|Nov 12<br />
|-<br />
|<br />
|Jijiang Yan <br />
|Nov 19<br />
|-<br />
|<br />
|Jijiang Yan <br />
|Nov 26<br />
|-<br />
|<br />
|Zak Webb <br />
|Dec 3<br />
|-<br />
|<br />
|Zak Webb <br />
|Dec 10<br />
|-<br />
|}</div>Kpm3http://quantum.cs.washington.edu/wiki/index.php?title=Journal_Club_Autumn_2010&diff=1099Journal Club Autumn 20102010-10-08T23:22:28Z<p>Kpm3: </p>
<hr />
<div>Journal Club Autumn 2010<br />
<br />
==People==<br />
<br />
'''Organizer:''' Kamil Michnicki (kpm3@u.washington.edu)<br />
<br />
'''Faculty Advisor:''' [[User:Dabacon|Dave Bacon]] (dabacon@cs.washington.edu)<br />
<br />
==Place==<br />
<br />
Friday 3:45 in B042 Physics.<br />
<br />
==Organization==<br />
<br />
Topic Chosen: Measurement Based Quantum Computing<br />
<br />
[[Possible Theoretical Topics and Papers]]<br />
<br />
[[Possible Experimental Topics and Papers]]<br />
<br />
==Schedule==<br />
<br />
{|<br />
!Subject<br />
!Speaker<br />
!Date<br />
|-<br />
|<br />
|Isaac Crosson <br />
|Oct 15<br />
|-<br />
|<br />
|Isaac Crosson <br />
|Oct 22<br />
|-<br />
|<br />
|Lucas Svek <br />
|Oct 29<br />
|-<br />
|<br />
|Kamil Michnicki <br />
|Nov 5<br />
|-<br />
|<br />
|Kamil Michnicki <br />
|Nov 12<br />
|-<br />
|<br />
|Jijiang Yan <br />
|Nov 19<br />
|-<br />
|<br />
|Jijiang Yan <br />
|Nov 26<br />
|-<br />
|<br />
|Zak Webb <br />
|Dec 3<br />
|-<br />
|<br />
|Zak Webb <br />
|Dec 10<br />
|-<br />
|}</div>Kpm3http://quantum.cs.washington.edu/wiki/index.php?title=Journal_Club_Autumn_2010&diff=1098Journal Club Autumn 20102010-10-08T23:20:08Z<p>Kpm3: </p>
<hr />
<div>Journal Club Autumn 2010<br />
<br />
==People==<br />
<br />
'''Organizer:''' Kamil Michnicki (kpm3@u.washington.edu)<br />
<br />
'''Faculty Advisor:''' [[User:Dabacon|Dave Bacon]] (dabacon@cs.washington.edu)<br />
<br />
==Place==<br />
<br />
Friday 3:45 in B042 Physics.<br />
<br />
==Organization==<br />
<br />
Topic Chosen: Measurement Based Quantum Computing<br />
<br />
[[Possible Theoretical Topics and Papers]]<br />
<br />
[[Possible Experimental Topics and Papers]]<br />
<br />
==Schedule==<br />
<br />
{|<br />
!Subject<br />
!Speaker<br />
!Date<br />
|-<br />
|<br />
|Isaac Crosson <br />
|<br />
|-<br />
|<br />
|Isaac Crosson <br />
|<br />
|-<br />
|<br />
|Lucas Svek <br />
|<br />
|-<br />
|<br />
|Kamil Michnicki <br />
|<br />
|-<br />
|<br />
|Kamil Michnicki <br />
|<br />
|-<br />
|<br />
|Jijiang Yan <br />
|<br />
|-<br />
|<br />
|Jijiang Yan <br />
|<br />
|-<br />
|<br />
|Zak Webb <br />
|<br />
|-<br />
|<br />
|Zak Webb <br />
|<br />
|-<br />
|}</div>Kpm3