Quantum Computation and Information.

Quantum Computation and Information.

Saved in:
Bibliographic Details
Main Author: Lomonaco, Samuel J.
Other Authors: Brandt, Howard E.
Format: eBook
Language:English
Published: Providence : American Mathematical Society, 2002.
Series:Contemporary Mathematics.
Subjects:
Quantum computers > Congresses.
Quantum computers
Conference papers and proceedings
Online Access:Click for online access
Table of Contents:
  • 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
  • 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
  • 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Ï?
  • 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.)
  • 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

Similar Items