Optimization Archives - IEEE Transactions on Quantum Engineering

Black-Box Optimization of the Storage Location Assignment Problem in Logistics Centers Using an Annealing Algorithm

December 19, 2025Hiromitsu Kigure Takeshi Baba Makoto Taniguchi Hirotaka KajiQuantum ComputingAnnealing, Closed box, Genetic algorithms, Hardware, Legged locomotion, Linear programming, Logistics, Mathematical models, Optimization, Quantum annealing

Abstract: The manufacturing industry encounters numerous optimization problems, one of which is the optimization of storage location assignment (OSLA) problem in logistics. OSLA is a combinatorial optimization problem focused on improving the efficiency of picking operations in logistics centers. We explore quantum annealing (QA) as a potential solution to combinatorial optimization problems and investigate its […]

Robust H∞ Uncertainties-Tolerant Observer-Based Reference Quantum Trajectory Tracking Control for Lindblad Master Equation

December 18, 2025Shin-Yi Wen Bor-Sen Chen Chun-Liang LinEnabling TechnologiesControl design, Estimation, Feedback control, Mathematical models, Optimization, Pollution measurement, Quantum state, Quantum system, Trajectory, Trajectory tracking

Abstract: In this article, a robust output feedback reference quantum trajectory tracking control design is proposed through the simultaneous continuous weak measurement of noncommuting observables. Using the robust H∞ uncertainties-tolerant observer-based reference quantum trajectory tracking control (UTOBRQTTC) design strategy, the proposed method can robustly estimate the quantum trajectory and robustly track a sequence of any […]

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

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

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

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

Convexification of the Quantum Network Utility Maximization Problem

December 30, 2024Sounak Kar, Stephanie WehnerQuantum InternetMeasurement, Optimization, Quality of service, Quantum networks, Repeaters, Resource management, Routing protocols, Sufficient conditions, Topology, Vectors

Network utility maximization (NUM) addresses the problem of allocating resources fairly within a network and explores the ways to achieve optimal allocation in real-world networks. Although extensively studied in classical networks, NUM is an emerging area of research in the context of quantum networks. In this work, we consider the quantum network utility maximization (QNUM) […]

Novel Trade-offs in 5 nm FinFET SRAM Arrays at Extremely Low Temperatures

December 5, 2024Shivendra Singh Parihar, Girish Pahwa, Baker Mohammad, Yogesh Singh Chauhan, Hussam AmrouchEnabling TechnologiesCircuits, Cryogenics, Electrical resistance measurement, FinFETs, Optimization, Random access memory, Resistance, Transistors, Voltage measurement, Wire

Complementary metal–oxide–semiconductor (CMOS)-based computing promises drastic improvement in performance at extremely low temperatures (e.g., 77 K, 10 K). The field of extremely low temperature CMOS-environment-based computing holds the promise of delivering remarkable enhancements in both performance and power consumption. Static random access memory (SRAM) plays a major role in determining the performance and efficiency of […]