Application-Driven Benchmarking of the Traveling Salesperson Problem: a Quantum Hardware Deep-Dive

• URL: http://arxiv.org/abs/2507.16471v1
• Date: Tue, 22 Jul 2025 11:22:04 GMT
• Title: Application-Driven Benchmarking of the Traveling Salesperson Problem: a Quantum Hardware Deep-Dive
• Authors: Amine Bentellis, Benedikt Poggel, Jeanette Miriam Lorenz,
• Abstract summary: The study includes a comparative analysis of various hardware architectures with the example of the Traveling Salesperson Problem.<n>It highlights what steps are necessary to run real-world applications on quantum hardware.<n>Results in the relative efficiency of exemplary quantum algorithms on neutral atom-based, ion trap and superconducting hardware.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: The potential analysis of the capabilities of quantum computing, especially before fault tolerance at scale, is difficult due to the variety of existing hardware technologies with a wide spread of maturity. Not only the result of computations, but also the very process of running quantum-enhanced algorithms differ from provider to provider. The study includes a comparative analysis of various hardware architectures with the example of the Traveling Salesperson Problem, a central class of combinatorial optimization. It highlights what steps are necessary to run real-world applications on quantum hardware, showcases how the providers and various technologies differ and presents results in the relative efficiency of exemplary quantum algorithms on neutral atom-based, ion trap and superconducting hardware, the latter including both gate-based and annealing devices. This is an important step in advancing the understanding of quantum computing capabilities from an application standpoint - agnostic to the underlying qubit technology and projecting results into the future to judge what further developments on the application side are necessary.

Related papers

• Benchmarking fault-tolerant quantum computing hardware via QLOPS [2.0464713282534848]
  To run quantum algorithms, it is essential to develop scalable quantum hardware with low noise levels.<n>Various fault-tolerant quantum computing schemes have been developed for different hardware platforms.<n>We propose Quantum Logical Operations Per Second (QLOPS) as a metric for assessing the performance of FTQC schemes.
  arXiv  Detail & Related papers  (2025-07-16T08:31:51Z)
• Quantum Executor: A Unified Interface for Quantum Computing [46.36953285198747]
  Quantum Executor is a backend-agnostic execution engine designed to orchestrate quantum experiments across heterogeneous platforms.<n>Key features include support for asynchronous and distributed execution, customizable execution strategies and a unified API for managing quantum experiments.
  arXiv  Detail & Related papers  (2025-07-10T09:55:32Z)
• 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)
• Quantum Compiler Design for Qubit Mapping and Routing: A Cross-Architectural Survey of Superconducting, Trapped-Ion, and Neutral Atom Systems [36.240273478884696]
  We review and categorize research on the qubit mapping and routing problems across the three mainstream quantum hardware platforms.<n>We primarily explore the development of hardware-aware compilers for superconducting platforms.<n>We examine the evolution of trapped-ion and neutral atom devices.
  arXiv  Detail & Related papers  (2025-05-22T16:49:57Z)
• Comprehensive Survey of QML: From Data Analysis to Algorithmic Advancements [2.5686697584463025]
  Quantum Machine Learning represents a paradigm shift at the intersection of Quantum Computing and Machine Learning.<n>The field faces significant challenges, including hardware constraints, noise, and limited qubit coherence.<n>This survey aims to provide a foundational resource for advancing Quantum Machine Learning toward practical, real-world applications.
  arXiv  Detail & Related papers  (2025-01-16T13:25:49Z)
• How to Build a Quantum Supercomputer: Scaling from Hundreds to Millions of Qubits [3.970891204847277]
  Small-scale demonstrations have become possible for quantum algorithmic primitives on hundreds of physical qubits.<n>We show how the road to scaling could be paved by adopting existing semiconductor technology to build much higher-quality qubits.<n>We argue that, to tackle industry-scale classical optimization and machine learning problems, heterogeneous quantum-probabilistic computing with custom-designed accelerators should be considered.
  arXiv  Detail & Related papers  (2024-11-15T18:22:46Z)
• Parallel Quantum Computing Simulations via Quantum Accelerator Platform Virtualization [44.99833362998488]
  We present a model for parallelizing simulation of quantum circuit executions. The model can take advantage of its backend-agnostic features, enabling parallel quantum circuit execution over any target backend.
  arXiv  Detail & Related papers  (2024-06-05T17:16:07Z)
• Quantum algorithms: A survey of applications and end-to-end complexities [90.05272647148196]
  The anticipated applications of quantum computers span across science and industry. We present a survey of several potential application areas of quantum algorithms. We outline the challenges and opportunities in each area in an "end-to-end" fashion.
  arXiv  Detail & Related papers  (2023-10-04T17:53:55Z)
• Characterizing Qubit Traffic of a Quantum Intranet aiming at Modular Quantum Computers [1.8602413562219944]
  Quantum-core processors are envisioned as the ultimate solution for the scalability of quantum computers. We present a technique to perform a-temporal characterization of quantum circuits running in multi-chip interconnected quantum computers.
  arXiv  Detail & Related papers  (2022-08-31T21:33:17Z)
• 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)
• Quantum circuit architecture search on a superconducting processor [56.04169357427682]
  Variational quantum algorithms (VQAs) have shown strong evidences to gain provable computational advantages for diverse fields such as finance, machine learning, and chemistry. However, the ansatz exploited in modern VQAs is incapable of balancing the tradeoff between expressivity and trainability. We demonstrate the first proof-of-principle experiment of applying an efficient automatic ansatz design technique to enhance VQAs on an 8-qubit superconducting quantum processor.
  arXiv  Detail & Related papers  (2022-01-04T01:53:42Z)
• 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)

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.