2
program roles
19
collaborators
2015–2026
years active
Contributions
QIP QCrypt TQC talk poster presenter award · △program ◇steering ○organizing · filled = chair
5 Talks
| Title | Conference | Type | Co-authors |
|---|---|---|---|
| Unitary embeddings: Linking gate teleportation to circuit synthesis | QIP 2022 | regular | Matthew Amy, Matthew Crawford, ▸Andrew Glaudell, Melissa Macasieb, Samuel Mendelson |
| Qutrit Metaplectic Gates Are a Subset of Clifford+T | TQC 2022 | regular | Andrew Glaudell, John van de Wetering, Lia Yeh |
| Toward the first quantum simulation with quantum speedup | QIP 2018 | regular | Andrew Childs, Dmitri Maslov, Yunseong Nam, ▸Yuan Su |
| Canonical forms for single-qutrit Clifford+T operators | TQC 2018 | regular | Andrew Glaudell, Jacob Taylor |
| Optimal ancilla-free Clifford+T approximation of z-rotations | QIP 2015 | plenary | Peter Selinger |
4 Posters
| Title | Conference | Co-authors |
|---|---|---|
| A Complete and Natural Rule Set for Multi-Qudit Clifford Circuits in All Odd Prime Dimensions | TQC 2026 | Xiaoning Bian, Sarah Meng Li, John van de Wetering, Yuming Zhao |
We present a complete set of rewrite rules for multi-qudit Clifford circuits, where \emph{qudit} denotes a d-level quantum system with d an odd prime. Completeness means that any two Clifford circuits representing the same linear map can be transformed into each other using these rules. In total, there are 19 \emph{Clifford relations}, each involving at most three qudits and admitting an intuitive interpretation. Our approach leverages the isomorphism between the symplectic group $\mathrm{Sp}(2n, \mathbb{Z}_d)$ and the quotient of the Clifford group by the Pauli group. We first derive a complete set of \emph{symplectic relations} for $\mathrm{Sp}(2n, \mathbb{Z}_d)$, and then lift them to Clifford relations by incorporating Pauli corrections. To do this, we introduce a \emph{symplectic normal form} that captures the stabiliser tableau of a Clifford operator and is unique up to Pauli correction. This simplification enables a streamlined derivation of a complete set of 66 relations, which we further compress to 18 symplectic relations. Our computations in $\mathrm{Sp}(2n, \mathbb{Z}_d)$ are formalised in the Agda proof assistant, providing a machine-verified proof of correctness. |
||
| Exact synthesis of (almost certainly) T-optimal single-qutrit Clifford+T normal forms | QIP 2018 | Andrew Glaudell, Jacob Taylor |
| Graphical Methods in Device-Independent Quantum Cryptography | QIP 2018 | Carl Miller, Spencer Breiner |
| A finite presentation of CNOT-dihedral operators | TQC 2017 | Matthew Amy, Jianxin Chen |
Committee service
| Conference | Committee | Position | Title |
|---|---|---|---|
| QIP 2026 | program | member | — |
| TQC 2017 | program | member | — |
Collaborators
| Co-author | Joint talks |
|---|---|
| Andrew Glaudell | 4 |
| Jacob Taylor | 2 |
| John van de Wetering | 2 |
| Matthew Amy | 2 |
| Andrew Childs | 1 |
| Carl Miller | 1 |
| Dmitri Maslov | 1 |
| Jianxin Chen | 1 |
| Lia Yeh | 1 |
| Matthew Crawford | 1 |
| Melissa Macasieb | 1 |
| Peter Selinger | 1 |
| Samuel Mendelson | 1 |
| Sarah Meng Li | 1 |
| Spencer Breiner | 1 |
| Xiaoning Bian | 1 |
| Yuan Su | 1 |
| Yuming Zhao | 1 |
| Yunseong Nam | 1 |