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

Studies in big data

QFT + NP = P Quantum Field Theory (QFT): A Possible Way of Solving NP-Complete Problems in Polynomial Time

Владик Крейнович, Luc Longpré, Adriana Espino Beltrán

Published Oct 13, 2017• 0 citations
Publisher
DOI
10.1007/978-3-319-63639-9_10

Related papers

If Space-Time Is Discrete, It Could Be Possible to Solve NP-Complete Problems in Polynomial Time.

Ricardo O. de Alba Alvarez, Nick Sims, Christian Servín +2 more

International journal of unconventional computing•Jan 1, 2020•0 citations

Quantum Phase Transitions and Typical Case, Polynomial Time Solution of Randomly Generated NP-Complete Problems via Adiabatic Quantum Computation

William M. Kaminsky, Seth Lloyd

Bulletin of the American Physical Society•Mar 16, 2006•0 citations

A recursive definition of quantum polynomial time computability (extended abstract).

Tomoyuki Yamakami

NCMA•Jan 1, 2017•1 citation

Is quantum field theory a theory

Gerard ’t Hooft

•Jan 1, 1983•0 citations

Reconfigurable integrated photonic processor for NP-complete problems

Xiao-Yun Xu, Tian-Yu Zhang, Ziwei Wang +2 more

Nondeterministic-polynomial-time (NP)-complete problems are widely involved in various real-life scenarios but are still intractable in being solved efficiently on conventional computers. It is of great practical significance to construct versatile computing architectures that solve NP-complete problems with computational advantage. Here, we present a reconfigurable integrated photonic processor to efficiently solve a benchmark NP-complete problem, the subset sum problem. We show that in the case of successive primes, the photonic processor has genuinely surpassed electronic processors launched recently by taking advantage of the high propagation speed and vast parallelism of photons and state-of-the-art integrated photonic technology. Moreover, we are able to program the photonic processor to tackle different problem instances, relying on the tunable integrated modules, variable split junctions, which can be used to build a fully reconfigurable architecture potentially allowing 2N configurations at most. Our experiments confirm the potential of the photonic processor as a versatile and efficient computing platform, suggesting a possible practical route to solving computationally hard problems at a large scale.

arXiv:2308.14156•Advanced Photonics•Sep 24, 2024•14 citations

A New Efficient Quantum Algorithm for Solving NP-complete Problems

Dhananjay P. Mehendale

•Jan 1, 2026•0 citations
Nondeterministic-polynomial-time (NP)-complete problems are widely involved in various real-life scenarios but are still intractable in being solved efficiently on conventional computers. It is of great practical significance to construct versatile computing architectures that solve NP-complete problems with computational advantage. Here, we present a reconfigurable integrated photonic processor to efficiently solve a benchmark NP-complete problem, the subset sum problem. We show that in the case of successive primes, the photonic processor has genuinely surpassed electronic processors launched recently by taking advantage of the high propagation speed and vast parallelism of photons and state-of-the-art integrated photonic technology. Moreover, we are able to program the photonic processor to tackle different problem instances, relying on the tunable integrated modules, variable split junctions, which can be used to build a fully reconfigurable architecture potentially allowing 2N configurations at most. Our experiments confirm the potential of the photonic processor as a versatile and efficient computing platform, suggesting a possible practical route to solving computationally hard problems at a large scale.