Entanglement-based Quantum Computing by Diagrams of States

We explore entanglement in composite quantum systems and how its peculiar properties are exploited in quantum information and communication protocols by means of Diagrams of States, a novel method to graphically represent and analyze how quantum information is elaborated during computations performed by quantum circuits. We present quantum diagrams of states for Bell states generation, measurements and projections, for dense coding and quantum teleportation, for probabilistic quantum machines designed to perform approximate quantum cloning and universal NOT and, finally, for quantum privacy amplification based on entanglement purification. Diagrams of states prove to be a useful approach to analyze quantum computations, by offering an intuitive graphic representation of the processing of quantum information. They also help in conceiving novel quantum computations, from describing the desired information processing to deriving the final implementation by quantum gate arrays.

Authors:

• Sara Felloni
• Giuliano Strini

Keywords:

• Diagrams of states
• entanglement
• quantum circuits
• quantum information.

References:

[1] S. Felloni, A. Leporati and G. Strini, Diagrams of states in quantum
information: An illustrative tutorial, International Journal of Unconventional
Computing, to be published; arXiv:0904.2656v1[quant-ph].
[2] S. Felloni, A. Leporati and G. Strini, Evolution of quantum systems by
diagrams of states, submitted for publication.
[3] S. Felloni and G. Strini, A graphic representation of states for quantum
copying machines, Electronic Journal of Theoretical Physics 3, Vol. 11,
p. 159, 2006.
[4] D. Deutsch, A. Ekert, R. Jozsa, C. Macchiavello, S. Popescu and A.
Sanpera, Quantum privacy amplification and the security of quantum
cryptography over noisy channels, Physical Review Letters 77, p. 2818,
1996.
[5] J. S. Bell, On the Einstein Podolsky Rosen paradox, Physics 1, p. 195,
1964.
[6] G. Benenti, G. Casati and G. Strini, Principles of Quantum Computation
and Information, Vol. 1: Basic Concepts, World Scientific, Singapore,
2004.
[7] D. Gottesman and I. L. Chuang, Demonstrating the viability of universal
quantum computation using teleportation and single-qubit operations,
Nature 402, p. 390, 1999.
[8] E. Knill, R. La and G. J. Milburn, A scheme for efficient quantum
computation with linear optics, Nature 409, p. 46, 2001.
[9] L. Zehnder, Z. Instrumentenkunde 11, p. 275, 1891.
[10] L. Mach, Z. Instrumentenkunde 12, p. 89, 1892.
[11] W. K. Wootters and W. H. Zurek, A single quantum state cannot be
cloned, Nature 299, p. 802, 1892.
[12] V. Buˇzek and M. Hillery, Quantum copying: beyond the No-Cloning
Theorem, Physical Review A 54, p. 1844, 1996.
[13] N. Gisin and S. Popescu, Spin flips and quantum information for antiparallel
spins, Physical Review Letters 83, p. 432, 1999.
[14] V. Buˇzek, M. Hillery and R. F. Werner, Optimal manipulations with
qubits: Universal NOT gate, Physical Review A 60, R2626, 1999.
[15] V. Buˇzek, M. Hillery and R. F. Werner, Universal-NOT gate, Journal of
Modern Optics 47, p. 211, 2000.
[16] G. Benenti, G. Casati and G. Strini, Principles of Quantum Computation
and Information, Vol. 2: Basic Tools and Special Topics, World
Scientific, Singapore, 2007.
[17] S. Felloni and G. Strini, Quantum algorithms by diagrams of states:
Deutsch-s and Grover-s algorithms, submitted for publication.