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

Pure and applied physics

Possibility of Quantum Entanglement

Andrew Cruz

Published Jan 1, 2021• 0 citations
OpenAlex

Related papers

Possibility of Quantum Entanglement and EPR Paradox

Aayush Verma

•Mar 1, 2020•0 citations

Quantum Entanglement

WORLD SCIENTIFIC eBooks•Sep 16, 2025•0 citations

Relativistic, Causal Description of Quantum Entanglement

John W. Moffat

A possible causal solution to the problem of providing a spacetime description of the transmission of signals in quantum entangled states is described using a `bimetric' spacetime structure, in which the quantum entanglement measurements alter the structure of spacetime. Possible experimental tests to verify the suggested spacetime interpretation of quantum entangled states are proposed.

arXiv:quant-ph/0204151•Apr 25, 2002•7 citations

Entanglement of Area Quantums in Quantized Space

Shao Dan, Shao Liang, Shao Changgui +1 more

Employing the area quantum 1/2 excited by the Wilson loop, a possible origin of qubit is argued. At the same time, the existences of possible entanglement of area quantums, and non-local property of the entangled states are demonstrated in quantized space.

Chinese Physics Letters•Jan 1, 2008•0 citations

Quantum Entanglement

Nicolas Gisin

Springer eBooks•Jan 1, 2014•0 citations

Basic logic and quantum entanglement

P A Zizzi

As it is well known, quantum entanglement is one of the most important features of quantum computing, as it leads to massive quantum parallelism, hence to exponential computational speed-up. In a sense, quantum entanglement is considered as an implicit property of quantum computation itself. But... can it be made explicit? In other words, is it possible to find the connective "entanglement" in a logical sequent calculus for the machine language? And also, is it possible to "teach" the quantum computer to "mimic" the EPR "paradox"? The answer is in the affirmative, if the logical sequent calculus is that of the weakest possible logic, namely Basic logic. - A weak logic has few structural rules. But in logic, a weak structure leaves more room for connectives (for example the connective "entanglement"). Furthermore, the absence in Basic logic of the two structural rules of contraction and weakening corresponds to the validity of the no-cloning and no-erase theorems, respectively, in quantum computing.

arXiv:quant-ph/0611119•Journal of Physics Conference Series•May 1, 2007•7 citations
As it is well known, quantum entanglement is one of the most important features of quantum computing, as it leads to massive quantum parallelism, hence to exponential computational speed-up. In a sense, quantum entanglement is considered as an implicit property of quantum computation itself. But... can it be made explicit? In other words, is it possible to find the connective "entanglement" in a logical sequent calculus for the machine language? And also, is it possible to "teach" the quantum computer to "mimic" the EPR "paradox"? The answer is in the affirmative, if the logical sequent calculus is that of the weakest possible logic, namely Basic logic. - A weak logic has few structural rules. But in logic, a weak structure leaves more room for connectives (for example the connective "entanglement"). Furthermore, the absence in Basic logic of the two structural rules of contraction and weakening corresponds to the validity of the no-cloning and no-erase theorems, respectively, in quantum computing.