QIP 2016 Accepted Talks

Accepted talk submissions for QIP 2016 (in no particular order)

• Omar Fawzi, Marius Junge, Renato Renner, David Sutter, Mark Wilde and Andreas Winter. Universal recoverability in quantum information theory

• Merger of:
  Beni Yoshida. Gapped boundaries, group cohomology and fault-tolerant logical gates
  and
  Beni Yoshida. Topological phases with generalized global symmetries

• Mario Berta, Joseph M. Renes, Marco Tomamichel, Mark Wilde and Andreas Winter. Strong Converse and Finite Resource Tradeoffs for Quantum Channels

• Ashley Montanaro. Quantum walk speedup of backtracking algorithms

• Andris Ambainis, Aleksandrs Belovs, Oded Regev and Ronald de Wolf. Efficient Quantum Algorithms for (Gapped) Group Testing and Junta Testing

• Merger of:
  Ryan O'Donnell and John Wright. Efficient quantum tomography
  and
  Jeongwan Haah, Aram Harrow, Zhengfeng Ji, Xiaodi Wu and Nengkun Yu. Sampleoptimal tomography of quantum states

• Michael Bremner, Ashley Montanaro and Daniel Shepherd. Average-case complexity versus approximate simulation of commuting quantum computations

• David Sutter, Volkher Scholz, Andreas Winter and Renato Renner. Approximate degradable quantum channels

• Aleksander Kubica, Beni Yoshida and Fernando Pastawski. Unfolding the color code

• Yimin Ge, Andras Molnar and J. Ignacio Cirac. Rapid adiabatic preparation of injective PEPS and Gibbs states

• Mohammad Bavarian, Thomas Vidick and Henry Yuen. Anchoring games for parallel repetition

• Anne Broadbent and Stacey Jeffery. Quantum homomorphic encryption for circuits of low T-gate complexity

• Andris Ambainis, Kaspars Balodis, Aleksandrs Belovs, Troy Lee, Juris Smotrovs and Miklos Santha. Separations in Query Complexity Based on Pointer Functions

• Sergey Bravyi and David Gosset. Gapped and gapless phases of frustration-free spin-1/2 chains

• Merger of:
  Niel de Beaudrap and Sevag Gharibian. A linear time algorithm for quantum 2-SAT
  and
  Itai Arad, Miklos Santha, Aarthi Sundaram and Shengyu Zhang. Linear time algorithm for quantum 2SAT

• Mark Braverman, Ankit Garg, Young Kun Ko, Jieming Mao and Dave Touchette. Nearoptimal bounds on bounded-round quantum communication complexity of disjointness

• Matthew Coudron and Thomas Vidick. Interactive proofs with approximately commuting provers

• Scott Aaronson and Andris Ambainis. Forrelation: A Problem that Optimally Separates Quantum from Classical Computing

• Benjamin Musto and Jamie Vicary. Quantum Latin squares and unitary error bases

• Johannes Bausch, Toby Cubitt and Maris Ozols. The Complexity of Translationally Invariant Spin Chains with Low Dimension

• Fernando Brandao and Aram Harrow. Estimating operator norms using covering nets with applications to quantum information theory

• Christopher Portmann, Christian Matt, Ueli Maurer, Renato Renner and Björn Tackmann. Quantum Boxes: A Framework for Modeling and Composing Quantum Reactive Systems

• Merger of:
  Huangjun Zhu. Discrete Wigner function and Clifford group
  and
  Zak Webb. The Clifford group forms a unitary 3-design

• Ning Bao, Sepehr Nezami, Hirosi Ooguri, Bogdan Stoica, James Sully and Michael Walter. The holographic entropy cone

• Fernando Pastawski, Beni Yoshida, Daniel Harlow and John Preskill. Holographic quantum error-correcting codes: toy models for the bulk/boundary correspondence

• Zhengfeng Ji. Classical Verification of Quantum Proofs

• Anthony Leverrier, Jean-Pierre Tillich and Gilles Zemor. Quantum Expander Codes

• Sergey Bravyi, Graeme Smith and John Smolin. Virtual Qubits from Classical Computation

• Andrew Cross, Ke Li and Graeme Smith. Additivity in Classical and Quantum Information Theory

• Omar Fawzi and Renato Renner. Quantum conditional mutual information and approximate Markov chains

• Rotem Arnon-Friedman, Christopher Portmann and Volkher Scholz. Quantum-proof multi-source randomness extractors in the Markov model

• Mike Mazurek, Matthew Pusey, Ravi Kunjwal, Kevin Resch and Robert Spekkens. Noncontextuality violation as a robust quantum resource

• Andrew Childs, Robin Kothari and Rolando Somma. Quantum linear systems algorithm with exponentially improved dependence on precision

• Sergey Bravyi and Andrew Cross. Doubled color codes

• Scott Aaronson, Shalev Ben-David and Robin Kothari. Separations in query complexity using cheat sheets
  (Recipient of the QIP 2016 Best Student Paper Prize)

• Michael Beverland, Gorjan Alagic, Jeongwan Haah, Gretchen Campbell, Ana Maria Rey and Alexey Gorshkov. Implementing a quantum algorithm for spectrum estimation with alkaline earth atoms

• Ke Li. Discriminating quantum states: the multiple Chernoff distance

• Anna Komar, Olivier Landon-Cardinal and Kristan Temme. An Energy Barrier is Necessary for the Thermal Stability of Stabilizer Quantum Memories

• Guillaume Aubrun and Szarek Stanislaw. Dvoretzky's theorem and the complexity of entanglement detection

• Adam Bouland, Laura Mančinska and Xue Zhang. Complexity classification of 2-qubit commuting hamiltonians

• Vadym Kliuchnikov, Alex Bocharov, Martin Roetteler and Jon Yard. A framework for qubit unitary synthesis

• Lior Eldar and Aram Harrow. Local Hamiltonians with No Low-energy Trivial States