172 citations · 196 across the 3 of their papers we have counts for
9 papers
Quantum Networks for Generating Arbitrary Quantum States
Phillip Kaye, Michele Mosca
Quantum protocols often require the generation of specific quantum states. We describe a quantum algorithm for generating any prescribed quantum state. For an important subclass of…
Exact quantum Fourier transforms and discrete logarithm algorithms
Michele Mosca, Christof Zalka
We show how the quantum fast Fourier transform (QFFT) can be made exact for arbitrary orders (first for large primes). For most quantum algorithms only the quantum Fourier transfor…
How Powerful is Adiabatic Quantum Computation?
Wim van Dam, Michele Mosca, Umesh Vazirani
We analyze the computational power and limitations of the recently proposed 'quantum adiabatic evolution algorithm'.
Approximate Quantum Cloning with Nuclear Magnetic Resonance
H. K. Cummins, C. Jones, A. Furze +4
Here we describe a Nuclear Magnetic Resonance (NMR) experiment that uses a three qubit NMR device to implement the one to two approximate quantum cloning network of Buzek et al.
Decomposing Finite Abelian Groups
Kevin K. H. Cheung, Michele Mosca
This paper describes a quantum algorithm for efficiently decomposing finite Abelian groups. Such a decomposition is needed in order to apply the Abelian hidden subgroup algorithm.…
Private Quantum Channels and the Cost of Randomizing Quantum Information
Michele Mosca, Alain Tapp, Ronald de Wolf
We investigate how a classical private key can be used by two players, connected by an insecure one-way quantum channel, to perform private communication of quantum information. In…