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

An Algorithm For Quantum Circuit Optimization

Raymond Garwei Wong

Published Jan 1, 2012• 3 citations
OpenAlex

Abstract

In the past 20 years, many researchers shifted their focus to developing computers based on quantum mechanical phenomenon as current computers started to plateau in performance. Some problems such as integer factorization have been shown to perform much more efficiently on a quantum computer than on its classical counterpart. However, quantum computers will continue to remain the object of theoretical research unless it can be physically manifested, and quantum circuit optimization hopes to be a useful aid in turning the theory into a reality. My project looks at a possible approach to solving the issue of circuit optimization by incorporating classical algorithms as well as touching on another possible application of machine learning. The research and implementation is incomplete, but a glance at the material shows it has potential to be fairly effective.

Related papers

4. From classical to quantum machine learning

Arit Kumar Bishwas, Ashish Mani, Vasile Palade

In recent years, Machine Learning (ML) has started to be ubiquitously applied to practically most of the human activity domains. Although traditional, or classical machine learning (CML) approaches are useful in solving many complex tasks, there are still many challenges that such approaches are facing. One issue is the limitation in the processing speed of current silicon technology based computers, which made researchers look to the underlying quantum theory principles and try to run complex quantum computing experiments. In future, in order to develop more complex artificial intelligence systems, we will have to process huge amounts of data at high speed, and the existing classical computing will probably not serve well this purpose, due to silicon technology limitations. A different technology that can handle huge volumes of data and at high speed is needed. In recent years, the progress in quantum computing research seems to provide hopeful answers to overcome the speed processing barrier. This is very important for the training of many computational intensive machine learning models. The latest advancements in quantum technology appear to be promising, which can boost the field of machine learning overall. In this chapter, we discuss the transition from classical machine learning to quantum machine learning (QML) and explore the recent progress in this domain. QML is not only associated with the development of high-performance machine learning algorithms that can run on a quantum computer with significant performance improvements but also has a very diverse meaning in other aspects. The chapter tried to touch those aspects in brief too, but the main focus is on the advancements in the field of developing machine learning algorithms that will run on a quantum computer.

De Gruyter eBooks•Jun 8, 2020•0 citations

How to Synthesize Quantum-Circuit Optimizers

Amanda Xu

Recent breakthroughs in quantum computing hardware have brought us closer to realizing the dream of quantum computers accelerating domains such as materials discovery, chemistry, and beyond. Further shrinking the timeline for solving useful problems with quantum computing requires a flexible compilation stack that can adapt to emerging hardware. My research develops robust tools and techniques for optimizing quantum programs to be run on arbitrary quantum computing architectures.

ACM SIGPLAN International Conference on Systems, Programming, Languages, and Applications: Software for Humanity (SPLASH)•Oct 10, 2025•0 citations

Classification problem solving using quantum machine learning mechanisms

Alina O. Savchuk, Nonna N. Shapovalova

Due to the similarity of the computational and probabilistic nature of quantum computing and machine learning, the idea arose to optimize the learning process using quantum methods. There are both fundamentally new algorithms, such as HHL, and quantum-improved ones: QPCA, QSVM. In this article, we will look at the QSVM algorithm step by step, starting from the basics described in section 2 and gradually delving into the composition of the algorithm. Thus, after the basics, we will consider the quantum phase estimation, which is part of the HHL algorithm, and then the QSVM algorithm, the component of which is the HHL. We also will consider the QPCA algorithm, which can be applied before the QSVM algorithm to reduce the dimension of the data sample. In this way, we explore the fundamental difference between classical algorithms and their quantum counterparts. We also implement the QSVM method in practice and compare the obtained practical results with theory. As a result, we obtained high quality of accuracy (100 %) compared to the classical SVM (83 %) on a data sample of dimension 72. However, we found out that the learning time on a quantum device is far from ideal (it can reach 5 min for a sample of this size). The study aims to theoretically argue or disprove the hypothesis about the efficiency of quantum computing for machine learning algorithms. The object of research is the programming of quantum computers. The research subject is the study of quantum computing mechanisms for the implementation of machine learning problems. The research result is a software module that allows evaluating the efficiency of the classification task on a quantum computer. It also can be used to compare the results obtained from classical and quantum devices. Research methods: theoretical analysis of the foundations of quantum computing: principles of superposition and entanglement, linear algebra, probability theory over complex numbers; building a model of one qubit and multi-qubit system; research of quantum machine learning algorithms’ work principles and their complexity; empirical comparison of quantum machine learning methods with their classical counterparts.

Workshop for Young Scientists in Computer Science & Software Engineering (CS&SE@SW)•Jan 19, 2022•0 citations

A Comprehensive Review of Quantum Circuit Optimization: Current Trends and Future Directions

Krishnageetha Karuppasamy, Varun Puram, Stevens Johnson +1 more

Optimizing quantum circuits is critical for enhancing computational speed and mitigating errors caused by quantum noise. Effective optimization must be achieved without compromising the correctness of the computations. This survey explores recent advancements in quantum circuit optimization, encompassing both hardware-independent and hardware-dependent techniques. It reviews state-of-the-art approaches, including analytical algorithms, heuristic strategies, machine learning-based methods, and hybrid quantum-classical frameworks. The paper highlights the strengths and limitations of each method, along with the challenges they pose. Furthermore, it identifies potential research opportunities in this evolving field, offering insights into the future directions of quantum circuit optimization.

arXiv:2408.08941•Quantum Reports•Jan 1, 2025•43 citations

Optimizing the Prioritization of Compiled Quantum Circuits by Machine Learning Approaches

Marie Salm, Johanna Barzen, Frank Leymann +1 more

Communications in computer and information science•Jan 1, 2022•5 citations

Exploration and Development of Quantum Computing Algorithms for Optimization, Cryptography, and Machine Learning Applications

Kaya Tunçel

Quantum computing, with its potential to revolutionize computation, relies fundamentally on the development of efficient algorithms to leverage its unparalleled processing capabilities. This research delves into the creation, exploration, and refinement of quantum computing algorithms, focusing on their applications in optimization, cryptography, and machine learning. Quantum algorithms such as Shor's and Grover's have demonstrated remarkable advantages in factorization and search problems, while more recent innovations are tackling complex challenges in global optimization and data analysis. By integrating principles of quantum mechanics—such as superposition, entanglement, and interference—these algorithms promise exponential speed-ups over classical counterparts in specific domains. This study critically analyzes existing quantum algorithms, proposes advancements in hybrid quantum-classical frameworks, and explores their implications for practical problem-solving. Through simulations and theoretical evaluations, it aims to bridge the gap between quantum theory and real-world applications, contributing to the evolution of quantum computing as a transformative technology.

Human computer interaction.•Nov 11, 2024•3 citations
In the past 20 years, many researchers shifted their focus to developing computers based on quantum mechanical phenomenon as current computers started to plateau in performance. Some problems such as integer factorization have been shown to perform much more efficiently on a quantum computer than on its classical counterpart. However, quantum computers will continue to remain the object of theoretical research unless it can be physically manifested, and quantum circuit optimization hopes to be a useful aid in turning the theory into a reality. My project looks at a possible approach to solving the issue of circuit optimization by incorporating classical algorithms as well as touching on another possible application of machine learning. The research and implementation is incomplete, but a glance at the material shows it has potential to be fairly effective.
In recent years, Machine Learning (ML) has started to be ubiquitously applied to practically most of the human activity domains. Although traditional, or classical machine learning (CML) approaches are useful in solving many complex tasks, there are still many challenges that such approaches are facing. One issue is the limitation in the processing speed of current silicon technology based computers, which made researchers look to the underlying quantum theory principles and try to run complex quantum computing experiments. In future, in order to develop more complex artificial intelligence systems, we will have to process huge amounts of data at high speed, and the existing classical computing will probably not serve well this purpose, due to silicon technology limitations. A different technology that can handle huge volumes of data and at high speed is needed. In recent years, the progress in quantum computing research seems to provide hopeful answers to overcome the speed processing barrier. This is very important for the training of many computational intensive machine learning models. The latest advancements in quantum technology appear to be promising, which can boost the field of machine learning overall. In this chapter, we discuss the transition from classical machine learning to quantum machine learning (QML) and explore the recent progress in this domain. QML is not only associated with the development of high-performance machine learning algorithms that can run on a quantum computer with significant performance improvements but also has a very diverse meaning in other aspects. The chapter tried to touch those aspects in brief too, but the main focus is on the advancements in the field of developing machine learning algorithms that will run on a quantum computer.
Due to the similarity of the computational and probabilistic nature of quantum computing and machine learning, the idea arose to optimize the learning process using quantum methods. There are both fundamentally new algorithms, such as HHL, and quantum-improved ones: QPCA, QSVM. In this article, we will look at the QSVM algorithm step by step, starting from the basics described in section 2 and gradually delving into the composition of the algorithm. Thus, after the basics, we will consider the quantum phase estimation, which is part of the HHL algorithm, and then the QSVM algorithm, the component of which is the HHL. We also will consider the QPCA algorithm, which can be applied before the QSVM algorithm to reduce the dimension of the data sample. In this way, we explore the fundamental difference between classical algorithms and their quantum counterparts. We also implement the QSVM method in practice and compare the obtained practical results with theory. As a result, we obtained high quality of accuracy (100 %) compared to the classical SVM (83 %) on a data sample of dimension 72. However, we found out that the learning time on a quantum device is far from ideal (it can reach 5 min for a sample of this size). The study aims to theoretically argue or disprove the hypothesis about the efficiency of quantum computing for machine learning algorithms. The object of research is the programming of quantum computers. The research subject is the study of quantum computing mechanisms for the implementation of machine learning problems. The research result is a software module that allows evaluating the efficiency of the classification task on a quantum computer. It also can be used to compare the results obtained from classical and quantum devices. Research methods: theoretical analysis of the foundations of quantum computing: principles of superposition and entanglement, linear algebra, probability theory over complex numbers; building a model of one qubit and multi-qubit system; research of quantum machine learning algorithms’ work principles and their complexity; empirical comparison of quantum machine learning methods with their classical counterparts.
Optimizing quantum circuits is critical for enhancing computational speed and mitigating errors caused by quantum noise. Effective optimization must be achieved without compromising the correctness of the computations. This survey explores recent advancements in quantum circuit optimization, encompassing both hardware-independent and hardware-dependent techniques. It reviews state-of-the-art approaches, including analytical algorithms, heuristic strategies, machine learning-based methods, and hybrid quantum-classical frameworks. The paper highlights the strengths and limitations of each method, along with the challenges they pose. Furthermore, it identifies potential research opportunities in this evolving field, offering insights into the future directions of quantum circuit optimization.
Quantum computing, with its potential to revolutionize computation, relies fundamentally on the development of efficient algorithms to leverage its unparalleled processing capabilities. This research delves into the creation, exploration, and refinement of quantum computing algorithms, focusing on their applications in optimization, cryptography, and machine learning. Quantum algorithms such as Shor's and Grover's have demonstrated remarkable advantages in factorization and search problems, while more recent innovations are tackling complex challenges in global optimization and data analysis. By integrating principles of quantum mechanics—such as superposition, entanglement, and interference—these algorithms promise exponential speed-ups over classical counterparts in specific domains. This study critically analyzes existing quantum algorithms, proposes advancements in hybrid quantum-classical frameworks, and explores their implications for practical problem-solving. Through simulations and theoretical evaluations, it aims to bridge the gap between quantum theory and real-world applications, contributing to the evolution of quantum computing as a transformative technology.