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

arXiv:quant-ph/9806086

Exploiting Particle Statistics in Quantum Computation

Giuseppe Castagnoli, Dalida Monti

Published Jun 25, 1998• 0 citations
arXivHTMLPDF

Abstract

We describe a plausible-speculative form of quantum computation which exploits particle (fermionic, bosonic) statistics, under a generalized, counterfactual interpretation thereof. In the idealized situation of an isolated system, it seems that this form of computation yields to NP-complete=P.
DOI
10.48550/arxiv.quant-ph/9806086

Related papers

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

New Method to Simulate Quantum Interference Using Deterministic Processes and Application to Event-based Simulation of Quantum Computation (Statistical Physics of Quantum Systems--novel orders and dynamics)

Hans A. De Raedt, Koen De Raedt, Kristel F. L. Michielsen

Journal of the Physical Society of Japan•Jan 1, 2005•0 citations

A diakoptic approach to quantum computation

Giuseppe Castagnoli, Dalida Monti

In the diakoptic approach, mechanisms are divided into simpler parts interconnected in some standard way (say by a "mechanical connection''). We explore the possibility of applying this approach to quantum mechanisms: the specialties of the quantum domain seem to yield a richer result. First parts are made independent of each other by assuming that connections are removed. The overall state would thus become a superposition of tensor products of the eigenstates of the independent parts. Connections are restored by projecting off all the tensor products which violate them. This would be performed by particle statistics, under a special interpretation thereof. The NP-complete problem of testing the satisfiability of a Boolean network is approached in this way. The diakoptic approach appears to be able of taming the quantum whole without clipping its richness.

arXiv:quant-ph/9712053•Dec 23, 1997•0 citations

Simulating strongly interacting fermionic systems in a quantum computer

Alexandre Choquette, Panagiotis Kl. Barkoutsos, Agustín Di Paolo +4 more

Bulletin of the American Physical Society•Mar 5, 2019•0 citations

Probabilistic Logics in Quantum Computation

Héctor Freytes, Antonio Ledda, Giuseppe Sergioli +1 more

Springer eBooks•Jan 1, 2013•4 citations

Quantum Nondeterministic Computation based on Statistics Superselection Rules

Giuseppe Castagnoli

Quantum states which obey certain symmetry superselection rules under identical particles permutation can be interpreted as computational states satisfying corresponding Boolean predicates. Given the NP-complete problem of testing the satisfiability of a generic Boolean predicate P, we investigate the possibility of achieving quantum nondeterministic computation by deriving, from P, a physical situation in which the computational states satisfy Piff they satisfy a special fermion statistics.

International Journal of Modern Physics B•Apr 20, 1997•1 citation
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.
In the diakoptic approach, mechanisms are divided into simpler parts interconnected in some standard way (say by a "mechanical connection''). We explore the possibility of applying this approach to quantum mechanisms: the specialties of the quantum domain seem to yield a richer result. First parts are made independent of each other by assuming that connections are removed. The overall state would thus become a superposition of tensor products of the eigenstates of the independent parts. Connections are restored by projecting off all the tensor products which violate them. This would be performed by particle statistics, under a special interpretation thereof. The NP-complete problem of testing the satisfiability of a Boolean network is approached in this way. The diakoptic approach appears to be able of taming the quantum whole without clipping its richness.