QFT based quantum arithmetic logic unit on IBM quantum computer

• URL: http://arxiv.org/abs/2306.09560v1
• Date: Fri, 16 Jun 2023 00:25:21 GMT
• Title: QFT based quantum arithmetic logic unit on IBM quantum computer
• Authors: Sel\c{c}uk \c{C}akmak, Murat Kurt, Azmi Gen\c{c}ten
• Abstract summary: 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.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: In this study, we constructed a primitive quantum arithmetic logic unit (qALU) based on the quantum Fourier transform. The qALU is capable of performing arithmetic ADD (addition) and logic NAND gate operations. We presented two versions of the arithmetic logic unit, with two-input and four-input capabilities. By comparing the required number of quantum gates for serial and parallel architectures in executing arithmetic addition, we evaluated the performance. 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. Furthermore, we discussed the potential implementation of qALU circuit in the field of computer science, highlighting the possibility of constructing soft-core processor on quantum processing unit.

Related papers

• Realization of Constant-Depth Fan-Out with Real-Time Feedforward on a Superconducting Quantum Processor [33.096693427147535]
  We demonstrate a quantum fan-out gate with real-time feedforward on up to four output qubits using a superconducting quantum processor. Our work highlights the potential of mid-circuit measurements combined with real-time conditional operations to improve the efficiency of complex quantum algorithms.
  arXiv  Detail & Related papers  (2024-09-11T03:40:24Z)
• Elementary Quantum Arithmetic Logic Units for Near-Term Quantum Computers [0.0]
  We propose feasible quantum arithmetic logic units (QALUs) for near-term quantum computers with qubits arranged in two-dimensional arrays. We introduce a feasible quantum arithmetic operation to compute the two's complement representation of signed integers. Our work demonstrates a viable implementation of QALUs on near-term quantum computers, advancing towards scalable and resource-efficient quantum arithmetic operations.
  arXiv  Detail & Related papers  (2024-08-13T01:49:58Z)
• Quantum Compiling with Reinforcement Learning on a Superconducting Processor [55.135709564322624]
  We develop a reinforcement learning-based quantum compiler for a superconducting processor. We demonstrate its capability of discovering novel and hardware-amenable circuits with short lengths. Our study exemplifies the codesign of the software with hardware for efficient quantum compilation.
  arXiv  Detail & Related papers  (2024-06-18T01:49:48Z)
• Supervised binary classification of small-scale digits images with a trapped-ion quantum processor [56.089799129458875]
  We show that a quantum processor can correctly solve the basic classification task considered. With the increase of the capabilities quantum processors, they can become a useful tool for machine learning.
  arXiv  Detail & Related papers  (2024-06-17T18:20:51Z)
• Parallel Quantum Computing Simulations via Quantum Accelerator Platform Virtualization [44.99833362998488]
  We present a model for parallelizing simulation of quantum circuit executions. The model can take advantage of its backend-agnostic features, enabling parallel quantum circuit execution over any target backend.
  arXiv  Detail & Related papers  (2024-06-05T17:16:07Z)
• Towards Quantum Computational Mechanics [1.530480694206666]
  We show how quantum computing can be used to solve representative element volume (RVE) problems in computational homogenisation. Our quantum RVE solver attains exponential acceleration with respect to classical solvers.
  arXiv  Detail & Related papers  (2023-12-06T12:53:02Z)
• Parallel Quantum Hough Transform [0.0]
  We propose a Parallel Quantum Hough transform (PQHT) algorithm that we execute on a quantum computer. The modules were developed using IBM Quantum Composer and tested using the IBM QASM simulator. The successful run results on Fraunhofer Q System One in Ehningen will be presented as a proof of concept for the PQHT algorithm.
  arXiv  Detail & Related papers  (2023-11-15T14:42:51Z)
• An Improved QFT-Based Quantum Comparator and Extended Modular Arithmetic Using One Ancilla Qubit [4.314578336989336]
  We propose a quantum-classical comparator based on the quantum Fourier transform (QFT) Proposed operators only require one ancilla qubit, which is optimal for qubit resources. The proposed algorithms reduce computing resources and make them valuable for Noisy Intermediate-Scale Quantum (NISQ) computers.
  arXiv  Detail & Related papers  (2023-05-16T02:09:41Z)
• Quantum Circuit Compiler for a Shuttling-Based Trapped-Ion Quantum Computer [26.47874938214435]
  We present a compiler capable of transforming and optimizing a quantum circuit targeting a shuttling-based trapped-ion quantum processor. The results show that the gate counts can be reduced by factors up to 5.1 compared to standard Pytket and up to 2.2 compared to standard Qiskit compilation.
  arXiv  Detail & Related papers  (2022-07-05T11:21:09Z)
• LQP: The Dynamic Logic of Quantum Information [77.34726150561087]
  This paper introduces a dynamic logic formalism for reasoning about information flow in composite quantum systems. We present a finitary syntax, a relational semantics and a sound proof system for this logic. As applications, we use our system to give formal correctness for the Teleportation protocol and for a standard Quantum Secret Sharing protocol.
  arXiv  Detail & Related papers  (2021-10-04T12:20:23Z)
• Strong quantum computational advantage using a superconducting quantum processor [33.030717006448526]
  We develop a two-dimensional programmable superconducting quantum processor, textitZuchongzhi, composed of 66 functional qubits in a tunable coupling architecture. Our work establishes an unambiguous quantum computational advantage that is infeasible classical computation in a reasonable amount of time.
  arXiv  Detail & Related papers  (2021-06-28T14:06:07Z)

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.