A fast quantum mechanical algorithm for database search
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Quantum computation and quantum information
Quantum computation and quantum information
Logic Synthesis and Verification Algorithms
Logic Synthesis and Verification Algorithms
Random Benchmark Circuits with Controlled Attributes
EDTC '97 Proceedings of the 1997 European conference on Design and Test
A transformation based algorithm for reversible logic synthesis
Proceedings of the 40th annual Design Automation Conference
Evolutionary Approach to Quantum andReversible Circuits Synthesis
Artificial Intelligence Review
Proceedings of the conference on Design, automation and test in Europe - Volume 2
A new heuristic algorithm for reversible logic synthesis
Proceedings of the 41st annual Design Automation Conference
Quantum logic synthesis by symbolic reachability analysis
Proceedings of the 41st annual Design Automation Conference
Fredkin/Toffoli Templates for Reversible Logic Synthesis
Proceedings of the 2003 IEEE/ACM international conference on Computer-aided design
Quantum Circuit Simplification Using Templates
Proceedings of the conference on Design, Automation and Test in Europe - Volume 2
Majority-based reversible logic gates
Theoretical Computer Science
Automatic Synthesis of Composable Sequential Quantum Boolean Circuits
ICCD '05 Proceedings of the 2005 International Conference on Computer Design
Synthesis of quantum logic circuits
Proceedings of the 2005 Asia and South Pacific Design Automation Conference
Analysis and synthesis of quantum circuits by using quantum decision diagrams
Proceedings of the conference on Design, automation and test in Europe: Proceedings
Evolutionary approach to quantum and reversible circuits synthesis
Artificial intelligence in logic design
Data structures and algorithms for simplifying reversible circuits
ACM Journal on Emerging Technologies in Computing Systems (JETC)
Techniques for the synthesis of reversible Toffoli networks
ACM Transactions on Design Automation of Electronic Systems (TODAES)
A novel synthesis algorithm for reversible circuits
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)
Proceedings of the 2008 Asia and South Pacific Design Automation Conference
Fast equivalence-checking for quantum circuits
Proceedings of the 2010 IEEE/ACM International Symposium on Nanoscale Architectures
Rule-based optimization of reversible circuits
Proceedings of the 2010 Asia and South Pacific Design Automation Conference
Realization and synthesis of reversible functions
Theoretical Computer Science
Synthesis of fredkin-toffoli reversible networks
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Fault diagnosis in reversible circuits under missing-gate fault model
Computers and Electrical Engineering
Fast equivalence-checking for quantum circuits
Quantum Information & Computation
Group theory based synthesis of binary reversible circuits
TAMC'06 Proceedings of the Third international conference on Theory and Applications of Models of Computation
Optimization of reversible circuits using reconfigured templates
RC'11 Proceedings of the Third international conference on Reversible Computation
Synthesis and optimization of reversible circuits—a survey
ACM Computing Surveys (CSUR)
Derivation of test set for detecting multiple missing-gate faults in reversible circuits
Computers and Electrical Engineering
White dots do matter: rewriting reversible logic circuits
RC'13 Proceedings of the 5th international conference on Reversible Computation
| Hi-index | 0.00 |
This paper gives a simple but nontrivial set of local transformation rules for Control-NOT(CNOT)-based combinatorial circuits. It is shown that this rule set is complete, namely, for any two equivalent circuits, S1 and S2, there is a sequence of transformations, each of them in the rule set, which changes S1 to S2. Our motivation is to use this rule set for developing a design theory for quantum circuits whose Boolean logic parts should be implemented by CNOT based circuits. As a preliminary example, we give a design procedure based on our transformation rules which reduces the cost of CNOT-based circuits.