Accepted talks

I. Talks without proceedings

  1. Maximal device-independent randomness in every dimension
    • Máté Farkas (University of York), Jurij Volčič (University of Auckland), Sigurd A. L. Storgaard (University of Copenhagen), Ranyiliu Chen (University of Copenhagen), Laura Mančinska (University of Copenhagen)
  2. A Unified Theory of Quantum Neural Network Loss Landscapes
    • Eric R. Anschuetz (Caltech)
  3. Directed st-connectivity with few paths is in quantum logspace
    • Roman Edenhofer (Université Paris Cité, IRIF), Simon Apers (Université Paris Cité, CNRS, IRIF)
  4. The Clifford hierarchy for one qubit or qudit
    • Nadish de Silva (Simon Fraser University), Oscar Lautsch (Simon Fraser University)
  5. Commuting Local Hamiltonians Beyond 2D
    • John Bostanci (Columbia University), Yeongwoo Hwang (Harvard University)
  6. Online learning of quantum processes
    • Asad Raza (Freie Universität Berlin), Matthias C. Caro (University of Warwick), Jens Eisert (Freie Universität Berlin), Sumeet Khatri (Virginia Tech)
  7. Phase error rate estimation in QKD with imperfect detectors
    • Devashish Tupkary (University of Waterloo), Shlok Nahar (University of Waterloo), Pulkit Sinha (University of Waterloo), Norbert Lutkenhaus (University of Waterloo)
  8. Rise of conditionally clean ancillae for efficient quantum circuit constructions
    • Tanuj Khattar (Google Quantum AI), Craig Gidney (Google Quantum AI)
  9. Unitary Designs from Random Symmetric Quantum Circuits
    • Hanqing Liu (TBD), Austin Hulse (Duke University), Iman Marvian (Duke University)
  10. Polynomial Time Quantum Gibbs Sampling for Fermi-Hubbard model at any Temperature
    • Štěpán Šmíd (Imperial College London), Richard Meister (Imperial College London), Mario Berta (RWTH Aachen University), Roberto Bondesan (Imperial College London)
  11. Optimal Hamiltonian simulation for low-energy states
    • Rolando Somma (Google), Alexander Zlokapa (MIT)
  12. Simulating chaos without chaos
    • Andi Gu (Harvard University), Yihui Quek (MIT), Susanne Yelin (Harvard University), Jens Eisert (Freie Universität Berlin), Lorenzo Leone (Freie Universität Berlin)
  13. Quantum Spin Chains and Symmetric Functions
    • Marcos Crichigno (Phasecraft US), Anupam Prakash (JPM Quantum)
  14. The complexity of Gottesman-Kitaev-Preskill states
    • Lukas Brenner (Technical University of Munich), Libor Caha (Technical University of Munich), Xavier Coiteux-Roy (University of Calgary), Robert Koenig (Technical University of Munich)
  15. Unitary Designs of Symmetric Local Random Circuits
    • Yosuke Mitsuhashi (RIKEN), Ryotaro Suzuki (Freie Universität Berlin), Tomohiro Soejima (Harvard University), Nobuyuki Yoshioka (University of Tokyo)
  16. Asymptotic robustness of entanglement in noisy quantum networks and graph connectivity
    • Fernando Lledó (Universidad Carlos III de Madrid & ICMAT), Carlos Palazuelos (Universidad Complutense de Madrid & ICMAT), Julio de Vicente (Universidad Carlos III de Madrid & ICMAT)
  17. A Hierarchy of Spectral Gap Certificates for Frustration-Free Spin Systems
    • Kshiti Sneh Rai (Leiden University), Ilya Kull (University of Vienna), Patrick Emonts (Leiden University), Jordi Tura (Leiden University), Norbert Schuch (University of Vienna), Flavio Baccari (University of Padova)
  18. Adaptive Channel Reshaping for Improved Entanglement Distillation
    • Dina Abdelhadi (EPFL), Tomas Jochym-O’Connor (IBM Quantum), Vikesh Siddhu (IBM Quantum), John Smolin (IBM Quantum)
  19. RE-completeness of entangled constraint satisfaction problems
    • Eric Culf (University of Waterloo), Kieran Mastel (University of Waterloo)
  20. Quantum Purity Amplification: Optimality and Efficient Algorithm
    • Zhaoyi Li (MIT), Honghao Fu (Concordia University), Takuya Isogawa (MIT), Isaac Chuang (MIT)
  21. PKE and ABE with Collusion-Resistant Secure Key Leasing
    • Fuyuki Kitagawa (NTT Social Informatics Laboratories), Ryo Nishimaki (NTT Social Informatics Laboratories), Nikhil Pappu (Portland State University)
  22. Time-dependent Hamiltonian Simulation via Magnus Expansion: Algorithms and Discrete Superconvergence for unbounded Hamiltonians
    • Di Fang (Duke University), Yonah Borns-Weil (UC Berkeley), Diyi Liu (University of Minnesota), Rahul Sarkar (UC Berkeley), Jiaqi Zhang (Duke University)
  23. Bounding the computational power of bosonic systems
    • Varun Upreti (Ecole Normale Supérieure), Ulysse Chabaud (Ecole Normale Supérieure)
  24. Quantum Algorithm for Reversing Unknown Unitary Evolutions
    • Yu-Ao Chen (HKUST), Yin Mo (HKUST), Yingjian Liu (HKUST), Lei Zhang (HKUST), Xin Wang (HKUST)
  25. Testing classical properties from quantum data
    • Matthias C. Caro (University of Warwick), Preksha Naik (Caltech), Joseph Slote (Caltech)
  26. Chasing shadows with Gottesman-Kitaev-Preskill codes
    • Jonathan Conrad (EPFL), Jens Eisert (Freie Universität Berlin), Steven T. Flammia (Virginia Tech)
  27. Full classification of Pauli Lie algebras
    • Gerard Aguilar Tapia (FU Berlin), Simon Cichy (FU Berlin), Jens Eisert (FU Berlin), Lennart Bittel (FU Berlin)
  28. Composably Secure Delegated Quantum Computation with Weak Coherent Pulses
    • Maxime Garnier (INRIA Paris), Dominik Leichtle (University of Edinburgh), Luka Music (Quandela), Harold Ollivier (INRIA Paris)
  29. Quantum position verification in one shot: parallel repetition of the f-BB84 and f-routing protocols
    • Llorenc Escola Farras (QuSoft/University of Amsterdam), Florian Speelman (QuSoft/University of Amsterdam)
  30. A full practical theory of the Clifford group commutant
    • Lennart Bittel (Freie Universität Berlin), Jens Eisert (Freie Universität Berlin), Lorenzo Leone (Freie Universität Berlin), Antonio Anna Mele (Freie Universität Berlin), Salvatore Oliviero (Scuola Normale Superiore)
  31. Tesseract: A Search-Based Decoder for Quantum Error Correction
    • Laleh Aghabaie Beni (Google Quantum AI), Oscar Higgott (Google Quantum AI), Noah Shutty (Google Quantum AI)
  32. Commitments are equivalent to statistically-verifiable one-way state generators
    • Rishabh Batra (NUS), Rahul Jain (NUS)
  33. Untelegraphable Encryption and its Applications
    • Jeffrey Champion (UT Austin), Fuyuki Kitagawa (NTT Social Informatics Laboratories), Ryo Nishimaki (NTT Social Informatics Laboratories), Takashi Yamakawa (NTT Social Informatics Laboratories)
  34. A Meta-Complexity Characterization of Quantum Cryptography
    • Bruno Cavalar (University of Oxford), Eli Goldin (NYU), Matthew Gray (University of Oxford), Peter Hall (NYU), Taiga Hiroka (Kyoto University), Tomoyuki Morimae (Kyoto University)
  35. Testing and Learning structured quantum Hamiltonians
    • Srinivasan Arunachalam (IBM), Arkopal Dutt (IBM), Francisco Escudero Gutiérrez (CWI & QuSoft)
  36. Copy-Protecting Puncturable Functionalities, Revisited
    • Prabhanjan Ananth (UC Santa Barbara), Amit Behera (Ben-Gurion University), Zikuan Huang (Tsinghua University)
  37. Additivity and chain rules for quantum entropies via multi-index Schatten norms
    • Omar Fawzi (ENS Lyon), Jan Kochanowski (INRIA), Cambyse Rouzé (INRIA), Thomas van Himbeeck (INRIA)
  38. Factoring an integer with three oscillators and a qubit
    • Lukas Brenner (Technical University of Munich), Libor Caha (Technical University of Munich), Xavier Coiteux-Roy (University of Calgary), Robert Koenig (Technical University of Munich)
  39. Pseudorandom Function-like States from Common Haar Unitary
    • Minki Hhan (UT Austin), Shogo Yamada (Kyoto University)
  40. Adaptive Syndrome Extraction
    • Noah Berthusen (University of Maryland), Shi Jie Samuel Tan (University of Maryland), Eric Huang (University of Maryland), Daniel Gottesman (University of Maryland)
  41. Classically estimating observables of noiseless quantum circuits
    • Armando Angrisani (EPFL), Alexander Schmidhuber (MIT), Manuel S. Rudolph (EPFL), Marco Cerezo (Los Alamos National Laboratory), Zoë Holmes (EPFL), Hsin-Yuan Huang (Google Quantum AI)
  42. Quantum Routing and Entanglement Dynamics Through Bottlenecks
    • Dhruv Devulapalli (University of Maryland), Chao Yin (University of Colorado), Andrew Guo (Quantinuum), Eddie Schoute (IBM Research), Andrew Childs (University of Maryland), Alexey Gorshkov (University of Maryland/NIST), Andrew Lucas (University of Colorado)
  43. A quantum algorithm for Khovanov homology
    • Alexander Schmidhuber (MIT), Michele Reilly (MIT), Paolo Zanardi (USC), Seth Lloyd (MIT), Aaron Lauda (USC)
  44. Forrelation is Extremally Hard
    • Uma Girish (Columbia University), Rocco Servedio (Columbia University)
  45. Quantum computational complexity of matrix functions
    • Santiago Cifuentes (UBA-CONICET), Samson Wang (Caltech), Thais Lima Silva (Technology Innovation Institute), Mario Berta (RWTH Aachen University), Leandro Aolita (Technology Innovation Institute)
  46. Quantum Threshold is Powerful
    • Jackson Morris (UC San Diego), Daniel Grier (UC San Diego)
  47. SPAM-free sound certification of quantum gates via quantum system quizzing
    • Nikolai Miklin (Hamburg University of Technology), Jan Nöller (Technical University of Darmstadt), Martin Kliesch (Hamburg University of Technology), Mariami Gachechiladze (Technical University of Darmstadt)
  48. Parallel Logical Measurements via Quantum Code Surgery
    • Alexander Cowtan (Oxford University), Zhiyang He (MIT), Dominic J. Williamson (University of Sydney), Theodore J. Yoder (IBM)
  49. Quantum Perfect Matchings
    • David Cui (MIT), Laura Mančinska (University of Copenhagen), Seyed Sajjad Nezhadi (University of Maryland), David E. Roberson (Technical University of Denmark)
  50. Quantum advantage for learning shallow neural networks with natural data distributions
    • Laura Lewis (Google Quantum AI), Dar Gilboa (Google Quantum AI), Jarrod R. McClean (Google Quantum AI)
  51. Quantum One-Time Programs, Revisited
    • Aparna Gupte (MIT), Jiahui Liu (Fujitsu Research), Justin Raizes (CMU), Bhaskar Roberts (UC Berkeley), Vinod Vaikuntanathan (MIT)
  52. Strategic Codes: The Universal Spatio-Temporal Framework for Quantum Error-Correction
    • Andrew Tanggara (Centre for Quantum Technologies), Mile Gu (Nanyang Technological University), Kishor Bharti (A*STAR)
  53. Polynomial time quantum and classical algorithms for representation theoretic multiplicities
    • Vojtech Havlicek (IBM Research), Martin Larocca (Los Alamos National Laboratory), Greta Panova (University of Southern California)
  54. The Space Just Above One Clean Qubit
    • Dale Jacobs (Tufts University), Saeed Mehraban (Tufts University)
  55. Orthogonality Broadcasting and Quantum Position Verification
    • Ian George (National University of Singapore), Rene Allerstorfer (QuSoft, CWI), Philip Verduyn Lunel (Sorbonne Université), Eric Chitambar (University of Illinois)
  56. X-arability of quantum states
    • Harm Derksen (Northeastern University), Nathaniel Johnston (Mount Allison University), Benjamin Lovitz (Northeastern University)
  57. Classical and Quantum Algorithms for Characters of the Symmetric Group
    • Sergey Bravyi (IBM), David Gosset (University of Waterloo), Vojtech Havlicek (IBM), Louis Schatzki (University of Illinois)
  58. Generalized Inner Product Estimation with Limited Quantum Communication
    • Srinivasan Arunachalam (IBM), Louis Schatzki (University of Illinois)
  59. Impossibility of Hyperefficient Shadow Tomography: Unbounded Multiple-Copy Secure Copy-Protection
    • Alper Cakan (Carnegie Mellon University), Vipul Goyal (NTT Research)
  60. Polylog-time- and constant-space-overhead fault-tolerant quantum computation with quantum low-density parity-check codes
    • Shiro Tamiya (Nanofiber Quantum Technologies), Masato Koashi (University of Tokyo), Hayata Yamasaki (University of Tokyo)
  61. Towards Non-Abelian Quantum Signal Processing: Efficient Control of Hybrid Continuous- and Discrete-Variable Architectures
    • Shraddha Singh (Yale University), Baptiste Royer (Université de Sherbrooke), Steven M. Girvin (Yale University)
  62. No quantum advantage without classical communication: fundamental limitations of quantum networks
    • Justus Neumann (Heinrich Heine University), Nikolai Wyderka (Heinrich Heine University), Tulja Varun Kondra (Heinrich Heine University), Kiara Hansenne (Université Paris-Saclay), Lisa T. Weinbrenner (Universität Siegen), Hermann Kampermann (Heinrich Heine University), Otfried Gühne (Universität Siegen), Dagmar Bruß (Heinrich Heine University)
  63. Classical Estimation of the Free Energy and Quantum Gibbs Sampling from the Markov Entropy Decomposition
    • Samuel Scalet (University of Cambridge), Angela Capel (University of Cambridge), Anirban Chowdhury (IBM Quantum), Hamza Fawzi (University of Cambridge), Omar Fawzi (ENS Lyon), Isaac Kim (UC Davis), Arkin Tikku (University of Sydney)
  64. A New World in the Depths of Microcrypt: Separating OWSGs and Quantum Money from QEFID
    • Amit Behera (Ben-Gurion University), Giulio Malavolta (Bocconi University), Tomoyuki Morimae (Kyoto University), Tamer Mour (Bocconi University), Takashi Yamakawa (NTT Social Informatics Laboratories)
  65. Generalized Short Path Algorithms: Towards Super-Quadratic Speedup over Markov Chain Search for Combinatorial Optimization
    • Shouvanik Chakrabarti (JPMorganChase), Dylan Herman (JPMorganChase), Guneykan Ozgul (JPMorganChase), Shuchen Zhu (JPMorganChase), Brandon Augustino (JPMorganChase), Tianyi Hao (JPMorganChase), Zichang He (JPMorganChase), Ruslan Shaydulin (JPMorganChase), Marco Pistoia (JPMorganChase)


II. Talks with proceedings

  1. Quantum Search with In-Place Queries
    • Blake Holman (Purdue University), Ronak Ramachandran (UT Austin), Justin Yirka (UT Austin)
  2. A quantum cloning game with applications to quantum position verification
    • Llorenc Escola Farras (QuSoft/University of Amsterdam),Leo Colisson Palais(Laboratoire Jean Kuntzmann,
      University Grenoble Alpes,) ,Florian Speelman (QuSoft/University of Amsterdam)
  3. Mixing time of quantum Gibbs sampling for random sparse Hamiltonians
    • Akshar Ramkumar (California Institute of Technology) ,Mehdi Soleimanifar (California Institute of Technology)
  4. Towards a complexity-theoretic dichotomy for (2+1)-dimensional TQFT invariants
    • Eric Samperton (Purdue University), Nicolas Bridges (Purdue University)
  5. Quantum SAT Problems with Finite Sets of Projectors are Complete for a Plethora of Classes
    • Ricardo Rivera Cardoso (Slovak Academy of Sciences), Alex Meiburg (University of Waterloo), Daniel Nagaj (Slovak Academy of Sciences)
  6. Uniformity testing when you have the source code
    • Clément Canonne (University of Sydney), Robin Kothari (Google), Ryan O’Donnell (Carnegie Mellon University)
  7. Efficient Quantum Pseudorandomness from Hamiltonian Phase States
    • John Bostanci (Columbia University), Jonas Haferkamp (Harvard University), Dominik Hangleiter (UC Berkeley), Alexander Poremba (MIT)
  8. Locality and Parameter Tradeoffs for Subsystem Codes
    • Samuel Dai (Northeastern University), Ray Li (Santa Clara University), Eugene Tang (Northeastern University)
  9. Hamiltonian Locality Testing via Trotterized Postselection
    • John Kallaugher (Sandia National Laboratories), Daniel Liang danliang@pdx.edu (Portland State University)
  10. Self-testing in the compiled setting via tilted-CHSH inequalities
    • Connor Paddock (University of Ottawa), Arthur Mehta (University of Ottawa), Lewis Wooltorton (University of York)
  11. Quantum Catalytic Space
    • Harry Buhrman (Quantinuum & CWI), Marten Folkertsma (CWI & QuSoft), Ian Mertz (Charles University), Florian Speelman (University of Amsterdam & QuSoft), Sergii Strelchuk (University of Oxford), Sathyawageeswar Subramanian (University of Cambridge), Quinten Tupker (CWI & QuSoft)
  12. The rotation-invariant Hamiltonian problem is QMAEXP-complete
    • Jon Nelson (University of Maryland), Daniel Gottesman (University of Maryland)