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

IEEE International Symposium on Multiple-Valued Logic (ISMVL)

Using Hasse Diagrams to Synthesize Ternary Quantum Circuits

Maher Hawash, Marek A. Perkowski

Published May 1, 2012• 5 citations
Publisher

Abstract

We present the results of application of Hasse diagrams to the problem of synthesizing ternary quantum circuits represented as input-output mapping vectors. The paper specifically focuses on ternary quantum circuits with relatively large number of variables where valid solutions exist in an exponentially expanding search space. Valid solutions represent the set of all input vector permutations (arrangements or sequences) which satisfy the circuit specification and are algorithmically convergent. We discovered that a) the ordering of the input vector has an impact on the size of the resulting circuit and, that b) only certain orderings are algorithmically convergent. Here we describe a method for systematically constructing such valid sequences using a ternary Hasse diagram and illustrate a detailed proof of the critical issue of algorithmic convergence. In essence, we illustrate the benefit of exploring many input sequences over limiting the synthesis to the natural binary order.

DOI
10.1109/ismvl.2012.49

Related papers

Application of Genetic Algorithm for Synthesis of Large Reversible Circuits using Covered Set Partitions

Maher Hawash, Baker K. Abdalhaq, Amjad Hawash +1 more

We present the results of application of Evolutionary Algorithms to the problem of synthesizing quantum circuits which belong to the class of reversible circuits, represented as an input/output mapping vectors. The paper specifically focuses on large quantum circuits where many valid solutions exist in an exponentially inflating search space. Valid solutions represent the set of all input vector permutations (arrangements) which satisfy the circuit specification. The search space for circuits with large number of variables grows exponentially making it impossible to discover the set of optimal solutions. The paper compares three methods for selecting valid solutions of input vector sequences: 1) randomly, 2) genetic algorithm, 3) Tabu search. The objective function calculates the number of elementary quantum gates needed to represent the solution such that lower number of gates represents better solutions. In addition to the choice of selection algorithm, we illustrate the impact of using different partition depths for the Covered Set Partitions algorithm used to construct valid input vector sequences.

•Jan 1, 2011•5 citations

Modular Component-Based Quantum Circuit Synthesis

Chan Gu Kang, Hakjoo Oh

In this article, we present a novel method for synthesizing quantum circuits from user-supplied components. Given input-output state vectors and component quantum gates, our synthesizer aims to construct a quantum circuit that implements the provided functionality in terms of the supplied component gates. To achieve this, we basically use an enumerative search with pruning. To accelerate the procedure, however, we perform the search and pruning at the module level; instead of simply enumerating candidate circuits by appending component gates in sequence, we stack modules, which are groups of gate operations. With this modular approach, we can effectively reduce the search space by directing the search in a way that bridges the gap between the current circuit and the input-output specification. Evaluation on 17 benchmark problems shows that our technique is highly effective at synthesizing quantum circuits. Our method successfully synthesized 16 out of 17 benchmark circuits in 96.6 seconds on average. On the other hand, the conventional, gate-level synthesis algorithm succeeded in 10 problems with an average time of 639.1 seconds. Our algorithm increased the speed of the baseline by 20.3x for the 10 problems commonly solved by both approaches.

Proceedings of the ACM on Programming Languages•Apr 6, 2023•17 citations

Logic Synthesis of Ternary Quantum Circuits with Minimal Qutrits

Xiaoyu Li, Guowu Yang, Desheng Zheng

Abstract — This paper investigates a universal approach of synthesizing arbitrary ternary logic circuits in quantum computation based on the truth table technology. It takes into account of the relationship of classical logic and quantum logic circuits. By adding inputs with constant value and garbage outputs, the classical non-reversible logic can be transformed into reversible logic. Combined with group theory, it provides an algorithm using the ternary Swap gate, ternary NOT gate and ternary Toffoli gate library. Simultaneously, the main result shows that the numbers of qutrits we use are minimal compared to other methods. We also illustrate with two examples to test our approach. Index Terms — ternary quantum computation, reversible logic, circuit synthesis, group theory I.

Journal of Computers•Jul 17, 2013•17 citations

Synthesis of Ternary Grover's Algorithm

Sudhindu Bikash Mandal, Amlan Chakrabarti, Susmita Sur‐Kolay

Grover's search algorithm is one of the well-studied quantum computing algorithms, which plays a key role in many applications such as graph coloring, triangle finding, Boolean satisfiability. Although there are many works on circuit synthesis for Grover's algorithm in the binary quantum domain, only a few exist for the ternary version of the algorithm. In this paper, we first propose a new ternary superposition operator and utilize it to synthesize a ternary quantum logic circuit for Grover's algorithm. Our proposed circuits for a ternary oracle and the ternary Grover's diffusion operator require 4 and 6 gate levels respectively per iteration, and for the ternary oracle 1 ancilla qutrit. To the best of our knowledge, this is the first circuit for the Grover's diffusion operator using ternary gates. Finally, we use these two circuits to present a ternary quantum circuit for the vertex coloring problem. The oracle circuit for this problem has smaller gate count compared to existing solutions.

IEEE International Symposium on Multiple-Valued Logic (ISMVL)•May 1, 2014•12 citations

Synthesis of ternary non-reversible logic circuits

Xiaoyu Li, Guowu Yang, Desheng Zheng

Reversible quantum circuits are a necessary subclass of quantum computation and its realization is required for any quantum computer to be universal. This paper investigates how to synthesis of arbitrary ternary non-reversible logic circuits by adding inputs with constant value and garbage outputs. Group theory has been also used to solve the synthesis of reversible logic circuits. Our algorithm uses the SNT (ternary Swap gate, ternary NOT gate, ternary Toffoli gate) library, by reducing the ternary non-reversible logic circuit synthesis problem to group theory representation. The main result shows the relationship of ternary non-reversible logic circuits and the reversible circuits. The realization approach is constructive and can be further used to develop software for synthesis of arbitrary d-level circuits. This result is significantly different from the binary non-reversible logic circuits.

IEEE Congress on Evolutionary Computation (CEC)•Jul 1, 2010•1 citation

Genetic algorithm based synthesis of multi-output ternary functions using quantum cascade of generalized ternary gates

Mozammel H. A. Khan, Marek A. Perkowski

Ternary quantum circuits have recently been introduced to help reduce the size of multi-valued logic for multi-level quantum computing systems. However, synthesizing these quantum circuits is not easy. We describe a new genetic algorithm based synthesizer for ternary quantum circuits. Our results show some of the synthesized circuits use fewer gates than previously published methods.

IEEE Congress on Evolutionary Computation (CEC)•Feb 22, 2005•41 citations
We present the results of application of Hasse diagrams to the problem of synthesizing ternary quantum circuits represented as input-output mapping vectors. The paper specifically focuses on ternary quantum circuits with relatively large number of variables where valid solutions exist in an exponentially expanding search space. Valid solutions represent the set of all input vector permutations (arrangements or sequences) which satisfy the circuit specification and are algorithmically convergent. We discovered that a) the ordering of the input vector has an impact on the size of the resulting circuit and, that b) only certain orderings are algorithmically convergent. Here we describe a method for systematically constructing such valid sequences using a ternary Hasse diagram and illustrate a detailed proof of the critical issue of algorithmic convergence. In essence, we illustrate the benefit of exploring many input sequences over limiting the synthesis to the natural binary order.
We present the results of application of Evolutionary Algorithms to the problem of synthesizing quantum circuits which belong to the class of reversible circuits, represented as an input/output mapping vectors. The paper specifically focuses on large quantum circuits where many valid solutions exist in an exponentially inflating search space. Valid solutions represent the set of all input vector permutations (arrangements) which satisfy the circuit specification. The search space for circuits with large number of variables grows exponentially making it impossible to discover the set of optimal solutions. The paper compares three methods for selecting valid solutions of input vector sequences: 1) randomly, 2) genetic algorithm, 3) Tabu search. The objective function calculates the number of elementary quantum gates needed to represent the solution such that lower number of gates represents better solutions. In addition to the choice of selection algorithm, we illustrate the impact of using different partition depths for the Covered Set Partitions algorithm used to construct valid input vector sequences.
In this article, we present a novel method for synthesizing quantum circuits from user-supplied components. Given input-output state vectors and component quantum gates, our synthesizer aims to construct a quantum circuit that implements the provided functionality in terms of the supplied component gates. To achieve this, we basically use an enumerative search with pruning. To accelerate the procedure, however, we perform the search and pruning at the module level; instead of simply enumerating candidate circuits by appending component gates in sequence, we stack modules, which are groups of gate operations. With this modular approach, we can effectively reduce the search space by directing the search in a way that bridges the gap between the current circuit and the input-output specification. Evaluation on 17 benchmark problems shows that our technique is highly effective at synthesizing quantum circuits. Our method successfully synthesized 16 out of 17 benchmark circuits in 96.6 seconds on average. On the other hand, the conventional, gate-level synthesis algorithm succeeded in 10 problems with an average time of 639.1 seconds. Our algorithm increased the speed of the baseline by 20.3x for the 10 problems commonly solved by both approaches.
Abstract — This paper investigates a universal approach of synthesizing arbitrary ternary logic circuits in quantum computation based on the truth table technology. It takes into account of the relationship of classical logic and quantum logic circuits. By adding inputs with constant value and garbage outputs, the classical non-reversible logic can be transformed into reversible logic. Combined with group theory, it provides an algorithm using the ternary Swap gate, ternary NOT gate and ternary Toffoli gate library. Simultaneously, the main result shows that the numbers of qutrits we use are minimal compared to other methods. We also illustrate with two examples to test our approach. Index Terms — ternary quantum computation, reversible logic, circuit synthesis, group theory I.
Grover's search algorithm is one of the well-studied quantum computing algorithms, which plays a key role in many applications such as graph coloring, triangle finding, Boolean satisfiability. Although there are many works on circuit synthesis for Grover's algorithm in the binary quantum domain, only a few exist for the ternary version of the algorithm. In this paper, we first propose a new ternary superposition operator and utilize it to synthesize a ternary quantum logic circuit for Grover's algorithm. Our proposed circuits for a ternary oracle and the ternary Grover's diffusion operator require 4 and 6 gate levels respectively per iteration, and for the ternary oracle 1 ancilla qutrit. To the best of our knowledge, this is the first circuit for the Grover's diffusion operator using ternary gates. Finally, we use these two circuits to present a ternary quantum circuit for the vertex coloring problem. The oracle circuit for this problem has smaller gate count compared to existing solutions.
Reversible quantum circuits are a necessary subclass of quantum computation and its realization is required for any quantum computer to be universal. This paper investigates how to synthesis of arbitrary ternary non-reversible logic circuits by adding inputs with constant value and garbage outputs. Group theory has been also used to solve the synthesis of reversible logic circuits. Our algorithm uses the SNT (ternary Swap gate, ternary NOT gate, ternary Toffoli gate) library, by reducing the ternary non-reversible logic circuit synthesis problem to group theory representation. The main result shows the relationship of ternary non-reversible logic circuits and the reversible circuits. The realization approach is constructive and can be further used to develop software for synthesis of arbitrary d-level circuits. This result is significantly different from the binary non-reversible logic circuits.