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

Quantum Approaches to Logic Circuit Synthesis and Testing

John P. Hayes, Igor L. Markov

Published Jun 1, 2006• 3 citations
OpenAlex

Abstract

The overall objective of this project was to investigate quantum study computing concepts in an integrated way and apply design automation techniques, such as synthesis, simulation and testing, to quantum logic circuits via mathematical and algorithmic models implemented in software. The research considered the interplay between conventional and quantum logic design, aiming at a deeper understanding of both areas and provided extensive computational experimentation at scales uncommon in quantum computing research. The project s main accomplishments

Related papers

Quantum computers are coming! But how to use their potential?

Robert Wille

Quantum computers are coming! But how to use their potential? Quantum computing is becoming a reality, but automated methods and software tools for this technology are just beginning. This project aims to develop automatic and efficient methods, e.g. for simulation, compilation, or verification of quantum circuits. DA QC will exploit design automation expertise proven powerful for conventional circuits and systems yet hardly utilised in quantum computing.

The Project Repository Journal•Sep 10, 2021•0 citations

Quantum Design Automation: Foundations, Challenges, and the Road Ahead

Feng Wu, Jingzhe Guo, Tian Xia +12 more

Quantum computing is transitioning from laboratory research to industrial deployment, yet significant challenges persist: system scalability and performance, fabrication yields, and the advancement of algorithms and applications. We emphasize that in building quantum computers -- spanning quantum chips, system integration, instruction sets, algorithms, and middleware such as quantum error correction schemes -- design is everywhere. In this paper, we advocate for a holistic design perspective in quantum computing, a perspective we argue is pivotal to unlocking innovative co-design opportunities and addressing the aforementioned key challenges. To equip readers with sufficient background for exploring co-optimization opportunities, we detail how interconnected computational methods and tools collaborate to enable end-to-end quantum computer design. This coverage encompasses critical stages -- such as chip layout design automation, high-fidelity system-level simulation, Hamiltonian derivation for quantum system modeling, control pulse simulation, decoherence analysis, and physical verification and testing -- followed by quantum instruction set design. We then proceed to quantum system and software development, including quantum circuit synthesis, quantum error correction and fault tolerance, and logic verification and testing. Through these discussions, we illustrate with concrete examples -- including co-optimizing quantum instruction sets with algorithmic considerations, customizing error correction circuits to hardware-specific constraints, and streamlining quantum chip design through tailored code design, among others. We hope that the detailed end-to-end design workflow as well as these examples will foster dialogue between the hardware and software communities, ultimately facilitating the translation of meaningful research findings into future quantum hardware implementations.

quant-pharXiv:2511.10479•Nov 14, 2025•0 citations

Synthesis of quantum-logic circuits

Vivek Shende, Stephen S. Bullock, Igor L. Markov

The pressure of fundamental limits on classical computation and the promise of exponential speedups from quantum effects have recently brought quantum circuits (Proc. R. Soc. Lond. A, Math. Phys. Sci., vol. 425, p. 73, 1989) to the attention of the electronic design automation community (Proc. 40th ACM/IEEE Design Automation Conf., 2003), (Phys. Rev. A, At. Mol. Opt. Phy., vol. 68, p. 012318, 2003), (Proc. 41st Design Automation Conf., 2004), (Proc. 39th Design Automation Conf., 2002), (Proc. Design, Automation, and Test Eur., 2004), (Phys. Rev. A, At. Mol. Opt. Phy., vol. 69, p. 062321, 2004), (IEEE Trans. Comput.-Aided Des. Integr. Circuits Syst., vol. 22, p. 710, 2003). Efficient quantum-logic circuits that perform two tasks are discussed: 1) implementing generic quantum computations, and 2) initializing quantum registers. In contrast to conventional computing, the latter task is nontrivial because the state space of an n-qubit register is not finite and contains exponential superpositions of classical bitstrings. The proposed circuits are asymptotically optimal for respective tasks and improve earlier published results by at least a factor of 2. The circuits for generic quantum computation constructed by the algorithms are the most efficient known today in terms of the number of most expensive gates [quantum controlled-NOTs (CNOTs)]. They are based on an analog of the Shannon decomposition of Boolean functions and a new circuit block, called quantum multiplexor (QMUX), which generalizes several known constructions. A theoretical lower bound implies that the circuits cannot be improved by more than a factor of 2. It is additionally shown how to accommodate the severe architectural limitation of using only nearest neighbor gates, which is representative of current implementation technologies. This increases the number of gates by almost an order of magnitude, but preserves the asymptotic optimality of gate counts.

arXiv:quant-ph/0406176•IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems•May 12, 2006•678 citations

Logic Synthesis for Quantum State Generation

Philipp Niemann, Rhitam Datta, Robert Wille

Quantum computation established itself as a promising emerging technology and, hence, attracted considerable attention in the domain of computer-aided-design (CAD). However, quantum mechanical phenomena such as superposition, phase shifts, or entanglement lead to a logic model which poses serious challenges to the development of a proper design flow for quantum circuits. Consequently, researchers addressed synthesis of quantum circuits not as a single design step, but considered sub-tasks such as synthesis of Boolean components or synthesis of restricted subsets of quantum functionality. Generating a particularly desired quantum state is another of these sub-tasks. However, logic synthesis of quantum circuits accomplishing that has hardly been considered yet. In this work, we propose a generic method which automatically synthesizes a quantum circuit generating any desired quantum state from an initially given basis state. The proposed method allows for both, a theoretical determination of upper bounds as well as an experimental evaluation of the number of quantum gates needed for this important design step.

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

Quantum Circuit Automatic Synthesizer (QCAS)

Ali Moghadaszadeh, Majid Mohamadi, Ali Niknafs +1 more

Abstract — Quantum and reversible circuit synthesis has been important concern of designers in recently passed decades. Considering the application of garbage bit in optimization of quantum circuit, GA-Based techniques have been introduced. This project provides an extensible infrastructure for quantum circuit automatic synthesis and optimization with the enhancement of interoperability features. The problem domain begins from complex computing model up to a synthesis of reversible quantum circuit. Optimization criterias are whole considered separately from software processing logic which cause capability of applying variable optimization critria in different problem domains. The new introduced methodology utilize PSO technique for circuit synthesis evolutionary computation in optimization step. A software library has been developed which implements this technique. It provides a simple flexible software for researchers in order to automatic synthesis of quantum circuit that implements an open source library of prerequisite of quantum circuit synthesis. Index Terms-Quantum circuits, gate, PSO, Automatic synthesis.

•Jan 1, 2013•0 citations

Logic design and quantum challenge

Victor I. Varshavsky

Is the design methodology of logical and computing structures ready to efficiently use new functional possibilities of quantum devices? Does the range of existing and suggested quantum devices provide effective design of logical and computing structures? With some examples, we discuss the possibility of obtaining positive answers to these questions uniting the efforts of physicists, technologists and experts in computer engineering. A number of hot points is outlined where this collaboration may be fruitful.

International Workshop on Physics and Computer Modeling of Devices Based on Low-Dimensional Structures•Nov 19, 2002•3 citations
The overall objective of this project was to investigate quantum study computing concepts in an integrated way and apply design automation techniques, such as synthesis, simulation and testing, to quantum logic circuits via mathematical and algorithmic models implemented in software. The research considered the interplay between conventional and quantum logic design, aiming at a deeper understanding of both areas and provided extensive computational experimentation at scales uncommon in quantum computing research. The project s main accomplishments
Quantum computing is transitioning from laboratory research to industrial deployment, yet significant challenges persist: system scalability and performance, fabrication yields, and the advancement of algorithms and applications. We emphasize that in building quantum computers -- spanning quantum chips, system integration, instruction sets, algorithms, and middleware such as quantum error correction schemes -- design is everywhere. In this paper, we advocate for a holistic design perspective in quantum computing, a perspective we argue is pivotal to unlocking innovative co-design opportunities and addressing the aforementioned key challenges. To equip readers with sufficient background for exploring co-optimization opportunities, we detail how interconnected computational methods and tools collaborate to enable end-to-end quantum computer design. This coverage encompasses critical stages -- such as chip layout design automation, high-fidelity system-level simulation, Hamiltonian derivation for quantum system modeling, control pulse simulation, decoherence analysis, and physical verification and testing -- followed by quantum instruction set design. We then proceed to quantum system and software development, including quantum circuit synthesis, quantum error correction and fault tolerance, and logic verification and testing. Through these discussions, we illustrate with concrete examples -- including co-optimizing quantum instruction sets with algorithmic considerations, customizing error correction circuits to hardware-specific constraints, and streamlining quantum chip design through tailored code design, among others. We hope that the detailed end-to-end design workflow as well as these examples will foster dialogue between the hardware and software communities, ultimately facilitating the translation of meaningful research findings into future quantum hardware implementations.
The pressure of fundamental limits on classical computation and the promise of exponential speedups from quantum effects have recently brought quantum circuits (Proc. R. Soc. Lond. A, Math. Phys. Sci., vol. 425, p. 73, 1989) to the attention of the electronic design automation community (Proc. 40th ACM/IEEE Design Automation Conf., 2003), (Phys. Rev. A, At. Mol. Opt. Phy., vol. 68, p. 012318, 2003), (Proc. 41st Design Automation Conf., 2004), (Proc. 39th Design Automation Conf., 2002), (Proc. Design, Automation, and Test Eur., 2004), (Phys. Rev. A, At. Mol. Opt. Phy., vol. 69, p. 062321, 2004), (IEEE Trans. Comput.-Aided Des. Integr. Circuits Syst., vol. 22, p. 710, 2003). Efficient quantum-logic circuits that perform two tasks are discussed: 1) implementing generic quantum computations, and 2) initializing quantum registers. In contrast to conventional computing, the latter task is nontrivial because the state space of an n-qubit register is not finite and contains exponential superpositions of classical bitstrings. The proposed circuits are asymptotically optimal for respective tasks and improve earlier published results by at least a factor of 2. The circuits for generic quantum computation constructed by the algorithms are the most efficient known today in terms of the number of most expensive gates [quantum controlled-NOTs (CNOTs)]. They are based on an analog of the Shannon decomposition of Boolean functions and a new circuit block, called quantum multiplexor (QMUX), which generalizes several known constructions. A theoretical lower bound implies that the circuits cannot be improved by more than a factor of 2. It is additionally shown how to accommodate the severe architectural limitation of using only nearest neighbor gates, which is representative of current implementation technologies. This increases the number of gates by almost an order of magnitude, but preserves the asymptotic optimality of gate counts.
Quantum computation established itself as a promising emerging technology and, hence, attracted considerable attention in the domain of computer-aided-design (CAD). However, quantum mechanical phenomena such as superposition, phase shifts, or entanglement lead to a logic model which poses serious challenges to the development of a proper design flow for quantum circuits. Consequently, researchers addressed synthesis of quantum circuits not as a single design step, but considered sub-tasks such as synthesis of Boolean components or synthesis of restricted subsets of quantum functionality. Generating a particularly desired quantum state is another of these sub-tasks. However, logic synthesis of quantum circuits accomplishing that has hardly been considered yet. In this work, we propose a generic method which automatically synthesizes a quantum circuit generating any desired quantum state from an initially given basis state. The proposed method allows for both, a theoretical determination of upper bounds as well as an experimental evaluation of the number of quantum gates needed for this important design step.
Abstract — Quantum and reversible circuit synthesis has been important concern of designers in recently passed decades. Considering the application of garbage bit in optimization of quantum circuit, GA-Based techniques have been introduced. This project provides an extensible infrastructure for quantum circuit automatic synthesis and optimization with the enhancement of interoperability features. The problem domain begins from complex computing model up to a synthesis of reversible quantum circuit. Optimization criterias are whole considered separately from software processing logic which cause capability of applying variable optimization critria in different problem domains. The new introduced methodology utilize PSO technique for circuit synthesis evolutionary computation in optimization step. A software library has been developed which implements this technique. It provides a simple flexible software for researchers in order to automatic synthesis of quantum circuit that implements an open source library of prerequisite of quantum circuit synthesis. Index Terms-Quantum circuits, gate, PSO, Automatic synthesis.
Is the design methodology of logical and computing structures ready to efficiently use new functional possibilities of quantum devices? Does the range of existing and suggested quantum devices provide effective design of logical and computing structures? With some examples, we discuss the possibility of obtaining positive answers to these questions uniting the efforts of physicists, technologists and experts in computer engineering. A number of hot points is outlined where this collaboration may be fruitful.