J. Watrous: Quantum algorithms for solvable groups. STOC 2001, pp. 60-67 A Zeno e#ect approach to simulating adiabatic Generators Proof. (Of Claim 2) We concentrate on a time interval [s 0 , s 1 ], s 0 < s 1 , where H() is continuous on [s 0 , s 1 ] and di#erentiable on (s 0 , s 1 ). We denote # max = 33 max s#(s 0 ,s 1 ) (s)|| and # min = min s#(s 0 ,s 1 ) #(H(s)). We choose R  Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Adiabatic Quantum State Generation and Statistical Zero.. - Aharonov, Ta-Shma (2003) (5 citations) (Correct)
No context found.
J. Watrous: Quantum algorithms for solvable groups. STOC 2001, pp. 60-67 A Zeno e#ect approach to simulating adiabatic Generators Proof. (Of Claim 2) We concentrate on a time interval [s 0 , s 1 ], s 0 < s 1 , where H() is continuous on [s 0 , s 1 ] and di#erentiable on (s 0 , s 1 ). We denote # max = 33 max s#(s 0 ,s 1 ) (s)|| and # min = min s#(s 0 ,s 1 ) #(H(s)). We choose R
Adiabatic Quantum State Generation and Statistical Zero.. - Aharonov, Ta-Shma (2003) (5 citations) (Correct)
No context found.
J. Watrous: Quantum algorithms for solvable groups. STOC 2001, pp. 60-67 A Zeno e#ect approach to simulating adiabatic Generators Proof. (of Claim 2) We concentrate on a time interval [s 0 , s 1 ], s 0 < s 1 , where H() is continuous on [s 0 , s 1 ] and di#erentiable on (s 0 , s 1 ). We denote # max = max s#(s 0 ,s 1 ) (s)|| 33 and # min = min s#(s 0 ,s 1 ) #(H(s)). We choose R
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