Reasoning about Grover's quantum search algorithm using probabilistic wp
ACM Transactions on Programming Languages and Systems (TOPLAS)
Parallelization, amplification, and exponential time simulation of quantum interactive proof systems
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
An introduction to quantum computing for non-physicists
ACM Computing Surveys (CSUR)
Two-way finite automata with quantum and classical states
Theoretical Computer Science - Natural computing
AAECC-13 Proceedings of the 13th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
Polynomial-Time Algorithms for the Equivalence for One-Way Quantum Finite Automata
ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation
Introduction to Recent Quantum Algorithms
MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
PSPACE has constant-round quantum interactive proof systems
Theoretical Computer Science - Algorithms,automata, complexity and games
PSPACE Has Constant-Round Quantum Interactive Proof Systems
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Bounds for Small-Error and Zero-Error Quantum Algorithms
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
On Quantum and Classical Space-Bounded Processes with Algebraic Transition Amplitudes
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
On quantum algorithms for noncommutative hidden subgroups
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
Other complexity classes and measures
Algorithms and theory of computation handbook
| Hi-index | 0.00 |