Addressable quantum gates
summary
Introduces addressable quantum circuits: a circuit model that adds finite, consumable addresses as quantum data and alternates global scatter and transport steps to route qubits, implement EPR pair creation, and realize the quantum switch (superposition of orders) within purely unitary, synchronous evolution. Requires no repeated or created addresses and enforces name-blind scatterings (commuting with renamings); constructs an inductive family of admissible unitaries with exponentially fewer parameters; shows mapping into quantum causal-graph dynamics and leaves CPTP extension and full equivalence as open problems.
AI-written summary · about
chapters (20)
- 0:00Introduction
- 0:12Quantum Computing
- 1:57Example of quantum control flow
- 2:08Characteristics of our model
- 3:10Addressable Quantum Circuits
- 4:03Targets
- 4:34Evolution of the EPR pair AQC
- 5:59Use case for Address spaces
- 7:14Synchronous Evolution
- 8:06Principle of the Quantum Switch
- 8:25Textbook circuit representation
- 8:46Quantum Switch as an AQC
- 11:07Manipulating addresses
- 13:13Forbidden behaviour
- 14:29Definitions about renamings
- 17:41Pure Nameblind matrices
- 18:11Comparisons to other models
- 18:27Quantum Causal Graph Dynamics
- 21:07PBS calculus
- 22:43Outlook
related talks
27mQuantum Circuits Are Just a Phase
28mA type-theoretic account of quantum computation (Extended Abstract)
18mAutomated distribution of quantum circuits via hypergraph partitioning
20mTowards a Hierarchical Quantum Circuit Language
22mOptimal Two-Qubit Circuits for Universal Fault-Tolerant Quantum Computation
30mHow to fault-tolerantly realize any quantum circuit with local operations
03h 08mA quick introduction to quantum information and quantum circuits
19mThe Quantum Abstract Machine