Algorithms for Quantum Branching Programs Based on Fingerprinting

@article{Ablayev2013AlgorithmsFQ,
  title={Algorithms for Quantum Branching Programs Based on Fingerprinting},
  author={Farid M. Ablayev and Alexander Vasiliev},
  journal={Int. J. Software and Informatics},
  year={2013},
  volume={7},
  pages={485-500}
}
In the paper we develop a method for constructing quantum alg orithms for computing Boolean functions by quantum ordered read-once branching programs (qua ntum OBDDs). Our method is based on fingerprinting technique and representation of Boolean f unctions by their characteristic polynomials. We use circuit notation for branching programs for desi red algorithms presentation. For several known functions our approach provides optimal QOBDDs. Name ly we consider such functions as MODm, EQn… CONTINUE READING

From This Paper

Topics from this paper.

References

Publications referenced by this paper.
Showing 1-10 of 14 references

Nahimovs (2008): Improved constructions of quantum automata . arXiv:0805.1686v1 Available athttp://xxx.lanl.gov/archive/quant-ph

  • N. A. Ambainis
  • 2008
Highly Influential
4 Excerpts

On the computational power of probabilistic and quantum branching programs of constant width

  • D. Lee, H. Wozniakowski
  • Information and Computation
  • 2005