The following pages link to Quantum Complexity Theory (Q4376183):
Displaying 11 items.
- Automata theory based on quantum logic: Some characterizations (Q598192) (← links)
- Unbounded-error quantum query complexity (Q638526) (← links)
- Some algebraic properties of measure-once two-way quantum finite automata (Q1007122) (← links)
- A probabilistic model of computing with words (Q1776375) (← links)
- One complexity theorist's view of quantum computing (Q1870556) (← links)
- Verification of quantum computation: an overview of existing approaches (Q2311888) (← links)
- On exact quantum query complexity (Q2350895) (← links)
- Automata theory based on quantum logic: reversibilities and pushdown automata (Q2455592) (← links)
- Determination of equivalence between quantum sequential machines (Q2503273) (← links)
- Determining the equivalence for one-way quantum finite automata (Q2518375) (← links)
- Quantum simulation from the bottom up: the case of rebits (Q4565125) (← links)
