On Quantum Computation with Some Restricted Amplitudes
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
Quantum zero-error algorithms cannot be composed
Information Processing Letters
Polynomial time quantum computation with advice
Information Processing Letters
Quantum and classical complexity classes: separations, collapses, and closure properties
Information and Computation
Theory of one-tape linear-time Turing machines
Theoretical Computer Science
Quantum and classical complexity classes: Separations, collapses, and closure properties
Information and Computation
Counting, fanout and the complexity of quantum ACC
Quantum Information & Computation
Languages recognized by nondeterministic quantum finite automata
Quantum Information & Computation
Quantum weakly nondeterministic communication complexity
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
Bounds on the power of constant-depth quantum circuits
FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
A dichotomy theorem for the approximate counting of complex-weighted bounded-degree Boolean CSPs
Theoretical Computer Science
Approximate counting for complex-weighted Boolean constraint satisfaction problems
Information and Computation
Quantum weakly nondeterministic communication complexity
Theoretical Computer Science
Proving the Power of Postselection
Fundamenta Informaticae - MFCS & CSL 2010 Satellite Workshops: Selected Papers
Hi-index | 0.89 |