Long Plenary Talks

• 93 | Matthew Hastings, Jeongwan Haah and Ryan O'Donnell. Fiber Bundle Codes: Breaking the N^{1/2} polylog(N) Barrier for Quantum LDPC Codes
• 176 | Alex Bredariol Grilo, Huijia Lin, Fang Song and Vinod Vaikuntanathan. Oblivious Transfer is in MiniQCrypt 
  merged with
  424 | James Bartusek, Andrea Coladangelo, Dakshita Khurana and Fermi Ma. One-Way Functions Imply Secure Computation in a Quantum World

Short Plenary Talks

• 58 | Anne Broadbent and Alex Bredariol Grilo. QMA-hardness of Consistency of Local Density Matrices with Applications to Quantum Zero-Knowledge
• 100 | Joonho Lee, Dominic Berry, Craig Gidney, William Huggins, Jarrod McClean, Nathan Wiebe and Ryan Babbush. Efficient quantum computation of chemistry through tensor hypercontraction
• 163 | Pablo Bonilla Ataides, David Tuckett, Stephen Bartlett, Steven Flammia and Benjamin Brown. The XZZX surface code
• 270 | Scott Aaronson, Shalev Ben-David, Robin Kothari, Shravas Rao and Avishay Tal. Degree vs. Approximate Degree and Quantum Implications of Huang’s Sensitivity Theorem
• 279 | Peter Brown, Hamza Fawzi and Omar Fawzi. New quantum Rényi divergences and their application to device-independent cryptography and quantum Shannon theory
• 301 | Gorjan Alagic, Prabhanjan Ananth, Zvika Brakerski, Yfke Dulek, Rolando La Placa and Christian Schaffner. Secure Software Leasing and Implications for Quantum Copy-Protection and Obfuscation
• 319 | Laura Mančinska and David Roberson. Quantum isomorphism is equivalent to equal homomorphism counts from planar graphs
• 377 | John Napp, Rolando La Placa, Alexander Dalzell, Fernando Brandão and Aram Harrow. Efficient classical simulation of random shallow 2D quantum circuits
• 380 | Matthew B. Hastings, Umesh Vazirani and András Gilyén. (Sub)Exponential advantage of adiabatic quantum computation with no sign problem

Contributed Talks

• 6 | Kyungjoo Noh, Stefano Pirandola and Liang Jiang. Enhanced energy-constrained quantum communication over bosonic Gaussian channels using multi-channel strategies
• 7 | Giacomo De Palma, Milad Marvian, Dario Trevisan and Seth Lloyd. The quantum Wasserstein distance of order 1
• 23 | Bowen Shi, Kohtaro Kato and Isaac Kim. Entanglement bootstrap program
• 32 | Anurag Anshu and Chinmay Nirkhe. Circuit lower bounds for low-energy states of quantum code Hamiltonians
• 35 | Tomotaka Kuwahara, Alvaro Alhambra and Anurag Anshu. Improved thermal area law and quasi-linear time algorithm for quantum Gibbs states
• 39 | Srinivasan Arunachalam, Alex B. Grilo, Tom Gur, Igor C. Oliveira and Aarthi Sundaram. Quantum learning algorithms imply circuit lower bounds
• 44 | Chenyi Zhang, Jiaqi Leng and Tongyang Li. Quantum Algorithms for Escaping from Saddle Points
• 45 | Mirjam Weilenmann, Edgar A. Aguilar and Miguel Navascués. Quantum Preparation Games
• 51 | Yuxiang Yang, Renato Renner and Giulio Chiribella. Optimal universal programming of unitary gates
• 52 | Guang Hao Low, Vera von Burg, Thomas Haner, Damian Steiger, Markus Reiher, Martin Roetteler and Matthias Troyer. Quantum computing enhanced computational catalysis
• 54 | Anurag Anshu, Srinivasan Arunachalam, Tomotaka Kuwahara and Mehdi Soleimanifar. Sample-efficient learning of quantum many-body systems
• 56 | Anurag Anshu, Aram Harrow and Mehdi Soleimanifar. From communication complexity to an entanglement spread area law in the ground state of gapped local Hamiltonians
• 61 | Atul Singh Arora, Jérémie Roland and Chrysoula Vlachou. Analytic quantum weak coin flipping protocols with arbitrarily small bias
• 70 | Makrand Sinha and Nikhil Bansal. $k$-Forrelation Optimally Separates Quantum and Classical Query Complexity
• 89 | Lin Lin and Yu Tong. Near-optimal ground state preparation
• 90 | Edward Farhi, Jeffrey Goldstone, Sam Gutmann and Leo Zhou. The Quantum Approximate Optimization Algorithm and the Sherrington-Kirkpatrick Model at Infinite Size
• 91 | Oscar Higgott and Nikolas Breuckmann. Subsystem codes with high thresholds by gauge fixing and reduced qubit overhead
• 104 | Shalev Ben-David, Andrew M. Childs, András Gilyén, William Kretschmer, Supartha Podder and Daochen Wang. Symmetries, graph properties, and quantum speedups
• 114 | Alex Bredariol Grilo, Kathrin Hövelmanns, Andreas Hülsing and Christian Majenz. Tight adaptive reprogramming in the QROM
• 116 | David Gosset, Daniel Grier, Alex Kerzner and Luke Schaeffer. Fast simulation of planar Clifford circuits
• 117 | Satvik Singh and Ion Nechita. The PPT square conjecture holds for all Choi-type maps
• 124 | Dmitri Maslov, Jin-Sung Kim, Sergey Bravyi, Theodore J. Yoder and Sarah Sheldon. Quantum advantage for computations with limited space
• 127 | Adam Bene Watts and J. William Helton. 3XOR Games with Perfect Commuting Operator Strategies Have Perfect Tensor Product Strategies and are Decidable in Polynomial Time
• 131 | Zvika Brakerski and Henry Yuen. Quantum Garbled Circuits
• 132 | Cambyse Rouzé, Ivan Bardet, Ángela Capel and Daniel Stilck França. On the entropic convergence of quantum Gibbs samplers
• 133 | Simon Becker, Nilanjana Datta, Ludovico Lami and Cambyse Rouzé. Energy-constrained discrimination of unitaries, quantum speed limits and a Gaussian Solovay-Kitaev theorem
• 142 | Harry Buhrman, Noah Linden, Laura Mančinska, Ashley Montanaro and Maris Ozols. Quantum majority and other Boolean functions with quantum inputs
• 145 | Gergely Bunth, Christopher Perry, Péter Vrana and Albert H. Werner. The semiring of dichotomies and asymptotic relative submajorization
• 148 | Pierre Fraigniaud, Francois Le Gall, Harumichi Nishimura and Ami Paz. Distributed Quantum Proofs for Replicated Data
• 152 | Amit Behera and Or Sattath. Almost Public Quantum Coins
• 159 | Kianna Wan, Soonwon Choi, Isaac Kim, Noah Shutty and Patrick Hayden. Fault-tolerant qubit from a constant number of components
• 164 | Matthew Coudron and Nolan Coble. Computing output weights of constant-depth, geometrically-local quantum circuits with polynomial additive error
• 169 | Aleksander Kubica and Rafał Demkowicz-Dobrzański. Using Quantum Metrological Bounds in Quantum Error Correction: A Simple Proof of the Approximate Eastin-Knill Theorem
• 182 | Simon Apers, Troy Lee and Ronald de Wolf. Quantum speedups for graph sparsification, graph cut problems and Laplacian solving
• 195 | Laura Mančinska, Jitendra Prakash and Christopher Schafhauser. Constant-sized robust self-tests for states and measurements of unbounded dimension
• 203 | Daniel Stilck França and Raul Garcia-Patron. Limitations of optimization algorithms on noisy quantum devices
• 212 | Benjamin Yadin, Benjamin Morris and Gerardo Adesso. Mixing indistinguishable systems leads to a quantum Gibbs paradox
• 214 | Jonas Haferkamp, Felipe Montealegre-Mora, Markus Heinrich, Jens Eisert, David Gross and Ingo Roth. Efficient unitary designs with a system-size independent number of non-Clifford gates
• 220 | Zuzana Gavorova, Matan Seidel and Yonathan Touati. Topological obstructions to implementing controlled unknown unitaries
• 233 | Alexander Müller-Hermes and Matthias Christandl. Fault-tolerant Coding for Quantum Communication
• 238 | Michal Oszmaniec, Adam Sawicki and Michal Horodecki. Epsilon-nets, unitary designs and random quantum circuits
• 245 | Adam Bouland, Bill Fefferman, Zeph Landau and Yunchao Liu. Noise and the frontier of quantum supremacy
• 250 | Tony Metger, Yfke Dulek, Andrea Coladangelo, Rotem Arnon-Friedman and Thomas Vidick. Device-independent protocols from computational assumptions
• 253 | Burak Sahinoglu and Rolando Somma. Hamiltonian Simulation in the low energy subspace
• 258 | Joel Klassen and Charles Derby. A Compact Fermion to Qubit Mapping
• 266 | Arne Heimendahl, Markus Heinrich and David Gross. The axiomatic and the operational approach to resource theories of magic do not coincide
• 271 | Noah Shutty, Mary Wootters and Patrick Hayden, Tight Limits on Nonlocality from Nontrivial Communication Complexity
• 274 | William Kirby, Andrew Tranter and Peter Love. Exploiting Contextuality in Variational Quantum Eigensolvers
• 284 | Jintai Ding, Vlad Gheorghiu, András Gilyén, Sean Hallgren and Jianqiang Li. Limitations of the Macaulay matrix approach for using the HHL algorithm to solve multivariate polynomial systems
• 289 | Ankit Garg, Robin Kothari, Praneeth Netrapalli and Suhail Sherif. No quantum speedup over gradient descent for non-smooth convex optimization
• 291 | Dorit Aharonov, Jordan Cotler and Xiao-Liang Qi. Quantum Algorithmic Measurement
• 298 | Isaac Kim, Eugene Tang and John Preskill. The ghost in the radiation: Robust encodings of the black hole interior
• 306 | Michael Gullans, Stefan Krastanov, David Huse, Liang Jiang and Steven Flammia. Quantum coding with low-depth random circuits
• 315 | William Kretschmer. The Quantum Supremacy Tsirelson Inequality
• 323 | Philippe Faist, Mischa Woods, Victor V. Albert, Joseph M. Renes, Jens Eisert and John Preskill. Bipartite energy-time uncertainty relation for quantum metrology with noise
• 326 | Piotr Kopszak, Marek Mozrzymas, Michal Studzinski and Michal Horodecki. Multi-port teleportation schemes
• 327 | Piotr Czarnik, Andrew Arrasmith, Patrick Coles and Lukasz Cincio. Error mitigation with Clifford quantum-circuit data
• 328 | Adrian Chapman and Steven Flammia. Characterization of solvable spin models via graph invariants
• 334 | Alexis Schotte, Guanyu Zhu, Lander Burgelman and Frank Verstraete. Quantum error correction thresholds for the universal Fibonacci Turaev-Viro code
• 342 | Alexander Sherstov, Andrey Storozhenko and Pei Wu. An Optimal Separation of Randomized and Quantum Query Complexity
• 352 | Leo Zhou and Dorit Aharonov. Strongly Universal Hamiltonian Simulators
• 359 | Vikesh Siddhu. Leaking information to gain entanglement via log-singularities
• 362 | Yuan Su, Hsin-Yuan Huang and Earl Campbell. Nearly tight Trotterization of correlated electrons
• 363 | Minh Tran, Abhinav Deshpande, Andrew Guo, Andrew Lucas and Alexey Gorshkov. Optimal State Transfer and Entanglement Generation in Power-law Interacting Systems
• 365 | Michael Beverland, Aleksander Kubica and Krysta M. Svore. The cost of universality: A comparative study of the overhead of state distillation and code switching with color codes
• 369 |Sisi Zhou and Liang Jiang. Asymptotic theory of quantum channel estimation
• 374 | Ramis Movassagh and Yingkai Ouyang. Constructing quantum codes from {\it any} classical code and their embedding in ground space of local Hamiltonians
• 378 | Justin Holmgren and Ran Raz. A Parallel Repetition Theorem for the GHZ game
• 379 | Yuval Sanders, Dominic Berry, Pedro Costa, Louis Tessler, Nathan Wiebe, Craig Gidney, Hartmut Neven and Ryan Babbush. Compilation of Fault-Tolerant Quantum Heuristics for Combinatorial Optimization
• 381 | Hsin-Yuan Huang, Richard Kueng, Michael Broughton, Masoud Mohseni, Ryan Babbush, Sergio Boixo, Hartmut Neven, Jarrod McClean and John Preskill. Fundamental aspects of solving quantum problems with machine learning
• 384 | James Bartusek, Andrea Coladangelo, Dakshita Khurana and Fermi Ma. On The Round Complexity of Two-Party Quantum Computation
• 386 | Sara Bartolucci, Patrick Birchall, Hector Bombin, Hugo Cable, Chris Dawson, Mercedes Gimeno-Segovia, Eric Johnston, Konrad Kieling, Naomi Nickerson, Mihir Pant, Fernando Pastawski, Terry Rudolph and Chris Sparrow. Fusion based quantum computation
• 387 | Marius Junge and Nicholas Laracuente. Multivariate Trace Inequalities, Recovery, and p-Fidelity Beyond Tracial Settings
• 390 | Sam Roberts and Dominic Williamson. 3-Fermion topological quantum computation
• 392 | Abhinav Deshpande, Alexey Gorshkov and Bill Fefferman. The importance of the spectral gap in estimating ground-state energies
• 394 | David Aasen, Daniel Bulmash, Abhinav Prem, Kevin Slagle and Dominic Williamson. Topological Defect Networks for Fractons of all Types
• 397 | Daniel Ranard, Freek Witteveen and Michael Walter. Classifying unitary dynamics with approximate light cones in one dimension
• 401 | Daniel Ranard and Xiao-Liang Qi. Emergent classicality in general multipartite states and channels
• 402 | Nathan Ju, Daniel Grier and Luke Schaeffer. Interactive quantum advantage with noisy, shallow Clifford circuits
• 408 | Hakop Pashayan, Oliver Reardon-Smith, Kamil Korzekwa and Stephen Bartlett. Fast estimation of outcome probabilities for quantum circuits
• 410 | Alexander Dalzell, Nicholas Hunter-Jones and Fernando Brandao. Random quantum circuits anti-concentrate in log depth
• 420 | Greg Kuperberg. The hidden subgroup problem for infinite groups
• 429 | Honghao Fu, Carl Miller and William Slofstra. The membership problem for constant-sized quantum correlations is undecidable
• 431 | Guillaume Aubrun, Ludovico Lami, Carlos Palazuelos and Martin Plávala. Entangleability of cones
• 441 | Tanmay Singal, Filip Maciejewski and Michał Oszmaniec. Implementation of quantum measurements using classical resources and only a single ancillary qubit
• 447 | Dante Bencivenga, Xining Chen and Peter Høyer. Quantum sampling in Markov chains
• 469 | Anurag Anshu, Shalev Ben-David and Srijita Kundu. On Query-to-Communication Lifting for Quantum Adversaries

Merged contributed talks

• 73 | Kun Fang and Zi-Wen Liu. No-go theorems for quantum resource purification
  merged with
  201 | Bartosz Regula and Ryuji Takagi. Fundamental limitations on quantum channel manipulation
• 75 | Ashley Montanaro and Changpeng Shao. Quantum algorithms for learning graphs and beyond
  merged with
  155 | Troy Lee, Miklos Santha and Shengyu Zhang. Quantum algorithms for graph problems with cut queries
• 84 | Bill Fefferman and Zachary Remscrim. Eliminating Intermediate Measurements in Space-Bounded Quantum Computation
  merged with
  156 | Uma Girish, Ran Raz and Wei Zhan. Quantum Logspace Algorithm for Powering Matrices with Bounded Norm
• 162 | Andrea Coladangelo, Christian Majenz and Alexander Poremba. Quantum Copy-Protection of Compute-and-Compare Programs in the Quantum Random Oracle Model
  merged with
  389 | Anne Broadbent, Stacey Jeffery, Sébastien Lord, Supartha Podder and Aarthi Sundaram. Secure Software Leasing Without Assumptions
• 211 | Gorjan Alagic, Andrew Childs, Andrea Coladangelo, Alex Bredariol Grilo, Shih-Han Hung, Thomas Vidick and Tina Zhang. Non-interactive zero-knowledge protocols for QMA
  merged with
  286 | Nir Bitansky and Omri Shmueli. Post-quantum Zero Knowledge in Constant Rounds
• 307 | Srijita Kundu and Ernest Y.-Z. Tan. Composably secure device-independent encryption with certified deletion
  merged with
  360 | Anne Broadbent and Rabib Islam. Quantum encryption with certified deletion