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

arXiv:2405.05021 · IEEE International Conference on Quantum Software (QSW)

Quantum Circuit Ansatz: Patterns of Abstraction and Reuse of Quantum Algorithm Design

Xiaoyu Guo, Takahiro Muta, Jianjun Zhao

Published Jul 7, 2024• 12 citations
arXivHTMLPDF

Abstract

Quantum computing holds the potential to revolutionize various fields by efficiently tackling complex problems. At its core are quantum circuits, sequences of quantum gates manipulating quantum states. The selection of the right quantum circuit ansatz, which defines initial circuit structures and serves as the basis for optimization techniques, is crucial in quantum algorithm design. This paper presents a categorized catalog of quantum circuit ansatzes aimed at supporting quantum algorithm design and implementation. Each ansatz is described with details such as intent, motivation, applicability, circuit diagram, implementation, example, and see also. Practical examples are provided to illustrate their application in quantum algorithm design. The catalog aims to assist quantum algorithm designers by offering insights into the strengths and limitations of different ansatzes, thereby facilitating decision-making for specific tasks.

DOI
10.1109/qsw62656.2024.00021

Related papers

Core Claim: Design a novel quantum optimization algorithm based on quantum entanglement, capable of rapidly solving complex non-linear optimization problems.

Jincheng Zhang

Quantum optimization is a rapidly growing field with the potential to revolutionize various computational tasks, particularly those involving complex, non-linear problems. Classical optimization algorithms often struggle to efficiently handle these challenges. This paper investigates the application of quantum entanglement to develop a new optimization method, aiming to overcome these limitations. We propose a novel quantum optimization framework that leverages entanglement to accelerate the solution of complex non-linear optimization problems. The core mechanism of this approach centers around exploiting the correlated states of entangled quantum bits to guide the search process, fostering a significantly enhanced efficiency compared to classical approaches. We detail the algorithm's architecture, the quantum circuit design employed for entanglement generation and manipulation, and a preliminary analysis of its performance on benchmark optimization problems. This research explores the potential for quantum optimization to fundamentally alter the landscape of computational optimization, offering a pathway towards solving previously intractable problems. The presented algorithm demonstrates promising results through simulations, suggesting that it can provide substantial speedups and improved solution quality for specific types of non-linear optimization tasks.

•Sep 3, 2026•0 citations

Primer on the Design and Construction of Quantum Circuits

Edgard Muñoz‐Coreas, Israel Koiku

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.

IEEE MetroCon•Nov 13, 2024•0 citations

Simulation and Design of Quantum Circuits

Alwin Zulehner, Robert Wille

Abstract Currently, there is an ongoing “race” to build the first practically useful quantum computer that provides substantial speed-ups for certain problems compared to conventional computers. In addition to the development of such devices, this also requires the development of automated tools and methods that provide assistance in the simulation and design of corresponding applications. Otherwise, a situation might be reached where we have powerful quantum computers but hardly any proper means to actually use them. This work provides an overview of corresponding solutions for the task of quantum circuit simulation, the task of quantum circuit design, as well as corresponding mapping tasks. The covered solutions utilise expertise on efficient data structures and algorithms gained in the design of conventional circuits and systems over the last decades. While the respective descriptions are kept brief and mainly convey the general ideas, references to further readings are provided for a more detailed treatment.

Lecture notes in computer science•Jan 1, 2020•12 citations

Probability Logic Quantum Algorithm

Jincheng Zhang

This paper introduces a novel probabilistic quantum algorithm designed to tackle complex probability modeling problems, including machine learning model training and optimization, and high-precision probability inference. We propose a framework that leverages the core concepts of probability logic – probability distributions, Bayesian inference – and quantum computing's unique properties like superposition and entanglement. The algorithm's efficiency is achieved through optimized quantum circuits and a carefully designed quantum-classical hybrid approach. We demonstrate the algorithm's effectiveness through a series of illustrative examples, showcasing its potential to significantly accelerate these computationally intensive tasks. This work presents a new approach to quantum computation that prioritizes logical reasoning and efficient probability manipulation, offering a pathway toward advanced statistical modeling and decision-making.

•Sep 3, 2026•0 citations

Dynamically Reconfigurable Quantum Circuits for Algorithm Optimization

Jincheng Zhang

This paper proposes a novel approach to quantum algorithm optimization through dynamically reconfigurable quantum circuits. The core concept involves adapting the structure of a quantum circuit during its execution, responding to real-time feedback derived from quantum state analysis. Traditional quantum circuit design often relies on static, pre-defined architectures, limiting their adaptability and potential for optimization. This work introduces a control system capable of monitoring qubit states and dynamically altering circuit topology – specifically, adjusting gate sequences and potentially even adding or removing qubits – to minimize gate count and maximize coherence, thereby improving overall algorithm efficiency. The theoretical framework presented here outlines the key components and operational principles of such a system, highlighting its potential to overcome the limitations of static circuits and usher in a new era of adaptive quantum computation. We demonstrate, through a mathematical model, how this dynamic reconfiguration can be strategically implemented to address specific algorithmic challenges, focusing on reducing circuit complexity and enhancing the fidelity of quantum computations. The key to this approach lies in continuous feedback loops and a sophisticated control algorithm that leverages quantum state information to guide circuit modifications. This allows for a more tailored and efficient execution of quantum algorithms compared to static designs.

•Sep 7, 2026•0 citations

Benchmarking PQC Ansatze in Realistic Device Topologies

Oleksa Hryniv, Vladyslav Los, Yuriy Pryyma +3 more

Parameterized quantum circuits (PQCs) serve as a flexible framework for implementing various quantum algorithms, particularly in quantum machine learning and optimization tasks. However, their training is challenging due to both theoretical constraints and the inherent limitations in current quantum hardware. A judicious choice of PQC architecture is crucial for accurately representing the solution space, and for ensuring convergence in training. Several works introduced measures of expressibility and entangling capability for PQCs, and compared these metrics across different circuit structures, providing insights into how they impact performance and efficiency. However, these investigations often assumed idealized all-to-all qubit connectivity, which is not applicable to most hardware architectures. In practice, additional transpilation steps are performed prior to execution on hardware. The potential impact of better alignment of the PQC structure with the underlying native topology has in fact motivated introduction of hardware-efficient ansatze. In our work, we extend the methodology of measuring PQC efficiency to include more realistic quantum hardware models. We examine several popular hardware topologies, including hexagonal, square, circular, linear, and all-to-all. We evaluate the expressibility and entangling capability of circuits with different connectivity types and various arrangements of rotation gates. We assess the training performance of these PQC types in the context of a variational compiling procedure and identify the preferred gate patterns. This approach provides a more realistic evaluation of PQC performance, thus offering practical insights into their applications on existing quantum devices.

IEEE International Conference on Quantum Computing and Engineering (QCE)•Sep 15, 2024•1 citation
Quantum computing holds the potential to revolutionize various fields by efficiently tackling complex problems. At its core are quantum circuits, sequences of quantum gates manipulating quantum states. The selection of the right quantum circuit ansatz, which defines initial circuit structures and serves as the basis for optimization techniques, is crucial in quantum algorithm design. This paper presents a categorized catalog of quantum circuit ansatzes aimed at supporting quantum algorithm design and implementation. Each ansatz is described with details such as intent, motivation, applicability, circuit diagram, implementation, example, and see also. Practical examples are provided to illustrate their application in quantum algorithm design. The catalog aims to assist quantum algorithm designers by offering insights into the strengths and limitations of different ansatzes, thereby facilitating decision-making for specific tasks.
Quantum optimization is a rapidly growing field with the potential to revolutionize various computational tasks, particularly those involving complex, non-linear problems. Classical optimization algorithms often struggle to efficiently handle these challenges. This paper investigates the application of quantum entanglement to develop a new optimization method, aiming to overcome these limitations. We propose a novel quantum optimization framework that leverages entanglement to accelerate the solution of complex non-linear optimization problems. The core mechanism of this approach centers around exploiting the correlated states of entangled quantum bits to guide the search process, fostering a significantly enhanced efficiency compared to classical approaches. We detail the algorithm's architecture, the quantum circuit design employed for entanglement generation and manipulation, and a preliminary analysis of its performance on benchmark optimization problems. This research explores the potential for quantum optimization to fundamentally alter the landscape of computational optimization, offering a pathway towards solving previously intractable problems. The presented algorithm demonstrates promising results through simulations, suggesting that it can provide substantial speedups and improved solution quality for specific types of non-linear optimization tasks.
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.
Abstract Currently, there is an ongoing “race” to build the first practically useful quantum computer that provides substantial speed-ups for certain problems compared to conventional computers. In addition to the development of such devices, this also requires the development of automated tools and methods that provide assistance in the simulation and design of corresponding applications. Otherwise, a situation might be reached where we have powerful quantum computers but hardly any proper means to actually use them. This work provides an overview of corresponding solutions for the task of quantum circuit simulation, the task of quantum circuit design, as well as corresponding mapping tasks. The covered solutions utilise expertise on efficient data structures and algorithms gained in the design of conventional circuits and systems over the last decades. While the respective descriptions are kept brief and mainly convey the general ideas, references to further readings are provided for a more detailed treatment.
This paper introduces a novel probabilistic quantum algorithm designed to tackle complex probability modeling problems, including machine learning model training and optimization, and high-precision probability inference. We propose a framework that leverages the core concepts of probability logic – probability distributions, Bayesian inference – and quantum computing's unique properties like superposition and entanglement. The algorithm's efficiency is achieved through optimized quantum circuits and a carefully designed quantum-classical hybrid approach. We demonstrate the algorithm's effectiveness through a series of illustrative examples, showcasing its potential to significantly accelerate these computationally intensive tasks. This work presents a new approach to quantum computation that prioritizes logical reasoning and efficient probability manipulation, offering a pathway toward advanced statistical modeling and decision-making.
This paper proposes a novel approach to quantum algorithm optimization through dynamically reconfigurable quantum circuits. The core concept involves adapting the structure of a quantum circuit during its execution, responding to real-time feedback derived from quantum state analysis. Traditional quantum circuit design often relies on static, pre-defined architectures, limiting their adaptability and potential for optimization. This work introduces a control system capable of monitoring qubit states and dynamically altering circuit topology – specifically, adjusting gate sequences and potentially even adding or removing qubits – to minimize gate count and maximize coherence, thereby improving overall algorithm efficiency. The theoretical framework presented here outlines the key components and operational principles of such a system, highlighting its potential to overcome the limitations of static circuits and usher in a new era of adaptive quantum computation. We demonstrate, through a mathematical model, how this dynamic reconfiguration can be strategically implemented to address specific algorithmic challenges, focusing on reducing circuit complexity and enhancing the fidelity of quantum computations. The key to this approach lies in continuous feedback loops and a sophisticated control algorithm that leverages quantum state information to guide circuit modifications. This allows for a more tailored and efficient execution of quantum algorithms compared to static designs.
Parameterized quantum circuits (PQCs) serve as a flexible framework for implementing various quantum algorithms, particularly in quantum machine learning and optimization tasks. However, their training is challenging due to both theoretical constraints and the inherent limitations in current quantum hardware. A judicious choice of PQC architecture is crucial for accurately representing the solution space, and for ensuring convergence in training. Several works introduced measures of expressibility and entangling capability for PQCs, and compared these metrics across different circuit structures, providing insights into how they impact performance and efficiency. However, these investigations often assumed idealized all-to-all qubit connectivity, which is not applicable to most hardware architectures. In practice, additional transpilation steps are performed prior to execution on hardware. The potential impact of better alignment of the PQC structure with the underlying native topology has in fact motivated introduction of hardware-efficient ansatze. In our work, we extend the methodology of measuring PQC efficiency to include more realistic quantum hardware models. We examine several popular hardware topologies, including hexagonal, square, circular, linear, and all-to-all. We evaluate the expressibility and entangling capability of circuits with different connectivity types and various arrangements of rotation gates. We assess the training performance of these PQC types in the context of a variational compiling procedure and identify the preferred gate patterns. This approach provides a more realistic evaluation of PQC performance, thus offering practical insights into their applications on existing quantum devices.