Simon Perdrix

From MaRDI portal
Person:496042

Available identifiers

zbMath Open perdrix.simonMaRDI QIDQ496042

List of research outcomes





PublicationDate of PublicationType
A generic normal form for ZX-diagrams and application to the rational angle completeness2024-12-19Paper
Quantum expectation transformers for cost analysis2024-12-06Paper
Quantum algorithms and oracles with the scalable ZX-calculus2024-11-29Paper
Theoretical computer science: computability, decidability and logic2024-09-11Paper
Theoretical computer science: computational complexity2024-09-11Paper
LO\(_\text{v}\)-calculus: a graphical language for linear optical quantum circuits2024-08-06Paper
Resource optimisation of coherently controlled quantum computations with the PBS-calculus2024-08-06Paper
Addition and differentiation of ZX-diagrams2024-06-27Paper
Addition and differentiation of ZX-diagrams2024-05-27Paper
Reversible causal graph dynamics: invertibility, block representation, vertex-preservation2024-02-09Paper
https://portal.mardi4nfdi.de/entity/Q61684352023-08-08Paper
Hybrid quantum-classical circuit simplification with the ZX-calculus2023-03-29Paper
Outcome determinism in measurement-based quantum computation with qudits2023-03-02Paper
https://portal.mardi4nfdi.de/entity/Q50912702022-07-21Paper
https://portal.mardi4nfdi.de/entity/Q50924172022-07-21Paper
https://portal.mardi4nfdi.de/entity/Q50891882022-07-18Paper
https://portal.mardi4nfdi.de/entity/Q50206302022-01-06Paper
https://portal.mardi4nfdi.de/entity/Q33849222021-12-17Paper
https://portal.mardi4nfdi.de/entity/Q50147792021-12-08Paper
https://portal.mardi4nfdi.de/entity/Q49972682021-06-29Paper
https://portal.mardi4nfdi.de/entity/Q49866602021-04-27Paper
https://portal.mardi4nfdi.de/entity/Q58564012021-03-26Paper
https://portal.mardi4nfdi.de/entity/Q51466562021-01-26Paper
A Complete Axiomatisation of the ZX-Calculus for Clifford+T Quantum Mechanics2021-01-20Paper
Diagrammatic Reasoning beyond Clifford+T Quantum Mechanics2021-01-20Paper
Quantum programming with inductive datatypes: causality and affine type theory2020-09-23Paper
https://portal.mardi4nfdi.de/entity/Q51148292020-06-26Paper
https://portal.mardi4nfdi.de/entity/Q51112252020-05-26Paper
Contextuality in multipartite pseudo-telepathy graph games2019-11-29Paper
Graph-theoretic Simplification of Quantum Circuits with the ZX-calculus2019-02-08Paper
A complete characterization of all-versus-nothing arguments for stabilizer states2018-12-12Paper
https://portal.mardi4nfdi.de/entity/Q46086392018-03-21Paper
Determinism and computational power of real measurement-based quantum computation2017-11-22Paper
Contextuality in multipartite pseudo-telepathy graph games2017-11-22Paper
https://portal.mardi4nfdi.de/entity/Q29584342017-02-01Paper
Partial observation of quantum Turing machines and a weaker well-formedness condition2016-10-07Paper
Reversibility in Extended Measurement-Based Quantum Computation2016-09-30Paper
Reversible Causal Graph Dynamics2016-08-10Paper
Minimum Degree Up to Local Complementation: Bounds, Parameterized Complexity, and Exact Algorithms2016-01-11Paper
New Protocols and Lower Bounds for Quantum Secret Sharing with Graph States2015-12-03Paper
Which Graph States are Useful for Quantum Information Processing?2015-11-20Paper
Quantum Circuits for the Unitary Permutation Problem2015-09-30Paper
Block Representation of Reversible Causal Graph Dynamics2015-09-29Paper
On weak odd domination and graph-based quantum secret sharing2015-09-16Paper
Call-by-value, call-by-name and the vectorial behaviour of the algebraic \lambda-calculus2015-01-15Paper
Bases in Diagrammatic Quantum Protocols2014-05-13Paper
The Parameterized Complexity of Domination-Type Problems and Application to Linear Codes2014-04-16Paper
Towards a quantum calculus (work in progress, extended abstract)2014-01-17Paper
Quantum patterns and types for entanglement and separability2013-12-06Paper
A hierarchy of quantum semantics2013-12-06Paper
Classically-controlled quantum computation2013-10-02Paper
Parameterized Complexity of Weak Odd Domination Problems2013-08-16Paper
Environment and Classical Channels in Categorical Quantum Mechanics2013-01-07Paper
On the Minimum Degree Up to Local Complementation: Bounds and Complexity2012-11-06Paper
Optimal accessing and non-accessing structures for graph protocols2011-09-28Paper
Computational Depth Complexity of Measurement-Based Quantum Computation2011-01-28Paper
Rewriting Measurement-Based Quantum Computations with Generalised Flow2010-09-07Paper
Environment and Classical Channels in Categorical Quantum Mechanics2010-09-03Paper
Graph States and the Necessity of Euler Decomposition2010-07-28Paper
https://portal.mardi4nfdi.de/entity/Q35608422010-05-14Paper
https://portal.mardi4nfdi.de/entity/Q35608412010-05-14Paper
Finding Optimal Flows Efficiently2008-08-28Paper
Quantum Entanglement Analysis Based on Abstract Interpretation2008-08-28Paper
Resources Required for Preparing Graph States2008-04-24Paper
Classically controlled quantum computation2006-08-28Paper

Research outcomes over time

This page was built for person: Simon Perdrix