Binary superposed quantum decision diagrams (Q993479)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Binary superposed quantum decision diagrams |
scientific article |
Statements
Binary superposed quantum decision diagrams (English)
0 references
20 September 2010
0 references
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.
0 references
quantum computing
0 references
quantum superposition
0 references
quantum gate
0 references
quantum initialization
0 references
quantum decision diagram
0 references
quantum array
0 references
quantum logic synthesis
0 references
binary superposed decision diagram
0 references
Ventura-Martinez algorithm
0 references
Long-Sun algorithm
0 references
transformation rule
0 references
reduction
0 references
node
0 references
Boolean function
0 references
qubit
0 references
canonical form
0 references
universality
0 references