From Hope to Heuristic: Realistic Runtime Estimates for Quantum Optimisation in NHEP

• URL: http://arxiv.org/abs/2505.05066v1
• Date: Thu, 08 May 2025 08:59:37 GMT
• Title: From Hope to Heuristic: Realistic Runtime Estimates for Quantum Optimisation in NHEP
• Authors: Maja Franz, Manuel Schönberger, Melvin Strobl, Eileen Kühn, Achim Streit, Pía Zurita, Markus Diefenthaler, Wolfgang Mauerer,
• Abstract summary: Noisy Intermediate-Scale Quantum (NISQ) computers, despite their limitations, present opportunities for near-term quantum advantages in Nuclear and High-Energy Physics.<n>This study focuses on core algorithms that solve optimisation problems through the quadratic Ising or quadratic unconstrained binary optimisation model.
• Score: 4.039557813788786
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Noisy Intermediate-Scale Quantum (NISQ) computers, despite their limitations, present opportunities for near-term quantum advantages in Nuclear and High-Energy Physics (NHEP) when paired with specially designed quantum algorithms and processing units. This study focuses on core algorithms that solve optimisation problems through the quadratic Ising or quadratic unconstrained binary optimisation model, specifically quantum annealing and the Quantum Approximate Optimisation Algorithm (QAOA). In particular, we estimate runtimes and scalability for the task of particle track reconstruction, a key computing challenge in NHEP, and investigate how the classical parameter space in QAOA, along with techniques like a Fourier-analysis based heuristic, can facilitate future quantum advantages. The findings indicate that lower frequency components in the parameter space are crucial for effective annealing schedules, suggesting that heuristics can improve resource efficiency while achieving near-optimal results. Overall, the study highlights the potential of NISQ computers in NHEP and the significance of co-design approaches and heuristic techniques in overcoming challenges in quantum algorithms.

Related papers

• VQC-MLPNet: An Unconventional Hybrid Quantum-Classical Architecture for Scalable and Robust Quantum Machine Learning [60.996803677584424]
  Variational Quantum Circuits (VQCs) offer a novel pathway for quantum machine learning.<n>Their practical application is hindered by inherent limitations such as constrained linear expressivity, optimization challenges, and acute sensitivity to quantum hardware noise.<n>This work introduces VQC-MLPNet, a scalable and robust hybrid quantum-classical architecture designed to overcome these obstacles.
  arXiv  Detail & Related papers  (2025-06-12T01:38:15Z)
• Provably Robust Training of Quantum Circuit Classifiers Against Parameter Noise [49.97673761305336]
  Noise remains a major obstacle to achieving reliable quantum algorithms.<n>We present a provably noise-resilient training theory and algorithm to enhance the robustness of parameterized quantum circuit classifiers.
  arXiv  Detail & Related papers  (2025-05-24T02:51:34Z)
• Noise-Aware Distributed Quantum Approximate Optimization Algorithm on Near-term Quantum Hardware [2.753858051267023]
  This paper introduces a noise-aware distributed Quantum Approximate Optimization Algorithm (QAOA) tailored for execution on near-term quantum hardware. We address the limitations of current Noisy Intermediate-Scale Quantum (NISQ) devices, which are hindered by limited qubit counts and high error rates.
  arXiv  Detail & Related papers  (2024-07-24T14:50:01Z)
• Graph Learning for Parameter Prediction of Quantum Approximate Optimization Algorithm [14.554010382366302]
  Quantum Approximate Optimization (QAOA) stands out for its potential to efficiently solve the Max-Cut problem. We use Graph Neural Networks (GNN) as a warm-start technique to optimize QAOA, using GNN as a warm-start technique. Our findings show GNN's potential in improving QAOA performance, opening new avenues for hybrid quantum-classical approaches in quantum computing.
  arXiv  Detail & Related papers  (2024-03-05T20:23:25Z)
• Quantum Annealing for Single Image Super-Resolution [86.69338893753886]
  We propose a quantum computing-based algorithm to solve the single image super-resolution (SISR) problem. The proposed AQC-based algorithm is demonstrated to achieve improved speed-up over a classical analog while maintaining comparable SISR accuracy.
  arXiv  Detail & Related papers  (2023-04-18T11:57:15Z)
• Optimization Applications as Quantum Performance Benchmarks [0.0]
  Combinatorial optimization is anticipated to be one of the primary use cases for quantum computation in the coming years. Inspired by existing methods to characterize classical optimization algorithms, we analyze the solution quality obtained by solving Max-Cut problems. This is used to guide the development of an advanced benchmarking framework for quantum computers.
  arXiv  Detail & Related papers  (2023-02-05T01:56:06Z)
• Decomposition of Matrix Product States into Shallow Quantum Circuits [62.5210028594015]
  tensor network (TN) algorithms can be mapped to parametrized quantum circuits (PQCs) We propose a new protocol for approximating TN states using realistic quantum circuits. Our results reveal one particular protocol, involving sequential growth and optimization of the quantum circuit, to outperform all other methods.
  arXiv  Detail & Related papers  (2022-09-01T17:08:41Z)
• Synergy Between Quantum Circuits and Tensor Networks: Short-cutting the Race to Practical Quantum Advantage [43.3054117987806]
  We introduce a scalable procedure for harnessing classical computing resources to provide pre-optimized initializations for quantum circuits. We show this method significantly improves the trainability and performance of PQCs on a variety of problems. By demonstrating a means of boosting limited quantum resources using classical computers, our approach illustrates the promise of this synergy between quantum and quantum-inspired models in quantum computing.
  arXiv  Detail & Related papers  (2022-08-29T15:24:03Z)
• Multi-disk clutch optimization using quantum annealing [34.82692226532414]
  We develop a new quantum algorithm to solve a problem with significant practical relevance in clutch manufacturing. It is demonstrated how quantum optimization can play a role in real industrial applications in the manufacturing sector.
  arXiv  Detail & Related papers  (2022-08-11T16:34:51Z)
• Reducing the cost of energy estimation in the variational quantum eigensolver algorithm with robust amplitude estimation [50.591267188664666]
  Quantum chemistry and materials is one of the most promising applications of quantum computing. Much work is still to be done in matching industry-relevant problems in these areas with quantum algorithms that can solve them.
  arXiv  Detail & Related papers  (2022-03-14T16:51:36Z)
• Quantum circuit architecture search for variational quantum algorithms [88.71725630554758]
  We propose a resource and runtime efficient scheme termed quantum architecture search (QAS) QAS automatically seeks a near-optimal ansatz to balance benefits and side-effects brought by adding more noisy quantum gates. We implement QAS on both the numerical simulator and real quantum hardware, via the IBM cloud, to accomplish data classification and quantum chemistry tasks.
  arXiv  Detail & Related papers  (2020-10-20T12:06:27Z)
• Policy Gradient based Quantum Approximate Optimization Algorithm [2.5614220901453333]
  We show that policy-gradient-based reinforcement learning algorithms are well suited for optimizing the variational parameters of QAOA in a noise-robust fashion. We analyze the performance of the algorithm for quantum state transfer problems in single- and multi-qubit systems.
  arXiv  Detail & Related papers  (2020-02-04T00:46:51Z)

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.