259 citations · 564 across the 8 of their papers we have counts for
6 papers · 1 filter
Automated Quantum Oracle Synthesis with a Minimal Number of Qubits
Jessie M. Henderson, Elena R. Henderson, Aviraj Sinha +2
Several prominent quantum computing algorithms--including Grover's search algorithm and Shor's algorithm for finding the prime factorization of an integer--employ subcircuits terme…
On quantum circuits employing roots of the Pauli matrices
Mathias Soeken, D. Michael Miller, Rolf Drechsler
The Pauli matrices are a set of three 2x2 complex Hermitian, unitary matrices. In this article, we investigate the relationships between certain roots of the Pauli matrices and how…
DDMF: An Efficient Decision Diagram Structure for Design Verification of Quantum Circuits under a Practical Restriction
Shigeru Yamashita, Shin-ichi Minato, D. Michael Miller
Recently much attention has been paid to quantum circuit design to prepare for the future "quantum computation era." Like the conventional logic synthesis, it should be important t…
Techniques for the Synthesis of Reversible Toffoli Networks
D. Maslov, D. M. Miller, G. W. Dueck
This paper presents novel techniques for the synthesis of reversible networks of Toffoli gates, as well as improvements to previous methods. Gate count and technology oriented cost…
Quantum Circuit Simplification and Level Compaction
D. Maslov, G. W. Dueck, D. M. Miller +1
Quantum circuits are time dependent diagrams describing the process of quantum computation. Usually, a quantum algorithm must be mapped into a quantum circuit. Optimal synthesis of…
Comparison of the Cost Metrics for Reversible and Quantum Logic Synthesis
Dmitri Maslov, D. Michael Miller
A breadth-first search method for determining optimal 3-line circuits composed of quantum NOT, CNOT, controlled-V and controlled-V+ (NCV) gates is introduced. Results are presented…