PPT-New Results of Quantum-proof Randomness

Extractors Xiaodi Wu MIT 1 st Trustworthy Quantum Information Workshop Ann Arbor USA 1 b ased on work w KaiMin Chung and Xin Li arXiv 14112315 and work wKaiMin Chung . The original motivation for extractors was to simulate randomized algorithms with weak random sources as might arise in nature This motivation is still compelling but extractors have taken on a much wider signi64257cance in the years since they were Both Sides of the Coin. Dave Mark – Intrinsic Algorithm LLC. Brian Schwab – Blizzard. Dave Mark. President & Lead Designer . of . Intrinsic . Algorithm . LLC. Independent Game Studio. AI Consulting Company. How can we draw the line?. Taner Edis. Department . of Physics,. . Truman . State . University. Supernatural fiction. Stories of ghosts, gods, spirits, magic, the occult.. Personality and agency (“spirit”) somehow fundamental to how the world works.. the . Classical World. Kai-Min Chung . Academia . Sinica. , Taiwan. 1. Based on joint works with . Xin. Li, . Yaoyun. Shi, and . Xiaodi. Wu. Original Motivation from . 9. 0’s. Randomness is . extremely useful . Upper and Lower Bounds. Matthew . Coudron. , Thomas . Vidick. , Henry Yuen. arXiv:1305.6626. The motivating question. Is it possible to test randomness?. The motivating question. Is it possible to test randomness?. Fang . Song. Joint . work with Sean . Hallgren. and Adam Smith. Computer . Science and . Engineering. Penn . State University. 2. Are. . classical . cryptographic. protocols . secure . against. . Fang Song. IQC, University of Waterloo. -- “Quantum-Friendly” Reductions. 2. How do . quantum . attacks change classical cryptography?. Crypto-systems based on the hardness of factoring and discrete-log are . Dung Nguyen. Chicago 19. th. January. Content. Motivation . Quantum bit (qubit) vs Classical bit (bit). Quantum Computation . Quantum Communication. Conclusion. Motivation. The end of Moore’s law scaling in silicon (because of quantum effects of particle at scale smaller than 7nm).. Fernando . G.S.L. . Brand. ão. ETH Zürich. Based on joint work with M. . Christandl. and J. Yard. Journees. . Deferation. de . Reserche. en . Mathematiques. de Paris Centre/GT . Informatique. . Days. , November 2011. , . Murcia, . Spain. Antonio . Acín. ICREA . Professor. at ICFO-. Institut. de . Ciencies. . Fotoniques. , Barcelona. Device-Independent Quantum . Information Processing. Computational security. Aram Harrow (MIT). Simons Institute 2014.1.17. a theorem. Let M. 2. R. . m. £. n. .. Say that a set S. ⊆[n]. k. is δ-good if . ∃φ:[m]. k. .  S. such that ∀(j. 1,. …, j. k. )∈S, . f(k,δ):= max{ |S| : ∃S⊆[n]. Randomness. ？. 隨機是指缺乏模式及可預測性的. 事件. e.g.. . 擲骰、六合彩、粒子運動等. 甚麼是機率. Probability. ？. 機率是用以描述隨機事件結果的數學. ” Workshop is to discuss theoretical and experimental hot issues related to quantum physics, from foundational issues (such as findings and ideas to investigate quantum effects in biological systems. The Workshop is supported by . Part 1. Outline. Introduction. Problems of classical physics. Black-body Radiation. experimental observations. Wien’s displacement law. Stefan – Boltzmann law. Rayleigh - Jeans. Wien’s radiation law.