activity
19982004
most citedHow Powerful is Adiabatic Quantum Computation?

172 citations · 196 across the 3 of their papers we have counts for

collaborators
Showing quant-phShow all

8 papers · 1 filter

quant-ph200417 cited

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…

quant-ph20037 cited

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…

quant-ph2002172 cited

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'.

quant-ph2001

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.

quant-ph2000

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…

quant-ph1999

Self-Testing of Universal and Fault-Tolerant Sets of Quantum Gates

Wim van Dam, Frederic Magniez, Michele Mosca +1

We consider the design of self-testers for quantum gates. A self-tester for the gates F_1,...,F_m is a classical procedure that, given any gates G_1,...,G_m, decides with high prob…