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:0910.2129

An algorithm for minimization of quantum cost

Anindita Banerjee, Anirban Pathak

Published Oct 12, 2009• 12 citations
arXivHTMLPDF

Abstract

A new algorithm for minimization of quantum cost of quantum circuits has been designed. The quantum cost of different quantum circuits of particular interest (eg. circuits for EPR, quantum teleportation, shor code and different quantum arithmetic operations) are computed by using the proposed algorithm. The quantum costs obtained using the proposed algorithm is compared with the existing results and it is found that the algorithm has produced minimum quantum cost in all cases.

DOI
10.48550/arxiv.0910.2129

Related papers

An algorithm for minimization of quantum cost of quantum circuits

Anindita Banerjee, Anirban Patha

A new algorithm for minimization of quantum cost of quantum circuits has been designed. The quantum cost of different quantum circuits of particular interest (eg. circuits for EPR, quantum teleportation, shor code and different quantum arithmetic operations) are computed by using the proposed algorithm. The quantum costs obtained using the proposed algorithm is compared with the existing results and it is found that the algorithm has produced minimum quantum cost in all cases.

•Oct 12, 2009•0 citations

An optimizing method for performance and resource utilization in quantum machine learning circuits

Tahereh Salehi, Mariam Zomorodi Moghadam, Paweł Pławiak +2 more

Quantum computing is a new and advanced topic that refers to calculations based on the principles of quantum mechanics. It makes certain kinds of problems be solved easier compared to classical computers. This advantage of quantum computing can be used to implement many existing problems in different fields incredibly effectively. One important field that quantum computing has shown great results in machine learning. Until now, many different quantum algorithms have been presented to perform different machine learning approaches. In some special cases, the execution time of these quantum algorithms will be reduced exponentially compared to the classical ones. But at the same time, with increasing data volume and computation time, taking care of systems to prevent unwanted interactions with the environment can be a daunting task and since these algorithms work on machine learning problems, which usually includes big data, their implementation is very costly in terms of quantum resources. Here, in this paper, we have proposed an approach to reduce the cost of quantum circuits and to optimize quantum machine learning circuits in particular. To reduce the number of resources used, in this paper an approach including different optimization algorithms is considered. Our approach is used to optimize quantum machine learning algorithms for big data. In this case, the optimized circuits run quantum machine learning algorithms in less time than the original ones and by preserving the original functionality. Our approach improves the number of quantum gates by 10.7% and 14.9% in different circuits respectively. This is the amount of reduction for one iteration of a given sub-circuit U in the main circuit. For cases where this sub-circuit is repeated more times in the main circuit, the optimization rate is increased. Therefore, by applying the proposed method to circuits with big data, both cost and performance are improved.

Scientific Reports•Oct 10, 2022•7 citations

Quantum circuit design for computer-assisted Shor's algorithm

Chi‐Chuan Hwang, Chu-Yuan Tseng, Cheng-Fang Su

In this paper, we successfully construct the universal quantum gate for Shor’s algorithm and derive the cost of this quantum circuit to estimate the complexity. The circuit we design to implement Shor’s algorithm’s first complete quantum circuit rather than a simplified circuit. This is important that the quantum circuit design proposed in this paper can decompose larger composite numbers directly if the hardware can be improved in the future. Although the time and space complexity are still greater than traditional computers, it proves that Shor’s algorithm can be implemented in quantum computers.

•Feb 11, 2022•1 citation

Optimisation of quantum circuits using cost effective quantum gates

Swathi Mummadi, Bhawana Rudra

The importance of reversible operations has increased with the emergence of new technologies. Reversible operations are crucial for developing energy-efficient and cost-efficient circuits. The efficiency of a quantum circuit is measured in terms of quantum cost and quantum depth. In this paper, we propose an optimisation algorithm for reversible gates like the Peres gate, Toffoli gate, and the entanglement purification method. Peres and Toffoli gates play an important role in quantum circuit implementation, and entanglement purification plays a key role in various applications like quantum teleportation, secure communication, quantum key distribution, etc. The proposed algorithm optimises the quantum cost and quantum depth to 20% compared to the existing approaches.

International Journal of Computational Science and Engineering•Jan 1, 2025•1 citation

Optimisation of quantum circuits using cost effective quantum gates

Swathi Mummadi, Bhawana Rudra

The importance of reversible operations has increased with the emergence of new technologies. Reversible operations are crucial for developing energy-efficient and cost-efficient circuits. The efficiency of a quantum circuit is measured in terms of quantum cost and quantum depth. In this paper, we propose an optimisation algorithm for reversible gates like the Peres gate, Toffoli gate, and the entanglement purification method. Peres and Toffoli gates play an important role in quantum circuit implementation, and entanglement purification plays a key role in various applications like quantum teleportation, secure communication, quantum key distribution, etc. The proposed algorithm optimises the quantum cost and quantum depth to 20% compared to the existing approaches.

International Journal of Computational Science and Engineering•Jan 1, 2024•0 citations

A Framework for Quantum Circuit Optimization: Comparators as a Case Study

Francisco José Orts, Rodrigo Gil-Merino

Qubits are the minimum unit of information in quantum computing. As current quantum devices have a very limited number of available qubits, finding circuits that optimize their use is crucial for this computing paradigm. Optimizing the qubits needed to implement a quantum circuit is not trivial, as these circuits have important restrictions such as the impossibility of copying values or the requirement that the computation done in them must always be reversible. This paper presents a framework for optimizing circuits for quantum computing. The framework is able to obtain, given a quantum circuit, an equivalent one that is more efficient in terms of number of qubits. In particular, the framework has applicability in quantum circuits dedicated to arithmetic operations such as addition or multiplication. As a representative case study, it is applied to a reversible comparator circuit, obtaining a design that reduces the number of qubits and controlled gates compared to other reversible comparators reported in the recent literature. As part of the work, a public repository is included with the necessary code to simplify any other circuit.

IEEE Transactions on Computers•Dec 12, 2025•0 citations
A new algorithm for minimization of quantum cost of quantum circuits has been designed. The quantum cost of different quantum circuits of particular interest (eg. circuits for EPR, quantum teleportation, shor code and different quantum arithmetic operations) are computed by using the proposed algorithm. The quantum costs obtained using the proposed algorithm is compared with the existing results and it is found that the algorithm has produced minimum quantum cost in all cases.
Quantum computing is a new and advanced topic that refers to calculations based on the principles of quantum mechanics. It makes certain kinds of problems be solved easier compared to classical computers. This advantage of quantum computing can be used to implement many existing problems in different fields incredibly effectively. One important field that quantum computing has shown great results in machine learning. Until now, many different quantum algorithms have been presented to perform different machine learning approaches. In some special cases, the execution time of these quantum algorithms will be reduced exponentially compared to the classical ones. But at the same time, with increasing data volume and computation time, taking care of systems to prevent unwanted interactions with the environment can be a daunting task and since these algorithms work on machine learning problems, which usually includes big data, their implementation is very costly in terms of quantum resources. Here, in this paper, we have proposed an approach to reduce the cost of quantum circuits and to optimize quantum machine learning circuits in particular. To reduce the number of resources used, in this paper an approach including different optimization algorithms is considered. Our approach is used to optimize quantum machine learning algorithms for big data. In this case, the optimized circuits run quantum machine learning algorithms in less time than the original ones and by preserving the original functionality. Our approach improves the number of quantum gates by 10.7% and 14.9% in different circuits respectively. This is the amount of reduction for one iteration of a given sub-circuit U in the main circuit. For cases where this sub-circuit is repeated more times in the main circuit, the optimization rate is increased. Therefore, by applying the proposed method to circuits with big data, both cost and performance are improved.
In this paper, we successfully construct the universal quantum gate for Shor’s algorithm and derive the cost of this quantum circuit to estimate the complexity. The circuit we design to implement Shor’s algorithm’s first complete quantum circuit rather than a simplified circuit. This is important that the quantum circuit design proposed in this paper can decompose larger composite numbers directly if the hardware can be improved in the future. Although the time and space complexity are still greater than traditional computers, it proves that Shor’s algorithm can be implemented in quantum computers.
The importance of reversible operations has increased with the emergence of new technologies. Reversible operations are crucial for developing energy-efficient and cost-efficient circuits. The efficiency of a quantum circuit is measured in terms of quantum cost and quantum depth. In this paper, we propose an optimisation algorithm for reversible gates like the Peres gate, Toffoli gate, and the entanglement purification method. Peres and Toffoli gates play an important role in quantum circuit implementation, and entanglement purification plays a key role in various applications like quantum teleportation, secure communication, quantum key distribution, etc. The proposed algorithm optimises the quantum cost and quantum depth to 20% compared to the existing approaches.
The importance of reversible operations has increased with the emergence of new technologies. Reversible operations are crucial for developing energy-efficient and cost-efficient circuits. The efficiency of a quantum circuit is measured in terms of quantum cost and quantum depth. In this paper, we propose an optimisation algorithm for reversible gates like the Peres gate, Toffoli gate, and the entanglement purification method. Peres and Toffoli gates play an important role in quantum circuit implementation, and entanglement purification plays a key role in various applications like quantum teleportation, secure communication, quantum key distribution, etc. The proposed algorithm optimises the quantum cost and quantum depth to 20% compared to the existing approaches.
Qubits are the minimum unit of information in quantum computing. As current quantum devices have a very limited number of available qubits, finding circuits that optimize their use is crucial for this computing paradigm. Optimizing the qubits needed to implement a quantum circuit is not trivial, as these circuits have important restrictions such as the impossibility of copying values or the requirement that the computation done in them must always be reversible. This paper presents a framework for optimizing circuits for quantum computing. The framework is able to obtain, given a quantum circuit, an equivalent one that is more efficient in terms of number of qubits. In particular, the framework has applicability in quantum circuits dedicated to arithmetic operations such as addition or multiplication. As a representative case study, it is applied to a reversible comparator circuit, obtaining a design that reduces the number of qubits and controlled gates compared to other reversible comparators reported in the recent literature. As part of the work, a public repository is included with the necessary code to simplify any other circuit.