In recent years, the increasing adoption of distributed sensing systems and Internet of Things (IoT) technologies has enabled denser monitoring infrastructures in industrial and safety-critical environments. In this context, sensor placement in hydrogen transport networks represents a combinatorial optimization problem that affects the information available for anomaly monitoring while being subject to deployment constraints. To address this problem, we propose a formulation based on Quadratic Unconstrained Binary Optimization (QUBO), in which the energy function is constructed from changes in the reconstruction loss of a neural autoencoder. These changes are measured when individual pressure sensors or sensor pairs are added to a fixed set of mass-flow sensors. Individual and pairwise terms encode measured sensor effects in the quadratic objective. The number of selected sensors is controlled through an energy penalty that discourages configurations whose cardinality deviates from a predefined target, rather than through a hard constraint. The resulting QUBO is mapped to the Quantum Approximate Optimization Algorithm (QAOA) using a variational quantum circuit with alternating cost and mixer layers. Its parameters are optimized through evolutionary search followed by local refinement via a memetic strategy. The experimental analysis compares this approach with classical and exact methods on the same QUBO and examines how faithfully the pairwise objective represents larger sensor configurations and downstream anomaly-detection outcomes. At a target of five pressure sensors, QAOA returned cardinality-feasible configurations in 7/25, 16/25, and 14/25 runs for Gestdown, Gestcenter, and Gestup, respectively, compared with 25/25 runs for each classical baseline in all three topologies.
In recent years, the increasing adoption of distributed sensing systems and Internet of Things (IoT) technologies has enabled denser monitoring infrastructures in industrial and safety-critical environments. In this context, sensor placement in hydrogen transport networks represents a combinatorial optimization problem that affects the information available for anomaly monitoring while being subject to deployment constraints. To address this problem, we propose a formulation based on Quadratic Unconstrained Binary Optimization (QUBO), in which the energy function is constructed from changes in the reconstruction loss of a neural autoencoder. These changes are measured when individual pressure sensors or sensor pairs are added to a fixed set of mass-flow sensors. Individual and pairwise terms encode measured sensor effects in the quadratic objective. The number of selected sensors is controlled through an energy penalty that discourages configurations whose cardinality deviates from a predefined target, rather than through a hard constraint. The resulting QUBO is mapped to the Quantum Approximate Optimization Algorithm (QAOA) using a variational quantum circuit with alternating cost and mixer layers. Its parameters are optimized through evolutionary search followed by local refinement via a memetic strategy. The experimental analysis compares this approach with classical and exact methods on the same QUBO and examines how faithfully the pairwise objective represents larger sensor configurations and downstream anomaly-detection outcomes. At a target of five pressure sensors, QAOA returned cardinality-feasible configurations in 7/25, 16/25, and 14/25 runs for Gestdown, Gestcenter, and Gestup, respectively, compared with 25/25 runs for each classical baseline in all three topologies.
Optimal sensor placement in civil structures is a combinatorial optimization problem. A small set of informative sensor locations must be selected from many possible measurement degrees of freedom. This paper combines a finite element evaluation (FEM) based on modal strain energy with a quadratic unconstrained binary optimization (QUBO) formulation. Solution paths based on the Quantum Approximate Optimization Algorithm (QAOA) are evaluated with multiple classical optimizers and compared with an exact reference calculation. The analysis focuses on the mechanical meaning of the objective function, the fixed sensor-number constraint, the influence of classical optimization, and the scaling from a small validation model to a larger Warren truss. The results show that reliable QAOA-based sensor placement depends on the combined treatment of objective function, constraint handling, mixer choice, circuit depth, and optimizer stability.
We present a novel slack-free, penalty-based framework for reformulating constrained binary optimization as Quadratic Unconstrained Binary Optimization (QUBO) on near-term quantum annealing hardware. Given a user-chosen penalty function that most naturally captures a constraint---typically non-quadratic, such as a Heaviside-function surrogate---and a target probability measure over the Boolean hypercube, our method returns the weighted least-squares projection of the chosen penalty function onto the subspace spanned by linear and quadratic Walsh--Fourier characters that correspond to physically realizable couplings on the target hardware graph. Within this restricted family, the resulting quadratic surrogate is uniquely and optimally determined by the normal equations: unlike state-of-the-art approaches, it introduces no per-constraint penalty coefficients to tune and avoids dense all-pairs couplings by construction. Two practical consequences follow. First, the projected penalty respects device connectivity, reducing chain lengths and physical-qubit overhead after minor embedding. Second, we show empirically that this hardware-native surrogate can outperform denser full-pairwise projections, despite being drawn from a strictly smaller approximation space. This advantage widens once the QUBO is embedded and sampled on quantum annealers, yielding samples with the lowest worst-case and mean objective gaps compared to unbalanced penalization and a hardware-blind projection onto all quadratic terms.
Maximizing gas throughput in transmission networks under hydraulic and operational constraints is a combinatorial problem whose complexity grows exponentially with network size, making it computationally intensive to solve exactly. This paper addresses the graph-based optimization problem by optimizing nodal-pressure assignments under the Panhandle-B hydraulic equation. By framing the problem as a search over discretized nodal-pressure assignments coupled with a cost Hamiltonian that encodes both the delivery objective and physical-constraint penalties, we establish a unified formulation suitable for the Quantum Approximate Optimization Algorithm (QAOA). The mathematical model is adapted to a Quadratic Unconstrained Binary Optimization (QUBO) formulation and implemented using the Classiq quantum software platform. In simulator-based experiments, QAOA recovered the maximum-throughput valid operating point, consistent with classical exhaustive evaluation and classical hydraulic simulation reference solutions. A distinctive contribution of this work is the end-to-end execution of a reduced problem instance on the IonQ Forte-1 trapped-ion quantum processor. Remarkably, the hardware implementation used only p=2 QAOA layers, substantially fewer than the p=30 layers used in the simulator-based study. Despite this significant reduction in circuit depth, the QPU produced physically valid and interpretable candidate solutions that bracketed the continuous classical optimum, with each located within one pressure-discretization step of it. These results demonstrate that meaningful gas-network optimization behavior can be obtained using considerably shallower QAOA circuits than initially expected and provide an end-to-end proof of concept for near-term quantum-assisted gas-network optimization.
The Quantum Approximate Optimization Algorithm (QAOA) has emerged as one of the most prominent hybrid quantum–classical algorithms for combinatorial optimization on noisy intermediate-scale quantum (NISQ) hardware. QAOA maps real-world problems into Ising or quadratic unconstrained binary optimization (QUBO) forms and alternates cost and mixer operators in a shallow parameterized circuit whose angles are tuned by a classical optimizer. This article introduces QAOA from fundamentals to practice, emphasizing why it aligns with industrial optimization through binary decision modeling and the presence of severe scaling challenges in classical optimization. We review research trends that improve expressivity and trainability, including ansatz engineering, parameter initialization, and hybrid training strategies, drawing parallels to developments in artificial intelligence. After that, we survey representative applications in emerging domains such as drug discovery, materials design, semiconductor design, logistics, and finance highlighting practical encodings and constraint-preserving formulations that keep quantum evolution within feasible subspaces beyond penalty-based methods. Finally, we present QAOA as a rapidly maturing framework with credible pathways toward near-term utility in real industrial workflows.
Wireless sensor network (WSN) coverage is a central optimization challenge in Internet of Things (IoT) deployments, where sensor mobility must be coordinated to maximize target coverage while limiting movement, redundancy, and resource usage. We formulate mobile placement as a quadratic unconstrained binary optimization (QUBO) problem using geometry-derived candidate actions. The formulation is first validated using the quantum approximate optimization algorithm (QAOA) on a 12-logical-qubit, two-sensor, three-target instance. For larger networks, we propose an adaptive simulated quantum annealing-assisted large-neighborhood search method (Adaptive SQA-LNS). The method identifies difficult target regions, solves reduced QUBO subproblems using path-integral simulated quantum annealing (SQA), a classical simulation of quantum annealing, and improves decoded solutions through constraint repair and local search. The experiments study scaling from 12 logical qubits to approximately 471 logical QUBO variables for the 50-sensor, 100-target benchmark. Networks ranging from 5 sensors and 15 targets to 50 sensors and 100 targets are evaluated using a common multi-objective formulation that incorporates coverage, movement, sensor utilization, redundancy, and connectivity. Across the evaluated instances, Adaptive SQA-LNS matches the constraint-programming reference coverage and achieves the smallest objective gap among the SQA-based approaches. These results provide a reproducible framework for studying quantum-annealing-inspired hybrid optimization for scalable wireless sensor network coverage.
Combinatorial optimization problems are typically formulated using Quadratic Unconstrained Binary Optimization (QUBO), where constraints are enforced through penalty terms that introduce auxiliary variables and rapidly increase Hamiltonian complexity, limiting scalability on near term quantum devices. In this work, we systematically study Quadratic Unconstrained D-ary Optimization (QUDO) as an alternative formulation in which decision variables are encoded directly in higher dimensional Hilbert spaces. We demonstrate that QUDO naturally captures structural constraints across a range of problem classes, including the Traveling Salesman Problem, two variants of the Vehicle Routing Problem, graph coloring, job scheduling, and Max-K-Cut, without the need for extensive penalty constructions. Using a qudit-level implementation of the Quantum Approximate Optimization Algorithm (qudit QAOA), we benchmark these formulations against their binary QUBO counterparts and exact classical solutions. Our study show consistently improved approximation ratios and substantially reduced computational overhead at comparable circuit depths, highlighting QUDO as a scalable and expressive representation for quantum combinatorial optimization.