The Basis of Design Tools for Quantum Computing: Arrays, Decision Diagrams, Tensor Networks, and ZX-Calculus

Abstract

Quantum computers promise to efficiently solve important problems classical computers never will. However, in order to capitalize on these prospects, a fully automated quantum software stack needs to be developed. This involves a multitude of complex tasks from the classical simulation of quantum circuits, over their compilation to specific devices, to the verification of the circuits to be executed as well as the obtained results. All of these tasks are highly non-trivial and necessitate efficient data structures to tackle the inherent complexity. Starting from rather straight-forward arrays over decision diagrams (inspired by the design automation community) to tensor networks and the ZX-calculus, various complementary approaches have been proposed. This work provides a look "under the hood" of today's tools and showcases how these means are utilized in them, e.g., for simulation, compilation, and verification of quantum circuits.

arXiv comment6 pages, 3 figures, Invited paper at the Design Automation Conference 2022

References in corpus (16)

• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• Hardware-efficient Variational Quantum Eigensolver for Small Molecules and Quantum Magnets
• Matrix Product States and Projected Entangled Pair States: Concepts, Symmetries, and Theorems
• Hand-waving and Interpretive Dance: An Introductory Course on Tensor Networks
• Improved classical simulation of quantum circuits dominated by Clifford gates
• Provably efficient machine learning for quantum many-body problems
• Graph-theoretic Simplification of Quantum Circuits with the ZX-calculus
• A Software Methodology for Compiling Quantum Programs
• Massively parallel quantum computer simulator, eleven years later
• Towards Large-scale Functional Verification of Universal Quantum Circuits
• A Survey of Quantum Computing for Finance
• How to Efficiently Handle Complex Values? Implementing Decision Diagrams for Quantum Computing
• Simulating quantum circuits with ZX-calculus reduced stabiliser decompositions
• Techniques to Reduce $\pi /4$-Parity-Phase Circuits, Motivated by the ZX Calculus
• As Accurate as Needed, as Efficient as Possible: Approximations in DD-based Quantum Circuit Simulation
• A Tensor Network based Decision Diagram for Representation of Quantum Circuits

Cited by in corpus (2)

• Procedurally Optimised ZX-Diagram Cutting for Efficient T-Decomposition in Classical Simulation
• Fast Classical Simulation of Quantum Circuits via Parametric Rewriting in the ZX-Calculus