On Computational Power of Quantum Read-Once Branching Programs

Details On Computational Power of Quantum Read-Once Branching Programs On Computational Power of Quantum Read-Once Branching Programs

2011-03-14

arxiv.org/abs/1103.2809v1

EPTCS 52, 2011, pp. 1-12

Computer Science

Computational Complexity

In Proceedings HPC 2010, arXiv:1103.2268

Scientific paper

10.4204/EPTCS.52.1

In this paper we review our current results concerning the computational power of quantum read-once branching programs. First of all, based on the circuit presentation of quantum branching programs and our variant of quantum fingerprinting technique, we show that any Boolean function with linear polynomial presentation can be computed by a quantum read-once branching program using a relatively small (usually logarithmic in the size of input) number of qubits. Then we show that the described class of Boolean functions is closed under the polynomial projections.

Affiliated with

Also associated with

No associations

Rating

On Computational Power of Quantum Read-Once Branching Programs 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 On Computational Power of Quantum Read-Once Branching Programs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On Computational Power of Quantum Read-Once Branching Programs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-138305