Michael A. Nielsen. Quantum Information Theory. Ph.D. dissertation, University of New Mexico, 1998. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
On Quantum Computation Theory - van Dam (2002) (10 citations) (Correct)
....S(#) is a continuous function of the finite set of eigenvalues of #. These eigenvalues are also continuous in the entries of #. Further background on these measures of quantum information and their properties can be found in [78, Chapter 5] and [105] Another good source is Nielsen s thesis [73]. 7.5 Symmetric Subspaces We use the symmetric subspace of the Hilbert space to prove some of our results on copies of quantum states. Let d be a Hilbert space of dimension d with the basis states labeled d#. #m d or d of the m fold tensor product space d contains the states ....
Michael A. Nielsen. Quantum Information Theory. Ph.D. dissertation, University of New Mexico, 1998.
On Quantum Coding for Ensembles of Mixed States - Howard Barnum Carlton (2001) (Correct)
.... 2 (1 ) 2 = min fE j g G cl p 1 (1 )q 1 ; p 2 (1 )q 2 min fE j g G cl (p 1 ; p 2 ) 1 )G cl (q 1 ; q 2 ) min fE j g G cl (p 1 ; p 2 ) min fF j g (1 )G cl (q 1 ; q 2 ) G( 1 ; 2 ) 1 )G( 1 ; 2 ) 37) Another proof, by M. A. Nielsen [30], uses the relation of quantum delity to puri cations. ....
M. A. Nielsen, Quantum Information Theory, University of New Mexico Dissertation, Albuquerque, 1998. 24
On Quantum Coding for Ensembles of Mixed States - Barnum, Caves, Fuchs, Jozsa, .. (2000) (Correct)
....fE j g G cl i p 1 (1 Gamma )q 1 ; p 2 (1 Gamma )q 2 j min fE j g i G cl (p 1 ; p 2 ) 1 Gamma )G cl (q 1 ; q 2 ) j min fE j g G cl (p 1 ; p 2 ) min fF j g (1 Gamma )G cl (q 1 ; q 2 ) G(ae 1 ; ae 2 ) 1 Gamma )G(oe 1 ; oe 2 ) 37) Another proof, by M. A. Nielsen [30], uses the relation of quantum fidelity to purifications. 21 ....
M. A. Nielsen, Quantum Information Theory, University of New Mexico Dissertation, Albuquerque, 1998. 23
Private Quantum Channels - Ambainis, Mosca, Tapp, de Wolf (2000) (1 citation) (Correct)
....mechanics allows for more general superoperators, but this type suces for our purposes. If two superoperators E = f p p i U i j 1 i Ng and E 0 = f p p 0 i U 0 i j 1 i N 0 g are identical (E( E 0 ( for all ) then they are unitarily related in the following way [Nie98, Section 3.2] where we assume N N 0 and if N N 0 we pad E 0 with zero operators to make E and E 0 of equal size) there exists a unitary N N matrix A such that for all i p p i U i = N X j=1 A ij q p 0 j U 0 j : 2.2 Von Neumann entropy Let density matrix have the ....
M. A. Nielsen. Quantum Information Theory. PhD thesis, University of New Mexico, Albuquerque, December 1998.
Quantum Communication and Complexity - de Wolf (2000) (1 citation) (Correct)
No context found.
M. A. Nielsen. Quantum Information Theory. PhD thesis, University of New Mexico, Albuquerque, December 1998.
Communication Complexity Lower Bounds by Polynomials - Buhrman, de Wolf (1999) (13 citations) (Correct)
No context found.
M. A. Nielsen. Quantum Information Theory. PhD thesis, University of New Mexico, Albuquerque, December 1998.
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