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

Journal of Philosophical Logic

Quantum Logic as a Fragment of Independence-Friendly Logic

Jaakko Hintikka

Published Jun 1, 2002• 13 citations
Publisher
DOI
10.1023/a:1015742824326

Related papers

Logical independence in quantum logic

Miklós Rédei

Foundations of Physics•Mar 1, 1995•27 citations

Independence in quantum logic approach

Miklós Rédei

Springer eBooks•Jan 1, 1998•0 citations

A user-friendly quantum logic

Peter Gibbins

Cambridge University Press eBooks•Sep 25, 1987•20 citations

Two-Qubit Iterative Evaluation of Naturally Fragmented PAIRS Circuits

Oguike Ahaneku, Oleg Bedrin

A naturally fragmented PAIRS circuit is used as an analytic validation case for gradient-observable evaluation in large logical quantum circuits. The circuit consists of independent two-qubit fragments (0, 1), (2, 3), (4, 5), . . ., so the logical unitary factorizes as a tensor product of two-qubit blocks. In the terminology of the Universal Suppression Law (USL) interpretation of variational trainability collapse, the differentiated quantity is the gradient observable Ai, and the relevant computationalobject is the measured embedded history of Ai. For the PAIRS circuit, this history is exactly contained in a two-qubit natural fragment. A closed-form expression is derived for the two-layer PAIRS observable ⟨Z0⟩ and its gradient. Small-system tests show agreement between ordinary full-register simulation, two-qubit iterative evaluation, and the analytic expression to floating-point precision. A 16384-logical-qubit PAIRS circuit is then evaluated by iterating a two-qubit register over 8192 natural fragments. The large logical calculation agrees tile-by-tile with the analytic formula, with maximum observable and gradient errors 6.661338×10∧−16. The result is not a barren-plateau mitigation experiment and not a quantum-advantage claim. It is a calibration example showing that, in a naturally fragmented circuit, the measured history of Ai rather than the nominal logical Hilbert space determines the exact evaluation.

•Jun 29, 2026•0 citations

Foundations of logic programming in hybrid-dynamic quantum logic

Daniel Găină

The main contribution of the present paper is the introduction of a simple yet expressive hybrid-dynamic logic for describing quantum programs. This version of quantum logic can express quantum measurements and unitary evolutions of states in a natural way based on concepts advanced in (hybrid and dynamic) modal logics. We then study Horn clauses in the hybrid-dynamic quantum logic proposed, and develop a series of results that lead to an initial semantics theorem for sets of clauses that are satisfiable. This shows that a significant fragment of hybrid-dynamic quantum logic has good computational properties, and can serve as a basis for defining executable languages for specifying quantum programs. We set the foundations of logic programming in this fragment by proving a variant of Herbrand's theorem, which reduces the semantic entailment of a logic-programming query by a program to the search of a suitable substitution.

arXiv:2406.02085•Jun 4, 2024•2 citations

Logic and Quantum Logic

Peter Mittelstaedt

Boston studies in the philosophy of science•Jan 1, 1976•0 citations
A naturally fragmented PAIRS circuit is used as an analytic validation case for gradient-observable evaluation in large logical quantum circuits. The circuit consists of independent two-qubit fragments (0, 1), (2, 3), (4, 5), . . ., so the logical unitary factorizes as a tensor product of two-qubit blocks. In the terminology of the Universal Suppression Law (USL) interpretation of variational trainability collapse, the differentiated quantity is the gradient observable Ai, and the relevant computationalobject is the measured embedded history of Ai. For the PAIRS circuit, this history is exactly contained in a two-qubit natural fragment. A closed-form expression is derived for the two-layer PAIRS observable ⟨Z0⟩ and its gradient. Small-system tests show agreement between ordinary full-register simulation, two-qubit iterative evaluation, and the analytic expression to floating-point precision. A 16384-logical-qubit PAIRS circuit is then evaluated by iterating a two-qubit register over 8192 natural fragments. The large logical calculation agrees tile-by-tile with the analytic formula, with maximum observable and gradient errors 6.661338×10∧−16. The result is not a barren-plateau mitigation experiment and not a quantum-advantage claim. It is a calibration example showing that, in a naturally fragmented circuit, the measured history of Ai rather than the nominal logical Hilbert space determines the exact evaluation.
The main contribution of the present paper is the introduction of a simple yet expressive hybrid-dynamic logic for describing quantum programs. This version of quantum logic can express quantum measurements and unitary evolutions of states in a natural way based on concepts advanced in (hybrid and dynamic) modal logics. We then study Horn clauses in the hybrid-dynamic quantum logic proposed, and develop a series of results that lead to an initial semantics theorem for sets of clauses that are satisfiable. This shows that a significant fragment of hybrid-dynamic quantum logic has good computational properties, and can serve as a basis for defining executable languages for specifying quantum programs. We set the foundations of logic programming in this fragment by proving a variant of Herbrand's theorem, which reduces the semantic entailment of a logic-programming query by a program to the search of a suitable substitution.