AMS Bookstore LOGO amslogo
Return to List  Item: 1 of 1   
Quantum Computation and Information
Edited by: Samuel J. Lomonaco, Jr., University of Maryland, Baltimore, MD, and Howard E. Brandt, Army Research Lab, Adelphi, MD

Contemporary Mathematics
2002; 310 pp; softcover
Volume: 305
ISBN-10: 0-8218-2140-7
ISBN-13: 978-0-8218-2140-4
List Price: US$91
Member Price: US$72.80
Order Code: CONM/305
[Add Item]

Request Permissions

This book is a collection of papers given by invited speakers at the AMS Special Session on Quantum Computation and Information held at the January 2000 Annual Meeting of the AMS in Washington, DC.

The papers in this volume give readers a broad introduction to the many mathematical research challenges posed by the new and emerging field of quantum computation and quantum information. Of particular interest is a long paper by Lomonaco and Kauffman discussing mathematical and computational aspects of the so-called hidden subgroup algorithm.

This book is intended to help readers recognize that, as a result of this new field of quantum information science, mathematical research opportunities abound in such diverse mathematical fields as algebraic coding theory, algebraic geometry, algebraic topology, communication theory, control theory, cryptography, differential geometry, differential topology, dynamical systems, game theory, group theory, information theory, number theory, operator theory, robotics, theory of computation, mathematical logic, mathematical physics, and more. It is hoped that this book will act as a catalyst to encourage members of the mathematical community to take advantage of the many mathematical research opportunities arising from the "grand challenge" of Quantum Information Science.

This book is the companion volume to Quantum Computation: A Grand Mathematical Challenge for the Twenty-First Century and the Millennium, PSAPM/58, Volume 58 in the Proceedings of Symposia in Applied Mathematics series.


Graduate students and research mathematicians interested in quantum computation, quantum information and applications.

Table of Contents

  • P. Benioff -- Space searches with a quantum robot
  • G. P. Berman, G. D. Doolen, D. I. Kamenev, G. V. López, and V. I. Tsifrinovich -- Perturbation theory and numerical modeling of quantum logic operations with a large number of qubits
  • H. E. Brandt -- Inconclusive rate with a positive operator valued measure
  • G. Brassard, P. Høyer, M. Mosca, and A. Tapp -- Quantum amplitude amplification and estimation
  • L. Hardy -- Manipulating the entanglement of one copy of a two-particle pure entangled state
  • T. F. Havel and C. J. L. Doran -- Geometric algebra in quantum information processing
  • L. H. Kauffman -- Quantum computing and the Jones polynomial
  • S. J. Lomonaco, Jr. and L. H. Kauffman -- Quantum hidden subgroup algorithms: A mathematical perspective
  • E. N. Maneva and J. A. Smolin -- Improved two-party and multi-party purification protocols
  • D. A. Meyer -- Quantum games and quantum algorithms
  • J. M. Myers and F. H. Madjid -- A proof that measured data and equations of quantum mechanics can be linked only by guesswork
  • J. Pachos -- Quantum computation by geometrical means
  • M. B. Ruskai -- Pauli exchange and quantum error correction
  • B. Schumacher and M. D. Westmoreland -- Relative entropy in quantum information theory
  • N. R. Wallach -- An unentangled Gleason's theorem
  • W. K. Wootters -- Entangled chains
Powered by MathJax
Return to List  Item: 1 of 1   

  AMS Home | Comments:
© Copyright 2014, American Mathematical Society
Privacy Statement

AMS Social

AMS and Social Media LinkedIn Facebook Podcasts Twitter YouTube RSS Feeds Blogs Wikipedia