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

International journal of unconventional computing

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, Martine C. Ceberio, Владик Крейнович

Published Jan 1, 2020• 0 citations
OpenAlex

Related papers

If Space-Time Is Discrete, We May Be Able to Solve NP-Hard Problems in Polynomial Time

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

Traditional physics assumes that space and time are continuous. However, this reasonable model leads to some serious problems. One the approaches that physicists follow to solve these problems is to assume that the space-time is actually discrete. In this paper, we analyze possible computational consequences of this discreteness. It turns out that in a discrete space-time, we may be able to solve NP-hard problems in polynomial time.

•Jan 1, 2019•0 citations

Solving NP-Complete Problems with a Quantum Computer

Colin P. Williams

Texts in computer science•Dec 6, 2010•3 citations

Is space-time discrete or continuous? ? An empirical question

Peter Forrest

Synthese•Jun 1, 1995•47 citations

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

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

Studies in big data•Oct 13, 2017•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.

Advanced Photonics•Sep 24, 2024•11 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.