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

The Journal of Supercomputing

Automatic synthesis of quaternary quantum circuits

Mozammel H. A. Khan, Himanshu Thapliyal, Edgard Muñoz‐Coreas

Published Sep 19, 2016• 18 citations
Publisher
DOI
10.1007/s11227-016-1878-5

Related papers

A Synthesis Method for Quaternary Quantum Logic Circuits

Sudhindu Bikash Mandal, Amlan Chakrabarti, Susmita Sur‐Kolay

arXiv:1210.8055•Lecture notes in computer science•Jan 1, 2012•15 citations

Automatic Synthesis for Quantum Circuits Using Genetic Algorithms

Cristian Ruican, Mihai Udrescu, Lucian Prodan +1 more

Lecture notes in computer science•Jul 2, 2007•20 citations

Genetic Synthesis of Compact Quaternary Reversible Comparators for Quantum Computing

Asma Taheri Monfared, Andrea Bombarda, Angelo Gargantini +1 more

Reversible logic is fundamental to quantum circuit design, as quantum operations are inherently information-preserving and reversible. While most quantum synthesis methods rely on binary logic, quaternary reversible computing can increase data density, reduce circuit width, and potentially lead to more efficient realizations. We introduce a genetic-algorithm-based approach for designing compact quaternary reversible comparator circuits, which are important components in quantum architectures. This technique utilizes a gate library based on extended Shift and Muthukrishnan–Stroud gates tailored to quaternary systems. Chromosomes encode sequences of quaternary gates, and evolutionary operators search for configurations with minimal quantum cost. Although demonstrated on comparator circuits, the approach applies to any quaternary reversible circuit defined by its truth table. The synthesis process occurs in two phases: candidate circuits first evolve toward correct behavior; then correct circuits are optimized to obtain compact implementations. We evaluate the approach on comparators performing lower-than, greater-than, and equality operations, as well as on a 1-qudit full comparator. The method achieves average quantum cost improvements of about 30% for restoring and 58% for non-restoring configurations compared to existing designs. These reductions support more efficient and more error-resilient quantum circuits, showing that this approach is a strong candidate for quaternary quantum systems.

ACM Transactions on Quantum Computing•May 13, 2026•0 citations

Synthesis of Quantum Circuits

Philipp Niemann, Robert Wille

SpringerBriefs in physics•Jan 1, 2017•0 citations

Synthesis of incompletely specified multi-output quaternary function using quaternary quantum gates

Mozammel H. A. Khan

Multiple-valued quantum circuits are a promising choice for future quantum computing technology since they have several advantages over binary quantum circuits. In this paper, we propose quaternary multi-qudit controlled gate family and show their realization on the top of liquid ion-trap realizable 1-qudit gates and 2-qudit Muthukrishnan-Stroud gates. Then we show a method of synthesizing incompletely specified multi-output quaternary function using quaternary 1-qudit gates and multi-qudit controlled gates.

International Conference on Computer and Information Technology (ICCIT)•Dec 1, 2007•1 citation

Novel Quaternary Quantum Decoder, Multiplexer and Demultiplexer Circuits

Majid Haghparast, Asma Taheri Monfared

International Journal of Theoretical Physics•Feb 21, 2017•12 citations
Reversible logic is fundamental to quantum circuit design, as quantum operations are inherently information-preserving and reversible. While most quantum synthesis methods rely on binary logic, quaternary reversible computing can increase data density, reduce circuit width, and potentially lead to more efficient realizations. We introduce a genetic-algorithm-based approach for designing compact quaternary reversible comparator circuits, which are important components in quantum architectures. This technique utilizes a gate library based on extended Shift and Muthukrishnan–Stroud gates tailored to quaternary systems. Chromosomes encode sequences of quaternary gates, and evolutionary operators search for configurations with minimal quantum cost. Although demonstrated on comparator circuits, the approach applies to any quaternary reversible circuit defined by its truth table. The synthesis process occurs in two phases: candidate circuits first evolve toward correct behavior; then correct circuits are optimized to obtain compact implementations. We evaluate the approach on comparators performing lower-than, greater-than, and equality operations, as well as on a 1-qudit full comparator. The method achieves average quantum cost improvements of about 30% for restoring and 58% for non-restoring configurations compared to existing designs. These reductions support more efficient and more error-resilient quantum circuits, showing that this approach is a strong candidate for quaternary quantum systems.
Multiple-valued quantum circuits are a promising choice for future quantum computing technology since they have several advantages over binary quantum circuits. In this paper, we propose quaternary multi-qudit controlled gate family and show their realization on the top of liquid ion-trap realizable 1-qudit gates and 2-qudit Muthukrishnan-Stroud gates. Then we show a method of synthesizing incompletely specified multi-output quaternary function using quaternary 1-qudit gates and multi-qudit controlled gates.