Cover Image

Evidence of scaling advantage on an NP-Complete problem with enhanced quantum solvers

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Lu, Quanfeng, Wei, Shijie, Li, Keren, Gao, Pan, Yan, Bao, Zheng, Muxi, Zhang, Haoran, Zeng, Jinfeng, Long, Gui-Lu
Format:	Preprint
Published:	2025
Subjects:	Quantum Physics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Space-Optimized and Experimental Implementations of Regev's Quantum Factoring Algorithm
by: Yang, Wentao, et al.
Published: (2025)

Quantum-Classical Hybrid Algorithm for Solving the Learning-With-Errors Problem on NISQ Devices
by: Zheng, Muxi, et al.
Published: (2024)

Exact Mobility Edges in a Disorder-Free Dimerized Stark Lattice with Effective Unbounded Hopping
by: Qi, Yunyao, et al.
Published: (2026)

The Riemann Hypothesis Emerges in Dynamical Quantum Phase Transitions
by: Wei, ShiJie, et al.
Published: (2025)

Topological phases of extended Su-Schrieffer-Heeger-Hubbard model
by: Chang, Pei-Jie, et al.
Published: (2024)

Generative quantum advantage for classical and quantum problems
by: Huang, Hsin-Yuan, et al.
Published: (2025)

Do quantum linear solvers offer advantage for networks-based system of linear equations?
by: Shetty, Disha, et al.
Published: (2025)

Wataridori is NP-Complete
by: Ruangwises, Suthee
Published: (2026)

Tokenisation is NP-Complete
by: Whittington, Philip, et al.
Published: (2024)

Nondango is NP-Complete
by: Ruangwises, Suthee
Published: (2023)

Practical advantage of non-Hermitian enhanced quantum sensing
by: Yang, Kun, et al.
Published: (2026)

DNA Probe Computing System for Solving NP-Complete Problems
by: Xu, Jin, et al.
Published: (2025)

Quantum computing algorithms for inverse problems on graphs and an NP-complete inverse problem
by: Ilmavirta, Joonas, et al.
Published: (2023)

Experimental simulation of quantum superchannels
by: Li, Hang, et al.
Published: (2023)

The Quiver Problem is NP Complete
by: Kac, Victor, et al.
Published: (2025)

Recognizing Sumsets is NP-Complete
by: Abboud, Amir, et al.
Published: (2024)

Unconditional quantum teleportational advantage of single photons
by: Peng, Li-Chao, et al.
Published: (2025)

Completeness in the Polynomial Hierarchy and PSPACE for many natural problems derived from NP
by: Grüne, Christoph, et al.
Published: (2026)

Optimality and NP-Hardness of Transformers in Learning Markovian Dynamical Functions
by: Ding, Yanna, et al.
Published: (2025)

Scaling advantage with quantum-enhanced memetic tabu search for LABS
by: Cadavid, Alejandro Gomez, et al.
Published: (2025)

Multi-patch/multiple-scattering frequency-time hybrid solver for interior and exterior wave equation problems
by: Pan, Shuai, et al.
Published: (2025)

Joint Unitarity and a Single Definite Outcome in a Quantum Measurement
by: Liu, Muxi
Published: (2026)

Entanglement-enhanced learning of quantum processes at scale
by: Seif, Alireza, et al.
Published: (2024)

Towards a Linear-Ramp QAOA protocol: Evidence of a scaling advantage in solving some combinatorial optimization problems
by: Montanez-Barrera, J. A., et al.
Published: (2024)

NP-Completeness of Neighborhood Balanced Colorings
by: Asaeedi, Saeed
Published: (2024)

The 2-Attractor Problem is NP-Complete
by: Fuchs, Janosch, et al.
Published: (2023)

Crisis Management Through Diversification: Evidence From Product Recalls in an Emerging Market
by: Hengmiao Bao, et al.
Published: (2026)

Mitigating water grabbing of farmland transfer through plot up‐scaling and pro‐environmental investment: Evidence from Jiangsu, China
by: Ying Chai, et al.
Published: (2024)

Towards large-scale quantum optimization solvers with few qubits
by: Sciorilli, Marco, et al.
Published: (2024)

Beyond asymptotic scaling: Comparing functional quantum linear solvers
by: Lefterovici, Andreea-Iulia, et al.
Published: (2025)

Implementation of Polynomial NP-Complete Algorithms Based on the NP Verifier Simulation Framework
by: Lee, Changryeol
Published: (2026)

Experimental practical quantum tokens with transaction time advantage
by: Jiang, Yang-Fan, et al.
Published: (2024)

Unconditional quantum magic advantage in shallow circuit computation
by: Zhang, Xingjian, et al.
Published: (2024)

The sudden death of quantum advantage in correlation generations
by: Sun, Weixiao, et al.
Published: (2024)

On modeling NP-Complete problems as polynomial-sized linear programs: Escaping/Side-stepping the "barriers"
by: Diaby, Moustapha, et al.
Published: (2023)

Global strong solutions with large initial data for the Cauchy problem of the multi-dimensional compressible Navier-Stokes-Korteweg system
by: Huang, Xiangdi, et al.
Published: (2026)

A $1000\times$ Faster LLM-enhanced Algorithm For Path Planning in Large-scale Grid Maps
by: Zeng, Junlin, et al.
Published: (2025)

On the Cauchy problem for the multi-dimensional compressible Navier-Stokes-Korteweg system: Global strong solutions with arbitrarily large initial data
by: Huang, Xiangdi, et al.
Published: (2026)

Autonomous Code Evolution Meets NP-Completeness
by: Yu, Cunxi, et al.
Published: (2025)

Thin Tree Verification is coNP-Complete
by: Moayyedi, Alice
Published: (2025)