On Computational Power of Quantum Branching Programs
Authors:
- 2 August 2001
- book chapter
- Published by Springer Nature
- p. 59-70
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- 1-way quantum finite automata: strengths, weaknesses and generalizations2002
- On the power of quantum finite state automata2002
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum ComputerSIAM Journal on Computing, 1997
- Bounded-width polynomial-size branching programs recognize exactly those languages in NC1Journal of Computer and System Sciences, 1989
- Simulating physics with computersInternational Journal of Theoretical Physics, 1982