Year: 2020
Type: article
Abstract: We present a completely new approach to quantum circuit optimisation, based on the ZX-calculus. We first interpret quantum circuits as ZX-diagrams, which provide a flexible, lower-level language for describing quantum computations graphically. Then, using the rules of the ZX-calculus, we give a simplification strategy for ZX-diagrams based on the two graph transformations of local complementation and pivoting and show that the resulting reduced diagram can be transformed back into a quantum circuit. While little is known about extracting circuits from arbitrary ZX-diagrams, we show that the underlying graph of our simplified ZX-diagram always has a graph-theoretic property called generalised flow, which in turn yields a deterministic circuit extraction procedure. For Clifford circuits, this extraction procedure yields a new normal form that is both asymptotically optimal in size and gives a new, smaller upper bound on gate depth for nearest-neighbour architectures. For Clifford+T and more general circuits, our technique enables us to to `see around' gates that obstruct the Clifford structure and produce smaller circuits than naïve `cut-and-resynthesise' methods.
Source: Quantum
Authors: Ross Duncan, Aleks Kissinger, Simon Perdrix, John van de Wetering
Institutions: University of Strathclyde, Cambridge Quantum Computing (United Kingdom), University of Oxford, Centre National de la Recherche Scientifique, Institut national de recherche en sciences et technologies du numérique, Laboratoire Lorrain de Recherche en Informatique et ses Applications, MOCQUA: Modèles de calcul émergents, Université de Lorraine, Radboud University Nijmegen
Language: English
Subfield: Artificial Intelligence
Field: Computer Science
Domain: Physical Sciences
Open Access status: gold
Estimated APC paid: $215
OpenAlex ID: W2918135161
