Quantum Ordered Binary Decision Diagrams with Repeated Tests

TL;DR

This paper investigates how allowing repeated tests in quantum ordered binary decision diagrams (QOBDDs) enhances their computational power and provides methods for synthesizing QOBDDs based on Boolean operations.

Contribution

It introduces the concept of repeated tests in QOBDDs and explores their impact on computational capabilities, also detailing synthesis techniques for Boolean operations.

Findings

Repeated tests increase QOBDDs' computational power

Methods for synthesizing QOBDDs from Boolean operations

Enhanced understanding of quantum decision diagram capabilities

Abstract

Quantum branching programs (quantum binary decision diagrams, respectively) are a convenient tool for examining quantum computations using only a logarithmic amount of space. Recently several types of restricted quantum branching programs have been considered, e. g. read--once quantum branching programs. This paper considers quantum ordered binary decision diagrams (QOBDDs) and answers the question: How does the computational power of QOBDDs increase, if we allow repeated tests. Additionally it is described how to synthesize QOBDDs according to Boolean operations.