Now on ScienceBlogs: Oldest Human-Made Object in Space

ScienceBlogs Book Club: Inside the Outbreaks

Search

rss.jpg   Subscribe to RSS feed

Follow dabacon on Twitter

Profile

davidog.pngDave Bacon is a theoretical ski bum who is also a pseudo professor. His research is on quantum computing, his scientific passions extend to everything in physics, mathematics, computer science and beyond, and his personal pleasures include making wine, playing poker, skiing, camping, and daydreaming (although not all of those at the same time.) Nothing he says on this blog should be construed as having anything to do with his employer or his dog.


Recent Comments

Recent Posts

Other Information

The use of Occam's razor on this website is strickly prohibited.

Cows are well approximated by a sphere.
rss.jpg   Subscribe to RSS feed

Follow dabacon on Twitter

« Bacon Brains | Main | Posters For Some, Minature American Flags for Others »

QIP Talks That Have arXiv Papers

Category: Computer ScienceQuantum Computing
Posted on: January 15, 2010 6:19 PM, by Dave Bacon

Share:

QIP 2010 talks and associated papers if I could find them (amazing how almost all papers for this conference are available, for free, online at one location....also interesting how papers seem to cluster in the 10-12 months of the listings :) ) If anyone has corrections please leave a comment.

Monday

  • Daniel Gottesman and Sandy Irani
    The quantum and classical complexity of translationally invariant tiling and Hamiltonian problems
    arXiv:0905.2419
  • Rahul Jain, Iordanis Kerenidis, Greg Kuperberg, Miklos Santha, Or Sattath, and Shengyu Zhang
    On the power of a unique quantum witness
    arXiv:0906.4425
  • Scott Aaronson and Andrew Drucker
    A full characterization of quantum advice
    No paper found
  • Rahul Jain (invited talk)
    QIP = PSPACE
    arXiv:0907.4737
  • Antonio Acin, Antoine Boyer de la Giroday, Serge Massar, and Stefano Pironio
    Random numbers certified by Bell's theorem
    arXiv:0911.3427
  • Dave Bacon and Steve Flammia
    Adiabatic gate teleportation
    arXiv:0905.0901 (see also arXiv:0912.2098)

Tuesday

  • Ben Reichardt (invited talk)
    Span programs and quantum algorithms
    A series of papers, including the 70 pager arXiv:0904.2759
  • David Gross, Yi-Kai Liu, Steven Flammia, Stephen Becker, and Jens Eisert
    Non-commutative compressed sensing: theory and applications for quantum tomography
    arXiv:0909.3304 (see also the followup arXiv:0910.1879 update: and the paper referred to in David's talk as arXiv.to.day arXiv:1001.2738)
  • Norbert Schuch, J. Ignacio Cirac, Dorit Aharonov, Itai Arad, and Sandy Irani
    An efficient algorithm for finding Matrix Product ground states
    arXiv:0910.5055 and arXiv:0910.4264
  • Dominic W. Berry and Andrew M. Childs
    The query complexity of Hamiltonian simulation and unitary implementation
    arXiv:0910.4157
  • Maarten Van den Nest
    Simulating quantum computers with probabilistic methods
    arXiv:0911.1624
  • Philippe Corboz (invited talk)
    Simulation of fermionic lattice models in two dimensions with tensor network algorithms
    arXiv:0912.0646
  • Boris Altshuler, Hari Krovi, and Jérémie Roland
    Adiabatic quantum optimization fails for random instances of NP-complete problems
    arXiv:0908.2782
  • Kristan Temme, Tobias Osborne, Karl Gerd Vollbrecht, David Poulin, and Frank Verstraete
    Quantum metropolis sampling
    arXiv:0911.3635
  • Sergey Bravyi, David Poulin, and Barbara Terhal
    Tradeoffs for reliable quantum information storage in 2D systems
    arXiv:0909.5200

Wednesday

  • André Chailloux (invited talk)
    Quantum coin flipping
    arXiv:0904.1511
  • Matthias Christandl, Norbert Schuch, and Andreas Winter
    Highly entangled states with almost no secrecy
    arXiv:0910.4151
  • Anindya De and Thomas Vidick
    Improved extractors against bounded quantum storage
    arXiv:0911.4680
  • Ivan Damgård, Serge Fehr, Carolin Lunemann, Louis Salvail, and Christian Schaffner
    Improving the security of quantum protocols via commit-and-open
    arXiv:0902.3918
  • Robert Koenig, Stephanie Wehner, and Juerg Wullschleger
    Unconditional security from noisy quantum storage
    arXiv:0906.1030 and arXiv:0911.2302
  • Pablo Arrighi, Vincent Nesme, and Reinhard Werner
    Unitarity plus causality implies localizability
    arXiv:0711.3975

Thursday

  • Aram Harrow (invited talk)
    Quantum algorithms for linear systems of equations
    arXiv:0811.3171
  • Stefano Chesi, Beat Röthlisberger, Daniel Loss, Sergey Bravyi, and Barbara M. Terhal
    Stability of topological quantum memories in contact with a thermal bath
    arXiv:0907.2807
  • Robert Koenig, Greg Kuperberg, and Ben Reichardt
    Quantum computation with Turaev-Viro codes
    No paper found
  • Mark Howard and Wim van Dam
    Tight noise thresholds for quantum computation with perfect stabilizer operations
    arXiv:0907.3189
  • Prabha Mandayam and Hui Khoon Ng
    A simple approach to approximate quantum error correction
    arXiv:0909.0931
  • Sergey Bravyi, Cristopher Moore, Alexander Russell, Christopher Laumann, Andreas Läuchli, Roderich Moessner, Antonello Scardicchio, and Shivaji Sondhi
    Random quantum satisfiability: statistical mechanics of disordered quantum optimization
    arXiv:0903.1904 and arXiv:0907.1297
  • Julia Kempe (invited talk)
    A quantum Lovász Local Lemma
    arXiv:0911.1696

Friday

  • Marcin Pawlowski
    Information causality
    arXiv:0905.2292
  • Salman Beigi, Sergio Boixo, Matthew Elliot, and Stephanie Wehner
    Local quantum measurement and relativity imply quantum correlations
    arXiv:0910.3952
  • David Gross, Markus Mueller, Roger Colbeck, and Oscar Dahlsten
    All reversible dynamics in maximally non-local theories are trivial
    arXiv:0910.1840
  • Michael Wolf, David Perez-Garcia, and Carlos Fernandez
    Measurements incompatible in quantum theory cannot be measured jointly in any other no-signaling theory
    arXiv:0905.2998
  • Toby Cubitt, Jens Eisert, and Michael Wolf
    Laying the quantum and classical embedding problems to rest
    arXiv:0908.2128
  • Salman Beigi, Peter Shor, and John Watrous
    Quantum interactive proofs with short messages
    No paper found.
  • Scott Aaronson (invited talk)
    New evidence that quantum mechanics is hard to simulate on classical computers
    No paper found.
  • Julia Kempe and Oded Regev
    No strong parallel repetition with entangled and non-signaling provers
    arXiv:0911.0201
  • Toby Cubitt, Debbie Leung, William Matthews, and Andreas Winter
    Zero-error channel capacity and simulation assisted by non-local correlations
    arXiv:0911.5300
  • Jianxin Chen, Toby Cubitt, Aram Harrow, and Graeme Smith
    Super-duper-activation of the zero-error quantum capacity
    arXiv:0906.2547 and arXiv:0912.2737

Share on Facebook
Share on StumbleUpon
Share on Facebook
Find more posts in: Physical Science

TrackBacks

TrackBack URL for this entry: http://scienceblogs.com/mt/pings/129628

Comments

1

Don't be too hard on Aaronson. It's going to be a challenge to find anything on the arXiv from him until they start accepting powerpoint as a native upload.

Posted by: David | January 15, 2010 10:08 PM

2

> also interesting how papers seem to cluster in the 10-12
> months of the listings

I think there's a policy about that. Oh, wait, maybe that's what the emoticon was for. I'm dense.

Posted by: Ian Durham | January 15, 2010 11:50 PM

3

Dave, thank you for this fantastic list!

I have looked at a fair proportion of those preprints, of which my favorite (so far) is the Corboz/Orus/Bauer/Vidal preprint Simulation of strongly correlated fermions in two spatial dimensions with fermionic Projected Entangled-Pair States.

The Corboz preprint had a very different "look-and-feel" to the other preprints ... and it made me laugh when I realized why ... it is that the Corboz et al. preprint does *not* contain the word "theorem" anywhere ... whereas the other QIP2010 preprints (that I looked at) all were theorem-centric. :)

Should we regard this as evidence that QIP perhaps will *not* evolve into a theorem-proving monoculture, along the lines of FOCS/STOC? After all, nowadays rather few practicing software engineers care to attend FOCS/STOC ... perhaps this is because "a very great deal more truth can become known than can be proven"?

On the other hand, a rigorous emphasis on theorem-proving might be the *best* course for QIP. After all, FOCS/STOC is an outstandingly successful academic culture.

Dave, you're on the QIP Program Committee ... what is the thinking on this? Balancing rigor-versus-vigor must have been pretty challenging.

Posted by: John Sidles | January 18, 2010 8:08 AM

4

You can also probably add http://arxiv.org/abs/1001.2738 for David Gross's Today's talk : I think it's the one he called arXiv:To.day on his slides

Posted by: Frédéric Grosshans | January 19, 2010 5:29 AM

Comments have been closed as this blog has moved to http://dabacon.org/pontiff.
Click here to search for this post on the new blog.

ScienceBlogs

Search ScienceBlogs:

Go to:

Advertisement
Follow ScienceBlogs on Twitter

© 2006-2011 ScienceBlogs LLC. ScienceBlogs is a registered trademark of ScienceBlogs LLC. All rights reserved.