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

Springer eBooks

Quantum-like Paradigm

Andrei Yu. Khrennikov

Published Jan 1, 2009• 1 citation
Publisher
DOI
10.1007/978-3-642-05101-2_1

Related papers

Replacing the Quantum Paradigm.

William M. Honig

Physics Essays•Jun 1, 1988•0 citations

A Philosophical Perspective on the New Quantum Computing Paradigm

Zhou Chang-l

Centering on the issue beyond classical computing ability, this paper presents a comprehensive philosophical perspective on the new quantum computing paradigm. It gives a systematic introduction to the new algorithm with natural mechanisms, and conducts comparison with the quantum computing paradigm and all the existing computational paradigms. A finding concludes the paper that by now only the quantum computing paradigm has truly gone beyond the limits of classical computing and it has profound scientific and philosophical significance.

Ziran bianzhengfa tongxun•Jan 1, 2003•0 citations

An Inherently Quantum Computation Paradigm: NP-complete=P Under the Hypothetical Notion of Continuous Uncomplete von Neumann Measurement

Giuseppe Castagnoli

The topical quantum computation paradigm is a transposition of the Turing machine into the quantum framework. Implementations based on this paradigm have limitations as to the number of: qubits, computation steps, efficient quantum algorithms (found so far). A new exclusively quantum paradigm (with no classical counterpart) is propounded, based on the speculative notion of continuous uncomplete von Neumann measurement. Under such a notion, NP-complete is equal to P. This can provide a mathematical framework for the search of implementable paradigms, possibly exploiting particle statistics.

arXiv:quant-ph/9810017•Oct 6, 1998•0 citations

The Quantum-Like Revolution

Arkady Plotnitsky, Emmanuel Haven

Springer eBooks•Jan 1, 2023•22 citations

Based on Quantum Geometry Computation Paradigm

Jincheng Zhang

Quantum Geometry Computation Paradigm (QGP) is a novel computational paradigm predicated on the principles of quantum geometry, offering a fundamentally different approach to tackling complex problems. This paper explores the potential of QGP, detailing its core mechanism, emphasizing its advantages over traditional methods, and outlining a preliminary implementation for a specific instance. We present a structured framework for utilizing geometric transformations and entanglement to achieve enhanced computational efficiency and robustness. The paper will then detail a preliminary model for solving a specific problem, demonstrating the potential of QGP for tackling complex computations. This work will also discuss the challenges and future directions of this research.

•Aug 31, 2026•0 citations

Quantum perspective

Amanda Gefter

The New Scientist•Feb 1, 2022•2 citations
Centering on the issue beyond classical computing ability, this paper presents a comprehensive philosophical perspective on the new quantum computing paradigm. It gives a systematic introduction to the new algorithm with natural mechanisms, and conducts comparison with the quantum computing paradigm and all the existing computational paradigms. A finding concludes the paper that by now only the quantum computing paradigm has truly gone beyond the limits of classical computing and it has profound scientific and philosophical significance.
The topical quantum computation paradigm is a transposition of the Turing machine into the quantum framework. Implementations based on this paradigm have limitations as to the number of: qubits, computation steps, efficient quantum algorithms (found so far). A new exclusively quantum paradigm (with no classical counterpart) is propounded, based on the speculative notion of continuous uncomplete von Neumann measurement. Under such a notion, NP-complete is equal to P. This can provide a mathematical framework for the search of implementable paradigms, possibly exploiting particle statistics.
Quantum Geometry Computation Paradigm (QGP) is a novel computational paradigm predicated on the principles of quantum geometry, offering a fundamentally different approach to tackling complex problems. This paper explores the potential of QGP, detailing its core mechanism, emphasizing its advantages over traditional methods, and outlining a preliminary implementation for a specific instance. We present a structured framework for utilizing geometric transformations and entanglement to achieve enhanced computational efficiency and robustness. The paper will then detail a preliminary model for solving a specific problem, demonstrating the potential of QGP for tackling complex computations. This work will also discuss the challenges and future directions of this research.