Programme scientifique (Sujet à changement)
Lundi 12 Décembre
08:15 | Enregistrement |
09:00 | Accueil & discours d'ouverture |
9:15 |
Sergey Bravyi (plénier): Topological qubits: stability against thermal noise abstrait | |
10:10 |
Omar Fawzi, Patrick Hayden, Ivan Savov, Pranab Sen and Mark Wilde (long): Advances in classical communication for network quantum information theory abstrait | papier |
10:40 | Pause |
11:05 |
Nilanjana Datta, Min-Hsiu Hsieh and Mark Wilde (court): Quantum rate distortion, reverse Shannon theorems, and source-channel separation abstrait | arXiv: 1108.4940 |
11:30 |
Graeme Smith, John A. Smolin and Jon Yard (court): Quantum communication with gaussian channels of zero quantum capacity abstrait | papier |
11:55 |
Nengkun Yu, Runyao Duan and Quanhua Xu (court): Bounds on the distance between a unital quantum channel and the convex hull of unitary channels, with applications to the asymptotic quantum Birkhoff conjecture abstrait | papier |
12:15 | Pause dîner |
14:00 |
Markus Greiner (Plénier): Quantum Magnetism with Ultracold Atoms - A Microscopic View of Artificial Quantum Matter |
14:55 |
André Chailloux and Iordanis Kerenidis (long): Optimal Bounds for Quantum Bit Commitment abstrait | arXiv: 1102.1678 |
15:25 | Pause |
15:50 |
Gilles Brassard, Peter Høyer, Kassem Kalach, Marc Kaplan, Sophie Laplante and Louis Salvail (long): Merkle Puzzles in a Quantum World abstrait | papier |
16:25 |
Salman Beigi and Robert Koenig (court): Simplified instantaneous non-local quantum computation with applications to position-based cryptography abstrait | arXiv: 1101.1065 |
16:50 |
Harry Buhrman, Serge Fehr, Christian Schaffner and Florian Speelman (court): The Garden-Hose Game and Application to Position-Based Quantum Cryptography abstrait | papier |
17:15 | Poster #1 |
Mardi 13 Décembre
09:00 |
Itai Arad, Zeph Landau and Umesh Vazirani (plénier): An improved area law for 1D frustration-free systems abstrait | papier |
9:55 |
Spyridon Michalakis and Justyna Pytel (court): Stability of Frustration-Free Hamiltonians abstrait | papier |
10:15 | Pause |
10:40 |
Toby Cubitt, Martin Schwarz, Frank Verstraete, Or Sattath and Itai Arad (court): Three Proofs of a Constructive Commuting Quantum Lovasz Local Lemma abstrait | papier |
11:05 |
Norbert Schuch (contributed talk): Complexity of commuting Hamiltonians on a square lattice of qubits abstrait | arXiv: 1105.2843 |
11:30 |
Josh Cadney, Noah Linden and Andreas Winter (court): Infinitely many constrained inequalities for the von Neumann entropy abstrait | arXiv: 1107.0624 |
11:50 | Pause dîner |
14:00 |
Jeongwan Haah (Plénier): Local stabilizer codes in three dimensions without string logical operators abstrait | arXiv: 1101.1962 |
14:55 |
Andrew Landahl, Jonas Anderson and Patrick Rice (court): Fault-tolerant quantum computing with color codes abstrait | arXiv: 1108.5738 |
15:15 | Pause |
15:40 |
Guillaume Duclos-Cianci, Héctor Bombin and David Poulin (long): Equivalence of Topological Codes and Fast Decoding Algorithms abstrait | arXiv: 1103.4606 |
16:15 |
Joseph M. Renes, Frederic Dupuis and Renato Renner (court): Quantum Polar Coding abstrait | papier |
16:40 |
Sergey Bravyi and Robert Koenig (long): Disorder-assisted error correction in Majorana chains abstrait | arXiv: 1108.3845 |
17:15 | Poster #2 |
Mercredi 14 Décembre
09:00 |
Troy Lee and Jérémie Roland (long): A strong direct product theorem for quantum query complexity abstrait | arXiv: 1104.4468 |
9:35 |
André Chailloux and Or Sattath (court): The Complexity of the Separable Hamiltonian Problem abstrait | papier: lien externe |
10:00 |
Yaoyun Shi and Xiaodi Wu (court): Epsilon-net method for optimizations over separable states abstrait | papier: lien externe |
10:20 | Pause |
10:45 |
Abel Molina and John Watrous (court): Hedging bets with correlated quantum strategies abstrait | arXiv: 1104.1140 |
11:10 |
Jop Briet and Thomas Vidick (court): Explicit lower and upper bounds on the entangled value of multiplayer XOR games abstrait | papier |
11:35 |
Gus Gutoski and Xiaodi Wu (long): Parallel approximation of min-max problems with applications to classical and quantum zero-sum games abstrait | arXiv: 1011.2787 |
12:05 | Pause Dîner |
19:00 |
Souper de la conférence Marché Bonsecours |
Jeudi 15 Décembre
09:00 |
Aleksandrs Belovs (plénier): Span Programs for Functions with Constant-Sized 1-certificates abstrait | arXiv: 1105.4024 |
9:55 |
Francois Le Gall (court): Improved Output-Sensitive Quantum Algorithms for Boolean Matrix Multiplication abstrait | papier |
10:20 |
Dominic Berry, Richard Cleve and Sevag Gharibian (court): Discrete simulations of continuous-time query algorithms that are efficient with respect to queries, gates and space abstrait | papier |
10:40 | Pause |
11:05 |
Thomas Decker, Gábor Ivanyos, Miklos Santha and Pawel Wocjan (court): Hidden Symmetry Subgroup Problems abstrait | papier |
11:30 |
Rahul Jain and Nayak Ashwin (court): A quantum information cost trade-off for the Augmented Index abstrait | papier: lien externe |
11:55 |
Sevag Gharibian and Julia Kempe (court): Hardness of approximation for quantum problems abstrait | papier: lien externe |
12:15 | Pause Dîner |
14:00 |
Jérémie Roland (plénier, basé sur travail conjoint avec
Maris Ozols et Martin Roetteler): Quantum rejection sampling abstrait | arXiv: 1103.2774 |
14:55 |
Rolando Somma and Sergio Boixo (court): Spectral Gap Amplification abstrait | papier |
15:15 | Pause |
15:40 |
Troy Lee, Rajat Mittal, Ben Reichardt, Robert Spalek and Mario Szegedy (long): Quantum query complexity for state conversion abstrait | papier |
16:15 |
Fernando Brandao, Aram Harrow and Michal Horodecki (long): Local random quantum circuits are approximate polynomial-designs abstrait | papier |
16:45 | Business Meeting... |
19:00 |
Rump Session UdeM (K500) |