There and back again: A circuit extraction tale

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 of a property known as gflow. While gflow is defined for one-way computations allowing measurements in three different planes of the Bloch sphere, most research so far has focused on computations containing only measurements in the XY-plane. Here, we give the first circuit-extraction algorithm to work for one-way computations containing measurements in all three planes and having gflow. The algorithm is efficient and the resulting circuits do not contain ancillae. One-way computations are represented using the ZX-calculus, hence the algorithm also represents the most general known procedure for extracting circuits from ZX-diagrams. In developing this algorithm, we generalise several concepts and results previously known for computations containing only XY-plane measurements. We bring together several known rewrite rules for measurement patterns and formalise them in a unified notation using the ZX-calculus. These rules are used to simplify measurement patterns by reducing the number of qubits while preserving both the semantics and the existence of gflow. The results can be applied to circuit optimisation by translating circuits to patterns and back again.

[1]  Elham Kashefi,et al.  Parallelizing quantum circuits , 2007, Theor. Comput. Sci..

[2]  Scott Aaronson,et al.  Improved Simulation of Stabilizer Circuits , 2004, ArXiv.

[3]  J. Eisert,et al.  Multiparty entanglement in graph states , 2003, quant-ph/0307130.

[4]  Aleks Kissinger,et al.  Reducing the number of non-Clifford gates in quantum circuits , 2020, Physical Review A.

[5]  Aleks Kissinger,et al.  PyZX: Large Scale Automated Diagrammatic Reasoning , 2019, Electronic Proceedings in Theoretical Computer Science.

[6]  Bob Coecke,et al.  Interacting Quantum Observables , 2008, ICALP.

[7]  Elham Kashefi,et al.  Global Quantum Circuit Optimization , 2013, 1301.0351.

[8]  Mehdi Mhalla,et al.  Which Graph States are Useful for Quantum Information Processing? , 2010, TQC.

[9]  Simon Perdrix,et al.  A Complete Axiomatisation of the ZX-Calculus for Clifford+T Quantum Mechanics , 2017, LICS.

[10]  H. Briegel,et al.  Measurement-based quantum computation on cluster states , 2003, quant-ph/0301052.

[11]  E. Kashefi,et al.  Generalized flow and determinism in measurement-based quantum computation , 2007, quant-ph/0702212.

[12]  Michele Mosca,et al.  Parallelizing quantum circuit synthesis , 2016, 1606.07413.

[13]  Simon Perdrix,et al.  Reversibility in Extended Measurement-Based Quantum Computation , 2015, RC.

[14]  Simon Perdrix,et al.  Diagrammatic Reasoning beyond Clifford+T Quantum Mechanics , 2018, LICS.

[15]  Elham Kashefi,et al.  The measurement calculus , 2004, JACM.

[16]  Niel de Beaudrap.  UNITARY-CIRCUIT SEMANTICS FOR MEASUREMENT-BASED COMPUTATIONS , 2009, 0906.4261.

[17]  Simon Perdrix,et al.  Rewriting Measurement-Based Quantum Computations with Generalised Flow , 2010, ICALP.

[18]  R Raussendorf,et al.  A one-way quantum computer. , 2001, Physical review letters.

[19]  M. Mosca,et al.  A Meet-in-the-Middle Algorithm for Fast Synthesis of Depth-Optimal Quantum Circuits , 2012, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[20]  Raphael Dias da Silva,et al.  Compact quantum circuits from one-way quantum computation , 2013 .

[21]  Aleks Kissinger,et al.  Graph-theoretic Simplification of Quantum Circuits with the ZX-calculus , 2019, Quantum.

[22]  Quanlong Wang,et al.  Techniques to Reduce $\pi/4$-Parity-Phase Circuits, Motivated by the ZX Calculus , 2019 .

[23]  I. Chuang,et al.  Quantum Computation and Quantum Information: Bibliography , 2010 .

[24]  A. Kissinger,et al.  Universal MBQC with generalised parity-phase interactions and Pauli measurements , 2017, Quantum.

[25]  Elham Kashefi,et al.  Extended Measurement Calculus , 2009 .

[26]  Mehdi Mhalla,et al.  Graph States, Pivot Minor, and Universality of (X, Z)-Measurements , 2012, Int. J. Unconv. Comput..

[27]  J. Fitzsimons,et al.  Minimal qubit resources for the realization of measurement-based quantum computation , 2017, Physical Review A.

[28]  Bob Coecke,et al.  Interacting quantum observables: categorical algebra and diagrammatics , 2009, ArXiv.

[29]  Simon Perdrix,et al.  Graph States and the Necessity of Euler Decomposition , 2009, CiE.

[30]  Ross Duncan,et al.  Phase Gadget Synthesis for Shallow Circuits , 2019, QPL.

[31]  Mehdi Mhalla,et al.  Finding Optimal Flows Efficiently , 2007, ICALP.

[32]  J. Eisert,et al.  Entanglement in Graph States and its Applications , 2006, quant-ph/0602096.

[33]  Aleks Kissinger,et al.  CNOT circuit extraction for topologically-constrained quantum memories , 2019, Quantum Inf. Comput..

[34]  Aleks Kissinger,et al.  Picturing Quantum Processes: A First Course in Quantum Theory and Diagrammatic Reasoning , 2017 .

[35]  Mio Murao,et al.  An analysis of the trade-off between spatial and temporal resources for measurement-based quantum computation , 2013, 1310.4043.

[36]  Dmitri Maslov,et al.  Polynomial-Time T-Depth Optimization of Clifford+T Circuits Via Matroid Partitioning , 2013, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[37]  Renaud Vilmart,et al.  A Near-Minimal Axiomatisation of ZX-Calculus for Pure Qubit Quantum Mechanics , 2018, 2019 34th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS).

[38]  Elham Kashefi,et al.  Computational Depth Complexity of Measurement-Based Quantum Computation , 2009, TQC.

[39]  Dmitri Maslov,et al.  Optimization of Clifford Circuits , 2013, ArXiv.

[40]  Quanlong Wang,et al.  A universal completion of the ZX-calculus , 2017, ArXiv.

[41]  Aleks Kissinger,et al.  Reducing T-count with the ZX-calculus , 2019, 1903.10477.

[42]  Miriam Backens,et al.  Making the stabilizer ZX-calculus complete for scalars , 2015, 1507.03854.

[43]  Quanlong Wang,et al.  Two complete axiomatisations of pure-state qubit quantum computing , 2018, LICS.

[44]  Morteza Saheb Zamani,et al.  Quantum Circuit Synthesis Targeting to Improve One-Way Quantum Computation Pattern Cost Metrics , 2017, ACM J. Emerg. Technol. Comput. Syst..

[45]  E. Kashefi,et al.  Determinism in the one-way model , 2005, quant-ph/0506062.

[46]  Miriam Backens,et al.  The ZX-calculus is complete for stabilizer quantum mechanics , 2013, 1307.7025.

[47]  Simon Perdrix,et al.  Pivoting makes the ZX-calculus complete for real stabilizers , 2013, QPL.

[48]  Gregory V. Bard.  Achieving a log(n) Speed Up for Boolean Matrix Operations and Calculating the Complexity of the Dense Linear Algebra step of Algebraic Stream Cipher Attacks and of Integer Factorization Methods , 2006, IACR Cryptol. ePrint Arch..

[49]  Morteza Saheb Zamani,et al.  Optimization of One-Way Quantum Computation Measurement Patterns , 2017, International Journal of Theoretical Physics.

[50]  Bart De Moor,et al.  Graphical description of the action of local Clifford transformations on graph states , 2003, quant-ph/0308151.