Algorithms for Quantum Branching Programs Based on Fingerprinting

Details Algorithms for Quantum Branching Programs Based on Fingerprinting Algorithms for Quantum Branching Programs Based on Fingerprinting

2009-11-12

arxiv.org/abs/0911.2317v1

EPTCS 9, 2009, pp. 1-11

Computer Science

Computational Complexity

Scientific paper

10.4204/EPTCS.9.1

In the paper we develop a method for constructing quantum algorithms for computing Boolean functions by quantum ordered read-once branching programs (quantum OBDDs). Our method is based on fingerprinting technique and representation of Boolean functions by their characteristic polynomials. We use circuit notation for branching programs for desired algorithms presentation. For several known functions our approach provides optimal QOBDDs. Namely we consider such functions as Equality, Palindrome, and Permutation Matrix Test. We also propose a generalization of our method and apply it to the Boolean variant of the Hidden Subgroup Problem.

Affiliated with

Also associated with

No associations

Rating

Algorithms for Quantum Branching Programs Based on Fingerprinting does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Algorithms for Quantum Branching Programs Based on Fingerprinting, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Algorithms for Quantum Branching Programs Based on Fingerprinting will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-150241