34,375 research outputs found
Adaptive protocols for the quantum depolarizing channel
No full textThesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Mathematics, 2007.Includes bibliographical references (p. 81-85).In the first part, we present a family of entanglement purification protocols that generalize four previous methods, namely the recurrence method, the modified recurrence method, and the two methods proposed by Maneva-Smolin and Leung-Shor. We will show that this family of protocols have improved yields over a wide range of initial fidelities F, and hence imply new lower bounds on the quantum capacity assisted by two-way classical communication of the quantum depolarizing channel. In particular, we show that the yields of these protocols are higher than the yield of universal hashing for F less than 0.99999 and as F goes to 1. In the second part, we define, for any quantum discrete memoryless channel, quantum entanglement capacity with classical feedback, a quantity that lies between two other well-studied quantities. These two quantities - namely the quantum capacity assisted by two-way classical communication and the quantum capacity with classical feedback - are widely conjectured to be different. We then present adaptive protocols for this newly-defined quantity on the quantum depolarizing channel. These protocols in turn imply new lower bounds on the quantum capacity with classical feedback.by Alan W. Leung.Ph.D
Letter from Carl Hayden to George W. P. Hunt
No full textLetter from Carl Hayden to Governor George W. P. Hunt asking the governor to submit the idea of a national park near the rim of the Grand Canyon to the state legislature during the special session. Hayden mentions the state of Arizona would be charged about 1.25 an acre. W. W. Bass and Bass Camp are also included in the letter
Letter from George W. P. Hunt to President Calvin Coolidge
No full textLetter from Governor George W. P. Hunt to Calvin Coolidge arguing for more autonomy in Arizona state matters
Letter from George W. P. Hunt to Carl Hayden
No full textLetter from Governor George W. P. Hunt to Carl Hayden expressing his support for legislation that would grant National Park status to the Grand Canyon
Letter from Carl Hayden to George W. P. Hunt
No full textLetter from Carl Hayden to George W. P. Hunt outlining the proposed national park boundaries and the cost of a township if the state of Arizona decided to acquire one on the rim of the Grand Canyon
Genuine memoirs of the celebrated Miss Maria Brown [electronic resource] : Exhibiting the life of a courtezan, in the most fashionable scenes of dissipation. Published by the author of a W** of P*** In two volumes.
No full textAuthor of a W** of P*** [Woman of Pleasure] = John Cleland, to whom this work is sometimes attributed.Electronic reproduction.English Short Title Catalog,Reproduction of original from British Library
Dr. Edward P. Wimberly, ITC, July 2011
No full textThis video is a conversation with Dr. Edward P. Wimberly. Dr. Wimberly talks about his book, "No Shame in Wesley's Gospel: A Twenty-First Century Pastoral Gospel". Brad Ost, AUC Woodruff Library, is the interviewer
Doc. Math. J. DMV 133 The Work of Peter W. Shor
No full textMuch of the work of Peter Shor has a strong geometrical avor, typically coupled with deep ideas from probability, complexity theory or combinatorics, and always woven together with brilliance and insight of the rst magnitude. Due to the space limitations of this note, I will restrict myself to brief descriptions of just four of his remarkable achievements, (unfortunately) omitting discussions of his seminal work [8] on randomized incremental algorithms (of fundamental importance in computational geometry) and his provocative results in computational biology on self-assembling virus shells. 1 Two-dimensional discrepancy, minimax grid matchings and online bin packing The minimax grid matching problem is a fundamental combinatorial problem arising the the average case analysis of algorithms. To state it, we consider a square S of area N in the plane, and a regularly spaced p N p N array G (=grid) of points in S. Let P be a set of N points selected independently and uniformly in S. By a perfect matching of P to G we meana1-1map: P! G. For each selection P, de ne L(P)=min maxp P d(p � (p)), where ranges over all perfect matchings of P to G, andd denotes Euclidean distance. Theorem [Shor [24], Leighton/Shor [21]] With very high probability
- …
