Registers Archives - IEEE Transactions on Quantum Engineering

Qubit-Efficient Quantum Circuit for the Minimum Vertex Cover Problem Using Grover’s Algorithm

September 29, 2026Krissada Sarawit, Kamonluk SuksenEarly Access, Open AccessAlgorithms, Architecture, Arithmetic, Circuits, Computer architecture, Costing, Optimization, Qubit, Radiation detectors, Registers

Abstract: The Minimum Vertex Cover (MVC) problem is a fundamental NP-hard combinatorial optimization problem with applications in network security, resource allocation, and scheduling. As quantum computing moves toward fault-tolerant operation, developing qubit-efficient algorithms remains a critical challenge. This paper presents three quantum circuit architectures for solving MVC and its weighted variant using Grover’s search algorithm: […]

Quantum Circuit-Based Adaptation for Credit Risk Analysis

May 7, 2026Halima Giovanna Ahmad, Alessandro Sarno, Mehdi El Bakraoui, Carlo Cosenza, Clément Bésoin, Francesca Cibrario, Valeria Zaffaroni, Giacomo Ranieri, Roberto Bertilone, Viviana Stasino, Pasquale Mastrovito, Francesco Tafuri, Davide Massarotti, Leonardo Chabbra, Davide CorbellettoEarly Access, Open AccessAlgorithms, Circuits, Gaussian distribution, Hardware, Modeling, Optimization, Probability, Quantum circuit, Qubit, Registers

Abstract: Noisy and Intermediate-Scale Quantum, or NISQ, processors are sensitive to noise, prone to quantum decoherence, and are not yet capable of continuous quantum error correction for fault-tolerant quantum computation. Hence, quantum algorithms designed in the pre-fault-tolerant era cannot neglect the noisy nature of the hardware, and investigating the relationship between quantum hardware performance and […]

Efficient implementation of randomized quantum algorithms with dynamic circuits

March 9, 2026Shu Kanno, Ikko Hamamura, Rudy Raymond, Qi Gao, Naoki YamamotoOpen Access, Quantum ComputingCircuits, Extraterrestrial measurements, Heuristic algorithms, Logic gates, Prevention and mitigation, Probability distribution, Quantum circuit, Quantum computing, Qubit, Registers

Abstract: Randomized algorithms are crucial subroutines in quantum computing, but the requirement to execute many types of circuits on a real quantum device has been challenging to their extensive implementation. In this study, we propose an engineering method to reduce the executing time for randomized algorithms using dynamic circuits, i.e., quantum circuits involving intermediate measurement […]

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

September 17, 2025Moritz Schmidt Abhoy Kole Leon Wichette Rolf Drechsler Frank Kirchner Elie MounzerQuantum Computing, UncategorizedArithmetic, Computer architecture, Hardware, Logic gates, Optimization, Quantum circuit, Quantum computing, Qubit, Registers, Standards

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

July 21, 2025Kaito Kishi; Junpei Yamaguchi; Tetsuya Izu; Noboru KunihiroQuantum InformationComputers, Cryptography, Fourier transforms, Logic gates, Noise measurement, Quantum algorithm, Quantum circuit, Quantum computing, Qubit, Registers

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, […]

Mixed Grover: A Hybrid Version to Improve Grover’s Algorithm for Unstructured Database Search

March 28, 2025Romain Piron; Muhammad Idham Habibie; Claire GoursaudQuantum ComputingApproximation algorithms, Complexity theory, Costs, Databases, Flyback transformers, Optimization, Qubit, Registers, Search problems, Signal processing algorithms

Abstract: In this article, we propose a new strategy to exploit Grover’s algorithm for unstructured search problems. We first show that running Grover’s routine with a reduced number of iterations but allowing several trials presents a complexity advantage while keeping the same success probability. Then, by a theoretical analysis of the performance, we provide a […]

Efficient Quantum State Preparation for the Cauchy Distribution Based on Piecewise Arithmetic

November 2, 2022Ethan T. WangOpen Access, Quantum ComputingApproximation algorithms, Distribution functions, Logic gates, Mathematical models, Monte Carlo methods, Qubit, Registers

The benefits of the quantum Monte Carlo algorithm heavily rely on the efficiency of the superposition state preparation. So far, most reported Monte Carlo algorithms use the Grover–Rudolph state preparation method, which is suitable for efficiently integrable distribution functions. Consequently, most reported works are based on log-concave distributions, such as normal distributions. However, non-log-concave distributions […]

A Low-Complexity Quantum Principal Component Analysis Algorithm

November 2, 2022Chen HeOpen Access, Quantum ComputingEigenvalues and eigenfunctions, Phase estimation, Principal component analysis, Quantum circuit, Quantum state, Registers, Runtime

In this article, we propose a low-complexity quantum principal component analysis (qPCA) algorithm. Similar to the state-of-the-art qPCA, it achieves dimension reduction by extracting principal components of the data matrix, rather than all components of the data matrix, to quantum registers, so that the samples of measurement required can be reduced considerably. Both our qPCA […]

A Grover Search-Based Algorithm for the List Coloring Problem

November 2, 2022Sayan MukherjeeOpen Access, Quantum ComputingColor, Logic gates, Quantum algorithm, Qubit, Registers, Search problems, Standards

Graph coloring is a computationally difficult problem, and currently the best known classical algorithm for k -coloring of graphs on n vertices has runtimes Ω(2n) for k≥5 . The list coloring problem asks the following more general question: given a list of available colors for each vertex in a graph, does it admit a proper coloring? We propose a hybrid classical-quantum algorithm based […]

EP-PQM: Efficient Parametric Probabilistic Quantum Memory With Fewer Qubits and Gates

November 2, 2022Mushahid KhanOpen Access, Quantum ComputingDatabases, Encoding, Logic gates, Probabilistic logic, Quantum computing, Qubit, Registers

Machine learning (ML) classification tasks can be carried out on a quantum computer (QC) using probabilistic quantum memory (PQM) and its extension, parametric PQM (P-PQM), by calculating the Hamming distance between an input pattern and a database of r patterns containing z features with a distinct attributes. For PQM and P-PQM to correctly compute the Hamming distance, the feature must be […]