The reviewed record of science sign in
Pith

arxiv: 2301.04147 · v1 · pith:WTCDVVBF · submitted 2023-01-10 · quant-ph · cs.DS· cs.ET

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

Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:WTCDVVBFrecord.jsonopen to challenge →

classification quant-ph cs.DScs.ET
keywords quantumcircuitsarraysclassicalcompilationcomputersdecisiondesign
0
0 comments X
read the original 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.