Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

IEEE International Symposium on Multiple-Valued Logic (ISMVL)

QMDD: A Decision Diagram Structure for Reversible and Quantum Circuits

D. Michael Miller, Mitchell Aaron Thornton

Published Jan 1, 2006• 164 citations
Publisher

Abstract

In this paper, we present a novel structure, QuantumMultiple- valued Decision Diagrams (QMDD), specifically designed to represent and manipulate the matrices encountered in the specification of reversible and quantum gates and circuits, both binary and multiple-valued. QMDD use many common decision diagram techniques, ideas introduced in QuIDDPro and novel techniques introduced here. Building the QMDD for the matrices for individual gates and the subsequent construction of the QMDD for the matrix describing a circuit are discussed. A prototype C implementation is described and experimental results are given that show the new structure is a promising and compact representation for reversible and quantum logic circuits.

DOI
10.1109/ismvl.2006.35

Related papers

On the Data Structure Metrics of Quantum Multiple-Valued Decision Diagrams

David Y. Feinstein, Mitchell Aaron Thornton, D. Michael Miller

This paper describes new metrics for the data structure referred to as quantum multiple-valued decision diagrams (QMDD) which are used to represent the matrices describing reversible and quantum gates and circuits. These metrics provide information about QMDD that allows for improvement of minimization techniques. We explore metrics related to the frequency of edges with non-zero weight for the entire QMDD data structure and their histograms with respect to each variable. We observe some unique regularity particular to the methodology of the QMDD. We develop new heuristics for QMDD dynamic variable ordering (DVO) that are guided by the proposed metrics. Experimental results show the effectiveness of the proposed techniques.

IEEE International Symposium on Multiple-Valued Logic (ISMVL)•May 1, 2008•4 citations

Quantum Multiple-Valued Decision Diagrams Containing Skipped Variables.

David Y. Feinstein, Mitchell Aaron Thornton

Quantum multiple-valued decision diagrams (QMDD) are data structures that enable efficient representation and manipulation of unitary matrices representing reversible and quantum circuits. QMDDs are of the form of a rooted, directed, acyclic graph with initial and terminal vertices where each vertex is annotated with a variable name representing a circuit line. Directed paths from the intial to a terminal vertex can be represented as a sequence of variable names in the order in which they appear in the path. The existence of QMDD paths that do not contain all variable names, or “skipped variables”, has direct ramifications in the formula-tion of synthesis and other algorithms for reversible and quantum logic. Skipped variables are generally rare and tend to appear in quantum circuits that are intended to operate using superimposed values on the control lines. We have found that a unitary matrix representing a circuit whose QMDD contains skipped variables is likely to exhibit a specific anomaly when decomposed into a cascade of unitary matrices using the Reck-Zeilinger-Bernstein-Bertani algorithm.

•Jan 1, 2015•2 citations

A Decision Diagram Package for Reversible and Quantum Circuit Simulation

D. Michael Miller, Mitchell Aaron Thornton, David A. Goodman

This paper presents a decision diagram structure intended for the simulation and verification of reversible and quantum circuits. The structure is designed to efficiently represent the matrices describing reversible and quantum gate and circuit behaviour and takes advantage of key properties of those matrices. Algorithms are described for efficiently building the decision diagram representation directly from a gate without constructing the actual matrix and for performing matrix multiplication which is the fundamental operation to determine the function realized by a cascade of gates. Experimental results show the methods presented are applicable to large circuits at the state of the art in reversible and quantum synthesis and design.

IEEE Congress on Evolutionary Computation (CEC)•Sep 22, 2006•22 citations

Analysis of Variable Reordering on the QMDD Representation of Quantum Circuits

Sharon Van Schaick, Kenneth Blair Kent

In previous research, a novel structure was discussed for representing the matrices that can be built from an n-variable r-valued reversible/quantum circuit. This structure, called a QMDD, takes on a form similar to that of a reduced-ordered-binary-decision-diagram (ROBDD). It is known that the order of variables used for developing an ROBDD from a binary logic circuit is relevant to the size and structure of that ROBDD. This paper determines what effect, if any, variable order has on the QMDD structure and proposes a simple heuristic for choosing a 'good' variable order.

Euromicro Conference on Digital System Design (DSD)•Aug 1, 2007•2 citations

Variable Reordering and Sifting for QMDD

D. Michael Miller, David Y. Feinstein, Mitchell Aaron Thornton

This paper considers variable reordering for quantum multiple-valued decision diagrams (QMDD) used to represent the matrices describing reversible and quantum gates and circuits. An efficient method for adjacent variable interchange is presented and this method is employed to implement sifting of QMDDs. Experimental results are presented showing the effectiveness of the proposed techniques.

IEEE International Symposium on Multiple-Valued Logic (ISMVL)•May 1, 2007•6 citations

On the Skipped Variables of Quantum Multiple-Valued Decision Diagrams

David Y. Feinstein, Mitchell Aaron Thornton

The data structure referred to as quantum multiple-valued decision diagrams (QMDD) is used to efficiently represent the unitary matrices describing reversible and quantum circuits. This paper investigates the conditions that cause skipped variables to appear in the QMDD of some binary and ternary quantum circuits. We have found that a unitary matrix that produces a skipped variable in a QMDD is likely to cause a specific anomaly when it is decomposed into a cascade of two-level unitary matrices by the Beck-Zeilinger-Bernstein-Bertani algorithm.

IEEE International Symposium on Multiple-Valued Logic (ISMVL)•May 1, 2011•5 citations
In this paper, we present a novel structure, QuantumMultiple- valued Decision Diagrams (QMDD), specifically designed to represent and manipulate the matrices encountered in the specification of reversible and quantum gates and circuits, both binary and multiple-valued. QMDD use many common decision diagram techniques, ideas introduced in QuIDDPro and novel techniques introduced here. Building the QMDD for the matrices for individual gates and the subsequent construction of the QMDD for the matrix describing a circuit are discussed. A prototype C implementation is described and experimental results are given that show the new structure is a promising and compact representation for reversible and quantum logic circuits.
This paper describes new metrics for the data structure referred to as quantum multiple-valued decision diagrams (QMDD) which are used to represent the matrices describing reversible and quantum gates and circuits. These metrics provide information about QMDD that allows for improvement of minimization techniques. We explore metrics related to the frequency of edges with non-zero weight for the entire QMDD data structure and their histograms with respect to each variable. We observe some unique regularity particular to the methodology of the QMDD. We develop new heuristics for QMDD dynamic variable ordering (DVO) that are guided by the proposed metrics. Experimental results show the effectiveness of the proposed techniques.
Quantum multiple-valued decision diagrams (QMDD) are data structures that enable efficient representation and manipulation of unitary matrices representing reversible and quantum circuits. QMDDs are of the form of a rooted, directed, acyclic graph with initial and terminal vertices where each vertex is annotated with a variable name representing a circuit line. Directed paths from the intial to a terminal vertex can be represented as a sequence of variable names in the order in which they appear in the path. The existence of QMDD paths that do not contain all variable names, or “skipped variables”, has direct ramifications in the formula-tion of synthesis and other algorithms for reversible and quantum logic. Skipped variables are generally rare and tend to appear in quantum circuits that are intended to operate using superimposed values on the control lines. We have found that a unitary matrix representing a circuit whose QMDD contains skipped variables is likely to exhibit a specific anomaly when decomposed into a cascade of unitary matrices using the Reck-Zeilinger-Bernstein-Bertani algorithm.
This paper presents a decision diagram structure intended for the simulation and verification of reversible and quantum circuits. The structure is designed to efficiently represent the matrices describing reversible and quantum gate and circuit behaviour and takes advantage of key properties of those matrices. Algorithms are described for efficiently building the decision diagram representation directly from a gate without constructing the actual matrix and for performing matrix multiplication which is the fundamental operation to determine the function realized by a cascade of gates. Experimental results show the methods presented are applicable to large circuits at the state of the art in reversible and quantum synthesis and design.
In previous research, a novel structure was discussed for representing the matrices that can be built from an n-variable r-valued reversible/quantum circuit. This structure, called a QMDD, takes on a form similar to that of a reduced-ordered-binary-decision-diagram (ROBDD). It is known that the order of variables used for developing an ROBDD from a binary logic circuit is relevant to the size and structure of that ROBDD. This paper determines what effect, if any, variable order has on the QMDD structure and proposes a simple heuristic for choosing a 'good' variable order.
The data structure referred to as quantum multiple-valued decision diagrams (QMDD) is used to efficiently represent the unitary matrices describing reversible and quantum circuits. This paper investigates the conditions that cause skipped variables to appear in the QMDD of some binary and ternary quantum circuits. We have found that a unitary matrix that produces a skipped variable in a QMDD is likely to cause a specific anomaly when it is decomposed into a cascade of two-level unitary matrices by the Beck-Zeilinger-Bernstein-Bertani algorithm.