Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Bulletin of the American Physical Society

A traveling salesperson and sparse sampling boost to quasiparticle interference mapping

Jens Oppliger, Fabian Donat Natterer

Published Mar 3, 2020• 0 citations
OpenAlex

Related papers

Compressed sensing of Fourier sparse quasiparticle-interference map

Olli Winberg

•May 24, 2021•0 citations

Multiparticle interference

Dien A. Rice, Charles F. Osborne, Peter Lloyd

Physics Letters A•Mar 1, 1994•9 citations

Quantum hobbit routing: Annealer implementation of generalized Travelling Salesperson Problem

Iñigo Perez Delgado, Beatriz García Markaida, Aitor Moreno-Fernández-de-Leceta +1 more

In this paper, we present an implementation of a Job Selection Problem (JSP) — a generalization of the well-known Travelling Salesperson Problem (TSP)— of$N=9$jobs on its Quadratic Unconstrained Binary Optimization (QUBO) form, using$\mathrm{O}(N)$qubits on DWave's Advantage_system4.1 quantum annealing device. The best known quantum algorithm for TSP to date uses$\mathcal{O}(N^{2})$qubits. A solution is found using the quantum method. However, since hardware is not yet able to compensate the increase in search-space size, no present overall advantage is achieved when comparing the quantum results with either exhaustive or equiprobably sampled classical solutions of the problem.

arXiv:2309.16522•IEEE Symposium Series on Computational Intelligence (SSCI)•Dec 4, 2022•3 citations

A High-Performance Cyclic-Mapping Encoding for Quantum Computing of Traveling Salesperson Problems on NISQ Devices

J. Wang, Takumi Kanezashi, Daisuke Tsukayama +3 more

With the ongoing progress of quantum computing, there is increasing interest in bringing quantum technologies into real-world applications, making practically motivated NP-hard problems particularly important to study. In this work, we solve the traveling salesperson problem (TSP) on real quantum hardware to demonstrate and analyze the performance of different quantum chips, and we benchmark these results against simulations. This comparison provides evidence supporting the feasibility of deploying quantum computation toward practical applications.

IEEE International Conference on Nanotechnology (IEEE-NANO)•Jul 1, 2026•0 citations

From quantum jumps to quasiparticle population

Uri Vool, Ioan M. Pop, Katrina Sliwa +14 more

Bulletin of the American Physical Society•Mar 6, 2015•0 citations

Detecting statistics of quasiparticles using dynamical probes

Claudia De Grandi, Roman A. Barankov, Anatoli Polkovnikov

Bulletin of the American Physical Society•Mar 17, 2009•0 citations
In this paper, we present an implementation of a Job Selection Problem (JSP) — a generalization of the well-known Travelling Salesperson Problem (TSP)— ofN=9N=9N=9jobs on its Quadratic Unconstrained Binary Optimization (QUBO) form, usingO(N)\mathrm{O}(N)O(N)qubits on DWave's Advantage_system4.1 quantum annealing device. The best known quantum algorithm for TSP to date usesO(N2)\mathcal{O}(N^{2})O(N2)qubits. A solution is found using the quantum method. However, since hardware is not yet able to compensate the increase in search-space size, no present overall advantage is achieved when comparing the quantum results with either exhaustive or equiprobably sampled classical solutions of the problem.
With the ongoing progress of quantum computing, there is increasing interest in bringing quantum technologies into real-world applications, making practically motivated NP-hard problems particularly important to study. In this work, we solve the traveling salesperson problem (TSP) on real quantum hardware to demonstrate and analyze the performance of different quantum chips, and we benchmark these results against simulations. This comparison provides evidence supporting the feasibility of deploying quantum computation toward practical applications.