Quantum Computing Archives - Page 3 of 13 - IEEE Transactions on Quantum Engineering

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

May 6, 2025Claudio CicconettiQuantum ComputingComputational modeling, Containers, Delays, Logic gates, Mathematical models, Numerical models, Optimization, Quantum circuit, Quantum computing, Serverless computing

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

Runtime–Coherence Tradeoffs for Hybrid Satisfiability Solvers

April 22, 2025Vahideh Eshaghian; Sören Wilkening; Johan Åberg; David GrossQuantum ComputingCoherence time, Hardware, Optimization, Partitioning algorithms, Polynomials, Quantum algorithm, Qubit, Runtime, Search problems, Visualization

Abstract: Many search-based quantum algorithms that achieve a theoretical speedup are not practically relevant since they require extraordinarily long coherence times, or lack the parallelizability of their classical counterparts. This raises the question of how to divide computational tasks into a collection of parallelizable subproblems, each of which can be solved by a quantum computer […]

A Comprehensive Cross-Model Framework for Benchmarking the Performance of Quantum Hamiltonian Simulations

April 4, 2025Avimita Chatterjee; Sonny Rappaport; Anish Giri; Sonika Johri; Timothy Proctor; David E. Bernal NeiraQuantum ComputingBenchmark testing, Computational modeling, Hardware, Integrated circuit modeling, Legged locomotion, Noise, Quantum algorithm, Quantum computing, Qubit, Software algorithms

Abstract: Quantum Hamiltonian simulation is one of the most promising applications of quantum computing and forms the basis for many quantum algorithms. Benchmarking them is an important gauge of progress in quantum computing technology. We present a methodology and software framework to evaluate various facets of the performance of gate-based quantum computers on Trotterized quantum […]

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

Two-Dimensional Beam Selection by Multiarmed Bandit Algorithm Based on a Quantum Walk

March 26, 2025Maki Arai, Tomoki Yamagami, Takatomo Mihana, Ryoichi Horisaki, Mikio HasegawaQuantum ComputingAntenna arrays, Antenna radiation patterns, Array signal processing, Channel capacity, Complexity theory, Location awareness, Massive MIMO, Probability distribution, Quantum computing, Training

Abstract: This article proposes a novel beam selection method using a multiarmed bandit (MAB) algorithm based on a quantum walk (QW) principle, aimed at improving system performance. A massive multiple-input multiple-output system, employing multiple high-gain beams within a high-frequency band, is indispensable for achieving large capacity in future wireless communications. However, as the number of […]

Emulation of Density Matrix Dynamics With Classical Analog Circuits

March 19, 2025Anthony J. Cressman, Rahul SarpeshkarQuantum ComputingAnalog circuits, Capacitors, Emulation, Mathematical models, Noise, Noise measurement, Quantum computing, Quantum system, Vectors, Voltage

Abstract: Analog circuits have emerged as a valuable quantum emulation and simulation platform. Specifically, they have been experimentally shown to excel in emulating coherent state vector dynamics and motifs of quantum circuits, such as the quantum Fourier transform, tensor product superpositions, two-level systems such as Josephson junctions, and nuclear magnetic resonance state dynamics, all on […]

Utilizing Quantum Annealing in Computed Tomography Image Reconstruction

March 11, 2025Kilian Dremel, Dimitri Prjamkov, Markus Firsching, Mareike Weule, Thomas Lang, Anastasia Papadaki, Stefan Kasperl, Martin Blaimer, Theobald O. J. FuchsQuantum ComputingAnnealing, Computed tomography, Geometry, Image reconstruction, Optimization, Quantum annealing, Quantum computing, Reconstruction algorithms, Three-dimensional displays, X-ray imaging

Abstract: One of the primary difficulties in computed tomography (CT) is reconstructing cross-sectional images from measured projections of a physical object. There exist several classical methods for this task of generating a digital representation of the object, including filtered backprojection or simultaneous algebraic reconstruction technique. Our research aims to explore the potential of quantum computing […]

Two-Step Quantum Search Algorithm for Solving Traveling Salesman Problems

March 6, 2025Rei Sato, Cui Gordon, Kazuhiro Saito, Hideyuki Kawashima, Tetsuro Nikuni, Shohei WatabeQuantum ComputingComplexity theory, Costs, Encoding, Heuristic algorithms, Optimization, Quantum algorithm, Quantum circuit, Search problems, Traveling salesman problems, Urban areas

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

February 21, 2025Claudio Sanavio, Enea Mauri, Sauro SucciQuantum ComputingComputational fluid dynamics, Convergence, Encoding, Logic gates, Logistics, Mathematical models, Polynomials, Quantum algorithm, Quantum circuit, Qubit

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

Engineering Quantum Error Correction Codes Using Evolutionary Algorithms

February 5, 2025Mark A. Webster, Dan E. BrowneQuantum ComputingCodes, Computational modeling, Computers, Error analysis, Error correction codes, Evolutionary computation, Generators, Qubit, Standards, Vectors

Quantum error correction and the use of quantum error correction codes are likely to be essential for the realization of practical quantum computing. Because the error models of quantum devices vary widely, quantum codes that are tailored for a particular error model may have much better performance. For more about this article see link below. […]