Program Details

All conference talks will take place in the Calvert Ballroom (Salons AB), located on the second floor of The Hotel@UMD.

Invited talks are 40min plus 5min for questions. Merged talks are 30 min and other talks are 25 min (inclusive of questions). This year TQC has instituted an Outstanding Paper Award which has a longer talk duration of 35min plus 5min for questions.

Invited Talks

  • Monday, Jun 3: Ewin Tang (University of Washington, Seattle), Building a classical framework to analyze quantum machine learning speedups
  • Tuesday, Jun 4: Ken Brown (Duke University), Error Reduction, Fault Tolerance, and Scalability
  • Wednesday, Jun 5 (Morning): David Gosset (University of Waterloo), TBA
  • Wednesday, Jun 5 (Afternoon): András Gilyén (CWI, Amsterdam), Quantum Singular Value Transformation & its algorithmic applications

Contributed talks

The full list of accepted talks can be found here.

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

Poster Session

The poster session will take place on Monday, June 3, 17:15-19:15 in Foyer A outside the Calvert Ballroom.

The available space on the poster boards for each poster would be 4ft x 4ft (122 cm x 122 cm) . Each presenter will be assigned a spot based on the submission number.

Printing posters in College Park:

NISQ Invited Talks

The workshop will be held  June 6-7, 2019 in the Antonov Auditorium of the Iribe Center in the university. Each invited talk will be 45min (inclusive of questions). The tentative talk schedule is updated in the timetable (see top of page). The speakers (listed in order of their talks) are: 

Thursday
  • Chris Monroe (IonQ)
  • Paola Cappellaro (MIT)
  • Lorenza Viola (Dartmouth College)
  • John Preskill (Caltech)
  • Dave Bacon (Google)
Friday
  • Mikhail Lukin (Harvard University)
  • Hanhee Paik (IBM)
  • Peter Zoller (University of Innsbruck)
  • Krysta Svore (Microsoft)
  • David Gosset (University of Waterloo)
  • Elizabeth Crosson (University of New Mexico)
  • Ashley Montanaro (University of Bristol)

NISQ Poster Session

The NISQ Poster Session is scheduled for Thursday, June 6, 16:00-18:00 in the Iribe Center.

The current list of accepted posters can be found here.

The available space on the poster boards for each poster would be 4ft x 4ft (122 cm x 122 cm) . Each presenter will be assigned a spot based on the submission number.

Printing posters in College Park: