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

International Journal of Theoretical Physics

Cost Optimization Technique for Quantum Circuits

Anirban Basak, Arindam Sadhu, Kunal Das, Kapil K. Sharma

Published Jul 2, 2019• 6 citations
Publisher
DOI
10.1007/s10773-019-04192-7

Related papers

Quantum Cost Reduction of Reversible Circuits Using New Toffoli Decomposition Techniques

Md. Belayet Ali, Takashi Hirayama, Katsuhisa Yamanaka +1 more

Quantum cost is the most important criteria to evaluate reversible and quantum circuits. Also the fundamental building blocks of reversible and quantum circuits are Multiple-Control Toffoli (MCT) gates. The synthesis of MCT based reversible circuits are usually conducted into two steps. First, MCT circuits are decomposed into quantum circuits and then they are optimized using various techniques such as template matching, moving rules to reduce the quantum cost of reversible circuits. In this paper, we propose new techniques to decompose the Toffoli gates, in which MCT based circuits are mapped into a corresponding quantum realization. The main improvement is that the resulting quantum realization of MCT based circuits makes significantly better realization than those achieved in the earlier approaches and further reduction is possible using some other optimization techniques. Experimental results show that our new techniques enable to get sub-optimal realization of the MCT based reversible circuits in decomposition stage and quantum cost reduction of the reversible circuits is achieved by using that sub-optimal realization.

International Conference on Computational Science and Computational Intelligence (CSCI)•Dec 1, 2015•18 citations

An Efficient Quantum Circuit Design: Properties and Optimization Techniques

Mamtha Prajapati, Kalyan Babu Killana

Smart innovation, systems and technologies•Oct 17, 2024•4 citations

Quantum Circuits: Design and Optimization

George A. Kevrekidis

•Aug 17, 2018•0 citations

Optimal Wire Cutting With Classical Communication

Lukas Brenner, Christophe Piveteau, David Sutter

Circuit knitting is the process of partitioning large quantum circuits into smaller subcircuits such that the result of the original circuits can be deduced by only running the subcircuits. Such techniques will be crucial for near-term and early fault-tolerant quantum computers, as the limited number of qubits is likely to be a major bottleneck for demonstrating quantum advantage. One typically distinguishes between gate cuts and wire cuts when partitioning a circuit. The cost for any circuit knitting approach scales exponentially in the number of cuts. One possibility to realize a cut is via the quasiprobability simulation technique. In fact, we argue that all existing rigorous circuit knitting techniques can be understood in this framework. Furthermore, we characterize the optimal overhead for wire cuts where the subcircuits can exchange classical information or not. We show that the optimal cost for cuttingnwires without and with classical communication between the subcircuits scales asO(16n) andO(4n), respectively.

arXiv:2302.03366•IEEE Transactions on Information Theory•Aug 20, 2025•73 citations

Optimal Quantum Circuit Mapping

Lukas Burgholzer, Robert Wille

Springer eBooks•Jan 1, 2026•0 citations

Quantum Island Mapping: Optimizing Multi-Circuit Execution in Quantum Processors

Jaime Alvarado‐Valiente, Javier Romero‐Álvarez, Jorge Casco-Seco +2 more

Currently, quantum processors offered by quantum service providers are significantly underutilized, resulting in high execution costs and limited scalability. Various approaches have explored parallelization and circuit scheduling techniques to improve resource utilization. While these methods can significantly reduce both cost and execution times, they often have an impact on the results' noise. Addressing this challenge, this emerging study proposes a technique called Quantum Island Mapping, which enables the execution of multiple quantum circuits by separating them into “islands” within the qubit topology of a processor. The goal is to schedule multiple circuits into a single task to reduce execution costs and queuing, while maintaining a controlled separation of qubits between circuits to minimize interferences. To achieve this, separation distance parameters are defined, specifying the minimum number of qubits between different islands. This allows for configurations ranging from zero separation (maximum processor utilization) to maximum separation (single-circuit execution). The technique has been validated through experiments on a real quantum computer using well-known quantum algorithms, achieving optimal results.

IEEE International Conference on Quantum Computing and Engineering (QCE)•Aug 30, 2025•3 citations
Quantum cost is the most important criteria to evaluate reversible and quantum circuits. Also the fundamental building blocks of reversible and quantum circuits are Multiple-Control Toffoli (MCT) gates. The synthesis of MCT based reversible circuits are usually conducted into two steps. First, MCT circuits are decomposed into quantum circuits and then they are optimized using various techniques such as template matching, moving rules to reduce the quantum cost of reversible circuits. In this paper, we propose new techniques to decompose the Toffoli gates, in which MCT based circuits are mapped into a corresponding quantum realization. The main improvement is that the resulting quantum realization of MCT based circuits makes significantly better realization than those achieved in the earlier approaches and further reduction is possible using some other optimization techniques. Experimental results show that our new techniques enable to get sub-optimal realization of the MCT based reversible circuits in decomposition stage and quantum cost reduction of the reversible circuits is achieved by using that sub-optimal realization.
Circuit knitting is the process of partitioning large quantum circuits into smaller subcircuits such that the result of the original circuits can be deduced by only running the subcircuits. Such techniques will be crucial for near-term and early fault-tolerant quantum computers, as the limited number of qubits is likely to be a major bottleneck for demonstrating quantum advantage. One typically distinguishes between gate cuts and wire cuts when partitioning a circuit. The cost for any circuit knitting approach scales exponentially in the number of cuts. One possibility to realize a cut is via the quasiprobability simulation technique. In fact, we argue that all existing rigorous circuit knitting techniques can be understood in this framework. Furthermore, we characterize the optimal overhead for wire cuts where the subcircuits can exchange classical information or not. We show that the optimal cost for cuttingnwires without and with classical communication between the subcircuits scales asO(16n) andO(4n), respectively.
Currently, quantum processors offered by quantum service providers are significantly underutilized, resulting in high execution costs and limited scalability. Various approaches have explored parallelization and circuit scheduling techniques to improve resource utilization. While these methods can significantly reduce both cost and execution times, they often have an impact on the results' noise. Addressing this challenge, this emerging study proposes a technique called Quantum Island Mapping, which enables the execution of multiple quantum circuits by separating them into “islands” within the qubit topology of a processor. The goal is to schedule multiple circuits into a single task to reduce execution costs and queuing, while maintaining a controlled separation of qubits between circuits to minimize interferences. To achieve this, separation distance parameters are defined, specifying the minimum number of qubits between different islands. This allows for configurations ranging from zero separation (maximum processor utilization) to maximum separation (single-circuit execution). The technique has been validated through experiments on a real quantum computer using well-known quantum algorithms, achieving optimal results.