| M. H. Freedman, "Poly-locality in quantum computing", quant-ph/0001077; Found. Comput. Math. 2 (2002) 145--154. |
.... states of an atom illustrates, careful attention to the details of the physical implementation of a quantum algorithm is required to correctly quantify its computational complexity [17] Although the evolution of the QLGA can be simulated in the standard poly local model for quantum computing [18], issues of the time required for state preparation and measurement, and the adiabaticity required when turning on the magnetic field, all must be considered before we can claim to understand how this computation scales physically. Acknowledgements I thank A. P. Balachandran for encouraging me ....
M. H. Freedman, "Poly-locality in quantum computing", quant-ph/0001077. 8
.... specified with exponentially increasing precision in n, the size of the problem [18] This should be contrasted with the standard model for quantum computation using poly local transformations implemented by polynomially many bounded size gates on Hilbert spaces with a tensor product decomposition [19]; these require specification of only polynomially many nontrivial amplitudes with constant precision. As Bernstein Vazirani [2] and Shor [22] already emphasized in their original analyses of quantum models for computing, all physical resources must be accounted for to quantify algorithm ....
M. H. Freedman, "Poly-locality in quantum computing", quant-ph/0001077.
No context found.
M. H. Freedman, "Poly-locality in quantum computing", quant-ph/0001077; Found. Comput. Math. 2 (2002) 145--154.
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