First Page | Document Content | |
---|---|---|
![]() Date: 2001-01-29 04:38:02Quantum mechanics Quantum algorithm Quantum teleportation Quantum computer Quantum key distribution Hidden subgroup problem Quantum information Quantum circuit Quantum relative entropy Theoretical computer science Quantum information science Applied mathematics | Add to Reading List |
![]() | Smooth number estimates Rome, January 2009 Lemma. Let a ∈ R>0 and let φa : R>0 −→ R be the function given by φa (x) = x log x +DocID: 1qEHx - View Document |
![]() | Entropy of Stabilizer States Mary Beth Ruskai Tufts University and Institute for Quantum Computing, WaterlooDocID: 1pjyV - View Document |
![]() | Lower Bounds for Expected-Case Planar Point Location Theocharis Malamatos∗ point lies on a segment or vertex of S is zero.) The entropy P of S, denoted H throughout, is defined asDocID: 18ju6 - View Document |
![]() | QIP 2001 Program January 29, 2001 1DocID: 11XSX - View Document |
![]() | IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 47, NO. 4, MAY[removed]Rényi’s Divergence and Entropy Rates for Finite Alphabet Markov Sources 1553DocID: QteG - View Document |