Quantum computation and quantum information
Quantum computation and quantum information
Quantum Circuit Simplification Using Templates
Proceedings of the conference on Design, Automation and Test in Europe - Volume 2
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)
Reversible logic synthesis with Fredkin and Peres gates
ACM Journal on Emerging Technologies in Computing Systems (JETC)
A cycle-based synthesis algorithm for reversible logic
Proceedings of the 2009 Asia and South Pacific Design Automation Conference
Irreversibility and heat generation in the computing process
IBM Journal of Research and Development
Logical reversibility of computation
IBM Journal of Research and Development
Synthesis of reversible logic circuits
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Toffoli network synthesis with templates
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
An Algorithm for Synthesis of Reversible Logic Circuits
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Quantum Circuit Simplification and Level Compaction
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Fault diagnosis in reversible circuits under missing-gate fault model
Computers and Electrical Engineering
Synthesis and optimization of reversible circuits—a survey
ACM Computing Surveys (CSUR)
Depth-optimized reversible circuit synthesis
Quantum Information Processing
Reversible logic synthesis of k-input, m-output lookup tables
Proceedings of the Conference on Design, Automation and Test in Europe
Optimization of quantum circuits for interaction distance in linear nearest neighbor architectures
Proceedings of the 50th Annual Design Automation Conference
Constant-Factor optimization of quantum adders on 2d quantum architectures
RC'13 Proceedings of the 5th international conference on Reversible Computation
Reversible logic synthesis by quantum rotation gates
Quantum Information & Computation
Line ordering of reversible circuits for linear nearest neighbor realization
Quantum Information Processing
RMDDS: Reed-muller decision diagram synthesis of reversible logic circuits
ACM Journal on Emerging Technologies in Computing Systems (JETC)
Trading off circuit lines and gate costs in the synthesis of reversible logic
Integration, the VLSI Journal
Upper bounds for reversible circuits based on Young subgroups
Information Processing Letters
| Hi-index | 0.00 |
Reversible logic has applications in various research areas, including signal processing, cryptography and quantum computation. In this article, direct NCT-based synthesis of a given k-cycle in a cycle-based synthesis scenario is examined. To this end, a set of seven building blocks is proposed that reveals the potential of direct synthesis of a given permutation to reduce both quantum cost and average runtime. To synthesize a given large cycle, we propose a decomposition algorithm to extract the suggested building blocks from the input specification. Then, a synthesis method is introduced that uses the building blocks and the decomposition algorithm. Finally, a hybrid synthesis framework is suggested that uses the proposed cycle-based synthesis method in conjunction with one of the recent NCT-based synthesis approaches which is based on Reed-Muller (RM) spectra. The time complexity and the effectiveness of the proposed synthesis approach are analyzed in detail. Our analyses show that the proposed hybrid framework leads to a better quantum cost in the worst-case scenario compared to the previously presented methods. The proposed framework always converges and typically synthesizes a given specification very fast compared to the available synthesis algorithms. Besides, the quantum costs of benchmark functions are improved about 20% on average (55% in the best case).