Quantum Algorithms and Oracles with the Scalable ZX-calculus
arXiv:2104.01043 · doi:10.4204/EPTCS.343.10
Abstract
The ZX-calculus was introduced as a graphical language able to represent specific quantum primitives in an intuitive way. The recent completeness results have shown the theoretical possibility of a purely graphical description of quantum processes. However, in practice, such approaches are limited by the intrinsic low level nature of ZX calculus. The scalable notations have been proposed as an attempt to recover an higher level point of view while maintaining the topological rewriting rules of a graphical language. We demonstrate that the scalable ZX-calculus provides a formal, intuitive, and compact framework to describe and prove quantum algorithms. As a proof of concept, we consider the standard oracle-based quantum algorithms: Deutsch-Jozsa, Bernstein-Vazirani, Simon, and Grover algorithms, and we show they can be described and proved graphically.
arXiv commentIn Proceedings QPL 2021, arXiv:2109.04886
References in corpus (10)
- Quantum Mechanics helps in searching for a needle in a haystack
- Improved Simulation of Stabilizer Circuits
- Graph-theoretic Simplification of Quantum Circuits with the ZX-calculus
- Efficient magic state factories with a catalyzed |CCZ> to 2|T> transformation
- The ZX calculus is a language for surface code lattice surgery
- ZH: A Complete Graphical Calculus for Quantum Computations Involving Classical Non-linearity
- The Topology of Quantum Algorithms
- Effective Compression of Quantum Braided Circuits Aided by ZX-Calculus
- Pauli Fusion: a Computational Model to Realise Quantum Transformations from ZX Terms
- Abstract structure of unitary oracles for quantum algorithms