Accepted Papers

Verifiable Quantum Advantage via Optimized DQI Circuits.

Unentanglement and Post-Measurement Branching in Quantum Interactive Proofs.

On the Pure Quantum Polynomial Hierarchy and Quantified Hamiltonian Complexity.

Classification and implementation of unitary-equivariant and permutation-invariant quantum channels.

Randomized measurements for multi-parameter quantum metrology.

Will it glue? On short-depth designs beyond the unitary group.

Magic and communication complexity.

Rapid Mixing of Quantum Gibbs Samplers for Weakly-Interacting Quantum Systems.

Efficient magic-state generation with quantum tricycle codes.

Quantum lower bounds for simulating fluid dynamics.

Quantum computation with qubit-oscillator systems: Trading modes against energy.

Reconquering Bell sampling on qudits: stabilizer learning and testing, quantum pseudorandomness bounds, and more.

A complexity theory for non-local quantum computation.

Lower bounds on non-local computation from controllable correlation.

Clifford testing: algorithms and lower bounds.

Instance-Optimal Quantum State Certification with Entangled Measurements.

On the complexity of unique quantum witnesses and quantum approximate counting.

Quantum statistics in the minimal Bell scenario.

Randomness from causally independent processes.

Near-optimal performance of square-root measurement for general score functions and quantum ensembles.

Fundamentals of quantum Boltzmann machine learning with visible and hidden units.

Certifying and learning local quantum Hamiltonians.

A Sharp Computational Phase Transition for the Partition Function of the Transverse-Field Ising Model.

Channel Coding and Quantum Channel Discrimination against Jammers: a Minimax Approach.

The Necessity of Extending Quantum Prior Beliefs.

Complexity Theory for Quantum Promise Problems.

The code distance of Floquet codes.

High-dimensional quantum Schur transforms and Quantum Fourier transform for the symmetric group.

Fermionic Insights into Measurement-Based Quantum Computation: Circle Graph States Are Not Universal Resources.

Characterization of permutation gates in the third level of the Clifford hierarchy.

Nearly optimal algorithms to learn sparse quantum Hamiltonians.

Post-Quantum Security of Block Cipher Constructions.

The Black-Box Simulation Barrier Persists in a Fully Quantum World.

Unified Architecture for Quantum Lookup Tables.

Higher moment theory and learnability of bosonic states.

Entangling logical qubits without physical operations.

Quantum simulation of chemistry via quantum fast multipole method.

Power and limitations of distributed quantum state purification.

Efficient quantum circuits for high-dimensional representations of SU(n) and Ramanujan quantum expanders.

Quantum Search With Generalized Wildcards.

Optimal Qubit Purification and Unitary Schur Sampling via Random SWAP Tests.

Quantum Metrology with Constrained Ancillae.

High-Performance qLDPC Codes with Efficient Layouts on Flying Qubits.

Quadratic tensors as a unification of Clifford, Gaussian, and free-fermion physics.

Energy, Bosons and Computational Complexity.

Entanglement area law in interacting bosons: from Bose-Hubbard, $\phi4$, and beyond.

Beyond Belief Propagation: Cluster-Corrected Tensor Network Contraction with Exponential Convergence.

Simulating noisy IQP circuits under amplitude damping.

Provable Speedups for Convex Optimization via Quantum Dynamics.

Spectral Small-Incremental Entangling: Breaking Quasi-Polynomial Complexity Barriers in Long-Range Interacting Systems.

Fine-Grained Complexity for Quantum Problems from Size-Preserving Circuit-to-Hamiltonian Constructions.

Constant-Overhead Entanglement Distillation via Scrambling.

On the Complexity of Decoded Quantum Interferometry.

A Unified Approach to Quantum Key Leasing with a Classical Lessor.

Quantum Merlin-Arthur with an Internally Separable Proof.

Tight and Robust Consecutive Measurement Theorems with Applications to Quantum Cryptography.

Learning and certification of local time-dependent quantum dynamics and noise.

Transversal Dimension Jump for Product qLDPC Codes.

Powerful Primitives in the Bounded Quantum Storage Model.

Composable simultaneous purification: when all communication scenarios reduce to spatial correlations.

Cloning is as Hard as Learning for Stabilizer States.

Positive maps and extendibility hierarchies from copositive matrices.

Unitary synthesis with fewer T gates.

Limitations of Decoded Quantum Interferometry for MaxCut.

Plugging Leaks in Fault-Tolerant Quantum Computation and Verification.

Classically simulating noisy quantum circuits via exponential decay of conditional correlation.

Complexity of Fermionic 2-SAT.

Unclonable Cryptography in Linear Quantum Memory.

End-to-end quantum algorithms for tensor problems.

A New Approach to Arguments of Quantum Knowledge.

Universal thermodynamic implementation of a process with a variable work cost.

Dequantization Barriers for Guided Stoquastic Hamiltonians.

Space–Time Efficient Transversal Architectures for Large-Scale Quantum Computation.

Hiding, Shuffling, and Cycle Finding: Quantum Algorithms on Edge Lists.

The Power of Quantum Circuits in Sampling.

Topology for qLDPC: transversal non-Clifford gates and magic state fountain on homological product codes with constant rate and beyond the N^{1/3} distance barrier.

Limitations of Noisy Geometrically Local Quantum Circuits.

A robust and composable device-independent protocol for oblivious transfer using (fully) untrusted quantum devices in the bounded storage model.

Geometric optimization for quantum communication.

Classical Obfuscation of Quantum Circuits via Publicly-Verifiable QFHE.

Measuring gravitational lensing time delays with quantum information processing.

On the Complexity of the Circuit Width Problem.

Quantum Speedups for Sampling and Non-convex Optimization with Stochastic Oracles.

Limits on Quantum Information Processing from Non-Commutative Probability Theory.

A Family of Information-Theoretic de Finetti Theorems for Constrained Optimization.

Quantum algorithms through graph composition.

Optimizing fermionic Hamiltonians with classical interactions.