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

Expressiveness and Computational Complexity of Geometric Quantum Logic

Christian Herrmann, Martin Ziegler

Published Apr 10, 2010• 0 citations
OpenAlex

Related papers

Conceptual aspects of geometric quantum computation

Erik Sjöqvist, Vahid Azimi Mousolou, Carlo M. Canali

arXiv:1311.7470•Quantum Information Processing•Jul 7, 2016•26 citations

How to derive a quantum complexity lower bound

Tetsuro Nishino

Abstract The modeling of computation using logic circuits occupies an important position in the fundamentals of complexity theory including quantum complexity theory. Consequently, research into methods for computing logic functions on quantum circuits as well as for minimizing and simplifying such circuits has become extremely important. In this paper we explicitly formulate the depth minimization problem for quantum logic circuits and show that this problem is closely related to a geometric approach to deriving a lower bound on the size of a quantum logic circuit. © 2007 Wiley Periodicals, Inc. Electron Comm Jpn Pt 3, 90(10): 9–17, 2007; Published online in Wiley InterScience ( www.interscience.wiley.com ). DOI 10.1002/ecjc.20298

Electronics and Communications in Japan (Part III Fundamental Electronic Science)•Apr 23, 2007•0 citations

Evidence for the robustness of geometric quantum computation

Shi-Liang Zhu, Paolo Zanardi

Bulletin of the American Physical Society•Mar 24, 2005•0 citations

The Axioms of Quantum Field Theory, Quantum Variational Calculus, Quantum Logic Theory, Quantum Computability, Quantum Computational Complexity and Quantum Geometric Algebra

Daniel Cordero Grau

•Jul 1, 2016•0 citations

Visualizing Quantum Circuit Probability: Estimating Quantum State Complexity for Quantum Program Synthesis

Bao Gia Bach, Akash Kundu, Tamal Acharya +1 more

This work applies concepts from algorithmic probability to Boolean and quantum combinatorial logic circuits. The relations among the statistical, algorithmic, computational, and circuit complexities of states are reviewed. Thereafter, the probability of states in the circuit model of computation is defined. Classical and quantum gate sets are compared to select some characteristic sets. The reachability and expressibility in a space-time-bounded setting for these gate sets are enumerated and visualized. These results are studied in terms of computational resources, universality, and quantum behavior. The article suggests how applications like geometric quantum machine learning, novel quantum algorithm synthesis, and quantum artificial general intelligence can benefit by studying circuit probabilities.

arXiv:2304.02358•Entropy•May 7, 2023•2 citations

The geometry of generalized quantum logics

Thurlow A. Cook

International Journal of Theoretical Physics•Dec 1, 1978•24 citations
Abstract The modeling of computation using logic circuits occupies an important position in the fundamentals of complexity theory including quantum complexity theory. Consequently, research into methods for computing logic functions on quantum circuits as well as for minimizing and simplifying such circuits has become extremely important. In this paper we explicitly formulate the depth minimization problem for quantum logic circuits and show that this problem is closely related to a geometric approach to deriving a lower bound on the size of a quantum logic circuit. © 2007 Wiley Periodicals, Inc. Electron Comm Jpn Pt 3, 90(10): 9–17, 2007; Published online in Wiley InterScience ( www.interscience.wiley.com ). DOI 10.1002/ecjc.20298
This work applies concepts from algorithmic probability to Boolean and quantum combinatorial logic circuits. The relations among the statistical, algorithmic, computational, and circuit complexities of states are reviewed. Thereafter, the probability of states in the circuit model of computation is defined. Classical and quantum gate sets are compared to select some characteristic sets. The reachability and expressibility in a space-time-bounded setting for these gate sets are enumerated and visualized. These results are studied in terms of computational resources, universality, and quantum behavior. The article suggests how applications like geometric quantum machine learning, novel quantum algorithm synthesis, and quantum artificial general intelligence can benefit by studying circuit probabilities.