arXiv subjects

Azmi Gençten

Publications and source records attributed to Azmi Gençten.

6 recordsLinked to original sources

arXiv2026

Quantum Non-Moduler Multiplication with QFT-Based Multi Input Parallelized Adder

In this study, we propose an efficient quantum multiplication approach based on a QFT-assisted parallelized addition scheme. The multiplication stage is implemented using a structure composed entirely of Toffoli gates, which generate partial products. In the second stage, these partial results are accumulated using a QFT-based adder. Unlike conventional QFT-based arithmetic circuits, the proposed design eliminates the repeated application of QFT and inverse QFT (IQFT) operations during intermediate summation processes. This leads to a significant reduction in the total gate count and circuit complexity, enabling a more resource-efficient implementation. To demonstrate the feasibility of the proposed approach, a quantum circuit that performs the multiplication of two 3-bit numbers is designed. The circuit is tested and validated using IBM quantum simulators. The results indicate that the proposed method provides a more efficient alternative to traditional quantum multiplication techniques in terms of gate cost and circuit depth.

quant-ph↗

arXiv2026

Variational Quantum Eigensolver for the Analysis of High-Resolution NMR Spectra: Applications to AB and AB2 Spin Systems

The Variational Quantum Algorithms (VQAs) are hybrid quantum-classical algorithms and they can be used in the Nosiy Intermadiate Scale Quantum (NISQ) devises. The Variational Quantum Eigensolver (VQE) was suggested as a first VQA. VQE is based on the variational method of quantum mechanics and it is used to find the ground state energy of a quantum system. In this study, VQE is used for the analysis of NMR spectra for the AB and AB2 spin systems. The frequencies and the spin coupling values are obtained from the sample spectra for these spin systems. Then the Hamiltonians are written in terms of pauli spin operators and transformed into a suitable forms for quantum computer. By employing VQE the ground state energies are obtained for the related spin systems. They are found to be in good agreement with the results obtained from the known variation method.

quant-ph↗

arXiv2025

Construction of Boolean Logic Gates Using QFT-Based Adder Architecture

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.

quant-ph↗

arXiv2024

Scalable quantum circuit design for QFT-based arithmetic

In this research, 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, and it is compatible with d-level quantum sources, called qudits. We present qubit- and ququart-based multi-input QFT adders, and we compare and discuss potential benefits such as circuit simplicity and noise sensitivity. The results show that a ququart-based system significantly reduces gate count and improves computational efficiency compared to qubit-based systems. Overall, the findings presented in this study represent a promising step forward in the development of efficient quantum arithmetic circuits, particularly for multi-input operations, with clear advantages for ququart-based systems in reducing gate count, decoherence, and circuit complexity.

quant-ph↗

arXiv2023

QFT based quantum arithmetic logic unit on IBM quantum computer

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.

quant-ph↗

arXiv2019

Heat Bath Algorithmic Cooled Quantum Otto Engines

We suggest alternative quantum Otto engines, using heat bath algorithmic cooling with partner pairing algorithm instead of isochoric cooling. Liquid state nuclear magnetic resonance systems in one entropy sink are considered as working fluids. Then, the extractable work and thermal efficiency are analyzed in detail for four-stroke and two-stroke type of quantum Otto engines. The role of heat bath algorithmic cooling in these cycles is to use a single entropy sink instead of two. Also, this cooling algorithm increases the power of engines reducing the time required for one cycle.

quant-ph↗