A nearly optimal discrete query quantum algorithm for evaluating NAND formulas

Physics – Quantum Physics

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

21 pages, 2 figures

Scientific paper

We present an O(\sqrt{N}) discrete query quantum algorithm for evaluating
balanced binary NAND formulas and an O(N^{{1/2}+O(\frac{1}{\sqrt{\log N}})})
discrete query quantum algorithm for evaluating arbitrary binary NAND formulas.

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

A nearly optimal discrete query quantum algorithm for evaluating NAND formulas 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 A nearly optimal discrete query quantum algorithm for evaluating NAND formulas, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A nearly optimal discrete query quantum algorithm for evaluating NAND formulas will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-676624

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