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

Quantum circuit for multi-qubit Toffoli gate with optimal resource

Nie, Junhong, Wei Zi, Xiaoming Sun

Published Feb 7, 2024• 54 citations
arXivHTMLPDF

Abstract

Resource consumption is an important issue in quantum information processing, particularly during the present NISQ era. In this paper, we investigate resource optimization of implementing multiple controlled operations, which are fundamental building blocks in the field of quantum computing and quantum simulation. We design new quantum circuits for the $n$-Toffoli gate and general multi-controlled unitary, which have only $O(\log n)$-depth and $O(n)$-size, and only require $1$ ancillary qubit. To achieve these results, we explore the potential of ancillary qubits and discover a method to create new conditional clean qubits from existed ancillary qubits. These techniques can also be utilized to construct an efficient quantum circuit for incrementor, leading to an implementation of multi-qubit Toffoli gate with a depth of $O(\log^2n)$ and size of $O(n)$ without any ancillary qubits. Furthermore, we explore the power of ancillary qubits from the perspective of resource theory. We demonstrate that without the assistance of ancillary qubit, any quantum circuit implementation of multi-qubit Toffoli gate must employ exponential precision gates. This finding indicates a significant disparity in computational power of quantum circuits between using and not using ancillary qubits. Additionally, we discuss the comparison of the power of ancillary qubits and extra energy levels in quantum circuit design.

DOI
10.48550/arxiv.2402.05053

Related papers

Ancilla-free optimal quantum adder

Junhong Nie, Jialiang Tang, Xiaoming Sun +1 more

We construct an exact $n$-bit quantum adder with $O(n)$ gates and $O(\log n)$ depth that requires no ancillary qubits. The circuit uses only $X$, CNOT, and Toffoli gates under all-to-all connectivity and is classically reversible. Our construction accelerates the controlled ladder underlying addition. Grouping the data into blocks and use existing control qubits as conditional workspace gives a recursive construction with $O(n\log\log n)$ gates and $O(\log n)$ depth. We then coordinate inter-block propagation via two short-path forest operations to cut the per-block workspace requirement, yielding a nonrecursive implementation with $O(n)$ gates. Both the gate count and circuit depth are asymptotically optimal.

quant-pharXiv:2610.34446•Oct 27, 2026•0 citations

Low quantum cost realization of generalized peres and toffoli gates with multiple-control signals

Marek Szyprowski, Paweł Kerntopf

Multiple-control Toffoli gates are basic building blocks for reversible and quantum circuits. 3-bit Peres gate can be considered as a pair of 3-bit and 2-bit Toffoli gates, which can be implemented with fewer elementary quantum gates (what defines a metric called quantum cost) than the total number of elementary quantum gates required by each of Toffoli gates implemented separately. Due to this property, Peres gates are often used for quantum cost reduction of reversible circuits. This paper introduces a generalization of the Peres gate with n > 2 control signals. For such generalized gates corresponding quantum circuits are presented. The realizations have quantum cost of n2and require no ancillary signals. The proposed designs are built from elementary quantum gates, which consist of NOT, controlled NOT, controlled `square-roots-of-NOT' (known as controlled V/V+gates) and controlled `higher roots-of-NOT' (up to 2n-1-roots-of-NOT). The obtained quantum circuits are not entangled. The proposed designs are used to construct Toffoli gates of n control signals with quantum cost of 2n2- 2n + 1 and using no ancillary signals. This is an improvement in comparison with 2n+1- 3 and 48n2+ O(n), which are quantum costs of the known designs of the multiple-control Toffoli gate without ancillary signals.

IEEE International Conference on Nanotechnology (IEEE-NANO)•Aug 1, 2013•24 citations

Efficient Synthesis of Multi-Controlled Toffoli Gates with Ternary Clifford$+P_9$ Gates

Amit Saha, Francesco Arzani

Temporary occupation of qutrit levels can reduce the width and depth required for binary circuit logic in quantum computing. We introduce an efficient intermediate-qutrit decomposition of multi-controlled Toffoli gates with binary-subspace inputs and outputs. For balanced control widths $n=2^h-1$, the proposed decomposition is evaluated hierarchically through a tree, allowing independent subtree computations to proceed in parallel and reducing the depth from linear to logarithmic. The balanced low-depth construction requires $6n+3$ logical $P_9$ injections and $\frac{n-3}{4}$ clean ancillary qutrits. It matches the direct $P_9$ count of a recursively extended Clifford+$P_9$ baseline derived from the state-of-the-art work while using asymptotically one-quarter as many clean ancillas and replacing linear depth with logarithmic depth. For arbitrary control widths, a sequential extension preserves the $6n+3$ $P_9$ count but has depth $O(\log m+n-m)$ for a balanced core $m=2^h-1\leq n$, which is linear in the worst case over $n$. By reducing the resource overhead of a widely used reversible primitive, the proposed decomposition provides a practical building block for the design and compilation of more resource-efficient quantum algorithms in the fault-tolerant regime.

quant-pharXiv:2609.29884•Sep 25, 2026•1 citation

Efficient Quantum Circuit Synthesis for SAT-Oracle With Limited Ancillary Qubit

Shuai Yang, Wei Zi, Bujiao Wu +3 more

One of the main concerns in the era of noisy intermediate-scale quantum (NISQ) computing and fault-tolerant quantum computing is the optimization of circuit implementation for quantum oracles, particularly with limited resources. Synthesizing a satisfiability (SAT) oracle, a crucial component in solving SAT problems, presents a significant challenge. The current state-of-the-art implementation of an$m$-clause SAT-oracle necessitates$2m-1$ancillary qubits and a linear number of elementary gates. We develop two efficient and ancilla-adjustable synthesis algorithms to reduce the overall quantum resource usage. Our first quantum oracle algorithm achieves quadratic optimization in the number of ancillary qubits with merely eight times increased circuit size. We also show that using only three ancillary qubits with quadratic circuit size expansion is enough. Our second algorithm optimizes the circuit depth of the SAT oracle to$\tilde {O}(\log m)$using$m$ancillary qubits. By running our algorithms on classical intractable SAT instances featured in SAT competitions, the experiment results show that our required quantum resources align well with our theoretical analysis. Our algorithms highlight the scalability of SAT-oracle-based algorithms in near-term quantum devices, such as Grover’s algorithm.

arXiv:2101.05430•IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems•Oct 19, 2023•5 citations

Asymptotically Optimal Quantum Circuits for Comparators and Incrementers

Vivien Vandaele

We present quantum circuits for comparison and increment operations that achieve an asymptotically optimal gate count of $Θ(n)$ and depth of $Θ(\log n)$ over the Clifford+Toffoli gate set, while using a provably minimal number of qubits. We extend these results to classical-quantum comparators, yielding an improved classical-quantum adder with an optimal qubit count. Given the ubiquity of these operations as algorithmic building blocks, our constructions translate directly into reduced circuit complexity for many quantum algorithms. As a notable example, they can be used to improve a space-efficient circuit for Shor's factoring algorithm, reducing circuit depth from $\mathcal{O}(n^3)$ to $\mathcal{O}(n^2 \log^2 n)$ without increasing either the qubit count or the asymptotic gate complexity. Underpinning these results is a general theorem demonstrating how to trade ancilla qubits for control qubits with low overhead in both depth and gate count, providing a broadly applicable tool for quantum circuit design.

quant-pharXiv:2603.12917•Mar 16, 2026•9 citations

Recursive Generation of Multi-Qubits Control Gate to Facilitate the Grover's Quantum Algorithm in Large Scale Database Search

Wen-Li Wang, Shahid Hussain, Nathaniel V. Rondinelli +2 more

Context: Grover's algorithm is a powerful tool in the realm of quantum computing because it offers exponential speedup over classical linear searching for unstructured / unsorted search problems. However, it is challenging to construct efficient and scalable circuits for a multi-input control gate in the algorithm, particularly with a huge number of qubit inputs. Problem: Traditional circuit construction methods often require manual composition for the multi-input gate from basic quantum gates, which can be time consuming and error prone, thus hindering practical implementation. Moreover, the number of simple gates in the composition grows exponentially with the addition of each qubit. Method: This research provides an approach to recursively generate the oracle using Toffoli gates as the fundamental units to enhance scalability and reusability while maintaining effectiveness. The methodology leverages IBM Qiskit and Quantum Lab to simulate quantum computation to prove the practicality and feasibility. Result: The findings from the experiments between recursively and non-recursively generated circuits suggest that our recursive approach can offer comparable accuracy and computational complexity compared to the non-recursive approach. However, it tends to require a larger number of basic quantum gates due to a lack of circuit optimization. Conclusion: The results showcase the applicability of utilizing recursion as a speedy and economical alternative to generate circuits when implementing the Grover's algorithm. It not only presents potential scalability benefits, but also creates an avenue for further research on test verification and performance improvement to the computing community when running in actual quantum hardware.

IEEE International Conference on Software Quality, Reliability and Security Companion (QRS-C)•Jul 1, 2024•0 citations
Resource consumption is an important issue in quantum information processing, particularly during the present NISQ era. In this paper, we investigate resource optimization of implementing multiple controlled operations, which are fundamental building blocks in the field of quantum computing and quantum simulation. We design new quantum circuits for the nnn-Toffoli gate and general multi-controlled unitary, which have only O(log⁡n)O(\log n)O(logn)-depth and O(n)O(n)O(n)-size, and only require 111 ancillary qubit. To achieve these results, we explore the potential of ancillary qubits and discover a method to create new conditional clean qubits from existed ancillary qubits. These techniques can also be utilized to construct an efficient quantum circuit for incrementor, leading to an implementation of multi-qubit Toffoli gate with a depth of O(log⁡2n)O(\log^2n)O(log2n) and size of O(n)O(n)O(n) without any ancillary qubits. Furthermore, we explore the power of ancillary qubits from the perspective of resource theory. We demonstrate that without the assistance of ancillary qubit, any quantum circuit implementation of multi-qubit Toffoli gate must employ exponential precision gates. This finding indicates a significant disparity in computational power of quantum circuits between using and not using ancillary qubits. Additionally, we discuss the comparison of the power of ancillary qubits and extra energy levels in quantum circuit design.
We construct an exact nnn-bit quantum adder with O(n)O(n)O(n) gates and O(log⁡n)O(\log n)O(logn) depth that requires no ancillary qubits. The circuit uses only XXX, CNOT, and Toffoli gates under all-to-all connectivity and is classically reversible. Our construction accelerates the controlled ladder underlying addition. Grouping the data into blocks and use existing control qubits as conditional workspace gives a recursive construction with O(nlog⁡log⁡n)O(n\log\log n)O(nloglogn) gates and O(log⁡n)O(\log n)O(logn) depth. We then coordinate inter-block propagation via two short-path forest operations to cut the per-block workspace requirement, yielding a nonrecursive implementation with O(n)O(n)O(n) gates. Both the gate count and circuit depth are asymptotically optimal.
Multiple-control Toffoli gates are basic building blocks for reversible and quantum circuits. 3-bit Peres gate can be considered as a pair of 3-bit and 2-bit Toffoli gates, which can be implemented with fewer elementary quantum gates (what defines a metric called quantum cost) than the total number of elementary quantum gates required by each of Toffoli gates implemented separately. Due to this property, Peres gates are often used for quantum cost reduction of reversible circuits. This paper introduces a generalization of the Peres gate with n > 2 control signals. For such generalized gates corresponding quantum circuits are presented. The realizations have quantum cost of n2and require no ancillary signals. The proposed designs are built from elementary quantum gates, which consist of NOT, controlled NOT, controlled `square-roots-of-NOT' (known as controlled V/V+gates) and controlled `higher roots-of-NOT' (up to 2n-1-roots-of-NOT). The obtained quantum circuits are not entangled. The proposed designs are used to construct Toffoli gates of n control signals with quantum cost of 2n2- 2n + 1 and using no ancillary signals. This is an improvement in comparison with 2n+1- 3 and 48n2+ O(n), which are quantum costs of the known designs of the multiple-control Toffoli gate without ancillary signals.
Efficient Synthesis of Multi-Controlled Toffoli Gates with Ternary Clifford+P9+P_9+P9​ Gates
Temporary occupation of qutrit levels can reduce the width and depth required for binary circuit logic in quantum computing. We introduce an efficient intermediate-qutrit decomposition of multi-controlled Toffoli gates with binary-subspace inputs and outputs. For balanced control widths n=2h−1n=2^h-1n=2h−1, the proposed decomposition is evaluated hierarchically through a tree, allowing independent subtree computations to proceed in parallel and reducing the depth from linear to logarithmic. The balanced low-depth construction requires 6n+36n+36n+3 logical P9P_9P9​ injections and n−34\frac{n-3}{4}4n−3​ clean ancillary qutrits. It matches the direct P9P_9P9​ count of a recursively extended Clifford+P9P_9P9​ baseline derived from the state-of-the-art work while using asymptotically one-quarter as many clean ancillas and replacing linear depth with logarithmic depth. For arbitrary control widths, a sequential extension preserves the 6n+36n+36n+3 P9P_9P9​ count but has depth O(log⁡m+n−m)O(\log m+n-m)O(logm+n−m) for a balanced core m=2h−1≤nm=2^h-1\leq nm=2h−1≤n, which is linear in the worst case over nnn. By reducing the resource overhead of a widely used reversible primitive, the proposed decomposition provides a practical building block for the design and compilation of more resource-efficient quantum algorithms in the fault-tolerant regime.
One of the main concerns in the era of noisy intermediate-scale quantum (NISQ) computing and fault-tolerant quantum computing is the optimization of circuit implementation for quantum oracles, particularly with limited resources. Synthesizing a satisfiability (SAT) oracle, a crucial component in solving SAT problems, presents a significant challenge. The current state-of-the-art implementation of anmmm-clause SAT-oracle necessitates2m−12m-12m−1ancillary qubits and a linear number of elementary gates. We develop two efficient and ancilla-adjustable synthesis algorithms to reduce the overall quantum resource usage. Our first quantum oracle algorithm achieves quadratic optimization in the number of ancillary qubits with merely eight times increased circuit size. We also show that using only three ancillary qubits with quadratic circuit size expansion is enough. Our second algorithm optimizes the circuit depth of the SAT oracle toO~(log⁡m)\tilde {O}(\log m)O~(logm)usingmmmancillary qubits. By running our algorithms on classical intractable SAT instances featured in SAT competitions, the experiment results show that our required quantum resources align well with our theoretical analysis. Our algorithms highlight the scalability of SAT-oracle-based algorithms in near-term quantum devices, such as Grover’s algorithm.
We present quantum circuits for comparison and increment operations that achieve an asymptotically optimal gate count of Θ(n)Θ(n)Θ(n) and depth of Θ(log⁡n)Θ(\log n)Θ(logn) over the Clifford+Toffoli gate set, while using a provably minimal number of qubits. We extend these results to classical-quantum comparators, yielding an improved classical-quantum adder with an optimal qubit count. Given the ubiquity of these operations as algorithmic building blocks, our constructions translate directly into reduced circuit complexity for many quantum algorithms. As a notable example, they can be used to improve a space-efficient circuit for Shor's factoring algorithm, reducing circuit depth from O(n3)\mathcal{O}(n^3)O(n3) to O(n2log⁡2n)\mathcal{O}(n^2 \log^2 n)O(n2log2n) without increasing either the qubit count or the asymptotic gate complexity. Underpinning these results is a general theorem demonstrating how to trade ancilla qubits for control qubits with low overhead in both depth and gate count, providing a broadly applicable tool for quantum circuit design.
Context: Grover's algorithm is a powerful tool in the realm of quantum computing because it offers exponential speedup over classical linear searching for unstructured / unsorted search problems. However, it is challenging to construct efficient and scalable circuits for a multi-input control gate in the algorithm, particularly with a huge number of qubit inputs. Problem: Traditional circuit construction methods often require manual composition for the multi-input gate from basic quantum gates, which can be time consuming and error prone, thus hindering practical implementation. Moreover, the number of simple gates in the composition grows exponentially with the addition of each qubit. Method: This research provides an approach to recursively generate the oracle using Toffoli gates as the fundamental units to enhance scalability and reusability while maintaining effectiveness. The methodology leverages IBM Qiskit and Quantum Lab to simulate quantum computation to prove the practicality and feasibility. Result: The findings from the experiments between recursively and non-recursively generated circuits suggest that our recursive approach can offer comparable accuracy and computational complexity compared to the non-recursive approach. However, it tends to require a larger number of basic quantum gates due to a lack of circuit optimization. Conclusion: The results showcase the applicability of utilizing recursion as a speedy and economical alternative to generate circuits when implementing the Grover's algorithm. It not only presents potential scalability benefits, but also creates an avenue for further research on test verification and performance improvement to the computing community when running in actual quantum hardware.