The following pages link to Simon Perdrix (Q496042):
Displaying 50 items.
- On weak odd domination and graph-based quantum secret sharing (Q496043) (← links)
- Determinism and computational power of real measurement-based quantum computation (Q1679995) (← links)
- Quantum programming with inductive datatypes: causality and affine type theory (Q2200848) (← links)
- Hybrid quantum-classical circuit simplification with the ZX-calculus (Q2691632) (← links)
- Reversibility in Extended Measurement-Based Quantum Computation (Q2822501) (← links)
- Partial Observation of Quantum Turing Machines and a Weaker Well-Formedness Condition (Q2825346) (← links)
- Parameterized Complexity of Weak Odd Domination Problems (Q2842778) (← links)
- (Q2851713) (← links)
- Quantum Patterns and Types for Entanglement and Separability (Q2864172) (← links)
- A Hierarchy of Quantum Semantics (Q2864503) (← links)
- Towards a Quantum Calculus (Q2870207) (← links)
- Call-by-value, call-by-name and the vectorial behaviour of the algebraic \lambda-calculus (Q2938763) (← links)
- Block Representation of Reversible Causal Graph Dynamics (Q2947893) (← links)
- Quantum Circuits for the Unitary Permutation Problem (Q2948477) (← links)
- (Q2958434) (← links)
- Computational Depth Complexity of Measurement-Based Quantum Computation (Q3070975) (← links)
- Reversible Causal Graph Dynamics (Q3186585) (← links)
- (Q3384922) (← links)
- Which Graph States are Useful for Quantum Information Processing? (Q3453320) (← links)
- New Protocols and Lower Bounds for Quantum Secret Sharing with Graph States (Q3455193) (← links)
- Minimum Degree Up to Local Complementation: Bounds, Parameterized Complexity, and Exact Algorithms (Q3459866) (← links)
- Finding Optimal Flows Efficiently (Q3521971) (← links)
- Quantum Entanglement Analysis Based on Abstract Interpretation (Q3522076) (← links)
- (Q3560841) (← links)
- (Q3560842) (← links)
- Graph States and the Necessity of Euler Decomposition (Q3576049) (← links)
- Environment and Classical Channels in Categorical Quantum Mechanics (Q3586045) (← links)
- Rewriting Measurement-Based Quantum Computations with Generalised Flow (Q3587446) (← links)
- A complete characterization of all-versus-nothing arguments for stabilizer states (Q4560686) (← links)
- (Q4608639) (← links)
- (Q4986660) (← links)
- (Q4997268) (← links)
- (Q5014779) (← links)
- (Q5020630) (← links)
- (Q5089188) (← links)
- (Q5091270) (← links)
- (Q5092417) (← links)
- (Q5111225) (← links)
- (Q5114829) (← links)
- A Complete Axiomatisation of the ZX-Calculus for Clifford+T Quantum Mechanics (Q5145332) (← links)
- Diagrammatic Reasoning beyond Clifford+T Quantum Mechanics (Q5145333) (← links)
- (Q5146656) (← links)
- On the Minimum Degree Up to Local Complementation: Bounds and Complexity (Q5200501) (← links)
- The Parameterized Complexity of Domination-Type Problems and Application to Linear Codes (Q5410637) (← links)
- Bases in Diagrammatic Quantum Protocols (Q5415635) (← links)
- Resources Required for Preparing Graph States (Q5459158) (← links)
- Classically controlled quantum computation (Q5482261) (← links)
- (Q5856401) (← links)
- Outcome determinism in measurement-based quantum computation with qudits (Q5879616) (← links)
- Contextuality in multipartite pseudo-telepathy graph games (Q5915755) (← links)
