IQC-PCQT Workshop

Arjan Cornelissen,  Institut de Recherche en Informatique Fondamentale

Quantum algorithms for volume estimation

Claude Crepeau, McGill University

Do unicorns have wings?

Vahid Asadi, Institute for Quantum Computing

Lower Bounds on Entanglement and Quantum Gates in Non-local Quantum Computation

Kieran Mastel, Institute for Quantum Computing

Two Prover Perfect Zero Knowledge for MIP*

Daniel Szabo, Université Paris Cité

Estimating Betti numbers

Maël Luce, Université Paris Cité

Even-Cycle Detection in the Randomized and Quantum CONGEST Model

Ningping Cao, Institute for Quantum Computing

Quantum Dynamics between CPTP and HPTP

Srijita Kundu, Institute for Quantum Computing

Oracle separation of QMA and QCMA with bounded adaptivity

Simon Apers, Institut de Recherche en Informatique Fondamentale

Quantum walks, the discrete wave equation and Chebyshev polynomials

11:30 am

Connor Paddock, University of Ottawa

Soundness for compiled XOR games against quantum provers

Samuel Bouaziz, Simons Institute for the Theory of Computing

Quantum Pseudorandomness Cannot Be Shrunk In a Black-Box Way

David Gosset, Institute for Quantum Computing

Triply efficient shadow tomography

Roman Edenhofer, Université Paris Cité

Counting Paths in Quantum Logspace

Elie Bermot, Université Paris Cité

Exploring Quantum Annealing and Tunneling: Harnessing their Potential for Independent Set Sampling

Eric Culf, Institute for Quantum Computing

Approximation algorithms for noncommutative constraint satisfaction problems

Arthur Mehta, University of Ottawa

On the Monogamy of Non-local Games