116 citations · 420 across the 22 of their papers we have counts for
24 papers
Finding gflow on unlabelled open graphs
Miriam Backens, Victor Gasse, Piotr Mitosek +1
The one-way model of measurement-based quantum computing implements computations via successive adaptive single-qubit measurements on a resource graph state. This model has practic…
Completeness for flow-preserving rewrite rules
Miriam Backens, Simon Perdrix
Complete sets of graphical rewrite rules enable fully graphical reasoning about quantum computations and have been an area of active research for more than a decade. Many recent ap…
Generating one-way computations with flow: flow-preserving rewriting that ignores the interpretation
Miriam Backens
The one-way model is a universal model of quantum computation, driven by successive adaptive single-qubit measurements on an entangled resource state. Measurements are non-determin…
Working with measurement-based computations on qudits
Piotr Mitosek, Miriam Backens
Measurement-based quantum computing is a universal model of quantum computation in which successive product measurements of an entangled resource state drive the computation. The n…
Inserting Planar-Measured Qubits into MBQC Patterns while Preserving Flow
Miriam Backens, Thomas Perez
In the one-way model of measurement-based quantum computation (MBQC), computation proceeds via single-qubit measurements on a resource state. Flow conditions ensure that the overal…
An algebraic interpretation of Pauli flow, leading to faster flow-finding algorithms
Piotr Mitosek, Miriam Backens
The one-way model of quantum computation is an alternative to the circuit model. A one-way computation is driven entirely by successive adaptive measurements of a pre-prepared enta…
Flow-preserving ZX-calculus Rewrite Rules for Optimisation and Obfuscation
Tommy McElvanney, Miriam Backens
In the one-way model of measurement-based quantum computation (MBQC), computation proceeds via measurements on a resource state. So-called flow conditions ensure that the overall c…
Complete Flow-Preserving Rewrite Rules for MBQC Patterns with Pauli Measurements
Tommy McElvanney, Miriam Backens
In the one-way model of measurement-based quantum computation (MBQC), computation proceeds via measurements on some standard resource state. So-called flow conditions ensure that t…
A full dichotomy for Holant, inspired by quantum computation
Miriam Backens
Holant problems are a family of counting problems parameterised by sets of algebraic-complex valued constraint functions, and defined on graphs. They arise from the theory of holog…
Proceedings 18th International Conference on Quantum Physics and Logic
Chris Heunen, Miriam Backens
This volume contains the proceedings of the 18th International Conference on Quantum Physics and Logic (QPL 2021), which was held June 7-11, 2021 at the University of Gdansk and on…
Completeness of the ZH-calculus
Miriam Backens, Aleks Kissinger, Hector Miller-Bakewell +2
There are various gate sets used for describing quantum computation. A particularly popular one consists of Clifford gates and arbitrary single-qubit phase gates. Computations in t…
There and back again: A circuit extraction tale
Miriam Backens, Hector Miller-Bakewell, Giovanni de Felice +2
Translations between the quantum circuit model and the measurement-based one-way model are useful for verification and optimisation of quantum computations. They make crucial use o…
Holant clones and the approximability of conservative holant problems
Miriam Backens, Leslie Ann Goldberg
We construct a theory of holant clones to capture the notion of expressibility in the holant framework. Their role is analogous to the role played by functional clones in the study…
ZH: A Complete Graphical Calculus for Quantum Computations Involving Classical Non-linearity
Miriam Backens, Aleks Kissinger
We present a new graphical calculus that is sound and complete for a universal family of quantum circuits, which can be seen as the natural string-diagrammatic extension of the app…
Boolean approximate counting CSPs with weak conservativity, and implications for ferromagnetic two-spin
Miriam Backens, Andrei Bulatov, Leslie Ann Goldberg +2
We analyse the complexity of approximate counting constraint satisfactions problems , where is a set of nonnegative rational-valued funct…
Towards a Minimal Stabilizer ZX-calculus
Miriam Backens, Simon Perdrix, Quanlong Wang
The stabilizer ZX-calculus is a rigorous graphical language for reasoning about quantum mechanics. The language is sound and complete: one can transform a stabilizer ZX-diagram int…
A complete dichotomy for complex-valued Holant^c
Miriam Backens
Holant problems are a family of counting problems on graphs, parametrised by sets of complex-valued functions of Boolean inputs. Holant^c denotes a subfamily of those problems, whe…
A new Holant dichotomy inspired by quantum computation
Miriam Backens
Holant problems are a framework for the analysis of counting complexity problems on graphs. This framework is simultaneously general enough to encompass many other counting problem…
The inductive entanglement classification yields ten rather than eight classes of four-qubit entangled states
Miriam Backens
Lamata et al. use an inductive approach to classify the entangled pure states of four qubits under stochastic local operations and classical communication (SLOCC) [PRA 75(2), 02231…
Completeness and the ZX-calculus
Miriam Backens
Graphical languages offer intuitive and rigorous formalisms for quantum physics. They can be used to simplify expressions, derive equalities, and do computations. Yet in order to r…
A Simplified Stabilizer ZX-calculus
Miriam Backens, Simon Perdrix, Quanlong Wang
The stabilizer ZX-calculus is a rigorous graphical language for reasoning about quantum mechanics.The language is sound and complete: a stabilizer ZX-diagram can be transformed int…
Making the stabilizer ZX-calculus complete for scalars
Miriam Backens
The ZX-calculus is a graphical language for quantum processes with built-in rewrite rules. The rewrite rules allow equalities to be derived entirely graphically, leading to the que…
The ZX-calculus is complete for the single-qubit Clifford+T group
Miriam Backens
The ZX-calculus is a graphical calculus for reasoning about pure state qubit quantum mechanics. It is complete for pure qubit stabilizer quantum mechanics, meaning any equality inv…
The ZX-calculus is complete for stabilizer quantum mechanics
Miriam Backens
The ZX-calculus is a graphical calculus for reasoning about quantum systems and processes. It is known to be universal for pure state qubit quantum mechanics, meaning any pure stat…