Phillip Kaye, Michele Mosca  Home/Search
Context
Related
| cacr.math.uwaterloo.ca...corr200104.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: cacr.math.uwaterlo...tech_reports (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: If two parties, Alice and Bob, share some number, n, of partially entangled pairs of qubits, then it is possible for them to concentrate these pairs into some smaller number of maximally entangled states. We present a simpli ed version of the algorithm for such entanglement concentration, and we describe ecient networks for implementing these operations. 1 Introduction The state of a single pure quantum bit, or qubit, is described by a vector in a 2-dimensional Hilbert space spanned by basis... (Update)
Active bibliography (related documents): More All
0.2: Limits on the Power of Quantum Statistical Zero-Knowledge - Watrous (2002) (Correct)
0.2: Quantum Algorithms for Solvable Groups - Watrous (2000) (Correct)
0.2: A Quantum Fourier Transform Algorithm - Lomont (2004) (Correct)
Similar documents based on text: More All
1.0: Extracting Quantum Entanglement (General Entanglement.. - Ambainis, Smith, Yang (2002) (Correct)
0.5: Bell Inequalities And Entanglement - Werner, Wolf (2001) (Correct)
0.5: The Quantum Entanglement of Bipolar Sequences - Parker, Rijmen (2001) (Correct)
BibTeX entry: (Update)
@misc{ kaye-quantum,
author = "Phillip Kaye and Michele Mosca",
title = "Quantum Networks for Concentrating Entanglement",
url = "citeseer.ist.psu.edu/kaye01quantum.html" }
Citations (may not include all citations):210 A fast quantum mechanical algorithm for database search - Grover - 1996
168 Algorithms for Quantum Computation: Discrete Logarithms and .. - Shor - 1994
118 the Church-Turing principle and the universal quantum comput.. (context) - Deutsch, theory - 1985
116 Simulating Physics with Computers - Feynman - 1982
73 Tight bounds on quantum searching - Boyer, Brassard et al. - 1998
55 Teleporting an Unknown Quantum State via Dual Classical and .. - Bennett, Brassard et al. - 1993
46 An exact quantum polynomial-time algorithm for Simon's probl.. - Brassard, yer - 1997
30 Quantum Counting - Brassard, yer et al. - 1998
29 Classical Communication and Computation (context) - Buhrman, Cleve et al.
28 Exponential Separation of Quantum and Classical Communicatio.. - Raz - 1999
15 Quantum cryptography based on Bell's theorem (context) - Ekert - 1991
7 Quantum searching and counting by eigenvector analysis (context) - Mosca - 1998
6 Can quantum-mechanical description of reality be considered .. (context) - Einstein, Podolsky et al. - 1935
5 Quantum Computer Algorithms (context) - Mosca - 1999
1 Proceedings of the Royal Society of London (context) - Cleve, Ekert et al. - 1998
1 to appear in Quantum Computation and Quantum Information Sci.. (context) - Brassard, yer et al. - 2000
Documents on the same site (http://cacr.math.uwaterloo.ca/tech_reports.html): More
Computing Discrete Logarithms in High-Genus Hyperelliptic.. - Enge (1999) (Correct)
Determining the Maximum Consistent Set of Shares in a.. - Stinson, Wei (1999) (Correct)
The Xedni Calculus And The Elliptic Curve Discrete Logarithm.. - Silverman (1999) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC