Accuracy and Compactness in Decision Diagrams for Quantum Computation
Alwin Zulehner1,a, Philipp Niemann2,c, Rolf Drechsler2,3,d and Robert Wille1,b
1Institute for Integrated Circuits, Johannes Kepler University Linz, Austria
aalwin.zulehner@jku.at
brobert.wille@jku.at
2Cyber-Physical Systems, DFKI GmbH, Bremen, Germany
cphilipp.niemann@dfki.de
3Department of Computer Science, University of Bremen, Bremen, Germany
ddrechsle@informatik.uni-bremen.de
ABSTRACT
Quantum computation is a promising research field since it allows to conduct certain tasks exponentially faster than on conventional machines. As in the conventional domain, decision diagrams are heavily used in different design tasks for quantum computation like synthesis, verification, or simulation. However, unlike decision diagrams for the conventional domain, decision diagrams for quantum computation as of now suffer from a trade-off between accuracy and compactness that requires parameter fine-tuning on a case-by-case basis. In this work, we—for the first time—describe and evaluate the effects of this trade-off. Moreover, we propose an alternative approach that utilizes an algebraic representation of the occurring irrational numbers and outline how this can be incorporated in a decision diagram in order to overcome this trade-off.
