cs.AINov 13, 2026

Optimizing Drilling Trajectories in Multi-Material Structures Using Quantum Annealers

Authors: Eneko Osaba, Antonio Rubio-Mateos

Organizations: TECNALIA, Basque Research and Technology Alliance (BRTA), 48160 Derio, Bizkaia, Spain

Abstract

In this work we present a quantum-hybrid optimization approach for planning drilling trajectories on multi-material structures, with the objective of minimizing total energy consumption. The proposed formulation models the drilling process as a constrained routing problem in which each hole must be visited while accounting for heterogeneous material properties, material-dependent drilling costs and displacement energy, as well as tool-wear penalties. Our method incorporates realistic industrial constraints, including open-path routing and mandatory grouping of holes belonging to the same material to avoid frequent tool-bit changes. The modeled problem is solved using D-Wave's Leap Constrained Quadratic Model Hybrid Solver. To evaluate performance, we benchmark instances ranging from 10 to 55 holes with varying material distributions and cost matrices. The results highlight the capability of quantum-hybrid optimization to handle complex multi-physics constraints and to generate energy-efficient drilling sequences under realistic manufacturing conditions.

Figures & tables

Explore similar work

Oct 7, 2026

Measurement-Efficient Differentiable Quantum Architecture Search for Combinatorial Optimization

Differentiable quantum architecture search (DQAS) is a promising framework for the automated design of quantum circuits, particularly for variational quantum optimization algorithms. However, its practical deployment on quantum hardware is limited by the large number of circuit measurements required during optimization, making hardware execution costly. In this work, we show that for a broad class of combinatorial optimization problems and commonly used rotational gate parameterizations, the measurement cost of DQAS can be significantly reduced without changing the optimization objective. We derive the proposed measurement reduction scheme theoretically and validate it experimentally on 3-SAT and MaxCut benchmark problems. Our approach reduces the requested gradient measurement cost by about 39 to 41% while introducing only negligible classical post-processing overhead, lowering the practical cost of executing DQAS on quantum hardware.
May 15, 2026

Combinatorial Optimization of Robotic Hand Kinematic Structures Using a Potential-Dexterity-Based QUBO Formulation

Robotic hand kinematic design involves combinatorial selection among multiple finger structures whose performance depends on both individual kinematic characteristics and inter-finger interactions. This study presents a potential-dexterity-based quadratic unconstrained binary optimization (QUBO) formulation for combinatorial optimization of robotic hand kinematic structures. Potential dexterity-related metrics were evaluated through kinematic analysis and encoded into a 27-variable QUBO problem incorporating individual finger performance, thumb-to-finger workspace-overlap interactions, one-hot selection constraints, and pairwise structural compatibility. Exhaustive evaluation of the design space established a reference optimum and enabled direct validation of the formulated objective. Discretization sensitivity analysis showed that the selected design remained unchanged across the tested joint-space sampling intervals and at a finer workspace voxel resolution, while sensitivity was observed under coarse voxelization. Simulated annealing consistently recovered the reference optimum at higher sampling counts, and direct execution on D-Wave quantum annealing hardware also recovered the reference optimum under all tested sampling conditions. These results demonstrate that the proposed formulation provides a common QUBO representation for constrained robotic hand kinematic structure selection and enables evaluation using exhaustive, classical annealing, and quantum annealing approaches.
Feb 28, 2026

QANTIS: A Hardware-Validated Quantum Platform for POMDP Planning and Multi-Target Data Association

Autonomous navigation under uncertainty requires solving partially observable Markov decision processes (POMDPs) for planning and assigning sensor measurements to tracked targets--a task known as multi-target data association (MTDA). Both problems become computationally demanding at scale: belief conditioning costs O(P(e)−1)\mathcal{O}(P(e)^{-1}) per node under rare evidence, while MTDA is NP-hard. Quantum amplitude amplification can quadratically reduce the belief-update query cost to O(P(e)−1/2)\mathcal{O}(P(e)^{-1/2}), while QUBO reformulations expose MTDA to quantum and quantum-inspired optimisation heuristics. We present QANTIS, a modular platform that integrates quantum belief update (Grover amplitude amplification and BIQAE), QUBO-based data association via FPC-QAOA, and composable error mitigation, and we report a 45-experiment hardware study on three IBM Heron backends. On hardware, a single Grover iterate applied to a Tiger belief oracle amplifies a rare observation probability from 0.1790.179 to 0.9070.907 (5.1×5.1\times; ISA 18) while preserving the Bayesian posterior (Hellinger 0.00150.0015), increasing usable-shot yield from 1,463 to 7,429. We interpret this as a hardware validation of the quadratic query-complexity mechanism at k=1k=1 with posterior preservation, rather than a wall-clock advantage claim. We further demonstrate, to our knowledge, the first closed-loop hybrid quantum-classical Tiger POMDP on superconducting hardware (T=8T=8, max Hellinger below 0.0150.015), and empirically characterise NISQ feasibility boundaries: ZNE-based error mitigation is beneficial below ISA ≈100\approx 100 and harmful above ISA ≳1,000\gtrsim 1{,}000; FPC-QAOA is meaningful at ≤15\leq 15 QUBO variables (ISA ≲450\lesssim 450). These results characterise practical operating regimes on current superconducting hardware rather than wall-clock quantum advantage at today's problem scales.