Advertisement

Quantum and Stochastic Branching Programs of Bounded Width

Track A
  • Farid Ablayev
  • Cristopher Moore
  • Christopher Pollett
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2380)

Abstract

We prove upper and lower bounds on the power of quantum and stochastic branching programs of bounded width. We show any NC1 language can be accepted exactly by a width-2 quantum branching program of polynomial length, in contrast to the classical case where width 5 is necessary unless NC1 = ACC. This separates width-2 quantum programs from width-2 doubly stochastic programs as we show the latter cannot compute the middle bit of multiplication. Finally, we show that bounded-width quantum and stochastic programs can be simulated by classical programs of larger but bounded width, and thus are in NC1.

Keywords

Boolean Function Sink Node Stochastic Program Binary Decision Diagram Stochastic Matrice 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    F. Ablayev, A. Gainutdinova, and M. Karpinski. On computational Power of quantum branching programs. Proc. FCT 2001, Lecture Notes in Computer Science 2138: 59–70, 2001.Google Scholar
  2. 2.
    F. Ablayev and M. Karpinski. A lower bound for integer multiplication on randomized read-once branching programs. Electronic Colloquium on Computational Complexity TR 98-011, 1998. http://www.eccc.uni-trier.de/eccc
  3. 3.
    P. Alexandrov. Introduction to set theory and general topology. Berlin, 1984.Google Scholar
  4. 4.
    A. Ambainis and R. Freivalds. 1-way quantum finite automata: strengths, weakness, and generalizations. Proc. 39th IEEE Symp. on Foundations of Computer Science (FOCS), 332–342, 1998.Google Scholar
  5. 5.
    A. Ambainis, L. Schulman, and U. Vazirani. Computing with Highly Mixed States. Proc. 32nd Annual ACM Symp. on Theory of Computing (STOC), 697–704, 2000.Google Scholar
  6. 6.
    D.A. Barrington. Bounded-width polynomial branching programs recognize exactly those languages in NC1. Journal of Computer and System Sciences 38(1): 150–164, 1989.zbMATHCrossRefMathSciNetGoogle Scholar
  7. 7.
    D.A. Barrington and D. Therien. Finite Monoids and the Fine Structure of NC1 Journal of the ACM 35(4): 941–952, 1988.CrossRefMathSciNetGoogle Scholar
  8. 8.
    A. Kondacs and J. Watrous On the power of quantum finite automata. Proc. of the 38th IEEE Symp. on Foundations of Computer Science (FOCS), 66–75, 1997.Google Scholar
  9. 9.
    C. Moore and J.P. Crutchfield. Quantum automata and quantum grammars. Theoretical Computer Science 237: 275–306, 2000.zbMATHCrossRefMathSciNetGoogle Scholar
  10. 10.
    C. Moore, D. Thérien, F. Lemieux, J. Berman, and A. Drisko. Circuits and Expressions with Non-Associative Gates. Journal of Computer and System Sciences 60: 368–394, 2000.zbMATHCrossRefMathSciNetGoogle Scholar
  11. 11.
    M. Nakanishi, K. Hamaguchi, and T. Kashiwabara. Ordered quantum branching programs are more powerful than ordered probabilistic branching programs under a bounded-width restriction. Proc. 6th Annual International Conference on Computing and Combinatorics (COCOON) Lecture Notes in Computer Science 1858: 467–476, 2000.Google Scholar
  12. 12.
    M.A. Nielson and I.L. Chuang. Quantum Computation and Quantum Information. Cambridge University Press. 2000.Google Scholar
  13. 13.
    M. Rabin. Probabilistic automata. Information and Control 6: 230–245, 1963.CrossRefGoogle Scholar
  14. 14.
    P. Shor. Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM Journal on Computing 26(5): 1484–1509, 1997.zbMATHCrossRefMathSciNetGoogle Scholar
  15. 15.
    Ingo Wegener. Branching Programs and Binary Decision Diagrams. SIAM Monographs on Discrete Mathematics and Applications. 2000.Google Scholar
  16. 16.
    A.C. Yao. Lower Bounds by Probabilistic Arguments Proc. of the 24th IEEE Symp. on Foundations of Computer Science (FOCS), 420–428, 1983.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2002

Authors and Affiliations

  • Farid Ablayev
    • 1
  • Cristopher Moore
    • 2
  • Christopher Pollett
    • 3
  1. 1.Dept. of Theoretical CyberneticsKazan State UniversityKazanRussia
  2. 2.Computer Science DepartmentUniversity of New MexicoAlbuquerque
  3. 3.Dept. of Math and Computer ScienceSan Jose State UniversitySan Jose

Personalised recommendations