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

Studies in big data

Boolean Algebra and Its Applications

Weng-Long Chang, Athanasios V. Vasilakos

Published Dec 21, 2020• 24 citations
Publisher
DOI
10.1007/978-3-030-63583-1_2

Related papers

Faux-boolean algebras and classical models

W. Michael Dickson

Foundations of Physics Letters•Oct 1, 1995•28 citations

Faux-boolean algebras, classical probability, and determinism

W. Michael Dickson

Foundations of Physics Letters•Jun 1, 1995•26 citations

Boolean algebras in the study of Bell inequalities

José Manuel Méndez Martínez

•Aug 21, 2012•0 citations

Boolean Algebras on a Classical Phase Space

Veeravalli S. Varadarajan

Springer eBooks•Jan 1, 1968•18 citations

Boolean Algebras on a Classical Phase Space

Veeravalli S. Varadarajan

Springer eBooks•Jan 1, 1968•0 citations

Quantum-Enhanced Boolean Algebra - Verification by Quantum Simulation

Jincheng Zhang

Quantum-enhanced Boolean Algebra (QBA) represents a novel approach to logical statement verification, utilizing quantum simulation to dramatically accelerate the process compared to classical methods. This paper explores the design of a QBA, detailing the underlying quantum algorithms and their potential to offer a significant speedup in verification. We present a comprehensive overview of the core mechanism, highlighting the advantages of quantum computation over traditional approaches. The research focuses on establishing a robust and scalable framework for QBA verification, demonstrating its potential to revolutionize the field of logical verification. The paper concludes with a discussion of future research directions and potential applications.

•Sep 1, 2026•0 citations
Quantum-enhanced Boolean Algebra (QBA) represents a novel approach to logical statement verification, utilizing quantum simulation to dramatically accelerate the process compared to classical methods. This paper explores the design of a QBA, detailing the underlying quantum algorithms and their potential to offer a significant speedup in verification. We present a comprehensive overview of the core mechanism, highlighting the advantages of quantum computation over traditional approaches. The research focuses on establishing a robust and scalable framework for QBA verification, demonstrating its potential to revolutionize the field of logical verification. The paper concludes with a discussion of future research directions and potential applications.