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/0407057 · International Journal of Quantum Information

BASIC LOGIC AND QUANTUM COMPUTING: LOGICAL JUDGEMENTS BY AN INSIDER OBSERVER

Giulia Battilotti

Published Dec 17, 2004• 8 citations
arXivHTMLPDF

Abstract

We consider the logical assertions of a hypothetical observer who is inside a quantum computer and performs a reversible quantum measurement, obtaining a symmetric couple of new axioms, valid only inside the quantum computer. The result is that, in this logical framework, symmetry and paraconsistency hold.
DOI
10.1142/s0219749905000591

Related papers

Logical Interpretation of a Reversible Measurement in Quantum Computing

Giulia Battilotti, Paola Zizzi

We give the logical description of a new kind of quantum measurement that is a reversible operation performed by an hypothetical insider observer, or, which is the same, a quantum measurement made in a quantum space background, like the fuzzy sphere. The result is that the non-contradiction and the excluded middle principles are both invalidated, leading to a paraconsistent, symmetric logic. Our conjecture is that, in this setting, one can develop the adequate logic of quantum computing. The role of standard quantum logic is then confined to describe the projective measurement scheme.

arXiv:quant-ph/0408068•Aug 11, 2004•12 citations

Logical Quantum Computing: A Proof of Validity through Non-Symmetric Properties

Jincheng Zhang

This paper explores the potential of logical quantum computing to provide a novel framework for proving mathematical theorems. Leveraging the inherent non-symmetry of quantum computation, we aim to develop a method for rigorously validating mathematical constructs and potentially uncovering new quantum algorithms. The core mechanism involves simulating and analyzing mathematical theorems using quantum systems, identifying subtle patterns and inconsistencies that reveal vulnerabilities. This research will focus on establishing a rigorous, albeit preliminary, proof of the validity of a specific theorem, demonstrating the potential for a paradigm shift in mathematical verification. The paper concludes with a discussion of the challenges and future directions of this approach.

•Sep 7, 2026•0 citations

QUBITS AND QUANTUM SPACES

Paola Zizzi

We consider the quantum computational process as viewed by an insider observer: this is equivalent to an isomorphism between the quantum computer and a quantum space, namely the fuzzy sphere. The result is the formulation of a reversible quantum measurement scheme, with no hidden information.

arXiv:quant-ph/0406154•International Journal of Quantum Information•Dec 16, 2004•26 citations

Quantum Entanglement Logic Computation: A Breakdown

Jincheng Zhang

Quantum entanglement, a cornerstone of quantum mechanics, offers a radically different approach to computation compared to classical methods. This paper investigates the potential of leveraging entanglement's inherent non-symmetry to revolutionize logic computation. We propose a novel quantum computation framework centered around a modified quantum model that exploits the superposition and entanglement of quantum states for parallel processing and enhanced efficiency. The core claim is that the design of this framework, specifically through the utilization of entanglement's non-symmetric properties, will lead to a fundamentally new method of logic computation exceeding the capabilities of traditional approaches. This research explores the design and potential applications of this framework, highlighting its potential to overcome limitations inherent in current quantum algorithms.

•Sep 7, 2026•0 citations

Symmetric Paraconsistent Quantum Logic

Norihiro Kamide

In this study, a new logic called symmetric paracon-sistent quantum logic (SPQL) is introduced as a dual monose-quent system, which is a restricted and indexed sequent calculus. The logic SPQL is regarded as an extension and generalization of Dalla Chiara and Giuntini's paraconsistent quantum logic (PQL). Theorems for syntactically and semantically embedding SPQL into PQL and vice versa are proved. Additionally, cut-elimination, symmetry-elimination, contraposition-elimination, and algebraic-completeness theorems are proved for SPOL.

IEEE International Symposium on Multiple-Valued Logic (ISMVL)•May 1, 2021•2 citations

The internal logic of Bell's states

Giulia Battilotti, Paola Zizzi

We investigate the internal logic of a quantum computer with two qubits, in the two particular cases of non-entanglement (separable states) and maximal entanglement (Bell's states). To this aim, we consider an internal (reversible) measurement which preserves the probabilities by mirroring the states. We then obtain logical judgements for both cases of separable and Bell's states.

arXiv:quant-ph/0412199•Dec 26, 2004•6 citations
We give the logical description of a new kind of quantum measurement that is a reversible operation performed by an hypothetical insider observer, or, which is the same, a quantum measurement made in a quantum space background, like the fuzzy sphere. The result is that the non-contradiction and the excluded middle principles are both invalidated, leading to a paraconsistent, symmetric logic. Our conjecture is that, in this setting, one can develop the adequate logic of quantum computing. The role of standard quantum logic is then confined to describe the projective measurement scheme.
This paper explores the potential of logical quantum computing to provide a novel framework for proving mathematical theorems. Leveraging the inherent non-symmetry of quantum computation, we aim to develop a method for rigorously validating mathematical constructs and potentially uncovering new quantum algorithms. The core mechanism involves simulating and analyzing mathematical theorems using quantum systems, identifying subtle patterns and inconsistencies that reveal vulnerabilities. This research will focus on establishing a rigorous, albeit preliminary, proof of the validity of a specific theorem, demonstrating the potential for a paradigm shift in mathematical verification. The paper concludes with a discussion of the challenges and future directions of this approach.
Quantum entanglement, a cornerstone of quantum mechanics, offers a radically different approach to computation compared to classical methods. This paper investigates the potential of leveraging entanglement's inherent non-symmetry to revolutionize logic computation. We propose a novel quantum computation framework centered around a modified quantum model that exploits the superposition and entanglement of quantum states for parallel processing and enhanced efficiency. The core claim is that the design of this framework, specifically through the utilization of entanglement's non-symmetric properties, will lead to a fundamentally new method of logic computation exceeding the capabilities of traditional approaches. This research explores the design and potential applications of this framework, highlighting its potential to overcome limitations inherent in current quantum algorithms.
In this study, a new logic called symmetric paracon-sistent quantum logic (SPQL) is introduced as a dual monose-quent system, which is a restricted and indexed sequent calculus. The logic SPQL is regarded as an extension and generalization of Dalla Chiara and Giuntini's paraconsistent quantum logic (PQL). Theorems for syntactically and semantically embedding SPQL into PQL and vice versa are proved. Additionally, cut-elimination, symmetry-elimination, contraposition-elimination, and algebraic-completeness theorems are proved for SPOL.