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 MetroCon

Primer on the Design and Construction of Quantum Circuits

Edgard Muñoz‐Coreas, Israel Koiku

Published Nov 13, 2024• 0 citations
Publisher

Abstract

Quantum algorithms promise up to a superpolynomial factor speedup in computational tasks compared to their classical counterparts. Quantum computers are now approaching sizes where quantum algorithms can be demonstrated. As a result, the implementation of algorithms as quantum circuits has become an important research topic. In this work, we provide an overview of quantum computation and the design of quantum circuits. Properties unique to quantum computation are outlined. We introduce how a quantum algorithm is translated into a circuit and show measures used to assess the performance of quantum circuits.

DOI
10.1109/metrocon62511.2024.10883923

Related papers

Tutorials

Quantum computers offer the potential to extend our abilities to tackle computational problems in fields such as number theory, encryption, search and scientific computation.Up to a superpolynomial speedup has been reported for quantum algorithms in these areas.Motivated by the promise of faster computations, the development of quantum machines has caught the attention of both academics and industry researchers.Quantum machines are now at sizes where implementations of quantum algorithms or their components are now becoming possible.In order to implement quantum algorithms on quantum machines, resource efficient circuits and functional blocks must be designed.This tutorial will cover the following:

IEEE International Symposium on Smart Electronic Systems (iSES)•Dec 1, 2022•0 citations

Tutorial: basic concepts in quantum circuits

J.P. Hayes

Over the last decade a new way to compute has been defined which, unlike conventional methods, is based on quantum mechanics rather than classical physics. This fundamental change in paradigm can, in principle, solve some important and hitherto intractable problems such as prime factorization of large numbers. This tutorial presentation will review the basics of quantum computation and the design of circuits to implement quantum algorithms. The starting point is the notion of a quantum bit or qubit. Because of the superposition property of quantum states, n qubits can store 2n numbers simultaneously, implying a type of massive parallelism. Furthermore, quantum states allow powerful forms of interaction such as entanglement that have no classical counterparts. Qubits are fragile, however, and are altered by measurement; hence quantum circuits must follow very different rules from classical ones. The differences between quantum and classical logic circuits will be discussed and illustrated. Finally, the physical implementation of quantum devices will be considered, along with the prospects for practical quantum computers.

ACM/IEEE Design Automation Conference (DAC)•Mar 2, 2004•0 citations

Tutorial: basic concepts in quantum circuits

John P. Hayes

Over the last decade a new way to compute has been defined which, unlike conventional methods, is based on quantum mechanics rather than classical physics. This fundamental change in paradigm can, in principle, solve some important and hitherto intractable problems such as prime factorization of large numbers. This tutorial presentation will review the basics of quantum computation and the design of circuits to implement quantum algorithms. The starting point is the notion of a quantum bit or qubit. Because of the superposition property of quantum states, n qubits can store 2n numbers simultaneously, implying a type of massive parallelism. Furthermore, quantum states allow powerful forms of interaction such as entanglement that have no classical counterparts. Qubits are fragile, however, and are altered by measurement; hence quantum circuits must follow very different rules from classical ones. The differences between quantum and classical logic circuits will be discussed and illustrated. Finally, the physical implementation of quantum devices will be considered, along with the prospects for practical quantum computers.

ACM/IEEE Design Automation Conference (DAC)•Jan 1, 2003•0 citations

Design and evaluation of high-performance quantum circuit components

Richard Rines

Quantum computers promise to extend the domain of the computable, performing calculations thought to be intractable on any classical device. Rapid experimental and technological progress suggests that this promise could soon be realized. However, these first quantum computers will inevitably be both small, faulty, and expensive, demanding implementations of quantum algorithms which are compact, fast, and error-resistant. As the complexity of realizable quantum computers accelerates toward the threshold of quantum supremacy, their capacity to demonstrate a meaningful quantum advantage when applied to real-world tasks depends on the high-performance design, implementation, and analysis of quantum circuits. The first half of the thesis is devoted to Shor's factoring algorithm, seeking to determine the most efficient quantum circuit implementation of a quantum modular multiplier.

•Jan 1, 2019•0 citations

A comprehensive study of quantum arithmetic circuits

Siyi Wang, Xiufan Li, Wei Lee +3 more

In recent decades, the field of quantum computing has experienced remarkable progress. This progress is marked by the superior performance of many quantum algorithms compared with their classical counterparts, with Shor's algorithm serving as a prominent illustration. Quantum arithmetic circuits, which are the fundamental building blocks in numerous quantum algorithms, have attracted much attention. Despite extensive exploration of various designs in the existing literature, researchers remain keen to develop novel designs and improve existing ones. In this review article, we aim to provide a systematically organized and easily comprehensible overview of the current state of the art in quantum arithmetic circuits. Specifically, this study covers fundamental operations such as addition, subtraction, multiplication, division and modular exponentiation. We delve into the detailed quantum implementations of these prominent designs and evaluate their efficiency considering various objectives. We also discuss potential applications of the presented arithmetic circuits and suggest future research directions.This article is part of the theme issue 'Emerging technologies for future secure computing platforms'.

arXiv:2406.03867•Philosophical Transactions of the Royal Society A Mathematical Physical and Engineering Sciences•Jan 16, 2025•41 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•794 citations
Quantum algorithms promise up to a superpolynomial factor speedup in computational tasks compared to their classical counterparts. Quantum computers are now approaching sizes where quantum algorithms can be demonstrated. As a result, the implementation of algorithms as quantum circuits has become an important research topic. In this work, we provide an overview of quantum computation and the design of quantum circuits. Properties unique to quantum computation are outlined. We introduce how a quantum algorithm is translated into a circuit and show measures used to assess the performance of quantum circuits.
Quantum computers offer the potential to extend our abilities to tackle computational problems in fields such as number theory, encryption, search and scientific computation.Up to a superpolynomial speedup has been reported for quantum algorithms in these areas.Motivated by the promise of faster computations, the development of quantum machines has caught the attention of both academics and industry researchers.Quantum machines are now at sizes where implementations of quantum algorithms or their components are now becoming possible.In order to implement quantum algorithms on quantum machines, resource efficient circuits and functional blocks must be designed.This tutorial will cover the following:
Over the last decade a new way to compute has been defined which, unlike conventional methods, is based on quantum mechanics rather than classical physics. This fundamental change in paradigm can, in principle, solve some important and hitherto intractable problems such as prime factorization of large numbers. This tutorial presentation will review the basics of quantum computation and the design of circuits to implement quantum algorithms. The starting point is the notion of a quantum bit or qubit. Because of the superposition property of quantum states, n qubits can store 2n numbers simultaneously, implying a type of massive parallelism. Furthermore, quantum states allow powerful forms of interaction such as entanglement that have no classical counterparts. Qubits are fragile, however, and are altered by measurement; hence quantum circuits must follow very different rules from classical ones. The differences between quantum and classical logic circuits will be discussed and illustrated. Finally, the physical implementation of quantum devices will be considered, along with the prospects for practical quantum computers.
Over the last decade a new way to compute has been defined which, unlike conventional methods, is based on quantum mechanics rather than classical physics. This fundamental change in paradigm can, in principle, solve some important and hitherto intractable problems such as prime factorization of large numbers. This tutorial presentation will review the basics of quantum computation and the design of circuits to implement quantum algorithms. The starting point is the notion of a quantum bit or qubit. Because of the superposition property of quantum states, n qubits can store 2n numbers simultaneously, implying a type of massive parallelism. Furthermore, quantum states allow powerful forms of interaction such as entanglement that have no classical counterparts. Qubits are fragile, however, and are altered by measurement; hence quantum circuits must follow very different rules from classical ones. The differences between quantum and classical logic circuits will be discussed and illustrated. Finally, the physical implementation of quantum devices will be considered, along with the prospects for practical quantum computers.
Quantum computers promise to extend the domain of the computable, performing calculations thought to be intractable on any classical device. Rapid experimental and technological progress suggests that this promise could soon be realized. However, these first quantum computers will inevitably be both small, faulty, and expensive, demanding implementations of quantum algorithms which are compact, fast, and error-resistant. As the complexity of realizable quantum computers accelerates toward the threshold of quantum supremacy, their capacity to demonstrate a meaningful quantum advantage when applied to real-world tasks depends on the high-performance design, implementation, and analysis of quantum circuits. The first half of the thesis is devoted to Shor's factoring algorithm, seeking to determine the most efficient quantum circuit implementation of a quantum modular multiplier.
In recent decades, the field of quantum computing has experienced remarkable progress. This progress is marked by the superior performance of many quantum algorithms compared with their classical counterparts, with Shor's algorithm serving as a prominent illustration. Quantum arithmetic circuits, which are the fundamental building blocks in numerous quantum algorithms, have attracted much attention. Despite extensive exploration of various designs in the existing literature, researchers remain keen to develop novel designs and improve existing ones. In this review article, we aim to provide a systematically organized and easily comprehensible overview of the current state of the art in quantum arithmetic circuits. Specifically, this study covers fundamental operations such as addition, subtraction, multiplication, division and modular exponentiation. We delve into the detailed quantum implementations of these prominent designs and evaluate their efficiency considering various objectives. We also discuss potential applications of the presented arithmetic circuits and suggest future research directions.This article is part of the theme issue 'Emerging technologies for future secure computing platforms'.
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.