Exact results for accepting probabilities of quantum automata
Theoretical Computer Science - Mathematical 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 the complexity of simulating space-bounded quantum computations
Computational Complexity
Quantum branching programs and space-bounded nonuniform quantum complexity
Theoretical Computer Science
Exponential separation of quantum and classical online space complexity
Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures
Languages Recognized with Unbounded Error by Quantum Finite Automata
CSR '09 Proceedings of the Fourth International Computer Science Symposium in Russia on Computer Science - Theory and Applications
Unbounded-error quantum computation with small space bounds
Information and Computation
Languages recognized by nondeterministic quantum finite automata
Quantum Information & Computation
ROM-based computation: quantum versus classical
Quantum Information & Computation
Advice coins for classical and quantum computation
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
Inverting well conditioned matrices in quantum logspace
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Proving the Power of Postselection
Fundamenta Informaticae - MFCS & CSL 2010 Satellite Workshops: Selected Papers
Hi-index | 0.00 |