UC Logo
Institute for Quantum Science and Technology

Presentations by C. Paddock

    2026

  1. 21 Mar 2026, C. Paddock, A computable mapping from Turing machines to boolean constraint system nonlocal games using *-algebraic techniques (invited), Graduate Mini-school around Sofic Groups and the Connes Embedding Problem, Austin, Texas, United States of America, 21 Mar 2026 - 21 Mar 2026.

  2. 24 Jan 2026, C. Paddock, The NPA hierarchy does not always attain the commuting operator value (contributed), The 29th Annual Quantum Information Processing Conference (QIP 2026), Riga, Latvia, 24 Jan 2026 - 30 Jan 2026.

  3. 24 Jan 2026, C. Paddock, Quantitative quantum soundness for bipartite compiled Bell games via the sequential NPA hierarchy (contributed), The 29th Annual Quantum Information Processing Conference (QIP 2026), 24 Jan 2026 - 30 Jan 2026.

    4. 2025

  4. 3 Oct 2025, C. Paddock, Undecidability of a commuting operator value problem and consequences for the NPA hierarchy (invited), University of Ottawa, QUASAR Seminar.

  5. 6 Jun 2025, C. Paddock, Using nonlocal games to verify quantum computation through cryptographic compilation (invited), Ontario Cryptography Day, Toronto, Ontario, Canada, 6 Jun 2025 - 6 Jun 2025.