| Publication | Date of Publication | Type |
|---|
| A generic normal form for ZX-diagrams and application to the rational angle completeness | 2024-12-19 | Paper |
| Quantum expectation transformers for cost analysis | 2024-12-06 | Paper |
| Quantum algorithms and oracles with the scalable ZX-calculus | 2024-11-29 | Paper |
| Theoretical computer science: computability, decidability and logic | 2024-09-11 | Paper |
| Theoretical computer science: computational complexity | 2024-09-11 | Paper |
| LO\(_\text{v}\)-calculus: a graphical language for linear optical quantum circuits | 2024-08-06 | Paper |
| Resource optimisation of coherently controlled quantum computations with the PBS-calculus | 2024-08-06 | Paper |
| Addition and differentiation of ZX-diagrams | 2024-06-27 | Paper |
| Addition and differentiation of ZX-diagrams | 2024-05-27 | Paper |
| Reversible causal graph dynamics: invertibility, block representation, vertex-preservation | 2024-02-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6168435 | 2023-08-08 | Paper |
| Hybrid quantum-classical circuit simplification with the ZX-calculus | 2023-03-29 | Paper |
| Outcome determinism in measurement-based quantum computation with qudits | 2023-03-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5091270 | 2022-07-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5092417 | 2022-07-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5089188 | 2022-07-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5020630 | 2022-01-06 | Paper |
| Y-calculus: a language for real matrices derived from the ZX-calculus | 2021-12-17 | Paper |
| A simplified stabilizer ZX-calculus | 2021-12-08 | Paper |
| Pivoting makes the \textsc{zx}-calculus complete for real stabilizers | 2021-06-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4986660 | 2021-04-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5856401 | 2021-03-26 | Paper |
| Information flow in secret sharing protocols | 2021-01-26 | Paper |
| A Complete Axiomatisation of the ZX-Calculus for Clifford+T Quantum Mechanics | 2021-01-20 | Paper |
| Diagrammatic reasoning beyond Clifford+T quantum mechanics | 2021-01-20 | Paper |
| Quantum programming with inductive datatypes: causality and affine type theory | 2020-09-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5114829 | 2020-06-26 | Paper |
| ZX-calculus: cyclotomic supplementarity and incompleteness for Clifford+T quantum mechanics | 2020-05-26 | Paper |
| Contextuality in multipartite pseudo-telepathy graph games | 2019-11-29 | Paper |
| Graph-theoretic Simplification of Quantum Circuits with the ZX-calculus | 2019-02-08 | Paper |
| A complete characterization of all-versus-nothing arguments for stabilizer states | 2018-12-12 | Paper |
| Supplementarity is necessary for quantum diagram reasoning | 2018-03-21 | Paper |
| Determinism and computational power of real measurement-based quantum computation | 2017-11-22 | Paper |
| Contextuality in multipartite pseudo-telepathy graph games | 2017-11-22 | Paper |
| Access structure in graphs in high dimension and application to secret sharing | 2017-02-01 | Paper |
| Partial observation of quantum Turing machines and a weaker well-formedness condition | 2016-10-07 | Paper |
| Reversibility in extended measurement-based quantum computation | 2016-09-30 | Paper |
| Reversible causal graph dynamics | 2016-08-10 | Paper |
| Minimum degree up to local complementation: bounds, parameterized complexity, and exact algorithms | 2016-01-11 | Paper |
| New protocols and lower bounds for quantum secret sharing with graph states | 2015-12-03 | Paper |
| Which Graph States are Useful for Quantum Information Processing? | 2015-11-20 | Paper |
| Quantum Circuits for the Unitary Permutation Problem | 2015-09-30 | Paper |
| Block representation of reversible causal graph dynamics | 2015-09-29 | Paper |
| On weak odd domination and graph-based quantum secret sharing | 2015-09-16 | Paper |
| Call-by-value, call-by-name and the vectorial behaviour of the algebraic \(\lambda \)-calculus | 2015-01-15 | Paper |
| Bases in diagrammatic quantum protocols | 2014-05-13 | Paper |
| The parameterized complexity of domination-type problems and application to linear codes | 2014-04-16 | Paper |
| Towards a quantum calculus (work in progress, extended abstract) | 2014-01-17 | Paper |
| Quantum patterns and types for entanglement and separability | 2013-12-06 | Paper |
| A hierarchy of quantum semantics | 2013-12-06 | Paper |
| Classically-controlled quantum computation | 2013-10-02 | Paper |
| Parameterized complexity of weak odd domination problems | 2013-08-16 | Paper |
| Environment and classical channels in categorical quantum mechanics | 2013-01-07 | Paper |
| On the minimum degree up to local complementation: bounds and complexity | 2012-11-06 | Paper |
| Optimal accessing and non-accessing structures for graph protocols | 2011-09-28 | Paper |
| Computational Depth Complexity of Measurement-Based Quantum Computation | 2011-01-28 | Paper |
| Rewriting measurement-based quantum computations with generalised flow | 2010-09-07 | Paper |
| Environment and classical channels in categorical quantum mechanics | 2010-09-03 | Paper |
| Graph states and the necessity of Euler decomposition | 2010-07-28 | Paper |
| Extended measurement calculus | 2010-05-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3560841 | 2010-05-14 | Paper |
| Finding Optimal Flows Efficiently | 2008-08-28 | Paper |
| Quantum Entanglement Analysis Based on Abstract Interpretation | 2008-08-28 | Paper |
| Resources Required for Preparing Graph States | 2008-04-24 | Paper |
| Classically controlled quantum computation | 2006-08-28 | Paper |
