On Computational Power of Quantum Branching Programs-Reference-Cited by-同舟云学术

On Computational Power of Quantum Branching Programs

Published:2001 Issue: Volume: Page:59-70
ISSN:0302-9743
Container-title:Fundamentals of Computation Theory
language:
Short-container-title:

Author:

Ablayev Farid,Gainutdinova Aida,Karpinski Marek

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-44669-9_8

Reference10 articles.

1. Lect Notes Comput Sci;F. Ablayev,1998

2. F. Ablayev and M. Karpinski, A Lower Bound for Integer Multiplication on Randomized Read-Once Branching Programs, ECCC TR98-011 (1998), available at http://www.eccc.uni-trier.de/eccc/ .

3. P. Alexandrov, Introduction to set theory and general topology, Berlin, 1984.

4. A. Ambainis and R. Freivalds, 1-way quantum finite automata: strengths, weaknesses and generalization, In Proceeding of the 39th IEEE Conference on Foundation of Computer Science, 1998, 332–342. See also quant-ph/9802062 v3.

5. D. Barrington, Bounded-width Polynomial-Size Branching Programs Recognize Exactly Those Languages in NC 1, Journal of Comp. and System Sci. 38, (1989), 150–164.

Cited by 17 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Deterministic Construction of QFAs Based on the Quantum Fingerprinting Technique;Lobachevskii Journal of Mathematics;2023-02

2. Exponential separation between quantum and classical ordered binary decision diagrams, reordering method and hierarchies;Natural Computing;2022-07-26

3. Quantum Hashing and Fingerprinting for Quantum Cryptography and Computations;Computer Science – Theory and Applications;2020

4. On Quantum Fingerprinting and Quantum Cryptographic Hashing;Advanced Technologies of Quantum Key Distribution;2018-05-30

5. Classical and Quantum Computations with Restricted Memory;Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications;2018