Lightning Talks
summary
A new construction claims to obfuscate any unitary quantum program using a classical oracle plus a random oracle (ePrint 2025/891) and even ships a QR-linked AI song; a reinforcement‑learning pipeline built in PennyLane + Python searches circuits and produces multiple Ingleton‑violating circuits (≈100 gates) and analyzes entanglement and non‑local magic; several complexity questions appear: the Clifford isomorphism problem is QCMA‑in QCMA, BQP‑hard and GI‑hard; practical deobfuscation succeeds via Gröbner basis attacks on structured instances; proposals stress “repeatable / quantumly verifiable” tasks.
AI-written summary · about
chapters (7)
- 0:00Introduction to workshop
- 0:36Quantum program obfuscation
- 9:20Reinforcement learning for entanglement
- 19:58Unitary synthesis conjecture
- 32:39Clifford isomorphism problem
- 44:19De-obfuscating quantum programs
- 1:01:48Quantum algorithms philosophy
related talks
02h 41mLightning Talks
49mQuantum Garbled Circuits
23mCommunity keynote - Quantum Computing: Mind-bogglingly weird!
02h 42mQuantum Computing Exposed: Deep Dive
06mLightning Talk: Quantum Computing and Superpositional Cats
33mVerified Compilation of Quantum Oracles
01h 10mQuantum Advantage with Shallow Clifford Circuits
01h 06mQuantum Advantage Without Structure