Name: Quantum Information Processing 2023
Start: 2023-02-04T07:00:00+01:00
End: 2023-02-10T20:00:00+01:00
Location: Ghent University

A Complete Hierarchy of Linear Systems for Certifying Quantum Entanglement of Subspaces (in session "Parallel 2A")

A Computational Separation Between Quantum No-cloning and No-teleportation (in session "Parallel 8C")

A Convergence Theory for Over-parameterized Variational Quantum Eigensolvers (in session "Parallel 1A")

A streamlined quantum algorithm for topological data analysis with exponentially fewer qubits (in session "Parallel 8B")

A Sublinear-Time Quantum Algorithm for Approximating Partition Functions (in session "Parallel 5A")

A subpolynomial-time algorithm for the free energy of one-dimensional quantum systems in the thermodynamic limit (in session "Parallel 9C")

An efficient decoder for a linear distance quantum LDPC code (in session "Parallel 9B")

An operator-algebraic formulation of self-testing (in session "Parallel 7C")

Another Round of Breaking and Making Quantum Money: How to Not Build It from Lattices, and More (in session "Parallel 2B")

Breaking the cubic barrier in the Solovay-Kitaev algorithm (in session "Parallel 8A")

Business meeting

Circuit complexity and classical simulation of Many-Body Localized Systems (in session "Parallel 9C")

Circuit knitting with classical communication (in session "Parallel 6C")

Classical shadows of fermions with particle number symmetry (in session "Parallel 4A")

Commitments to Quantum States (in session "Parallel 6B")

Complete order implies tight relative entropy decay rate (in session "Parallel 6C")

Continuous-variable quantum state designs: theory and applications (in session "Parallel 5C")

Cryptography with Certified Deletion -- merged with -- Blind Delegation with Certified Deletion (in session "Parallel 4B")

Decidability of fully quantum nonlocal games with noisy maximally entangled states (in session "Parallel 9A")

Dualities in one-dimensional quantum lattice models: symmetric Hamiltonians and matrix product operator intertwiners (in session "Parallel 7B")

Entanglement area law for 1D gauge theories and bosonic systems (in session "Parallel 7B")

Exact solution for the quantum and private capacities of bosonic dephasing channels (in session "Parallel 3C")

Experimental quantum key distribution certified by Bell’s theorem (in session "Parallel 7C")

Exponentially tighter bounds on error mitigation: hardness at log log (n) depth (in session "Parallel 3B")

Floquet codes without parent subsystem codes (in session "Parallel 9B")

From the Hardness of Detecting Superpositions to Cryptography: Quantum Public Key Encryption and Commitments (in session "Parallel 6B")

General guarantees for randomized benchmarking with random quantum circuits (in session "Parallel 1C")

Generating k EPR-pairs from an n-party resource state (in session "Parallel 6C")

Good Quantum LDPC Codes with Linear Time Decoders (in session "Parallel 9B")

Hay from the haystack: explicit examples of exponential quantum circuit complexity (in session "Parallel 9A")

Hybrid Quantum-Classical Search Algorithms (in session "Parallel 7A")

Improved Hardness Results for the Guided Local Hamiltonian Problem (in session "Parallel 5B")

Improved machine learning algorithm for predicting ground state properties (in session "Parallel 7C")

Improved Quantum Speedups for Zero-Sum Games via Dynamic Gibbs Sampling (in session "Parallel 5A")

Industry session: Amazon | science (in session "Industry session")

Industry session: Google Quantum AI (in session "Industry session")

Industry session: Microsoft Azure Quantum (in session "Industry session")

Inevitability of knowing less than nothing (in session "Parallel 8C")

Influence in Completely Bounded Block-multilinear Forms and Classical Simulation of Quantum Algorithms (in session "Parallel 5B")

Information processing in causal networks from AdS/CFT (in session "Parallel 8C")

Invited plenary 1: Clique Homology is QMA_1-hard

Invited plenary 2: Quantum Information Processing with Indefinite Causal Order

Invited plenary 3: Real-time quantum error correction beyond break-even

Joint State-Channel Decoupling and One-Shot Quantum Coding Theorem -- merged with -- Optimal Second-Order Rates for Quantum Information Decoupling and Privacy Amplification (in session "Parallel 3C")

Learning beyond Cliffords: circuits and states (in session "Parallel 2C")

Learning to predict arbitrary quantum processes (in session "Parallel 2C")

Limitations of VQAs: a quantum optimal transport approach (in session "Parallel 1A")

Linear programming with unitary-equivariant constraints (in session "Parallel 7C")

Long-range data transmission in a fault-tolerant quantum bus architecture (in session "Parallel 3B")

Long-range entanglement from finite-depth circuits and measurements: from theory to quantum devices (in session "Parallel 7B")

Lower Bounding Ground State Energies of Local Hamiltonians -- Tractable Relaxations of Many-Body problems Through the Renormalization Group (in session "Parallel 1C")

Matchgate Shadows for Fermionic Quantum Simulation (in session "Parallel 4A")

Mean estimation when you have the source code; or, quantum Monte Carlo methods (in session "Parallel 6A")

Memory-Sample Lower Bounds for Learning with Classical-Quantum Hybrid Memory (in session "Parallel 7A")

Mind the gap: Achieving a super-Grover quantum speedup by jumping to the end (in session "Parallel 3A")

Noisy Decoding by Shallow Circuits with Parities: Classical and Quantum (in session "Parallel 1B")

On generalised quantum Stein’s lemmata and the reversibility of quantum resources (in session "Parallel 3C")

On reductions from weak to strong simulation (in session "Parallel 7A")

On the Feasibility of Unclonable Encryption, and More (in session "Parallel 4B")

Optimal time-periodic Hamiltonian simulation (in session "Parallel 9C")

Optimizing quantum circuit parameters via SDP -- merged with -- An Improved Approximation Algorithm for Quantum Max-Cut (in session "Parallel 4A")

Optimizing sparse fermionic Hamiltonians (in session "Parallel 9C")

Optimizing the depth of variational quantum algorithms is strongly QCMA-hard to approximate (in session "Parallel 9A")

Pauli topological codes from Abelian anyon theories (in session "Parallel 3B")

Plenary 1: Verifiable Quantum Advantage without Structure

Plenary 2: A polynomial-time classical algorithm for noisy random circuit sampling

Plenary 3: NLTS Hamiltonians from good quantum codes

Post-Quantum Zero Knowledge, Revisited (or: How to Do Quantum Rewinding Undetectably) (in session "Parallel 6B")

Quantifying Quantum Advantage in Topological Data Analysis (in session "Parallel 8B")

Quantum Advice in the Quantum Random Oracle Model (in session "Parallel 2B")

Quantum Algorithms for Sampling Log-Concave Distributions and Estimating Normalizing Constants (in session "Parallel 5A")

Quantum algorithms from fluctuation theorems: Thermal-state preparation (in session "Parallel 8A")

Quantum Commitments and Signatures without One-Way Functions (in session "Parallel 4B")

Quantum Cryptography in Algorithmica (in session "Parallel 4B")

Quantum divide and conquer (in session "Parallel 6A")

Quantum free games (in session "Parallel 9A")

Quantum Locally Testable Code with Exotic Parameters (in session "Parallel 9B")

Quantum networks self-test all entangled states (in session "Parallel 4C")

Quantum Pseudoentanglement (in session "Parallel 5B")

Quantum speedups for solving linear regression problems (in session "Parallel 3A")

Quantum Subroutine Composition (in session "Parallel 2A")

Quantum Talagrand, KKL and Friedgut's theorems and the learnability of quantum observables (in session "Parallel 2C")

Quantum tomography using state-preparation unitaries (in session "Parallel 2A")

Quantum Worst-Case to Average-Case Reductions for All Linear Problems (in session "Parallel 2A")

Short plenary 1: Generalised entropy accumulation

Short plenary 2: A Simple and Tighter Derivation of Achievability for Classical Communication over Quantum Channels

Short plenary 3: Pseudorandom Quantum States, Revisited: New Properties, Variants, Constructions and Cryptographic Applications

Short plenary 4: Time-Efficient Constant-Space-Overhead Fault-Tolerant Quantum Computation

Short plenary 5: A lower bound on the overhead of quantum error correction in low dimensions

Short plenary 6: The minimal canonical form of a tensor network

Short plenary 7: Learning many-body Hamiltonians with Heisenberg-limited scaling

Short plenary 8: Sparse random Hamiltonians are quantumly easy

Short plenary 9: One-Way Ticket to Las Vegas and the Quantum Adversary

Short plenary 10: Multidimensional Quantum Walks, with Application to k-Distinctness

Shorter Quantum Circuits via Single-Qubit Gate Approximation (in session "Parallel 8A")

Simulating qubit correlations with classical communication (in session "Parallel 4C")

Solving boolean satisfiability problems with the quantum approximate optimization algorithm (in session "Parallel 1A")

stateQIP = statePSPACE (in session "Parallel 1B")

Super-exponential distinguishability of correlated quantum states (in session "Parallel 5C")

Testing and Learning Quantum Juntas Nearly Optimally (in session "Parallel 3A")

Testing quantumness without entanglement (in session "Parallel 5C")

The Complexity of NISQ (in session "Parallel 1B")

The Quantum and Classical Streaming Complexity of Quantum and Classical Max-Cut (in session "Parallel 6A")

Tight Bounds for Quantum State Certification with Incoherent Measurements -- merged with -- Tight Bounds for State Tomography with Incoherent Measurements (in session "Parallel 2C")

Topological phases of unitary dynamics: Classification in Clifford category (in session "Parallel 7B")

Unique Games hardness of Quantum Max-Cut, and a conjectured vector-valued Borell's inequality (in session "Parallel 4A")

Unitary property testing lower bounds by polynomials (in session "Parallel 7A")

Universal lower bound on topological entanglement entropy (in session "Parallel 7B")

Universal trade-off structure between symmetry, irreversibility and quantum coherence for quantum processes (in session "Parallel 4C")

Welcome: Local organizers (in session "Welcome")

Welcome: Mathias De Clercq, Mayor of Ghent (in session "Welcome")

Welcome: Petra De Sutter, Federal Deputy Prime Minister, Minister of Telecommunication, Professor at Ghent University (in session "Welcome")

Why interference phenomena do not capture the essence of quantum theory (in session "Parallel 4C")

Quantum Information Processing 2023

Contact

Material Package