Quantum Annealing Hyperparameter Analysis for Optimal Sensor Placement in Production Environments

• URL: http://arxiv.org/abs/2507.16584v1
• Date: Tue, 22 Jul 2025 13:35:51 GMT
• Title: Quantum Annealing Hyperparameter Analysis for Optimal Sensor Placement in Production Environments
• Authors: Nico Kraus, Marvin Erdmann, Alexander Kuzmany, Daniel Porawski, Jonas Stein,
• Abstract summary: We show how quantum computing could contribute to cost-efficient, large-scale optimization problems once the hardware matures.<n>We transform the problem into a quadratic unconstrained binary optimization formulation with one-hot and binary encoding.<n>Our results demonstrate that quantum annealing is capable of solving instances derived from real-world scenarios.
• Score: 39.58317527488534
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: To increase efficiency in automotive manufacturing, newly produced vehicles can move autonomously from the production line to the distribution area. This requires an optimal placement of sensors to ensure full coverage while minimizing the number of sensors used. The underlying optimization problem poses a computational challenge due to its large-scale nature. Currently, classical solvers rely on heuristics, often yielding non-optimal solutions for large instances, resulting in suboptimal sensor distributions and increased operational costs. We explore quantum computing methods that may outperform classical heuristics in the future. We implemented quantum annealing with D-Wave, transforming the problem into a quadratic unconstrained binary optimization formulation with one-hot and binary encoding. Hyperparameters like the penalty terms and the annealing time are optimized and the results are compared with default parameter settings. Our results demonstrate that quantum annealing is capable of solving instances derived from real-world scenarios. Through the use of decomposition techniques, we are able to scale the problem size further, bringing it closer to practical, industrial applicability. Through this work, we provide key insights into the importance of quantum annealing parametrization, demonstrating how quantum computing could contribute to cost-efficient, large-scale optimization problems once the hardware matures.

Related papers

• Non-Variational Quantum Random Access Optimization with Alternating Operator Ansatz [3.5773675235837974]
  Quantum Random Access Optimization (QRAO) has been proposed to reduce the space requirements of quantum optimization.<n>We show that instance-independent fixed" parameters achieve good performance, removing the need for variational parameter optimization.<n>Our results pave the way for the practical execution of QRAO on early fault-tolerant quantum computers.
  arXiv  Detail & Related papers  (2025-02-06T18:25:31Z)
• Boosting quantum annealing performance through direct polynomial unconstrained binary optimization [0.0]
  We show how PUBO formulation can bring considerable savings in terms of required number of qubits.<n>We find scenarios where the scaling of the minimum energy gap during the optimization sweep differs significantly.<n>As an interesting side effect, the analysis on minimum energy gaps of different 3-SAT instance generators reveals different degrees of hardness.
  arXiv  Detail & Related papers  (2024-12-05T18:12:20Z)
• Fast Numerical Solver of Ising Optimization Problems via Pruning and Domain Selection [4.460518115427853]
  We propose a fast and efficient solver for the Ising optimization problems. Our solver can be an order of magnitude faster than the classical solver, and at least two times faster than the quantum-inspired annealers.
  arXiv  Detail & Related papers  (2023-12-10T09:43:15Z)
• Challenges and Opportunities in Quantum Optimization [14.7608536260003]
  Recent advances in quantum computers are demonstrating the ability to solve problems at a scale beyond brute force classical simulation. Across computer science and physics, there are different approaches for major optimization problems.
  arXiv  Detail & Related papers  (2023-12-04T19:00:44Z)
• Randomized Benchmarking of Local Zeroth-Order Optimizers for Variational Quantum Systems [65.268245109828]
  We compare the performance of classicals across a series of partially-randomized tasks. We focus on local zeroth-orders due to their generally favorable performance and query-efficiency on quantum systems.
  arXiv  Detail & Related papers  (2023-10-14T02:13:26Z)
• Quantum approximate optimization via learning-based adaptive optimization [5.399532145408153]
  Quantum approximate optimization algorithm (QAOA) is designed to solve objective optimization problems. Our results demonstrate that the algorithm greatly outperforms conventional approximations in terms of speed, accuracy, efficiency and stability. This work helps to unlock the full power of QAOA and paves the way toward achieving quantum advantage in practical classical tasks.
  arXiv  Detail & Related papers  (2023-03-27T02:14:56Z)
• Prog-QAOA: Framework for resource-efficient quantum optimization through classical programs [0.0]
  Current quantum optimization algorithms require representing the original problem as a binary optimization problem, which is then converted into an equivalent cost Hamiltonian suitable for the quantum device.<n>We propose to design classical programs for computing the objective function and certifying the constraints, and later compile them to quantum circuits.<n>We exploit this idea for optimization tasks like the Travelling Salesman Problem and Max-$K$-Cut and obtain circuits that are near-optimal with respect to all relevant cost measures.
  arXiv  Detail & Related papers  (2022-09-07T18:01:01Z)
• Adiabatic Quantum Computing for Multi Object Tracking [170.8716555363907]
  Multi-Object Tracking (MOT) is most often approached in the tracking-by-detection paradigm, where object detections are associated through time. As these optimization problems are often NP-hard, they can only be solved exactly for small instances on current hardware. We show that our approach is competitive compared with state-of-the-art optimization-based approaches, even when using of-the-shelf integer programming solvers.
  arXiv  Detail & Related papers  (2022-02-17T18:59:20Z)
• Variational Quantum Optimization with Multi-Basis Encodings [62.72309460291971]
  We introduce a new variational quantum algorithm that benefits from two innovations: multi-basis graph complexity and nonlinear activation functions. Our results in increased optimization performance, two increase in effective landscapes and a reduction in measurement progress.
  arXiv  Detail & Related papers  (2021-06-24T20:16:02Z)
• Machine Learning Framework for Quantum Sampling of Highly-Constrained, Continuous Optimization Problems [101.18253437732933]
  We develop a generic, machine learning-based framework for mapping continuous-space inverse design problems into surrogate unconstrained binary optimization problems. We showcase the framework's performance on two inverse design problems by optimizing thermal emitter topologies for thermophotovoltaic applications and (ii) diffractive meta-gratings for highly efficient beam steering.
  arXiv  Detail & Related papers  (2021-05-06T02:22:23Z)
• Adaptive pruning-based optimization of parameterized quantum circuits [62.997667081978825]
  Variisy hybrid quantum-classical algorithms are powerful tools to maximize the use of Noisy Intermediate Scale Quantum devices. We propose a strategy for such ansatze used in variational quantum algorithms, which we call "Efficient Circuit Training" (PECT) Instead of optimizing all of the ansatz parameters at once, PECT launches a sequence of variational algorithms.
  arXiv  Detail & Related papers  (2020-10-01T18:14:11Z)
• Compilation of Fault-Tolerant Quantum Heuristics for Combinatorial Optimization [0.14755786263360526]
  We explore which quantum algorithms for optimization might be most practical to try out on a small fault-tolerant quantum computer. Our results discourage the notion that any quantum optimization realizing only a quadratic speedup will achieve an advantage over classical algorithms.
  arXiv  Detail & Related papers  (2020-07-14T22:54:04Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.