18
collaborators
2010–2026
years active
Contributions
QIP QCrypt TQC talk poster presenter award · △program ◇steering ○organizing · filled = chair
1 Talk
| Title | Conference | Type | Co-authors |
|---|---|---|---|
|
Fault Tolerance by Construction ↗
|
QIP 2026 | regular | ▸Benjamin Rodatz, Boldizsár Poór, Maximilian Rüsch |
A key challenge in fault-tolerant quantum computing is synthesising and optimising circuits in a noisy environment, as traditional techniques often fail to account for the effect of noise on circuits. In this work, we propose a framework for designing fault-tolerant quantum circuits that are correct by construction. The framework starts with idealised specifications of fault-tolerant gadgets and refines them using provably sound basic transformations. To reason about manipulating circuits while preserving their error correction properties, we define fault equivalence; two circuits are considered fault-equivalent if all undetectable faults on one circuit have a corresponding fault on the other. This guarantees that the effect of undetectable faults on both circuits is the same. We argue that fault equivalence is a concept that is already implicitly present in the literature. Many problems, such as state preparation and syndrome extraction, can be naturally expressed as finding an implementable circuit that is fault-equivalent to an idealised specification. To utilise fault equivalence in a computationally tractable manner, we adapt the ZX calculus, a diagrammatic language for quantum computing. We restrict its rewrite system to not only preserve the underlying linear map but also fault equivalence, i.e. the circuit's behaviour under noise. We show that this rewriting system is complete, meaning that two circuits are fault-equivalent if and only if one can be transformed into the other using fault-equivalent ZX rewrites. Enabled by our framework, we verify, optimise and synthesise new and efficient circuits for syndrome extraction and cat state preparation. We anticipate that fault equivalence can capture and unify different approaches in fault-tolerant quantum computing, paving the way for an end-to-end circuit compilation framework. |
|||
7 Posters
| Title | Conference | Co-authors |
|---|---|---|
| Graphical CSS Code Transformation Using ZX Calculus | QIP 2024 | Jiaxin Huang, Sarah Meng Li, Lia Yeh, Michele Mosca, Michael Vasmer |
| Optimal compilation of parametrised quantum circuits | QIP 2024 | John van de Wetering, Richie Yeung |
| Quantum Supermaps are Characterised by Locality | TQC 2023 | Matthew Wilson, Giulio Chiribella |
| Quantum Circuit Optimisation with the ZX-calculus | QIP 2020 | Ross Duncan, Simon Perdrix, John van de Wetering |
| Coherent Parity Check Construction for Quantum Error Correction | QIP 2017 | Dominic Horsman, Nicholas Chancellor, Stefan Zohren |
| Universal MBQC with Molmer-Sorenson interactions and two measurement bases | TQC 2017 | John van de Wetering |
| Interacting Frobenius Algebras and the Structure of Multipartite Entanglement | QIP 2010 | Bob Coecke |
Collaborators
| Co-author | Joint talks |
|---|---|
| John van de Wetering | 3 |
| Benjamin Rodatz | 1 |
| Bob Coecke | 1 |
| Boldizsár Poór | 1 |
| Dominic Horsman | 1 |
| Giulio Chiribella | 1 |
| Jiaxin Huang | 1 |
| Lia Yeh | 1 |
| Matthew Wilson | 1 |
| Maximilian Rüsch | 1 |
| Michael Vasmer | 1 |
| Michele Mosca | 1 |
| Nicholas Chancellor | 1 |
| Richie Yeung | 1 |
| Ross Duncan | 1 |
| Sarah Meng Li | 1 |
| Simon Perdrix | 1 |
| Stefan Zohren | 1 |