|
|
|
|
| LEADER |
00000cam a2200000Mu 4500 |
| 001 |
EBOOKCENTRAL_ocn990576888 |
| 003 |
OCoLC |
| 005 |
20240329122006.0 |
| 006 |
m o d |
| 007 |
cr |n|---||||| |
| 008 |
151005s2002 riu o 000 0 eng d |
| 040 |
|
|
|a LIP
|b eng
|e pn
|c LIP
|d EBLCP
|d OCLCQ
|d AU@
|d OCLCQ
|d LOA
|d OCLCO
|d OCLCF
|d K6U
|d OCLCQ
|d OCLCO
|d OCLCQ
|d OCLCO
|d OCLCL
|
| 019 |
|
|
|a 922980952
|
| 020 |
|
|
|a 9780821878958
|
| 020 |
|
|
|a 0821878956
|
| 029 |
1 |
|
|a AU@
|b 000069466734
|
| 035 |
|
|
|a (OCoLC)990576888
|z (OCoLC)922980952
|
| 050 |
|
4 |
|a QA76.889 ǂb A47 2000eb
|
| 082 |
0 |
4 |
|a 004.1/4
|
| 049 |
|
|
|a UAMI
|
| 100 |
1 |
|
|a Lomonaco, Samuel J.
|
| 245 |
1 |
0 |
|a Quantum Computation and Information.
|
| 246 |
3 |
|
|a Contemporary Mathematics
|
| 246 |
3 |
|
|a Contemporary Mathematics, Volume 305
|
| 246 |
3 |
|
|a Quantum computation and information: AMS Special Session Quantum Computation and Information, January 19-21, 2000, Washington, D.C
|
| 260 |
|
|
|a Providence :
|b American Mathematical Society,
|c 2002.
|
| 300 |
|
|
|a 1 online resource (322 pages)
|
| 336 |
|
|
|a text
|b txt
|2 rdacontent
|
| 337 |
|
|
|a computer
|b c
|2 rdamedia
|
| 338 |
|
|
|a online resource
|b cr
|2 rdacarrier
|
| 490 |
1 |
|
|a Contemporary Mathematics ;
|v v. 305
|
| 588 |
0 |
|
|a Print version record.
|
| 505 |
0 |
|
|a Contents -- 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
|
| 505 |
8 |
|
|a Manipulating the entanglement of one copy of a two-particle pure entangled stateGeometric 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
|
| 505 |
8 |
|
|a 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. QRandÏ?(): The Progenitor of All QHSAs -- 7. Implementing ProbÏ? (X) with quantum subroutine QRANDÏ?() -- Part 4. Vintage Simon Algorithms -- 8. Properties of the probability distribution ProbÏ? (X) when Ï? has a hidden subgroup -- 9. A Markov process MÏ? induced by ProbÏ?
|
| 505 |
8 |
|
|a 10. Vintage Simon quantum hidden subgroup algorithms (QHSAs)Part 5. Vintage Shor Algorithms -- 11. Vintage Shor quantum hidden subgroup algorithms(QHSAs) -- 12. Direct summand structure -- 13. Vintage Shor QHSAs with group probe Ã?= ZQ. -- 14. Finding Shor transversals for vintage ZQ Shor algorithms -- 15. Maximal Shor transversals -- 16. Identifying characters of cyclic groups with points on the unit circle S1 in the complex plane C -- 17. Group norms -- 18. Vintage ZQ Shor QHSAs (Cont.)
|
| 505 |
8 |
|
|a 19. When are characters of Ã?= ZQ close to some character of a maximal cyclic subgroup ZP of HÏ??20. Summary of Vintage ZQ Shor QHSAs -- 21. A cursory analysis of complexity -- 22. Two alternative vintage ZQ Shor algorithms -- Part 6. Epilogue -- 23. Conclusion -- 24. Acknowledgement -- 25. Appendix A. Continued fractions -- 26. Appendix B. Probability Distributions on Integers -- References -- Improved two-party and multi-party purification protocols -- Quantum games and quantum algorithms
|
| 500 |
|
|
|a ""A proof that measured data and equations of quantum mechanics can be linked only by guesswork""
|
| 546 |
|
|
|a English.
|
| 590 |
|
|
|a ProQuest Ebook Central
|b Ebook Central Academic Complete
|
| 650 |
|
0 |
|a Quantum computers
|v Congresses.
|
| 650 |
|
4 |
|a Quantum computers
|v Congresses.
|
| 650 |
|
4 |
|a Engineering & Applied Sciences.
|
| 650 |
|
4 |
|a Computer Science.
|
| 650 |
|
6 |
|a Ordinateurs quantiques
|v Congrès.
|
| 650 |
|
7 |
|a Quantum computers
|2 fast
|
| 655 |
|
7 |
|a Conference papers and proceedings
|2 fast
|
| 700 |
1 |
|
|a Brandt, Howard E.
|
| 758 |
|
|
|i has work:
|a Quantum computation and information (Text)
|1 https://id.oclc.org/worldcat/entity/E39PCXJG8Kf6CRHHkPyrBJRPKm
|4 https://id.oclc.org/worldcat/ontology/hasWork
|
| 776 |
0 |
8 |
|i Print version:
|a Lomonaco, Samuel J.
|t Quantum Computation and Information.
|d Providence : American Mathematical Society, ©2002
|z 9780821821404
|
| 830 |
|
0 |
|a Contemporary Mathematics.
|
| 856 |
4 |
0 |
|u https://ebookcentral.uam.elogim.com/lib/uam-ebooks/detail.action?docID=3113369
|z Texto completo
|
| 938 |
|
|
|a ProQuest Ebook Central
|b EBLB
|n EBL3113369
|
| 994 |
|
|
|a 92
|b IZTAP
|
