Cost-Effective Realization of n-Bit Toffoli Gates for IBM Quantum Computers Using the Bloch Sphere Approach and IBM Native Gates

• URL: http://arxiv.org/abs/2410.13104v1
• Date: Thu, 17 Oct 2024 00:29:29 GMT
• Title: Cost-Effective Realization of n-Bit Toffoli Gates for IBM Quantum Computers Using the Bloch Sphere Approach and IBM Native Gates
• Authors: Ali Al-Bayaty, Marek Perkowski,
• Abstract summary: A cost-effective n-bit Toffoli gate is proposed to be realized (or transpiled) based on the layouts (linear, T-like, and I-like) and the number of n physical qubits for IBM quantum computers. The layout-aware n-bit Toffoli gate is designed using the visual approach of the Bloch sphere. After transpilation, our proposed layout-aware n-bit Toffoli gate always has a much lower transpilation quantum cost than that of the conventional n-bit Toffoli gate.
• Score: 0.0
• License:
• Abstract: A cost-effective n-bit Toffoli gate is proposed to be realized (or transpiled) based on the layouts (linear, T-like, and I-like) and the number of n physical qubits for IBM quantum computers. This proposed gate is termed the "layout-aware n-bit Toffoli gate". The layout-aware n-bit Toffoli gate is designed using the visual approach of the Bloch sphere, from the visual representations of the rotational quantum operations for IBM native gates. In this paper, we also proposed a new formula for the quantum cost, which calculates the total number of native gates, the crossing connections, and the depth of the final transpiled quantum circuit. This formula is termed the "transpilation quantum cost". After transpilation, our proposed layout-aware n-bit Toffoli gate always has a much lower transpilation quantum cost than that of the conventional n-bit Toffoli gate, where 3 <= n <= 7 qubits, for different IBM quantum computers.

Related papers

• CALA-$n$: A Quantum Library for Realizing Cost-Effective 2-, 3-, 4-, and 5-bit Gates on IBM Quantum Computers using Bloch Sphere Approach, Clifford+T Gates, and Layouts [1.8069913326395433]
  We introduce a new quantum layout-aware approach to realize cost-effective $n$-bit gates using the Bloch sphere, for $2 le n le 5$ qubits. Various standard $n$-bit gates are examined and evaluated, in the context of the final quantum costs, as the final counts of generated IBM native gates.
  arXiv  Detail & Related papers  (2024-08-02T05:50:35Z)
• Quantum circuit for multi-qubit Toffoli gate with optimal resource [6.727984016678534]
  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. We demonstrate that without the assistance of ancillary qubit, any quantum circuit implementation of multi-qubit Toffoli gate must employ exponential precision gates.
  arXiv  Detail & Related papers  (2024-02-07T17:53:21Z)
• GALA-n: Generic Architecture of Layout-Aware n-Bit Quantum Operators for Cost-Effective Realization on IBM Quantum Computers [0.0]
  A generic architecture of n-bit quantum operators is proposed for cost-effective transpilation. The proposed architecture is termed "GALA-n quantum operator" After transpilation, our proposed GALA-n quantum operator always has a lower transpilation quantum cost than that of conventional n-bit quantum operators.
  arXiv  Detail & Related papers  (2023-11-12T07:25:06Z)
• Constant-depth circuits for Uniformly Controlled Gates and Boolean functions with application to quantum memory circuits [42.979881926959486]
  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)
• Generalized Toffoli gate decomposition using ququints: Towards realizing Grover's algorithm with qudits [1.4732811715354455]
  We present an efficient decomposition of the generalized Toffoli gate on the five-level quantum systems, so-called ququints. Our results are applicable for quantum processors based on various physical platforms.
  arXiv  Detail & Related papers  (2022-12-23T18:05:44Z)
• Universal qudit gate synthesis for transmons [44.22241766275732]
  We design a superconducting qudit-based quantum processor. We propose a universal gate set featuring a two-qudit cross-resonance entangling gate. We numerically demonstrate the synthesis of $rm SU(16)$ gates for noisy quantum hardware.
  arXiv  Detail & Related papers  (2022-12-08T18:59:53Z)
• 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)
• Hardware-Conscious Optimization of the Quantum Toffoli Gate [11.897854272643634]
  This manuscript expands the analytical and numerical approaches for optimizing quantum circuits at this abstraction level. We present a procedure for combining the strengths of analytical native gate-level optimization with numerical optimization. Our optimized Toffoli gate implementation demonstrates an $18%$ reduction in infidelity compared with the canonical implementation.
  arXiv  Detail & Related papers  (2022-09-06T17:29: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)
• Building a fault-tolerant quantum computer using concatenated cat codes [44.03171880260564]
  We present a proposed fault-tolerant quantum computer based on cat codes with outer quantum error-correcting codes. We numerically simulate quantum error correction when the outer code is either a repetition code or a thin rectangular surface code. We find that with around 1,000 superconducting circuit components, one could construct a fault-tolerant quantum computer.
  arXiv  Detail & Related papers  (2020-12-07T23:22:40Z)
• 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.