Pith. sign in

A Tensor Network based Decision Diagram for Representation of Quantum Circuits

1 Pith paper cite this work. Polarity classification is still indexing.

1 Pith paper citing it
abstract

Tensor networks have been successfully applied in simulation of quantum physical systems for decades. Recently, they have also been employed in classical simulation of quantum computing, in particular, random quantum circuits. This paper proposes a decision diagram style data structure, called TDD (Tensor Decision Diagram), for more principled and convenient applications of tensor networks. This new data structure provides a compact and canonical representation for quantum circuits. By exploiting circuit partition, the TDD of a quantum circuit can be computed efficiently. Furthermore, we show that the operations of tensor networks essential in their applications (e.g., addition and contraction), can also be implemented efficiently in TDDs. A proof-of-concept implementation of TDDs is presented and its efficiency is evaluated on a set of benchmark quantum circuits. It is expected that TDDs will play an important role in various design automation tasks related to quantum circuits, including but not limited to equivalence checking, error detection, synthesis, simulation, and verification.

fields

cs.DS 1

years

2025 1

verdicts

CONDITIONAL 1

representative citing papers

A Matrix Product State Representation of Boolean Functions

cs.DS · 2025-05-03 · conditional · novelty 5.0

A matrix-product (tensor-train-like) representation of Boolean functions, built from row-switching matrices, is proven to be a canonical normal form equivalent to quasi-reduced binary decision diagrams.

citing papers explorer

Showing 1 of 1 citing paper.

  • A Matrix Product State Representation of Boolean Functions cs.DS · 2025-05-03 · conditional · none · ref 25 · internal anchor

    A matrix-product (tensor-train-like) representation of Boolean functions, built from row-switching matrices, is proven to be a canonical normal form equivalent to quasi-reduced binary decision diagrams.