The list of accepted talks for TQC 2019 ordered according to submission numbers is below.\u00a0<\/p>\n\n\n\n
5<\/strong> Gorjan Alagic, Tommaso Gagliardoni The list of accepted talks for TQC 2019 ordered according to submission numbers is below.\u00a0 5 Gorjan Alagic, Tommaso Gagliardoni and\u00a0Christian Majenz: Unforgeable Authentication and Signing of Quantum States.11 Andrew Childs,\u00a0Aaron Ostrander\u00a0and\u00a0Yuan Su: Faster quantum simulation by randomization merged with12 Andrew Childs\u00a0and\u00a0Yuan Su: Nearly optimal lattice simulation by product formulas.13 Xavier Coiteux-Roy and\u00a0Claude Cr\u00e9peau: The … Continue reading “Accepted Talks”<\/span><\/a><\/p>\n","protected":false},"author":2,"featured_media":0,"parent":0,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":{"_monsterinsights_skip_tracking":false,"_monsterinsights_sitenote_active":false,"_monsterinsights_sitenote_note":"","_monsterinsights_sitenote_category":0,"footnotes":""},"class_list":["post-235","page","type-page","status-publish","hentry"],"_links":{"self":[{"href":"https:\/\/www.tqcconference.org\/wp-json\/wp\/v2\/pages\/235","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.tqcconference.org\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/www.tqcconference.org\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/www.tqcconference.org\/wp-json\/wp\/v2\/users\/2"}],"replies":[{"embeddable":true,"href":"https:\/\/www.tqcconference.org\/wp-json\/wp\/v2\/comments?post=235"}],"version-history":[{"count":9,"href":"https:\/\/www.tqcconference.org\/wp-json\/wp\/v2\/pages\/235\/revisions"}],"predecessor-version":[{"id":446,"href":"https:\/\/www.tqcconference.org\/wp-json\/wp\/v2\/pages\/235\/revisions\/446"}],"wp:attachment":[{"href":"https:\/\/www.tqcconference.org\/wp-json\/wp\/v2\/media?parent=235"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}
11<\/strong> Andrew Childs,\u00a0Aaron Ostrander\u00a0
merged with<\/u>
12<\/strong> Andrew Childs\u00a0and\u00a0Yuan Su: Nearly optimal lattice simulation
13<\/strong> Xavier Coiteux-Roy and\u00a0Claude Cr\u00e9peau: The RGB No-Signalling Game<\/em>.
15<\/strong> Alex Bredariol Grilo:\u00a0 A simple protocol for verifiable delegation of quantum computation in one round.<\/em>
17<\/strong> Nilanjana Datta, Christoph Hirche and Andreas Winter: Convexity and Operational Interpretation of the Quantum Information Bottleneck Function<\/em>
18<\/strong> Alessandro Bisio and\u00a0Paolo Perinotti: Axiomatic theory of Higher-Order Quantum Computation.<\/em>
20<\/strong> Patricia Contreras Tejada, Carlos Palazuelos and Julio de Vicente: A resource theory of entanglement with a unique multipartite maximally entangled state.<\/em>
22<\/strong> Francois Le Gall, Harumichi Nishimura
24<\/strong> Kai DeLorenzo, Shelby Kimmel
26<\/strong> Tamara Kohler and Toby Cubitt: Toy Models of Holographic Duality between local Hamiltonians.<\/em>
30<\/strong> Gorjan Alagic, Stacey Jeffery, Maris Ozols
40<\/strong> Alvaro Alhambra and Mischa Woods: Continuous groups of transversal gates for quantum error correcting codes from finite clock reference frames<\/em>
merged with<\/u>
95\u00a0<\/strong>Philippe Faist, Sepehr Nezami,\u00a0Victor V. Albert,\u00a0Grant Salton, Fernando Pastawski,\u00a0Patrick Hayden\u00a0and\u00a0John Preskill:\u00a0Continuous symmetries and approximate quantum error correction.<\/em>
49<\/strong> Matthias Christandl, Angelo Lucia, P\u00e9ter Vrana
57<\/strong> David Gosset and John Smolin: A compressed classical description of quantum states.<\/em>
58<\/strong> Johannes Borregaard, Hannes Pichler, Tim Schr\u00f6der, Mikhail Lukin, Peter Lodahl and Anders S\u00f8rensen: One-way quantum repeater with minimal-resources.<\/em>
60<\/strong> Joel Wallman and\u00a0Steve Flammia: Efficient learning of Pauli channels.<\/em>
66<\/strong> Paul Boes, Henrik Wilming, Rodrigo Gallego and\u00a0Jens Eisert: Catalytic Quantum Randomness<\/em>
merged with<\/u>
68<\/strong> Paul Boes,\u00a0Jens Eisert, Rodrigo Gallego, Markus Mueller
84<\/strong> Toby Cubitt\u00a0and Carlos Gonzalez-Guillen: History-state Hamiltonians are critical.<\/em>
85<\/strong> Shalev Ben-David and\u00a0Robin Kothari: Quantum distinguishing complexity, zero-error algorithms, and statistical zero knowledge.<\/em>
89<\/strong> Nathan Wiebe,\u00a0Christopher Granade\u00a0
94<\/strong> Iman Marvian and Seth
98<\/strong> Andrew Childs,\u00a0Eddie Schoute\u00a0and Cem Unsal: Circuit Transformations for Quantum Architectures<\/em>
merged with<\/u>
101<\/strong> Ross Duncan, Alexander Cowtan, Silas Dilkes, Alexandre Krajenbrink, Will Simmons and Seyon Sivarajah: On the qubit routing problem.<\/em>
105<\/strong> Thomas Vidick\u00a0and Tina Zhang: Classical zero-knowledge arguments for quantum computations.<\/em>
106<\/strong> Guang Hao Low, Vadym Kliuchnikov and Luke Schaeffer: Trading T-gates for dirty qubits in state preparation and unitary synthesis.<\/em>
107<\/strong> Guanyu Zhu, Ali Lavasani and Maissam Barkeshli: Universal logical gate sets with constant-depth circuits for topological and hyperbolic quantum codes.<\/em>
110<\/strong> Arne Grimsmo, Joshua Combes and Ben Baragiola: Quantum computing with rotation-symmetric bosonic codes.<\/em>
116<\/strong> Bryan O’Gorman: Fine-grained parameterization of tensor network contraction<\/em>.
124<\/strong> Aditya Nema and\u00a0Pranab Sen: Approximate unitary n^{2\/3}-designs give rise to quantum channels with