Bitwise Quantum Min-Entropy Sampling and New Lower Bounds for Random Access Codes
Min-entropy sampling gives a bound on the min-entropy of a randomly chosen subset of a string, given a bound on the min-entropy of the whole string. König and Renner showed a min-entropy sampling theorem that holds relative to quantum knowledge. Their res
- PDF / 3,433,565 Bytes
- 218 Pages / 439.37 x 666.142 pts Page_size
- 75 Downloads / 197 Views
Dave Bacon Miguel Martin-Delgado Martin Roetteler (Eds.)
Theory of Quantum Computation, Communication, and Cryptography 6th Conference, TQC 2011 Madrid, Spain, May 24–26, 2011 Revised Selected Papers
123
Lecture Notes in Computer Science Commenced Publication in 1973 Founding and Former Series Editors: Gerhard Goos, Juris Hartmanis, and Jan van Leeuwen
Editorial Board David Hutchison Lancaster University, Lancaster, UK Takeo Kanade Carnegie Mellon University, Pittsburgh, PA, USA Josef Kittler University of Surrey, Guildford, UK Jon M. Kleinberg Cornell University, Ithaca, NY, USA Alfred Kobsa University of California, Irvine, CA, USA Friedemann Mattern ETH Zurich, Zürich, Switzerland John C. Mitchell Stanford University, Stanford, CA, USA Moni Naor Weizmann Institute of Science, Rehovot, Israel Oscar Nierstrasz University of Bern, Bern, Switzerland C. Pandu Rangan Indian Institute of Technology, Madras, India Bernhard Steffen TU Dortmund University, Dortmund, Germany Demetri Terzopoulos University of California, Los Angeles, CA, USA Doug Tygar University of California, Berkeley, CA, USA Gerhard Weikum Max Planck Institute for Informatics, Saarbruecken, Germany
For further volumes: http://www.springer.com/series/7407
6745
Dave Bacon Miguel Martin-Delgado Martin Roetteler (Eds.) •
Theory of Quantum Computation, Communication, and Cryptography 6th Conference, TQC 2011 Madrid, Spain, May 24–26, 2011 Revised Selected Papers
123
Editors Dave Bacon University of Washington Seattle, WA USA
Martin Roetteler NEC Laboratories America Princeton, NJ USA
Miguel Martin-Delgado Universidad Complutense de Madrid Madrid Spain
ISSN 0302-9743 ISBN 978-3-642-54428-6 DOI 10.1007/978-3-642-54429-3
ISSN 1611-3349 (electronic) ISBN 978-3-642-54429-3 (eBook)
Springer Heidelberg New York Dordrecht London Library of Congress Control Number: 2014933392 LNCS Sublibrary: SL1 – Theoretical Computer Science Springer-Verlag Berlin Heidelberg 2014 This work is subject to copyright. All rights are reserved by the Publisher, whether the whole or part of the material is concerned, specifically the rights of translation, reprinting, reuse of illustrations, recitation, broadcasting, reproduction on microfilms or in any other physical way, and transmission or information storage and retrieval, electronic adaptation, computer software, or by similar or dissimilar methodology now known or hereafter developed. Exempted from this legal reservation are brief excerpts in connection with reviews or scholarly analysis or material supplied specifically for the purpose of being entered and executed on a computer system, for exclusive use by the purchaser of the work. Duplication of this publication or parts thereof is permitted only under the provisions of the Copyright Law of the Publisher’s location, in its current version, and permission for use must always be obtained from Springer. Permissions for use may be obtained through RightsLink at the Copyright Clearance Center. Violations are liable to prosecution under the respective Copyright Law
Data Loading...
