Difference between revisions of "Journal Club Spring 2012"
(→Papers) |
(→Papers) |
||
| Line 27: | Line 27: | ||
==Papers== | ==Papers== | ||
| + | |||
June 2003: '''Randomizing quantum states: Constructions and applications''' - Hayden, Leung, Shor, Winter<br/> | June 2003: '''Randomizing quantum states: Constructions and applications''' - Hayden, Leung, Shor, Winter<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/> | ''"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/> | ||
| Line 35: | Line 36: | ||
http://arxiv.org/abs/quant-ph/0409157 | http://arxiv.org/abs/quant-ph/0409157 | ||
| − | Jun 2007: '''Random Unitaries Give Quantum Expanders''' - Hastings<br/> | + | Jun 2007: '''Random Unitaries Give Quantum Expanders''' - M. B. Hastings<br/> |
''"We show that randomly choosing the matrices in a completely positive map from the unitary group gives a quantum expander. "''<br/> | ''"We show that randomly choosing the matrices in a completely positive map from the unitary group gives a quantum expander. "''<br/> | ||
http://arxiv.org/abs/0706.0556 | http://arxiv.org/abs/0706.0556 | ||
| Line 46: | Line 47: | ||
''"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/> | ''"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/> | ||
http://arxiv.org/abs/0804.0011 | http://arxiv.org/abs/0804.0011 | ||
| + | |||
| + | ===Additional Topics=== | ||
| + | |||
| + | July 2004: '''Aspects of generic entanglement''' - Hayden, Leung, Winter<br/> | ||
| + | http://arxiv.org/abs/quant-ph/0407049 | ||
| + | |||
| + | Jun 2006: '''The mother of all protocols: Restructuring quantum information's family tree''' - Abeyesinghe, Devetak, Hayden, Winter<br/> | ||
| + | http://arxiv.org/abs/quant-ph/0606225 | ||
| + | |||
| + | Oct 2010: '''From Low-Distortion Norm Embeddings to Explicit Uncertainty Relations and Efficient Information Locking''' - Fawzi, Hayden, Sen<br/> | ||
| + | http://arxiv.org/abs/1010.3007 | ||
| + | |||
| + | Oct 2009: '''Non-additivity of Renyi entropy and Dvoretzky's Theorem''' - Aubrun, Szarek, Werner<br/> | ||
| + | http://arxiv.org/abs/0910.1189 | ||
| + | |||
| + | Mar 2010: '''Hastings' additivity counterexample via Dvoretzky's theorem''' - Aubrun, Szarek, Werner<br/> | ||
| + | http://arxiv.org/abs/1003.4925 | ||
| + | |||
| + | Jun 2011: '''Entanglement thresholds for random induced states''' - Aubrun, Szarek, Ye<br/> | ||
| + | http://arxiv.org/abs/1106.2264 | ||
| + | |||
| + | Nov 2011: '''Towards the fast scrambling conjecture''' - Lashkari, Stanford, Hastings, Osborne, Hayden<br/> | ||
| + | http://arxiv.org/abs/1111.6580 | ||
Revision as of 03:39, 29 March 2012
This quarter we will be focusing on Quantum Expanders and Randomized Constructions.
People
Organizer(1): Isaac Crosson
Organizer(2): Kamil Michnicki (kpm3uw@gmail.com)
Faculty Advisor: Aram Harrow
Place
Friday 1:30pm in Computer Science, CSE 503.
Schedule
| Subject | Speaker | Date |
|---|---|---|
| Introduction and Review | ??? | ??? |
| ??? | ??? | ??? |
Papers
June 2003: Randomizing quantum states: Constructions and applications - Hayden, Leung, Shor, Winter
"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."
http://arxiv.org/abs/quant-ph/0307104 , http://arxiv.org/abs/0802.4193
Sep 2004: Entanglement in Random Subspaces - Hayden
"The selection of random subspaces plays a role in quantum information theory analogous to the role of random strings in classical information theory."
http://arxiv.org/abs/quant-ph/0409157
Jun 2007: Random Unitaries Give Quantum Expanders - M. B. Hastings
"We show that randomly choosing the matrices in a completely positive map from the unitary group gives a quantum expander. "
http://arxiv.org/abs/0706.0556
Sep 2007: Quantum expanders from any classical Cayley graph expander - A. W. Harrow
"We give a simple recipe for translating walks on Cayley graphs of a group G into a quantum operation on any irrep of G. "
http://arxiv.org/abs/0709.1142 0709.1142
Apr 2008: Classical and Quantum Tensor Product Expanders - M. B. Hastings, A. W. Harrow
"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."
http://arxiv.org/abs/0804.0011
Additional Topics
July 2004: Aspects of generic entanglement - Hayden, Leung, Winter
http://arxiv.org/abs/quant-ph/0407049
Jun 2006: The mother of all protocols: Restructuring quantum information's family tree - Abeyesinghe, Devetak, Hayden, Winter
http://arxiv.org/abs/quant-ph/0606225
Oct 2010: From Low-Distortion Norm Embeddings to Explicit Uncertainty Relations and Efficient Information Locking - Fawzi, Hayden, Sen
http://arxiv.org/abs/1010.3007
Oct 2009: Non-additivity of Renyi entropy and Dvoretzky's Theorem - Aubrun, Szarek, Werner
http://arxiv.org/abs/0910.1189
Mar 2010: Hastings' additivity counterexample via Dvoretzky's theorem - Aubrun, Szarek, Werner
http://arxiv.org/abs/1003.4925
Jun 2011: Entanglement thresholds for random induced states - Aubrun, Szarek, Ye
http://arxiv.org/abs/1106.2264
Nov 2011: Towards the fast scrambling conjecture - Lashkari, Stanford, Hastings, Osborne, Hayden
http://arxiv.org/abs/1111.6580
