LEADER 03467nam 2200529 450 001 9910788662603321 005 20220822053552.0 010 $a0-8218-7895-6 010 $a0-8218-2140-7 035 $a(CKB)3240000000069831 035 $a(EBL)3113369 035 $a(SSID)ssj0000629412 035 $a(PQKBManifestationID)11369994 035 $a(PQKBTitleCode)TC0000629412 035 $a(PQKBWorkID)10732673 035 $a(PQKB)10608221 035 $a(MiAaPQ)EBC3113369 035 $a(RPAM)12864343 035 $a(PPN)197106331 035 $a(EXLCZ)993240000000069831 100 $a20020722h20022002 uy| 0 101 0 $aeng 135 $aur|n|---||||| 181 $ctxt 182 $cc 183 $acr 200 10$aQuantum computation and information $eAMS Special Session Quantum Computation and Information, January 19-21, 2000, Washington, D.C. /$fSamuel J. Lomonaco, Jr., Howard E. Brandt, editors 210 1$aProvidence, Rhode Island :$cAmerican Mathematical Society,$d[2002] 210 4$dİ2002 215 $a1 online resource (322 p.) 225 1 $aContemporary mathematics,$v305$x0271-4132 300 $aDescription based upon print version of record. 320 $aIncludes bibliographical references. 327 $aContents -- Preface -- Gilles Brassard Awarded Pot de Vin Prize -- List of Participants -- Space searches with a quantum robot -- Perturbation theory and numerical modeling of quantum logic operations with a large number of qubits -- Inconclusive rate with a positive operator valued measure -- 1. Introduction -- 2. Inconclusive rates comparison -- 3. Disturbed inconclusive rate -- 4. Consistency -- 5. Conclusion -- 6. Acknowledgements -- References -- Quantum amplitude amplification and estimation -- Manipulating the entanglement of one copy of a two-particle pure entangled state -- Geometric algebra in quantum information processing -- Quantum computing and the Jones polynomial -- 1. Introduction -- 2. Dirac Brackets -- 3. Braiding, Projectors and the Temperley Lieb Algebra -- 4. The Bracket Polynomial -- 5. Knot Amplitudes -- 6. Quantum Computing -- 7. Summary -- References -- Quantum hidden subgroup algorithms: A mathematical perspective -- Part 1. Preamble -- 1. Introduction -- 2. An example of Shor's quantum factoring algorithm -- 3. Definition of the hidden subgroup problem (HSP) and hidden subgroup algorithms (HSAs) -- Part 2. Algebraic Preliminaries -- 4. The Character Group -- 5. Fourier analysis on a finite abelian group -- 6. Implementation issues: Group algebras as Hilbert spaces -- Part 3. QRandI??(): The Progenitor of All QHSAs -- 7. Implementing ProbI?? (X) with quantum subroutine QRANDI??() -- Part 4. Vintage Simon Algorithms -- 8. Properties of the probability distribution ProbI?? (X) when I?? has a hidden subgroup -- 9. A Markov process MI?? induced by ProbI?? -- A proof that measured data and equations of quantum mechanics can be linked only by guesswork. 410 0$aContemporary mathematics (American Mathematical Society).$v305$x0271-4132 606 $aQuantum computers$vCongresses 615 0$aQuantum computers 676 $a004.1/4 702 $aLomonaco$b Samuel J. 702 $aBrandt$b Howard E. 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910788662603321 996 $aQuantum computation and information$9377078 997 $aUNINA