Expressiveness and Computational Complexity of Geometric Quantum Logic
Christian HerrmannMartin ZieglerPublished in: CoRR (2010)
Keyphrases
- computational complexity
- quantum computation
- logic circuits
- computational properties
- special case
- expressive power
- logic synthesis
- logic programming
- np complete
- decision problems
- computational cost
- geometric constraints
- np hard
- high computational complexity
- geometric information
- geometric structure
- quantum computing
- predicate logic
- storage requirements
- computationally efficient
- neural network
- digital circuits
- modal logic
- quantum mechanics
- asynchronous circuits
- low complexity
- computational efficiency
- quantum inspired
- motion estimation
- sound and complete axiomatization