Construction of Boolean Logic Gates Using QFT-Based Adder Architecture

• URL: http://arxiv.org/abs/2504.17090v1
• Date: Wed, 23 Apr 2025 20:47:36 GMT
• Title: Construction of Boolean Logic Gates Using QFT-Based Adder Architecture
• Authors: Ayda Kaltehei, Murat Kurt, Azmi Gençten, Selçuk Çakmak,
• Abstract summary: We construct the quantum reversible counterparts of the logical AND, OR, XOR, NOR, and NAND gates.<n>We utilize a quantum Fourier transform (QFT)-based adder circuit that replicates the functionality of a digital half-adder.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: In this study, we construct the quantum reversible counterparts of the logical AND, OR, XOR, NOR, and NAND gates. We utilize a quantum Fourier transform (QFT)-based adder circuit that replicates the functionality of a digital half-adder, which computes the sum and carry of two input bits using XOR and AND gates, respectively. To realize different logic gate operations, we apply pre- and post-processing to the QFT-adder using quantum gates, leveraging Boolean algebra properties to enable conversions between various logical functions. Although the number of elementary quantum logic gates increases for a small number of inputs-making the approach appear inefficient at first glance-the overall required qubit count is reduced compared to non-QFT-based designs as the number of inputs increases.

Related papers

• Scalable quantum circuit design for QFT-based arithmetic [0.0]
  We create a scalable version of the quantum Fourier transform-based arithmetic circuit to perform addition and subtraction operations on N n-bit unsigned integers encoded in quantum registers. We present qubit- and ququart-based multi-input QFT adders, and we compare and discuss potential benefits such as circuit simplicity and noise sensitivity.
  arXiv  Detail & Related papers  (2024-10-31T23:34:06Z)
• Multi-controlled single-qubit unitary gates based on the quantum Fourier transform and deep decomposition [0.0]
  We will present a few new generalizations of the multi-controlled X (MCX) gate that uses the quantum Fourier transform (QFT)<n>First, we will optimize QFT-MCX and prove that it is equivalent to a stair MCX gates array.<n>The supremacy of our implementations over the best-known optimized algorithm will be demonstrated.
  arXiv  Detail & Related papers  (2024-08-01T21:56:02Z)
• Benchmarking logical three-qubit quantum Fourier transform encoded in the Steane code on a trapped-ion quantum computer [3.2821436094760026]
  We logically encoded three-qubit circuits for the quantum transform (QFT) We benchmark the circuits on the Quantinuum H2-11 trapped-ion quantum computer. We compare the logical QFT benchmark results to predictions based on the logical component benchmarks.
  arXiv  Detail & Related papers  (2024-04-12T17:27:27Z)
• Error-corrected Hadamard gate simulated at the circuit level [42.002147097239444]
  We simulate the logical Hadamard gate in the surface code under a circuit-level noise model. Our paper is the first to do this for a unitary gate on a quantum error-correction code.
  arXiv  Detail & Related papers  (2023-12-18T19:00:00Z)
• QFT based quantum arithmetic logic unit on IBM quantum computer [0.0]
  The qALU is capable of performing arithmetic ADD (addition) and logic NAND gate operations. We executed our quantum Fourier transform based qALU design on real quantum computer hardware provided by IBM. The results demonstrated that the proposed circuit can perform arithmetic and logic operations with a high success rate.
  arXiv  Detail & Related papers  (2023-06-16T00:25:21Z)
• Direct pulse-level compilation of arbitrary quantum logic gates on superconducting qutrits [36.30869856057226]
  We demonstrate any arbitrary qubit and qutrit gate can be realized with high-fidelity, which can significantly reduce the length of a gate sequence. We show that optimal control gates are robust to drift for at least three hours and that the same calibration parameters can be used for all implemented gates.
  arXiv  Detail & Related papers  (2023-03-07T22:15:43Z)
• 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)
• Applications of Universal Parity Quantum Computation [0.0]
  We demonstrate the applicability of a universal gate set in the parity encoding, which is a dual to the standard gate model. Embedding these algorithms in the parity encoding reduces the circuit depth compared to conventional gate-based implementations. We propose simple implementations of multiqubit gates in tailored encodings and an efficient strategy to prepare graph states.
  arXiv  Detail & Related papers  (2022-05-19T12:31:46Z)
• Logical blocks for fault-tolerant topological quantum computation [55.41644538483948]
  We present a framework for universal fault-tolerant logic motivated by the need for platform-independent logical gate definitions. We explore novel schemes for universal logic that improve resource overheads. Motivated by the favorable logical error rates for boundaryless computation, we introduce a novel computational scheme.
  arXiv  Detail & Related papers  (2021-12-22T19:00:03Z)
• 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)
• 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)
• Improving the Performance of Deep Quantum Optimization Algorithms with Continuous Gate Sets [47.00474212574662]
  Variational quantum algorithms are believed to be promising for solving computationally hard problems. In this paper, we experimentally investigate the circuit-depth-dependent performance of QAOA applied to exact-cover problem instances. Our results demonstrate that the use of continuous gate sets may be a key component in extending the impact of near-term quantum computers.
  arXiv  Detail & Related papers  (2020-05-11T17:20:51Z)
• Qubit Mapping Based on Subgraph Isomorphism and Filtered Depth-Limited Search [5.980663391414905]
  Mapping logical quantum circuits to Noisy Intermediate-Scale Quantum (NISQ) devices is a challenging problem. This paper proposes an efficient method by selecting an initial mapping that takes into consideration the similarity between the architecture graph of the given NISQ device and a graph induced by the input logical circuit. The proposed circuit transformation algorithm can significantly decrease the number of auxiliary two-qubit gates required to be added to the logical circuit.
  arXiv  Detail & Related papers  (2020-04-15T15:07:49Z)

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.