On Computational Power of Quantum Branching Programs

Physics – Quantum Physics

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Scientific paper

In this paper we study a model of a Quantum Branching Program (QBP) and
investigate its computational power. We prove a general lower bound on the
width of read-once QBPs, which we show to be almost tight on certain symmetric
function.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

On Computational Power of Quantum 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 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 Branching Programs will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-350468

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.