Exploration of Design Alternatives for Reducing Idle Time in Shor’s Algorithm: A Study on Monolithic and Distributed Quantum Systems

Abstract: Shor’s algorithm is one of the most prominent quantum algorithms, yet finding efficient implementations remains an active research challenge. While many approaches focus on low-level modular arithmetic optimizations, a broader perspective can provide additional opportunities for improvement. By adopting a midlevel abstraction, we analyze the algorithm as a sequence of computational tasks, enabling systematic […]

Simulation of Shor Algorithm for Discrete Logarithm Problems With Comprehensive Pairs of Modulo p and Order q

Abstract: The discrete logarithm problem (DLP) over finite fields, commonly used in classical cryptography, has no known polynomial-time algorithm on classical computers. However, Shor has provided its polynomial-time algorithm on quantum computers. Nevertheless, there are only few examples simulating quantum circuits that operate on general pairs of modulo p and order q. In this article, […]

Q-Gen: A Parameterized Quantum Circuit Generator

Abstract: Unlike most classical algorithms that take an input and give the solution directly as an output, quantum algorithms produce a quantum circuit that works as an indirect solution to computationally hard problems. In the full quantum computing workflow, most data processing remains in the classical domain except for running the quantum circuit in the […]

Analysis of Parameterized Quantum Circuits: On the Connection Between Expressibility and Types of Quantum Gates

Abstract: Expressibility is a crucial factor of a parameterized quantum circuit (PQC). In the context of variational-quantum-algorithm-based quantum machine learning (QML), a QML model composed of a highly expressible PQC and a sufficient number of qubits is theoretically capable of approximating any arbitrary continuous function. While much research has explored the relationship between expressibility and […]

Modeling and Performance Evaluation of Hybrid Classical–Quantum Serverless Computing Platforms

Abstract: While quantum computing technologies are evolving toward achieving full maturity, hybrid algorithms, such as variational quantum computing, are already emerging as valid candidates to solve practical problems in fields, such as chemistry and operations research. This situation calls for a tighter and better integration of classical and quantum computing infrastructures to improve efficiency and […]

Quantum Circuit Compilation for Trapped-Ion Processors With the Drive-Through Architecture

Abstract: Trapped-ion technologies stand out as leading contenders in the pursuit of quantum computing, due to their capacity for highly entangled qubits. Among many proposed trapped-ion architectures, the “drive-through” architecture has drawn increasing attention, notably for its remarkable ability to minimize heat generation, which is crucial for low-temperature operation and thermal noise reduction, thus reliable […]

Two-Step Quantum Search Algorithm for Solving Traveling Salesman Problems

Quantum search algorithms, such as Grover’s algorithm, are anticipated to efficiently solve constrained combinatorial optimization problems. However, applying these algorithms to the traveling salesman problem (TSP) on a quantum circuit presents a significant challenge. Existing quantum search algorithms for the TSP typically assume that an initial state—an equal superposition of all feasible solutions satisfying the […]

Explicit Quantum Circuit for Simulating the Advection–Diffusion–Reaction Dynamics

We assess the convergence of the Carleman linearization of advection–diffusion–reaction (ADR) equations with a logistic nonlinearity. It is shown that five Carleman iterates provide a satisfactory approximation of the original ADR across a broad range of parameters and strength of nonlinearity. To assess the feasibility of a quantum algorithm based on this linearization, we analyze […]

Generating Shuttling Procedures for Constrained Silicon Quantum Dot Array

In silicon quantum computers, a single electron is trapped in a microstructure called a quantum dot, and its spin is used as a qubit. For large-scale integration of qubits, we previously proposed an approach of sharing a control gate in the row or column of a 2-D quantum dot array. In our array, the shuttling […]

Variational Quantum Algorithms for Differential Equations on a Noisy Quantum Computer

The role of differential equations (DEs) in science and engineering is of paramount importance, as they provide the mathematical framework for a multitude of natural phenomena. Since quantum computers promise significant advantages over classical computers, quantum algorithms for the solution of DEs have received a lot of attention. Particularly interesting are algorithms that offer advantages […]