Linear programming Archives - IEEE Transactions on Quantum Engineering

Advanced Quantum Annealing for the Bi-Objective Traveling Thief Problem: An ε-Constraint-Based Approach

March 16, 2026Nguyen Hoang Viet, Nguyen Xuan Tung, Trinh Van Chien, Won-Joo HwangOpen AccessAnnealing, Hardware, Interference, Linear programming, Optimization, Quantum annealing, Scalability, Transforms, Traveling salesman problems, Urban areas

Abstract: This paper addresses the Bi-Objective Traveling Thief Problem (BI-TTP), a challenging multi-objective optimization problem that requires the simultaneous optimization of travel cost and item profit. Conventional methods for the BI-TTP often face severe scalability issues due to the complex interdependence between routing and packing decisions, as well as the inherent complexity and large problem […]

Equivariant Quantum Approximate Optimization Algorithm

January 16, 2026Boris Tsvelikhovskiy, Ilya Safro, Yuri AlexeevQuantum ComputingApproximation algorithms, Heuristic algorithms, Linear programming, Machine learning algorithms, Mixers, Optimization, Partitioning algorithms, Quantum circuit, Standards, Stationary state

Abstract: Constructing effective mixer Hamiltonians is essential for enhancing the performance of the quantum approximate optimization algorithm (QAOA) in solving combinatorial optimization problems. In this work, we develop a systematic methodology for designing QAOA mixers that align with the symmetries of the classical objective function, with the goal of achieving values (mean, median, and minimum […]

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

Low-Complexity Syndrome-Based Linear Programming Decoding of Quantum LDPC Codes

December 4, 2025Sana Javed, Sergio Colet, Francisco Garcia-Herrero, Óscar Ruano, Juan Antonio Maestro, Bane Vasić, Mark F. FlanaganQuantum InformationBenchmark testing, Codes, Decoding, Error analysis, Error correction codes, Floors, Iterative decoding, Linear programming, Noise, Qubit

Abstract: This article proposes a novel low-complexity syndrome-based linear programming (SB-LP) decoding algorithm for decoding quantum low-density parity-check codes. Under the code-capacity model, the SB-LP decoder can be used as a standalone decoder; however, it is particularly powerful when used as a postprocessing step following SB min-sum (SB-MS) decoding. In the latter case, the proposed […]

Qubit Reduction and Quantum Speedup for Wireless Channel Assignment Problem

August 18, 2023Yuki SanoQuantum ComputingEncoding, Genetic algorithms, Linear programming, Logic gates, Optimization, Quantum circuit, Qubit

In this article, we propose a novel method of formulating an NP-hard wireless channel assignment problem as a higher-order unconstrained binary optimization (HUBO), where the Grover adaptive search (GAS) is used to provide a quadratic speedup for solving the problem. The conventional method relies on a one-hot encoding of the channel indices, resulting in a […]

Quantum Topology Optimization via Quantum Annealing

June 14, 2023Zisheng YeQuantum ComputingAnnealing, Computational efficiency, Layout, Linear programming, Logic gates, Optimization, Quantum annealing

We present a quantum annealing-based solution method for topology optimization (TO). In particular, we consider TO in a more general setting, i.e., applied to structures of continuum domains where designs are represented as distributed functions, referred to as continuum TO problems. According to the problem’s properties and structure, we formulate appropriate subproblems that can be […]

Identification of Time-Varying Decoherence Rates for Open Quantum Systems

June 29, 2021Shuixin Xiao; Shibei Xue; Daoyi Dong; Jun ZhangOpen Access, Quantum InformationHeuristic algorithms, Linear programming, Optimization, Quantum system, Qubit, Time measurement, Time-varying systems

Parameter identification of quantum systems is a fundamental task in developing practical quantum technology. In this article, we study the identification of time-varying decoherence rates for open quantum systems. Given the measurement data of local observables, this can be formulated as an optimization problem. We expand the unknown decoherence rates into Fourier series and take […]

Exploiting Symmetry Reduces the Cost of Training QAOA

March 17, 2021Ruslan Shaydulin; Stefan M. WildOpen Access, Quantum Information, Quantum SoftwareApproximation algorithms, Hardware, Linear programming, Optimization, Qubit, Tensors, Training

A promising approach to the practical application of the quantum approximate optimization algorithm (QAOA) is finding QAOA parameters classically in simulation and sampling the solutions from QAOA with optimized parameters on a quantum computer. Doing so requires repeated evaluations of QAOA energy in simulation. In this article, we propose a novel approach for accelerating the […]

Solving the Max-Flow Problem on a Quantum Annealing Computer

October 14, 2020Thomas Krauss; Joey McCollum; Chapman Pendery; Sierra Litwin; Alan J. MichaelsOpen Access, Quantum Information, Quantum SoftwareAnnealing, Directed graphs, Linear programming, Qubit, Simulated annealing

This article addresses the question of implementing a maximum flow algorithm on directed graphs in a formulation suitable for a quantum annealing computer. Three distinct approaches are presented. In all three cases, the flow problem is formulated as a quadratic unconstrained binary optimization (QUBO) problem amenable to quantum annealing. The first implementation augments a graph […]

Entanglement Distribution in a Quantum Network: A Multicommodity Flow-Based Approach

October 1, 2020Kaushik Chakraborty; David Elkouss; Bruno Rijsman; Stephanie WehnerOpen Access, Quantum InformationLinear programming, Optimization, Probabilistic logic, Protocols, Quantum entanglement, Repeaters, Standards

We consider the problem of optimizing the achievable EPR-pair distribution rate between multiple source-destination pairs in a quantum Internet, where the repeaters may perform a probabilistic Bell-state measurement and we may impose a minimum end-to-end fidelity as a requirement. We construct an efficient linear programming (LP) formulation that computes the maximum total achievable entanglement distribution […]