arXiv subjects

Ayda Kaltehei

Publications and source records attributed to Ayda Kaltehei.

3 recordsLinked to original sources

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↗