Graph-Based Algorithms for Boolean Function Manipulation
IEEE Transactions on Computers
Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
SIAM Journal on Computing
Feynman and computation: exploring the limits of computers
Feynman and computation: exploring the limits of computers
Quantum computation and quantum information
Quantum computation and quantum information
Algebric Decision Diagrams and Their Applications
Formal Methods in System Design
Improving Gate-Level Simulation of Quantum Circuits
Quantum Information Processing
Data structures and algorithms for simplifying reversible circuits
ACM Journal on Emerging Technologies in Computing Systems (JETC)
Proceedings of the 44th annual Design Automation Conference
Optimal realizations of simplified Toffoli gates
Quantum Information & Computation
Quantum circuits for incompletely specified two-qubit operators
Quantum Information & Computation
Graph-based simulation of quantum computation in the density matrix representation
Quantum Information & Computation
An efficient method for generating exhaustive test sets
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Synthesis of quantum-logic circuits
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Enhancing debugging of multiple missing control errors in reversible logic
Proceedings of the 20th symposium on Great lakes symposium on VLSI
Fast equivalence-checking for quantum circuits
Proceedings of the 2010 IEEE/ACM International Symposium on Nanoscale Architectures
Reducing the number of lines in reversible circuits
Proceedings of the 47th Design Automation Conference
Proceedings of the Conference on Design, Automation and Test in Europe
Integration, the VLSI Journal
Fast equivalence-checking for quantum circuits
Quantum Information & Computation
RevKit: an open source toolkit for the design of reversible circuits
RC'11 Proceedings of the Third international conference on Reversible Computation
Reversible circuits: recent accomplishments and future challenges for an emerging technology
VDAT'12 Proceedings of the 16th international conference on Progress in VLSI Design and Test
Synthesis and optimization of reversible circuits—a survey
ACM Computing Surveys (CSUR)
Reversible logic synthesis by quantum rotation gates
Quantum Information & Computation
| Hi-index | 0.00 |
Among the post-CMOS technologies currently under investigation, quantum computing (QC) holds a special place. QC offers not only extremely small size and low power, but also exponential speed-ups for important simulation and optimization problems. It also poses new CAD problems that are similar to, but more challenging, than the related problems in classical (non-quantum) CAD, such as determining if two states or circuits are functionally equivalent. While differences in classical states are easy to detect, quantum states, which are represented by complex-valued vectors, exhibit subtle differences leading to several notions of equivalence. This provides flexibility in optimizing quantum circuits, but leads to difficult new equivalence-checking issues for simulation and synthesis. We identify several different equivalence-checking problems and present algorithms for practical benchmarks, including quantum communication and search circuits, which are shown to be very fast and robust for hundreds of qubits.