DDMF: An Efficient Decision Diagram Structure for Design Verification of Quantum Circuits under a Practical Restriction

TL;DR

This paper introduces DDMFs, a novel decision diagram structure that enables efficient verification of quantum circuits under practical restrictions, improving upon previous methods and contributing new concepts like quantum and matrix functions.

Contribution

The paper presents DDMFs, a new decision diagram structure for quantum circuit verification, along with the concepts of quantum and matrix functions, demonstrating analytical advantages over existing techniques.

Findings

DDMF enables more efficient quantum circuit verification.

Analytical comparison shows DDMF's advantages over previous methods.

Introduction of quantum and matrix functions for circuit design.

Abstract

Recently much attention has been paid to quantum circuit design to prepare for the future "quantum computation era." Like the conventional logic synthesis, it should be important to verify and analyze the functionalities of generated quantum circuits. For that purpose, we propose an efficient verification method for quantum circuits under a practical restriction. Thanks to the restriction, we can introduce an efficient verification scheme based on decision diagrams called Decision Diagrams for Matrix Functions (DDMFs). Then, we show analytically the advantages of our approach based on DDMFs over the previous verification techniques. In order to introduce DDMFs, we also introduce new concepts, quantum functions and matrix functions, which may also be interesting and useful on their own for designing quantum circuits.