Accepted Talks

The list of accepted talks for TQC 2019 ordered according to submission numbers is below. 

5 Gorjan Alagic, Tommaso Gagliardoni and Christian Majenz: Unforgeable Authentication and Signing of Quantum States.
11 Andrew Childs, Aaron Ostrander and Yuan Su: Faster quantum simulation by randomization
merged with
12 Andrew Childs and Yuan Su: Nearly optimal lattice simulation by product formulas.
13 Xavier Coiteux-Roy and Claude Crépeau: The RGB No-Signalling Game.
15 Alex Bredariol Grilo:  A simple protocol for verifiable delegation of quantum computation in one round.
17 Nilanjana Datta, Christoph Hirche and Andreas Winter: Convexity and Operational Interpretation of the Quantum Information Bottleneck Function
18 Alessandro Bisio and Paolo Perinotti: Axiomatic theory of Higher-Order Quantum Computation.
20 Patricia Contreras Tejada, Carlos Palazuelos and Julio de Vicente: A resource theory of entanglement with a unique multipartite maximally entangled state.
22 Francois Le Gall, Harumichi Nishimura and Ansis Rosmanis: Quantum Advantage for the LOCAL Model in Distributed Computing.
24 Kai DeLorenzo, Shelby Kimmel and Raylen Witter: Applications of the quantum algorithm for st-connectivity.
26 Tamara Kohler and Toby Cubitt: Toy Models of Holographic Duality between local Hamiltonians.
30 Gorjan Alagic, Stacey Jeffery, Maris Ozols and Alexander Poremba: On Quantum Chosen-Ciphertext Attacks and Learning with Errors.
40 Alvaro Alhambra and Mischa Woods: Continuous groups of transversal gates for quantum error correcting codes from finite clock reference frames
merged with
95 Philippe Faist, Sepehr Nezami, Victor V. Albert, Grant Salton, Fernando Pastawski, Patrick Hayden and John Preskill: Continuous symmetries and approximate quantum error correction.
49 Matthias Christandl, Angelo Lucia, Péter Vrana and Albert H. Werner: Tensor network representations from the geometry of entangled states.
57 David Gosset and John Smolin: A compressed classical description of quantum states.
58 Johannes Borregaard, Hannes Pichler, Tim Schröder, Mikhail Lukin, Peter Lodahl and Anders Sørensen: One-way quantum repeater with minimal-resources.
60 Joel Wallman and Steve Flammia: Efficient learning of Pauli channels.
66 Paul Boes, Henrik Wilming, Rodrigo Gallego and Jens Eisert: Catalytic Quantum Randomness
merged with
68 Paul Boes, Jens Eisert, Rodrigo Gallego, Markus Mueller and Henrik Wilming: Von Neumann entropy from unitarity.
84 Toby Cubitt and Carlos Gonzalez-Guillen: History-state Hamiltonians are critical.
85 Shalev Ben-David and Robin Kothari: Quantum distinguishing complexity, zero-error algorithms, and statistical zero knowledge.
89 Nathan Wiebe, Christopher Granade and John Gamble: Bayesian ACRONYM Tuning.
94 Iman Marvian and Seth Lloyd : Universal Quantum Emulator.
98 Andrew Childs, Eddie Schoute and Cem Unsal: Circuit Transformations for Quantum Architectures
merged with
101 Ross Duncan, Alexander Cowtan, Silas Dilkes, Alexandre Krajenbrink, Will Simmons and Seyon Sivarajah: On the qubit routing problem.
105 Thomas Vidick and Tina Zhang: Classical zero-knowledge arguments for quantum computations.
106 Guang Hao Low, Vadym Kliuchnikov and Luke Schaeffer: Trading T-gates for dirty qubits in state preparation and unitary synthesis.
107 Guanyu Zhu, Ali Lavasani and Maissam Barkeshli: Universal logical gate sets with constant-depth circuits for topological and hyperbolic quantum codes.
110 Arne Grimsmo, Joshua Combes and Ben Baragiola: Quantum computing with rotation-symmetric bosonic codes.
116 Bryan O’Gorman: Fine-grained parameterization of tensor network contraction.
124 Aditya Nema and Pranab Sen: Approximate unitary n^{2/3}-designs give rise to quantum channels with super additive classical capacity.