Quantum computing with controlled-NOT and few qubits
- 15 December 1997
- journal article
- conference paper
- Published by The Royal Society in Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences
- Vol. 355 (1733) , 2259-2266
- https://doi.org/10.1098/rsta.1997.0124
Abstract
We describe simple quantum networks which allow us to prepare, manipulate and measure quantum entanglement of few qubits.This publication has 23 references indexed in Scilit:
- Quantum Privacy Amplification and the Security of Quantum Cryptography over Noisy ChannelsPhysical Review Letters, 1996
- Quantum computation and Shor's factoring algorithmReviews of Modern Physics, 1996
- Purification of Noisy Entanglement and Faithful Teleportation via Noisy ChannelsPhysical Review Letters, 1996
- Elementary gates for quantum computationPhysical Review A, 1995
- Universality in quantum computationProceedings of the Royal Society of London. Series A: Mathematical and Physical Sciences, 1995
- Conditional Quantum Dynamics and Logic GatesPhysical Review Letters, 1995
- Communication via one- and two-particle operators on Einstein-Podolsky-Rosen statesPhysical Review Letters, 1992
- Quantum theory, the Church–Turing principle and the universal quantum computerProceedings of the Royal Society of London. Series A. Mathematical and Physical Sciences, 1985
- Proposed Experiment to Test Local Hidden-Variable TheoriesPhysical Review Letters, 1969
- On the Einstein Podolsky Rosen paradoxPhysics Physique Fizika, 1964