PC’s Long Plenaries:

  1. Group Order is in QCMA: François Le Gall, Harumichi Nishimura,Dhara Thakkar
  2. Multi-qubit Toffoli with exponentially fewer T gates: David Gosset, Robin Kothari,Chenyi Zhang
  3. Merge:
    1. Representations of f-Divergences and their role in Quantum Hypothesis Testing:  Salman Beigi, Hao-Chung Cheng, Christoph Hirche, Po-Chieh Liu, Marco Tomamichel
    2. Quantum channel coding with a few code lengths: Hao-Chung Cheng,Po-Chieh Liu (National Taiwan University)


(Short) Plenaries:

  1. A Constant Rate Quantum Computer on a Line: Craig Gidney,Thiago Bergamaschi
  2. Constructive counterexamples to the additivity of minimum output Rényi entropy of quantum channels for all p>1: Harm Derksen, Benjamin Lovitz
  3. Quantum precomputation: how to parallelize cascade circuits and the Moore–Nilsson conjecture is false: Adam Bene Watts, Charles R. Chen, J. William Helton, Joseph Slote
  4. Compressed Permutation Oracles:  Joseph Carolan
  5. Strong random unitaries and fast scrambling: Thomas Schuster, Fermi Ma, Alex Lombardi, Fernando Brandao, Hsin-Yuan Huang
  6. Few Single-Qubit Measurements Suffice to Certify Any Quantum State: Meghal Gupta, William He, Ryan O'Donnell [Best Student Paper]
  7. Merge:
    1. Constant-Overhead Addressable Gates via Single-Shot Code Switching: Louis Golowich, Kathleen (Katie) Chang, Guanyu Zhu
    2. Single-Shot, Universal Protocols via Code Switching: Michael Gullans, Yifan Hong, Min-Hsiu Hsieh, Ting-Chun Lin, Shi Jie Samuel Tan


Regular Talks:

  1. Uncloneable Encryption from Decoupling: Archishna Bhattacharyya, Eric Culf
  2. A Quantum Approach For Reducing Communications in Classical Secure Computations with Long Outputs: Jiayu Zhang
  3. Fault Tolerance by Construction: Benjamin Rodatz, Boldizsár Poór, Maximilian Rüsch, Aleks Kissinger
  4. Parallel Repetition for Post-Quantum Arguments: Andrew Huang, Yael Tauman Kalai
  5. Quantum circuit lower bounds in the magic hierarchy: Natalie Parham
  6. Unified Framework for Quantum Code Embedding: Andrew C. Yuan
  7. High-Temperature Fermionic Gibbs States are Mixtures of Gaussian States: Akshar Ramkumar, Yiyi Cai, Yu Tong, Jiaqing Jiang
  8. On the Cryptographic Foundations of Interactive Quantum Advantage: Kabir Tomer, Mark Zhandry
  9. Catalytic z-rotations in constant T-depth: Isaac Kim
  10. Causal decompositions of 1D quantum cellular automata: Augustin Vanrietvelde, Octave Mestoudjian, Pablo Arrighi
  11. Fourier Spectrum of Noisy Quantum Algorithms: Uma Girish
  12. Efficient and simple Gibbs sampling state preparation of the 2D toric code via duality to classical Ising chains: Pablo Páez Velasco, Niclas Schilling, Samuel O. Scalet, Frank Verstraete, Ángela Capel
  13. Random Unitaries in Constant (Quantum) Time: Benjamin Foxman, Natalie Parham, Francisca Vasconcelos, Henry Yuen
  14. Can effective descriptions of bosonic systems be considered complete?: Francesco Arzani, Robert Booth, Ulysse Chabaud
  15. Tile codes: Vincent Steffan, Shin Ho Choe, Nikolas P. Breuckmann, Francisco Revson Fernandes Pereira, Jens Niklas Eberhardt, Zijian Liang, Yu-An Chen
  16. Unfolded distillation: very low-cost magic state preparation for biased-noise qubits: Diego Ruiz
  17. Obfuscation of Unitary Quantum Programs: Miryam Mi-Ying Huang, Er-Cheng Tang
  18. Optimal quantum simulation of linear non-unitary dynamics: Guang Hao Low, Rolando D. Somma
  19. Universal quantum computing in two dimensions without getting tied in knots: Julio Magdalena de la Fuente, Margarita Davydova, Andreas Bauer, Mark Webster, Dominic Williamson, Benjamin Brown
  20. Distributed Quantum Advantage for Local Problems: Alkida Balliu, Sebastian Brandt, Filippo Casagrande, Xavier Coiteux-Roy, Francesco d'Amore, Barbara Keller, Massimo Equi, François Le Gall, Henrik Lievonen, Augusto Modanese, Dennis Olivetti, Marc-Olivier Renou, Jukka Suomela, Gustav Schmid, Lucas Tendick, Isadora Veeren
  21. Symmetric localizable multiparty quantum measurements: Jef Pauwels, Cyril Branciard, Alejandro Pozas-Kerstjens, Nicolas Gisin
  22. Trading Mathematical for Physical Simplicity: Bialgebraic Structures in Matrix Product Operator Symmetries: Yuhan Liu, Andras Molnar, Xiao-Qi Sun, Frank Verstraete, Kohtaro Kato, Laurens Lootens
  23. Entanglement sharing schemes: Alex May, Zahra Khanian, Dongjin Lee, Debbie Leung, Zhi Li, Takato Mori, Stanley Miao, Farzin Salek, Jinmin Yi, Beni Yoshida
  24. Sum of Squares Spectral Amplification: Robbie King, Guang Hao Low, Dominic Berry, Qiushi Han, Eugene DePrince, Alec White, Ryan Babbush, Rolando Somma, Nick Rubin
  25. Gap-preserving reductions and RE-completeness of independent set games: Laura Mančinska, Pieter Spaas, Taro Spirig, Matthijs Vernooij
  26. MIPco=coRE: Junqiao Lin
  27. Information-Computation Gaps in Quantum Learning via Low-Degree Likelihood: Sitan Chen, Weiyuan Gong, Jonas Haferkamp, Yihui Quek
  28. The firewall paradox is Wigner's friend paradox: Ladina Hausmann, Renato Renner
  29. Continuous-Variable Quantum MacWilliams Identities: Ansgar G. Burchards
  30. Efficient Learning Implies Quantum Glassiness: Eric Anschuetz
  31. A Meta-Complexity Characterization of Minimal Quantum Cryptography: Bruno Cavalar, Boyang Chen, Andrea Coladangelo, Matthew Gray, Zihan Hu, Zhengfeng Ji, Xingjian Li
  32. On One-Shot Signatures, Quantum vs Classical Binding, and Obfuscating Permutations: Omri Shmueli, Mark Zhandry
  33. Tight and self-testing multipartite quantum Bell inequalities from the renormalization group: Paolo Abiuso, Julian Fischer, Miguel Navascues
  34. Parent Lindbladians for Matrix Product Density Operators: Yuhan Liu, Alberto Ruiz-de-Alarcon, Georgios Styliaris, Xiao-Qi Sun, David Perez-Garcia, Ignacio Cirac
  35. Cyclic quantum causal modelling with a graph separation theorem: Carla Ferradini, Victor Gitton, V. Vilasini
  36. Cloning Games, Black Holes and Cryptography: Alexander Poremba, Seyoon Ragavan, Vinod Vaikuntanathan
  37. The abelian state hidden subgroup problem: Learning stabilizer groups and beyond: Marcel Hinsche, Jose Carrasco, Jens Eisert
  38. The Jacobi Factoring Circuit: Quantum Factoring in Near-Linear Gates and Sublinear Space: Gregory D. Kahanamoku-Meyer, Seyoon Ragavan, Vinod Vaikuntanathan, Katherine Van Kirk
  39. Quantum Advantage from Sampling Shallow Circuits: Beyond Hardness of Marginals: Daniel Grier, Daniel M. Kane, Jackson Morris, Anthony Ostuni, Kewen Wu
  40. Heisenberg-limited Hamiltonian learning continuous variable systems via engineered dissipation: Tim Möbus, Andreas Bluhm, Tuvia Gefen, Yu Tong, Albert H. Werner, Cambyse Rouzé
  41. Quantum Computing Enhanced Sensing: Richard R. Allen, Francisco Machado, Isaac L. Chuang, Robert Huang, Soonwon Choi
  42. Two bases suffice for QMA1-completeness: Henry Ma, Anand Natarajan
  43. The NPA hierarchy does not always attain the commuting operator value: Marco Fanizza, Larissa Kroell, Arthur Mehta, Connor Paddock, Denis Rochette, William Slofstra, Yuming Zhao
  44. Efficient Quantum Optimization via Dynamical Simulation: Ahmet Burak Catli, Sophia Simon, Nathan Wiebe
  45. Adversarially robust quantum state learning and testing: Maryam Aliakbarpour, Nai-Hui Chia, Vladimir Braverman, Yuhan Liu
  46. Fast quantum computation with all-to-all Hamiltonians: Chao Yin
  47. Quantum Codes with Addressable and Transversal Non-Clifford Gates: Zhiyang (Sunny) He, Vinod Vaikuntanathan, Adam Wills, Rachel Yun Zhang
  48. Optimal Distillation of Qubit Clocks: Sujay Kazi, Iman Marvian
  49. Quantum Circuit Complexity of Matrix-Product Unitaries: Georgios Styliaris, Rahul Trivedi, J. Ignacio Cirac
  50. Efficient Learning Algorithms for Structured Bosonic and Fermionic Unitary Operators: Marco Fanizza, Vishnu Iyer, Junseo Lee, Antonio A. Mele, Francesco A. Mele
  51. Fast and Error-Correctable Quantum RAM: Francesco Cesa, Hannes Pichler, Hannes Bernien
  52. Non-iid hypothesis testing: from classical to quantum: Giacomo De Palma, Marco Fanizza, Ryan O'Donnell, Connor Mowry
  53. On quantum to classical comparison for Davies generators: Joao Basso, Shirshendu Ganguly, Alistair Sinclair, Nikhil Srivastava, Zachary Stier, Thuy-Duong Vuong
  54. Efficient implementation of sequential quantum processes with group symmetry: Dmitry Grinko, Satoshi Yoshida, Mio Murao, Maris Ozols
  55. Long-range nonstabilizerness and quantum codes, phases, and complexity: Fuchuan Wei, Zi-Wen Liu
  56. Universal work extraction in quantum thermodynamics: Kaito Watanabe, Ryuji Takagi
  57. Extractors: QLDPC Architectures for Efficient Pauli-Based Computation: Zhiyang (Sunny) He, Alexander Cowtan, Dominic J. Williamson, Theodore J. Yoder
  58. An Improved Quantum Algorithm for 3-Tuple Lattice Sieving: Lynn Engelberts, Yanlin Chen, Amin Shiraz Gilani, Maya-Iggy van Hoof, Stacey Jeffery, Ronald de Wolf
  59. A complete theory for the Clifford commutant and its applications: Lennart Bittel, Jens Eisert, Lorenzo Leone, Antonio A. Mele, Salvatore F.E. Oliviero
  60. Tight relations and equivalences between smooth relative entropies: Bartosz Regula, Ludovico Lami, Nilanjana Datta
  61. Efficient Non-Adaptive Quantum Algorithms for Tolerant Junta Testing: Zongbo Bao, Yuxuan Liu, Penghui Yao, Zekun Ye, Jialin Zhang
  62. Universal classical-quantum channel resolvability and private channel coding: Takaya Matsuura, Masahito Hayashi, Min-Hsiu Hsieh
  63. Universal Fault Tolerance with Non-Transversal Clifford Gates: Benjamin Anker, Milad Marvian
  64. Strong converse exponent of channel interconversion: Aadil Oufkir, Yongsheng Yao, Mario Berta
  65. Quantum advantage from soft decoders: Andre Chailloux, Jean-Pierre Tillich
  66. Infinite temperature at zero energy: Matteo Ippoliti, David M. Long
  67. Derandomised tensor product gap amplification for quantum Hamiltonians: Thiago Bergamaschi, Tony Metger, Thomas Vidick, Tina Zhang
  68. Quantized Markov chain couplings that prepare Qsamples: Kristan Temme, Pawel Wocjan
  69. A distillation-teleportation protocol for fault-tolerant QRAM: Alexander M. Dalzell, András Gilyén, Connor T. Hann, Sam McArdle, Grant Salton, Quynh T. Nguyen, Aleksander Kubica, Fernando G.S.L. Brandao
  70. Partial trace relations beyond normal matrices: Pablo Costa Rico, Michael M. Wolf
  71. Quantum Gibbs states are locally Markov: Chi-Fang (Anthony) Chen, Cambyse Rouzé
  72. Improving quantum communication rates with permutation-invariant codes: Sujeet Bhalerao, Felix Leditzky
  73. Evidence that the Quantum Approximate Optimization Algorithm Optimizes the Sherrington-Kirkpatrick Model Efficiently in the Average Case: Sami Boulebnane, Abid A. Khan, Ruslan Shaydulin
  74. Efficiently learning depth-3 circuits via quantum agnostic boosting: Srinivasan Arunachalam, Arkopal Dutt, Alexandru Gheorghiu, Michael de Oliveira
  75. Exponential improvements to the average-case hardness of BosonSampling: Ishaun Datta, Adam Bouland, Bill Fefferman, Felipe Hernandez
  76. Composable logical gate error in approximate quantum error correction: Lukas Brenner, Beatriz Dias, Robert König
  77. Quantum oracles, weak and strong: Ewin Tang, John Wright, Mark Zhandry
  78. The Compressed Oracle is a Worthy (Multiplicative) Adversary: Stacey Jeffery, Sebastian Zur
  79. Dequantization and Hardness of Spectral Sum Estimation: Roman Edenhofer, Atsuya Hasegawa, Francois Le Gall
  80. Topological Quantum Spin Glass Order in qLDPC codes: Benedikt Placke, Tibor Rakovszky, Nikolas P. Breuckmann, Vedika Khemani
  81. Tour de gross: A modular quantum computer based on bivariate bicycle codes: Eddie Schoute, Theodore J. Yoder, Patrick Rall, Emily Pritchett, Jay Gambetta, Andrew W. Cross, Malcolm Carroll, Michael E. Beverland
  82. All pure multipartite entangled states of qubits can be self-tested up to complex conjugation: Ivan Šupić, Maria Balanzo Juando, Andrea Coladangelo, Remigiusz Augusiak, Antonio Acin
  83. An Area Law for Metastable States: Thiago Bergamaschi, Chi-Fang (Anthony) Chen, Umesh Vazirani
  84. An Algorithmic Polynomial Freiman-Ruzsa Theorem via Stabilizer Learning: Srinivasan Arunachalam, Jop Briet, Davi Castro-Silva, Arkopal Dutt, Tom Gur
  85. Quantum Spin Chains Thermalize at All Temperatures: Thiago Bergamaschi, Chi-Fang (Anthony) Chen
  86. Learning quantum Gibbs states locally and efficiently: Chi-Fang (Anthony) Chen, Anurag Anshu, Quynh Nguyen
  87. Local transformations of bipartite entanglement are rigid: Can Bostanci, Tony Metger, Henry Yuen
  88. Lieb-Robinson bounds with exponential-in-volume tails: Ben McDonough, Chao Yin, Andrew Lucas, Carolyn Zhang
  89. Better completeness for QMA: Scott Aaronson, Stacey Jeffery, Freek Witteveen
  90. Is it Gaussian? Testing bosonic quantum states: Filippo Girardi, Freek Witteveen, Francesco Anna Mele, Lennart Bittel, Salvatore Francesco Emanuele Oliviero, David Gross, Michael Walter
  91. Umlaut information: Filippo Girardi, Aadil Oufkir, Bartosz Regula, Marco Tomamichel, Mario Berta, Ludovico Lami
  92. Quantum generalizations of Glauber and Metropolis dynamics: Chi-Fang Chen, Csaba Czabán, Joao F. Doriguello, András Gilyén, Balázs Kabella, Michael J. Kastoryano, József Mák, Zoltán Zimborás
  93. Pauli tomography at your fingertips: Jayadev Acharya, Abhilash Dharmavarapu, Yuhan Liu, Nengkun Yu
  94. Average-case quantum complexity from glassiness: Alexander Zlokapa, Bobak T. Kiani, Eric R. Anschuetz
  95. Less is More: On Copy Complexity in Quantum Cryptography: Prabhanjan Ananth, Eli Goldin
  96. Quantum simulation of a noisy classical nonlinear dynamics: Sergey Bravyi, Sergiy Zhuk, Mykhaylo Zayats, Robert Manson-Sawko
  97. Classical Simulations of Low Magic Quantum Dynamics: Kemal Aziz, Haining Pan, Michael Gullans, Jedediah Pixley
  98. Fast Simulation of Fermions with Reconfigurable Qubits: Nishad Maskara, Marcin Kalinowski, Daniel Gonzalez-Cuadra, Mikhail Lukin
  99. Quantum matrix arithmetics with Hamiltonian evolution: Christopher Kang, Yuan Su
  100. The Complexity of Thermalization in Finite Quantum Systems: Dhruv Devulapalli, Timothy Connor Mooney, James Watson
  101. A log-depth in-place quantum Fourier transform that rarely needs ancillas: Gregory D. Kahanamoku-Meyer, John Blue, Thiago Bergamaschi, Craig Gidney, Isaac Chuang
  102. A New Quantum Linear System Algorithm Beyond the Condition Number and Its Application to Solving Multivariate Polynomial Systems: Jianqiang Li
  103. Quantum algorithms for Uhlmann transformation: Takeru Utsumi, Yoshifumi Nakata, Qisheng Wang, Ryuji Takagi
  104. Quantum error correction beyond SU(2): spin, permutation-invariant, and bosonic codes from convex geometry: Arda Aydin, Victor Albert, Alexander Barg
  105. Efficient Quantum Hermite Transform: Siddhartha Jain, Vishnu Iyer, Rolando Somma, Ning Bao, Stephen Jordan
  106. Fast-forwardable Lindbladians imply quantum phase estimation: Zhong-Xia Shang, Naixu Guo, Patrick Rebentrost, Alan Aspuru-Guzik, Tongyang Li, Qi Zhao
  107. Polynomial-time tolerant testing stabilizer states: Srinivasan Arunachalam, Arkopal Dutt
  108. Approximate Quantum Error Correction with 1D Log-Depth Circuits: Guoding Liu, Zhenyu Du, Zi-Wen Liu, Xiongfeng Ma
  109. Layer codes as partially self-correcting quantum memories: Shouzhen Gu, Libor Caha, Shin Ho Choe, Zhiyang He, Aleksander Kubica, Eugene Tang
  110. Inverse Nonlinear Fast Fourier Transform: Closing A Chapter in Quantum Signal Processing: Hongkang Ni, Rahul Sarkar, Lexing Ying, Lin Lin
  111. Batched high-rate logical operations for quantum LDPC codes: Qian Xu, Hengyun Zhou, Dolev Bluvstein, Madelyn Cain, Marcin Kalinowski, John Preskill, Mikhail D. Lukin, Nishad Maskara
  112. A Dobrushin condition for quantum Markov chains: Rapid mixing and conditional mutual information at high temperature: Ainesh Bakshi, Allen Liu, Ankur Moitra, Ewin Tang
  113. Free mutual information and ergodicity in operator space: Shreya Vardhan, Jinzhao Wang
  114. Parallel Spooky Pebble Games and Regev's Factoring Algorithm: Gregory D. Kahanamoku-Meyer, Seyoon Ragavan, Katherine Van Kirk
  115. Fault-tolerant protocols through spacetime concatenation: Yichen Xu, Arpit Dua
  116. Hamiltonians and random unitaries: Laura Cui, Liang Mao, Fernando Brandao, Hsin-Yuan Huang, Thomas Schuster
  117. Haar random codes attain the quantum Hamming bound, approximately: Fermi Ma, Xinyu Tan, John Wright
  118. Mechanisms for Quantum Advantage in Global Optimization of Nonconvex Functions: Dylan Herman, Guneykan Ozgul, Anuj Apte, Junhyung Lyle Kim, Anupam Prakash, Jiayu Shen, Shouvanik Chakrabarti
  119. Quantum Relative Entropy Decay Composition Yields Shallow, Unstructured k-Designs: Nicholas Laracuente
  120. Average-Case Hardness and Reducibility of Decoding Quantum Stabilizer Codes: Andrey Khesin, Jonathan Lu, Alexander Poremba, Yihui Quek, Akshar Ramkumar, Peter Shor, Vinod Vaikuntanathan
  121. Nonlocality of Quantum States Can be Transitive: Kai-Siang Chen, Gelo Noel M. Tabia, Chung-Yun Hsieh, Yu-Chun Yin, Yeong-Cherng Liang
  122. A Quantum Time-Space Tradeoff for Directed st-Connectivity: Stacey Jeffery, Galina Pass
  123. On the optimization of quantum divergences: Gereon Kossmann, René Schwonnek, Mario Berta, Mark M. Wilde
  124. Universal tradeoff relations between resource cost and irreversibility of channels: General-resource Wigner-Araki-Yanase theorems and beyond: Hiroyasu Tajima, Koji Yamaguchi, Ryuji Takagi, Yui Kuramochi
  125. Gluing Random Unitaries with Inverses: Prabhanjan Ananth, John Bostanci, Aditya Gulati, Yao-Ting Lin
  126. Breaking the Treewidth Barrier in Quantum Circuit Simulation with Decision Diagrams: Bin Cheng, Ziyuan Wang, Longxiang Yuan, Ruixuan Deng, Jianxin Chen, Zhengfeng Ji
  127. When Quantum Nonlocality Does Not Play Dice & No Bound Randomness in Quantum Nonlocality: Ravishankar Ramanathan, Yuan Liu, Yutian Wu, Stefano Pironio
  128. Quartic quantum speedups for community detection: Alexander Schmidhuber, Alexander Zlokapa
  129. Hardness of recognizing phases of matter: Thomas Schuster, Dominik Kufel, Norman Y. Yao, Hsin-Yuan Huang
  130. Hamiltonian Decoded Quantum Interferometry: Alexander Schmidhuber, Jonathan Z Lu, Stephen Jordan, Alexander Poremba, Noah Shutty, Yihui Quek
  131. Optimising quantum data hiding: Francesco Anna Mele, Ludovico Lami
  132. Merge:
    1. Quantum Lifting for Invertible Permutations and Ideal Ciphers: Alexandru Cojocaru, Minki Hhan, Qipeng Liu, Takashi Yamakawa
    2. The Sponge is Quantum Indifferentiable: Gorjan Alagic, Joseph Carolan, Christian Majenz, Saliha Tokat
  133. Merge:
    1. Quantitative Quantum Soundness for Bipartite Compiled Bell Games via the Sequential NPA Hierarchy: Xiangling Xu, Igor Klep, Connor Paddock, Marc-Olivier Renou, Simon Schmidt, Lucas Tendick, Yuming Zhao
    2. A convergent sum-of-squares hierarchy for compiled nonlocal games: David Cui, Chirag Falor, Anand Natarajan, Tina Zhang
  134. Merge:
    1. Complexity of mixed Schatten norms of quantum maps: Jan Kochanowski, Omar Fawzi, Cambyse Rouzé
    2. Computational aspects of the trace norm contraction coefficient: Idris Delsol, Omar Fawzi, Jan Kochanowski, Akshay Ramachandran
  135. Merge:
    1. Quantitative quantum soundness for all multipartite compiled nonlocal games: Xiangling Xu, Matilde Baroni, Igor Klep, Dominik Leichtle, Marc-Olivier Renou, Ivan Šupić, Lucas Tendick
    2. Bounding the asymptotic quantum value of all multipartite compiled non-local games: Matilde Baroni, Dominik Leichtle, Siniša Janković, Ivan Šupić
  136. Merge:
    1. Entanglement theory with limited computational resources: Lorenzo Leone, Jacopo Rizzo, Jens Eisert, Sofiene Jerbi
    2. Quantum Computational Entropies: Noam Avidan, Thomas A. Hahn, Rotem Arnon, Joseph M. Renes
    3. Computational relative entropy: Johannes Jakob Meyer, Asad Raza, Jacopo Rizzo, Lorenzo Leone, Sofiene Jerbi, Jens Eisert
  137. Merge:
    1. Optimal lower bounds for quantum state tomography: Thilo Scharnhorst, Jack Spilecki, John Wright
    2. The debiased Keyl's algorithm: a new unbiased estimator for full state tomography: Angelos Pelecanos, Jack Spilecki, John Wright
  138. Merge:
    1. An infinite hierarchy of multi-copy quantum learning tasks: Jan Nöller, Viet Tran, Mariami Gachechildaze, Richard Kueng
    2. Exponential Advantage from One More Replica in Estimating Nonlinear Properties of Quantum States: Qi Ye, Dong-Ling Deng, Zhenhuan Liu