<F4.08e+05> J.<F4.039e+05> Machta,<F4.112e+05> Phase Information in Quantum Oracle<F4.039e+05> Computing, Physics Department, University of Massachusetts, Amherst, MA, manuscript, 1996. Home/Search Document Not in Database Summary Related Articles |
This paper is cited in the following contexts:
Quantum Complexity Theory - Bernstein, Vazirani (1997) (156 citations) (Correct)
....to perform general unitary transformations suggests a broader definition, which may be useful in other contexts. For example, oracles that perform more general, nonBoolean unitary operations have been considered in computational learning theory [15] and have been used to obtain large separations [32] between quantum and classical relativized complexity classes. See [9] for a discussion of more general definitions of oracle quantum computing. 8.4. Fourier sampling and the power of QTMs. In this section we give evidence that QTMs are more powerful than bounded error probabilistic TMs. We ....
<F4.08e+05> J.<F4.039e+05> Machta,<F4.112e+05> Phase Information in Quantum Oracle<F4.039e+05> Computing, Physics Department, University of Massachusetts, Amherst, MA, manuscript, 1996.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC