Binary superposed quantum decision diagrams (Q993479)

The key theme of this work is the binary superposed decision diagrams or BSQDDs for short. The basic idea that lies behind BSQDDs is to represent a quantum superposition as a decision diagram where each node on each branch of a BSQDD corresponds to a gate. Each of those gates is controlled by the path originated from the root of the decision diagram. Each branch of BSQDD represents a different part of the desired quantum superposition. It is proved in Theorem 9 that, given a sufficient set of gates, a BSQDD enables to represent any quantum superposition. In this sense BSQDDs are universal. Two transformation rules to manipulate and reduce BSQDDs are derived. The canonical form for BSQDDs is defined. It is demonstrated that BSQDDs have some advantages to initialize quantum superpositions compared to the existing approaches. One of them is that BSQDDs do not require the ancilla qubits. Several examples of BSQDDs are discussed.