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

SpringerBriefs in physics

Quantum Multiple-Valued Decision Diagrams

Philipp Niemann, Robert Wille

Published Jan 1, 2017• 4 citations
Publisher
DOI
10.1007/978-3-319-63724-2_4

Related papers

Quantum Multiple-Valued Decision Diagrams

Michael D. Miller, Mitchell Aaron Thornton

Synthesis lectures on digital circuits and systems•Jan 1, 2008•0 citations

Property Checking of Quantum Circuits Using Quantum Multiple-Valued Decision Diagrams

Julia Seiter, Mathias Soeken, Robert Wille +1 more

Lecture notes in computer science•Jan 1, 2013•20 citations

Minimization of Quantum Multiple-valued Decision Diagrams Using Data Structure Metrics.

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

•Jan 1, 2009•3 citations

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

Decision Diagrams for Quantum Computing

Robert Wille, Stefan Hillmich, Lukas Burgholzer

arXiv:2302.04687•Springer eBooks•Aug 13, 2022•22 citations

Quantum Multiple-Valued Decision Diagrams in Graphical Calculi

Renaud Vilmart

Graphical calculi such as the ZH-calculus are powerful tools in the study and analysis of quantum processes, with links to other models of quantum computation such as quantum circuits, measurement-based computing, etc. A somewhat compact but systematic way to describe a quantum process is through the use of quantum multiple-valued decision diagrams (QMDDs), which have already been used for the synthesis of quantum circuits as well as for verification. We show in this paper how to turn a QMDD into an equivalent ZH-diagram, and vice-versa, and show how reducing a QMDD translates in the ZH-Calculus, hence allowing tools from one formalism to be used into the other.

arXiv:2107.01186•Leibniz international proceedings in informatics•Jan 1, 2021•0 citations
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.
Graphical calculi such as the ZH-calculus are powerful tools in the study and analysis of quantum processes, with links to other models of quantum computation such as quantum circuits, measurement-based computing, etc. A somewhat compact but systematic way to describe a quantum process is through the use of quantum multiple-valued decision diagrams (QMDDs), which have already been used for the synthesis of quantum circuits as well as for verification. We show in this paper how to turn a QMDD into an equivalent ZH-diagram, and vice-versa, and show how reducing a QMDD translates in the ZH-Calculus, hence allowing tools from one formalism to be used into the other.