Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Journal of Computer Research and Development

Fast Algorithms for Synthesis of Quantum Reversible Logic Circuits Based on Hash Table

Zhiqiang Li, Hanwu Chen, Baowen Xu, Wenjie Liu

Published Dec 15, 2008• 1 citation
OpenAlex

Related papers

A Fast Algorithm for Synthesis of Quantum Reversible Logic Circuits

Zhiqiang Li, Hanwu Chen, Baowen Xu +3 more

Chinese Journal of Computers•Aug 13, 2009•5 citations

A Fast Symbolic Transformation Based Algorithm for Reversible Logic Synthesis

Mathias Soeken, Gerhard W. Dueck, D. Michael Miller

Lecture notes in computer science•Jan 1, 2016•19 citations

Effective Hash-Based Algorithm for Reversible Logic Circuits Synthesis with Minimum Cost

Zhiqiang Li, Hanwu Chen, Baowen Xu +2 more

We present an effective algorithm which can construct optimal 3-qubit reversible logic circuits for any given reversible logic gates and costs by constructing a minimal perfect hash function. We also present an algorithm which can automatically construct quantum gate library. In the experiments on 3-qubit synthesis, our algorithm synthesizes all optimal reversible circuits with extremely fast speed--the average speed which synthesizes circuits with minimum cost is 365 times faster than that of best result.

International Conference on Natural Computation (ICNC)•Jan 1, 2008•1 citation

Fast algorithm for 4-qubit reversible logic circuits synthesis

Zhiqiang Li, Hanwu Chen, Baowen Xu +3 more

Owing to the exponential nature of the memory or run-tune complexity, many existing methods can only synthesize 3-qubit circuits, however, (G.W. Yang et al., 2005) can achieve 12 steps for the CNP (controlled-Not gate, NOT gate and Peres gate) library in 4-qubit circuit synthesis with mini-length by using an enhanced bi-directional synthesis approach. We mainly absorb the ideas of our 3-qubit synthesis algorithms based on hash table and present a novel and efficient algorithm which can construct almost all optimal 4-qubit reversible logic circuits with various types of gates and mini-length cost based on constructing the shortest coding and the specific topological compression, whose lossless compression ratios of the space of n-qubit circuits is near 2timesn!. Our algorithm has created all 3120218828 optimal 4-qubit circuits whose length is less than 9 for the CNT (Toffoli gate) library, and it can quickly achieve 16 steps through cascading created circuits. To the best of our knowledge, there are no other algorithms to achieve the contribution.

IEEE Congress on Evolutionary Computation (CEC)•Jun 1, 2008•12 citations

Reversible Logic Synthesis Methodologies with Application to Quantum Computing

Saleem Mohammed Ridha Taha

Studies in systems, decision and control•Sep 24, 2015•24 citations

Matrix-Based Algorithm for 4-Qubit Reversible Logic Circuits Synthesis

Dong Wang, Shengyao Sun, Hanwu Chen

Energy Procedia•Jan 1, 2011•4 citations
We present an effective algorithm which can construct optimal 3-qubit reversible logic circuits for any given reversible logic gates and costs by constructing a minimal perfect hash function. We also present an algorithm which can automatically construct quantum gate library. In the experiments on 3-qubit synthesis, our algorithm synthesizes all optimal reversible circuits with extremely fast speed--the average speed which synthesizes circuits with minimum cost is 365 times faster than that of best result.
Owing to the exponential nature of the memory or run-tune complexity, many existing methods can only synthesize 3-qubit circuits, however, (G.W. Yang et al., 2005) can achieve 12 steps for the CNP (controlled-Not gate, NOT gate and Peres gate) library in 4-qubit circuit synthesis with mini-length by using an enhanced bi-directional synthesis approach. We mainly absorb the ideas of our 3-qubit synthesis algorithms based on hash table and present a novel and efficient algorithm which can construct almost all optimal 4-qubit reversible logic circuits with various types of gates and mini-length cost based on constructing the shortest coding and the specific topological compression, whose lossless compression ratios of the space of n-qubit circuits is near 2timesn!. Our algorithm has created all 3120218828 optimal 4-qubit circuits whose length is less than 9 for the CNT (Toffoli gate) library, and it can quickly achieve 16 steps through cascading created circuits. To the best of our knowledge, there are no other algorithms to achieve the contribution.