Journal Club Organization
From Quantum Computing Theory Group
Organization
Votes for Next Quarter
- Quantum Expanders and Randomized Constructions - 3 votes
- Hidden Subgroup Problem / Graph Isomorphism / Quantum State Generation - 3 votes
- Quantum Information Theory - 1 vote
- Algorithms - 1 vote
- Hamiltonian Simulation - 3 votes
- Quantum Lower Bounds - 2 votes
- Possible Topics
Notes from Fall Quarter
- Quantum Information (Mark Wilde http://arxiv.org/abs/1106.1445)
* Pro/Con: field has stabilized, stuck on solving additivity problem * Con: unrealistic models, not as applicable * Pro: Using asymptotic bounds on entropy can give classical algorithm for approximating separable states. (Brandao, Christandl, Yard) * Pro: connection to quantum error-correcting codes
- Self-Correcting Quantum Memories
* Pro: hot/active research area right now, possibility of making contribution, not many people working on * Major breakthrough by Haah http://arxiv.org/abs/1101.1962 * Pro: best way theory can help build a quantum computer * Pro: nice connections to statistical physics (topological order)
- Matt Hastings / Sergei Bravyi / Alexei Kitaev (Greatest Hits, Vol. 1)
* Hastings: area laws, Lieb-Robinson bounds, additivity, classical algorithms for simulating quantum systems, hamiltonian complexity, self-correcting quantum memory, topological order * Bravyi: stoquastic hamiltonians, topological codes, Majorana fermions, stability results for topological order * Kitaev: awesome * Possibly invite for physics colloquium
- Oded Regev: quantum algorithms, communication complexity, lattice-based crypto
- Following one particular person:
* Pro: can jump around various topics, get good breadth * Con: might not ever understand anything
- Hamiltonian Complexity
* 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) * Con: hard! (e.g. quantum PCP)
- Quantum Money / Knots
- Stephen Bartlett