J. Savage, "Computational work and time on finite functions," Journal of ACM 19 (1972), 660-674.  Home/Search   Document Not in Database   Summary   Related Articles

....Boolean circuit K of size poly(n; t) that (n; t) simulates Q. Corollary If L 2 P , then CQ (L n ) O(n k ) for some fixed k. L n is the set of strings in L of length n. This is the quantum analog of the simulation of deterministic Turing machines by classical Boolean circuits (see Savage [Sa72], Schnorr [Schn76] Pippenger and Fischer [PF79] The proof for the quantum version involves subtler arguments. A sketch of the main steps in the proof is given in Section 6. 4 A Universal Quantum Turing Machine As noted in [BV93] the simulation of quantum machines is a nontrivial problem, and ....

J. Savage, "Computational work and time on finite functions," Journal of ACM 19 (1972), 660-674.

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