Farid Ablayev, Aida Gainutdinova, Marek Karpinski, Cristopher Moore & Christopher Pollett (2005):
On the computational power of probabilistic and quantum branching programs of constant width.
Information and Computation 203,
pp. 145–162,
doi:10.1016/j.ic.2005.04.003.
Available at http://dx.doi.org/10.1016/j.ic.2005.04.003.
Farid Ablayev & Alexander Vasiliev (2008):
On the Computation of Boolean Functions by Quantum Branching Programs via Fingerprinting.
Electronic Colloquium on Computational Complexity (ECCC) 15(059).
Available at http://www.eccc.uni-trier.de/report/2008/059/.
Farid Ablayev & Alexander Vasiliev (2009):
Algorithms for Quantum Branching Programs Based on Fingerprinting.
EPTCS 9,
pp. 1–11,
doi:10.4204/EPTCS.9.1.
Available at http://arxiv.org/abs/0911.2317.
Vishwani Agrawal, David Lee & Henryk Wozniakowski (1998):
Numerical computation of characteristic polynomials of Boolean functions and its applications.
Numerical Algorithms 17,
pp. 261–278,
doi:10.1023/A:1016632423579.
Andris Ambainis & Rusins Freivalds (1998):
1-way quantum finite automata: strengths, weaknesses and generalizations.
In: Proceeding of the 39th IEEE Conference on Foundation of Computer Science,
FOCS '98.
IEEE Computer Society,
Washington, DC, USA,
pp. 332–342,
doi:10.1109/SFCS.1998.743469.
Available at http://arxiv.org/abs/quant-ph/9802062.
Andris Ambainis & Nikolajs Nahimovs (2008):
Improved Constructions of Quantum Automata.
In: Yasuhito Kawano & Michele Mosca: Theory of Quantum Computation, Communication, and Cryptography,
Lecture Notes in Computer Science 5106.
Springer Berlin / Heidelberg,
pp. 47–56,
doi:10.1007/978-3-540-89304-2_5.
Available at http://arxiv.org/abs/0805.1686.
David Deutsch (1989):
Quantum Computational Networks.
Royal Society of London Proceedings Series A 425,
pp. 73–90,
doi:10.1098/rspa.1989.0099.
Jawahar Jain, Jacob A. Abraham, James Bitner & Donald S. Fussell (1992):
Probabilistic verification of Boolean functions.
Formal Methods in System Design 1,
pp. 61–115,
doi:10.1007/BF00464357.
Sergey A. Moiseev, Sergey N. Andrianov & Firdus F. Gubaidullin (2010):
Solid state multi-ensemble quantum computer in waveguide circuit model.
Technical Report arXiv:1009.5771.
Cornell University Library.
Available at http://arxiv.org/abs/1009.5771.
Cristopher Moore & James P. Crutchfield (2000):
Quantum automata and quantum grammars.
Theoretical Computer Science 237(1-2),
pp. 275–306,
doi:10.1016/S0304-3975(98)00191-1.
Masaki Nakanishi, Kiyoharu Hamaguchi & Toshinobu Kashiwabara (2000):
Ordered Quantum Branching Programs Are More Powerful than Ordered Probabilistic Branching Programs under a Bounded-Width Restriction.
In: Ding-Zhu Du, Peter Eades, Vladimir Estivill-Castro, Xuemin Lin & Arun Sharma: Computing and Combinatorics,
Lecture Notes in Computer Science 1858.
Springer Berlin / Heidelberg,
pp. 467–476,
doi:10.1007/3-540-44968-X_46.
Martin Sauerhoff (2001):
On the size of randomized OBDDs and read-once branching programs for k-stable functions.
Computational Complexity 10,
pp. 155–178,
doi:10.1007/s00037-001-8193-z.
Martin Sauerhoff & Detlef Sieling (2005):
Quantum branching programs and space-bounded nonuniform quantum complexity.
Theoretical Computer Science 334(1-3),
pp. 177–225,
doi:10.1016/j.tcs.2004.12.031.
Available at http://arxiv.org/abs/quant-ph/0403164.
Ingo Wegener (2000):
Branching Programs and Binary Decision Diagrams.
SIAM Monographs on Discrete Mathematics and Applications.
SIAM Press.
Ronald de Wolf (2001):
Quantum Computing and Communication Complexity.
University of Amsterdam.
Andrew Chi-Chih Yao (1993):
Quantum circuit complexity.
In: Proceedings of Thirty-fourth IEEE Symposium on Foundations of Computer Science.
IEEE Computer Society,
Palo Alto, California, USA,
pp. 352–361,
doi:10.1109/SFCS.1993.366852.
eptcs@eptcs.org