708 research outputs found
Cloning transformations in spin networks without external control
In this paper we present an approach to quantum cloning with unmodulated spin
networks. The cloner is realized by a proper design of the network and a choice
of the coupling between the qubits. We show that in the case of phase covariant
cloner the XY coupling gives the best results. In the 1->2 cloning we find that
the value for the fidelity of the optimal cloner is achieved, and values
comparable to the optimal ones in the general N->M case can be attained. If a
suitable set of network symmetries are satisfied, the output fidelity of the
clones does not depend on the specific choice of the graph. We show that spin
network cloning is robust against the presence of static imperfections.
Moreover, in the presence of noise, it outperforms the conventional approach.
In this case the fidelity exceeds the corresponding value obtained by quantum
gates even for a very small amount of noise. Furthermore we show how to use
this method to clone qutrits and qudits. By means of the Heisenberg coupling it
is also possible to implement the universal cloner although in this case the
fidelity is 10% off that of the optimal cloner.Comment: 12 pages, 13 figures, published versio
Experimental demonstration of an efficient quantum phase-covariant cloning and its possible applications to simulating eavesdropping in quantum cryptography
We describe a nuclear magnetic resonance (NMR) experiment which implements an
efficient one-to-two qubit phase-covariant cloning machine(QPCCM). In the
experiment we have achieved remarkably high fidelities of cloning, 0.848 and
0.844 respectively for the original and the blank qubit. This experimental
value is close to the optimal theoretical value of 0.854. We have also
demonstrated how to use our phase-covariant cloning machine for quantum
simulations of bit by bit eavesdropping in the four-state quantum key
distribution protocol.Comment: 4 pages, 5 figure
An Introduction to Quantum Computing for Non-Physicists
Richard Feynman's observation that quantum mechanical effects could not be
simulated efficiently on a computer led to speculation that computation in
general could be done more efficiently if it used quantum effects. This
speculation appeared justified when Peter Shor described a polynomial time
quantum algorithm for factoring integers.
In quantum systems, the computational space increases exponentially with the
size of the system which enables exponential parallelism. This parallelism
could lead to exponentially faster quantum algorithms than possible
classically. The catch is that accessing the results, which requires
measurement, proves tricky and requires new non-traditional programming
techniques.
The aim of this paper is to guide computer scientists and other
non-physicists through the conceptual and notational barriers that separate
quantum computing from conventional computing. We introduce basic principles of
quantum mechanics to explain where the power of quantum computers comes from
and why it is difficult to harness. We describe quantum cryptography,
teleportation, and dense coding. Various approaches to harnessing the power of
quantum parallelism are explained, including Shor's algorithm, Grover's
algorithm, and Hogg's algorithms. We conclude with a discussion of quantum
error correction.Comment: 45 pages. To appear in ACM Computing Surveys. LATEX file. Exposition
improved throughout thanks to reviewers' comment
- …