Quantum measurements and the Abelian Stabilizer Problem

We present a polynomial quantum algorithm for the Abelian stabilizer problem which includes both factoring and the discrete logarithm. Thus we extend famous Shor's results. Our method is based on a procedure for measuring an eigenvalue of a unitary operator. Another application of this procedure is a polynomial quantum Fourier transform algorithm for an arbitrary finite Abelian group. The paper also contains a rather detailed introduction to the theory of quantum computation.Comment: 22 pages, LATE

Distinguishing n Hamiltonians on C^n by a single measurement

If an experimentalist wants to decide which one of n possible Hamiltonians acting on an n dimensional Hilbert space is present, he can conjugate the time evolution by an appropriate sequence of known unitary transformations in such a way that the different Hamiltonians result in mutual orthogonal final states. We present a general scheme providing such a sequence.Comment: 4 pages, Revte

New Trends in Quantum Computing

Classical and quantum information are very different. Together they can perform feats that neither could achieve alone, such as quantum computing, quantum cryptography and quantum teleportation. Some of the applications range from helping to preventing spies from reading private communications. Among the tools that will facilitate their implementation, we note quantum purification and quantum error correction. Although some of these ideas are still beyond the grasp of current technology, quantum cryptography has been implemented and the prospects are encouraging for small-scale prototypes of quantum computation devices before the end of the millennium.Comment: 8 pages. Presented at the 13th Symposium on Theoretical Aspects of Computer Science, Grenoble, 22 February 1996. Will appear in the proceedings, Lecture Notes in Computer Science, Springer-Verlag. Standard LaTeX. Requires llncs.sty (included