Stesso: A reconfigurable decomposition of $n$-bit Toffoli gates using symmetrical logical structures and adjustable support qubits

• URL: http://arxiv.org/abs/2510.26116v2
• Date: Fri, 31 Oct 2025 01:21:43 GMT
• Title: Stesso: A reconfigurable decomposition of $n$-bit Toffoli gates using symmetrical logical structures and adjustable support qubits
• Authors: Shanyan Chen, Ali Al-Bayaty, Xiaoyu Song, Marek Perkowski,
• Abstract summary: This paper introduces a new structural design method to effectively decompose $(n+1)$-bit Toffoli gates by utilizing ancilla qubits.<n>It has been experimentally proven that $(n+1)$-bit Toffoli gates always have lower quantum costs than using conventional composition methods.
• Score: 2.349579657464914
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: An $(n+1)$-bit Toffoli gate is mainly utilized to construct other quantum gates and operators, such as Fredkin gates, arithmetical adders, and logical comparators, where $n \geq 2$. Several researchers introduced different methods to decompose $(n+1)$-bit Toffoli gates in a quantum circuit into a set of standard 3-bit Toffoli gates or a set of elementary quantum gates, such as single-qubit and two-qubit gates. However, these methods are not effectively reconfigurable for linearly connected symmetrical structures (layouts) of contemporary quantum computers, usually utilizing more ancilla qubits. This paper introduces a new structural design method to effectively decompose $(n+1)$-bit Toffoli gates by utilizing configurable ancilla qubits, which we named the ``support qubits". Collectively, we call our decomposition method for symmetrical structures using support qubits the ``step-decreasing structures shaped operators (Stesso)". The main advantage of Stesso is to configurable construct different decomposed operators of various polarities and intermediate sub-circuits, such as Positive Polarity-Stesso, Mixed Polarity-Stesso, and Generalized-Stesso. With Stesso, it has been experimentally proven that $(n+1)$-bit Toffoli gates always have lower quantum costs than using conventional composition methods.

Related papers

• Prefix Sums via Kronecker Products [47.600794349481966]
  We show how to design quantum adders with $1.893log(n)+O(1)$ Toffoli depth, $O(n)$ Toffoli gates, and $O(n)$ additional qubits.<n>As an application, we show how to use these circuits to design quantum adders with $1.893log(n)+O(1)$ Toffoli depth, $O(n)$ Toffoli gates, and $O(n)$ additional qubits.
  arXiv  Detail & Related papers  (2025-12-18T08:49:18Z)
• Clifford+V synthesis for multi-qubit unitary gates [0.0]
  We develop a general framework for synthesizing target gates by using a finite set of basic gates.<n>We introduce a suboptimal but short run-time algorithm for synthesizing multi-qubit controlled gates.
  arXiv  Detail & Related papers  (2025-10-09T14:57:55Z)
• Efficient compilation of quantum circuits using multi-qubit gates [0.0]
  We present a compilation scheme which implements a general-circuit decomposition to a sequence of Ising-type, long-range, multi-qubit entangling gates.<n>We numerically test our compilation and show that, compared to conventional realizations with two-qubit gates, our compilations improves the logarithm of quantum volume by $20%$ to $25%$.
  arXiv  Detail & Related papers  (2025-01-28T19:08:13Z)
• Ancilla-free Quantum Adder with Sublinear Depth [2.784223169208082]
  We present the first exact quantum adder with sublinear depth and no ancilla qubits.<n>Our construction is based on classical reversible logic only.<n>We also present new constructions for incrementing and adding a constant to a quantum register.
  arXiv  Detail & Related papers  (2025-01-28T09:05:49Z)
• Constant-depth circuits for Boolean functions and quantum memory devices using multi-qubit gates [40.56175933029223]
  We propose two types of constant-depth constructions for implementing Uniformly Controlled Gates. We obtain constant-depth circuits for the quantum counterparts of read-only and read-write memory devices.
  arXiv  Detail & Related papers  (2023-08-16T17:54:56Z)
• Variational Quantum Algorithm based circuit that implements the Toffoli gate with multi inputs [0.0]
  This study seeks a circuit diagram for a multi-inputs Toffoli gate including only single qubit gates and CNOTs. We have developed two variational quantum algorithms that can be used to implement a multi-inputs Toffoli gate.
  arXiv  Detail & Related papers  (2023-05-30T05:10:08Z)
• Quantum Fourier Addition, Simplified to Toffoli Addition [92.18777020401484]
  We present the first systematic translation of the QFT-addition circuit into a Toffoli-based adder. Instead of using approximate decompositions of the gates from the QFT circuit, it is more efficient to merge gates.
  arXiv  Detail & Related papers  (2022-09-30T02:36:42Z)
• Software mitigation of coherent two-qubit gate errors [55.878249096379804]
  Two-qubit gates are important components of quantum computing. But unwanted interactions between qubits (so-called parasitic gates) can degrade the performance of quantum applications. We present two software methods to mitigate parasitic two-qubit gate errors.
  arXiv  Detail & Related papers  (2021-11-08T17:37:27Z)
• Approaching the theoretical limit in quantum gate decomposition [0.0]
  We propose a novel numerical approach to decompose general quantum programs in terms of single- and two-qubit quantum gates with a $CNOT$ gate count. Our approach is based on a sequential optimization of parameters related to the single-qubit rotation gates involved in a pre-designed quantum circuit used for the decomposition.
  arXiv  Detail & Related papers  (2021-09-14T15:36:22Z)
• Realization of arbitrary doubly-controlled quantum phase gates [62.997667081978825]
  We introduce a high-fidelity gate set inspired by a proposal for near-term quantum advantage in optimization problems. By orchestrating coherent, multi-level control over three transmon qutrits, we synthesize a family of deterministic, continuous-angle quantum phase gates acting in the natural three-qubit computational basis.
  arXiv  Detail & Related papers  (2021-08-03T17:49:09Z)
• Halving the width of Toffoli based constant modular addition to n+3 qubits [69.43216268165402]
  We present an arithmetic circuit performing constant modular addition having $mathcalO(n)$ depth of Toffoli gates. This is an improvement by a factor of two compared to the width of the state-of-the-art Toffoli-based constant modular adder.
  arXiv  Detail & Related papers  (2021-02-06T17:07:48Z)
• QUANTIFY: A framework for resource analysis and design verification of quantum circuits [69.43216268165402]
  QUANTIFY is an open-source framework for the quantitative analysis of quantum circuits. It is based on Google Cirq and is developed with Clifford+T circuits in mind. For benchmarking purposes QUANTIFY includes quantum memory and quantum arithmetic circuits.
  arXiv  Detail & Related papers  (2020-07-21T15:36:25Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.