Graph-Based Algorithms for Boolean Function Manipulation
IEEE Transactions on Computers
QMDD: A Decision Diagram Structure for Reversible and Quantum Circuits
ISMVL '06 Proceedings of the 36th International Symposium on Multiple-Valued Logic
Analysis and synthesis of quantum circuits by using quantum decision diagrams
Proceedings of the conference on Design, automation and test in Europe: Proceedings
Techniques for the synthesis of reversible Toffoli networks
ACM Transactions on Design Automation of Electronic Systems (TODAES)
Checking equivalence of quantum circuits and states
Proceedings of the 2007 IEEE/ACM international conference on Computer-aided design
Reversible logic synthesis with Fredkin and Peres gates
ACM Journal on Emerging Technologies in Computing Systems (JETC)
An XQDD-Based Verification Method for Quantum Circuits
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
BDD-based synthesis of reversible logic for large functions
Proceedings of the 46th Annual Design Automation Conference
Quantum Circuit Simulation
Reversible circuit synthesis using a cycle-based approach
ACM Journal on Emerging Technologies in Computing Systems (JETC)
Quantum Computation and Quantum Information: 10th Anniversary Edition
Quantum Computation and Quantum Information: 10th Anniversary Edition
Block-based quantum-logic synthesis
Quantum Information & Computation
Constant-optimized quantum circuits for modular multiplication and exponentiation
Quantum Information & Computation
Synthesis of quantum-logic circuits
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Reversible Circuit Optimization Via Leaving the Boolean Domain
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Synthesis and optimization of reversible circuits—a survey
ACM Computing Surveys (CSUR)
| Hi-index | 0.00 |
A rotation-based synthesis framework for reversible logic is proposed. We develop a canonical representation based on binary decision diagrams and introduce operators to manipulate the developed representation model. Furthermore, a recursive functional bidecomposition approach is proposed to automatically synthesize a given function. While Boolean reversible logic is particularly addressed, our framework constructs intermediate quantum states that may be in superposition, hence we combine techniques from reversible Boolean logic and quantum computation. The proposed approach results in quadratic gate count for multiple-control Toffoli gates without ancillae, linear depth for quantum carry-ripple adder, and quasilinear size for quantum multiplexer.