Related papers: Arithmetic Circuits for Multilevel Qudits Based on…
Quantum computers have the potential to solve some important industrial and scientific problems with greater efficiency than classical computers. While most current realizations focus on two-level qubits, the underlying physics used in most…
In recent decades, the field of quantum computing has experienced remarkable progress. This progress is marked by the superior performance of many quantum algorithms compared to their classical counterparts, with Shor's algorithm serving as…
In some quantum algorithms, arithmetic operations are of utmost importance for resource estimation. In binary quantum systems, some efficient implementation of arithmetic operations like, addition/subtraction, multiplication/division,…
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…
In this paper, we introduce the workflow for converting qubit circuits represented by Open Quantum ASseMbly format (OpenQASM, also known as QASM) into the qudit form for execution on qudit hardware and provide a method for translating qudit…
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…
For the solution of partial differential equations (PDEs), we show that the quantum Fourier transform (QFT) can enable the design of quantum circuits that are particularly simple, both conceptually and with regard to hardware requirements.…
Gate-based universal quantum computation is formulated in terms of two types of operations: local single-qubit gates, which are typically easily implementable, and two-qubit entangling gates, whose faithful implementation remains one of the…
In the paper, we consider quantum circuits for the Quantum Fourier Transform (QFT) algorithm. The QFT algorithm is a very popular technique used in many quantum algorithms. We present a generic method for constructing quantum circuits for…
Recent developments in qudit-based quantum computing, in particular with trapped ions, open interesting possibilities for scaling quantum processors without increasing the number of physical information carriers. In this work, we propose a…
Universal quantum computation may be realized based on quantum walk, by formulating it as a scattering problem on a graph. In this paper, we simulate quantum gates through electric circuits, following a recent report that a one-dimensional…
Quantum computing promises remarkable approaches for processing information, but new tools are needed to compile program representations into the physical instructions required by a quantum computer. Here we present a novel adaptation of…
Qudits, or multi-level quantum information carriers, present a promising path for scaling quantum computers. However, their use introduces increased complexity in quantum logic, necessitating careful control of relative phases between…
The Quantum Fourier Transform (QFT) is a fundamental component of many quantum computing algorithms. In this paper, we present an alternative method for factoring this transformation. Inspired by this approach, we introduce a new quantum…
Quantum computation is traditionally expressed in terms of quantum bits, or qubits. In this work, we instead consider three-level qu$trits$. Past work with qutrits has demonstrated only constant factor improvements, owing to the $\log_2(3)$…
Digital-analog quantum computing with two-level systems is a computational paradigm that combines an analog Hamiltonian with single-qubit gates to achieve universality. We extend this framework to $d$-level systems by conjugating an analog…
Quantum computing with qudits, an extension of qubits to multiple levels, is a research field less mature than qubit-based quantum computing. However, qudits can offer some advantages over qubits, by representing information with fewer…
Representations of quantum computations are almost always based on a tensor product $\otimes$-structure. This coincides with what we are able to execute in our experiments, as well as what we observe in Nature, but it makes certain familiar…
Quantum computation offers the potential to solve fundamental yet otherwise intractable problems across a range of active fields of research. Recently, universal quantum-logic gate sets - the building blocks for a quantum computer - have…
In this paper, we present Clifford+T gates based quantum circuit design of integer division having $n$ ancillary qubits. The proposed quantum circuit is based on restoring division algorithm. The proposed quantum circuit of integer division…