A Categorical Semantics of Quantum Protocols
LICS '04 Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science
Journal of the ACM (JACM)
Interacting Quantum Observables
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
Graph States and the Necessity of Euler Decomposition
CiE '09 Proceedings of the 5th Conference on Computability in Europe: Mathematical Theory and Computational Practice
Graphical reasoning in compact closed categories for quantum computation
Annals of Mathematics and Artificial Intelligence
Universal Blind Quantum Computation
FOCS '09 Proceedings of the 2009 50th Annual IEEE Symposium on Foundations of Computer Science
Computational depth complexity of measurement-based quantum computation
TQC'10 Proceedings of the 5th conference on Theory of quantum computation, communication, and cryptography
The compositional structure of multipartite quantum entanglement
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming: Part II
Environment and classical channels in categorical quantum mechanics
CSL'10/EACSL'10 Proceedings of the 24th international conference/19th annual conference on Computer science logic
Strong Complementarity and Non-locality in Categorical Quantum Mechanics
LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
| Hi-index | 0.00 |
We present a method for verifying measurement-based quantum computations, by producing a quantum circuit equivalent to a given deterministic measurement pattern. We define a diagrammatic presentation of the pattern, and produce a circuit via a rewriting strategy based on the generalised flow of the pattern. Unlike other methods for translating measurement patterns with generalised flow to circuits, this method uses neither ancilla qubits nor acausal loops.