Quantum Information Theory But, we are going to be even more ridiculous later and consider bits written on one atom instead of the present 10 11 atoms.

Slides:



Advertisements
Similar presentations
Designing Investigations to Predict Probabilities Of Events.
Advertisements

Pretty-Good Tomography Scott Aaronson MIT. Theres a problem… To do tomography on an entangled state of n qubits, we need exp(n) measurements Does this.
Quantum Computation and Quantum Information – Lecture 2
Lecture Discrete Probability. 5.2 Recap Sample space: space of all possible outcomes. Event: subset of of S. p(s) : probability of element s of.
Lecture 13 Elements of Probability CSCI – 1900 Mathematics for Computer Science Fall 2014 Bill Pine.
Michael A. Nielsen University of Queensland Quantum entropy Goals: 1.To define entropy, both classical and quantum. 2.To explain data compression, and.
Solve for x. 28 = 4(2x + 1) = 8x = 8x + 8 – 8 – 8 20 = 8x = x Distribute Combine Subtract Divide.
Short course on quantum computing Andris Ambainis University of Latvia.
The Classroom Presenter Project Professor Richard Anderson Department of Computer Science and Engineering
UCB Claude Shannon – In Memoriam Jean Walrand U.C. Berkeley
The Classroom Presenter Project Professor Richard Anderson Department of Computer Science and Engineering University of Washington
SAMPLING DISTRIBUTIONS. SAMPLING VARIABILITY
Quantum Computing Lecture 1 Michele Mosca. l Course Outline
Erasing correlations, destroying entanglement and other new challenges for quantum information theory Aram Harrow, Bristol Peter Shor, MIT quant-ph/
Quantum Computation and Quantum Information – Lecture 2 Part 1 of CS406 – Research Directions in Computing Dr. Rajagopal Nagarajan Assistant: Nick Papanikolaou.
EECS 598 Fall ’01 Quantum Cryptography Presentation By George Mathew.
Great Theoretical Ideas in Computer Science.
Paraty, Quantum Information School, August 2007 Antonio Acín ICFO-Institut de Ciències Fotòniques (Barcelona) Quantum Cryptography.
Basic Concepts in Information Theory
Great Theoretical Ideas In Computer Science Steven Rudich, Anupam GuptaCS Spring 2004 Lecture 22April 1, 2004Carnegie Mellon University
Ch2: Probability Theory Some basics Definition of Probability Characteristics of Probability Distributions Descriptive statistics.
Chapter 5: Probability Distribution What is Probability Distribution? It is a table of possible outcomes of an experiment and the probability of each outcome.
Jian-Wei Pan Decoherence-free sub-space and quantum error-rejection Jian-Wei Pan Lecture Note 7.
October 1 & 3, Introduction to Quantum Computing Lecture 1 of 2 Introduction to Quantum Computing Lecture 1 of 2
Great Theoretical Ideas in Computer Science.
1 hardware of quantum computer 1. quantum registers 2. quantum gates.
Diffusion in Disordered Media Nicholas Senno PHYS /12/2013.
COMPSCI 102 Introduction to Discrete Mathematics.
Recent Progress in Many-Body Theories Barcelona, 20 July 2007 Antonio Acín 1,2 J. Ignacio Cirac 3 Maciej Lewenstein 1,2 1 ICFO-Institut de Ciències Fotòniques.
Lecture 2 Molecular dynamics simulates a system by numerically following the path of all particles in phase space as a function of time the time T must.
Quantum Mechanics(14/2) Hongki Lee BIOPHOTONICS ENGINEERING LABORATORY School of Electrical and Electronic Engineering, Yonsei University Quantum Computing.
Basic Concepts of Probability
Umans Complexity Theory Lectures Lecture 7b: Randomization in Communication Complexity.
12/24/ Probability Distributions. 12/24/ Probability Distributions Random Variable – a variable whose values are numbers determined.
Express as a fraction the probability that the outcome for rolling two number cubes has a sum less than 7. Probability COURSE 3 LESSON 6-9 Make a table.
Interactive Channel Capacity. [Shannon 48]: A Mathematical Theory of Communication An exact formula for the channel capacity of any noisy channel.
TELECOMMUNICATIONS Dr. Hugh Blanton ENTC 4307/ENTC 5307.
Multipartite Entanglement and its Role in Quantum Algorithms Special Seminar: Ph.D. Lecture by Yishai Shimoni.
Basic Q.C. One moose, two moose Red moose, blue moose Live moose, dead moose.
2 pt 3 pt 4 pt 5 pt 1 pt 2 pt 3 pt 4 pt 5 pt 1 pt 2 pt 3 pt 4 pt 5 pt 1 pt 2 pt 3 pt 4 pt 5 pt 1 pt 2 pt 3 pt 4 pt 5 pt 1 pt Number Sense Computation Geometry.
Lecture 3, CS5671 Information theory Uncertainty –Can we measure it? –Can we work with it? Information (Uncertainty == Information)? Related concepts Surprise,
Great Theoretical Ideas in Computer Science for Some.
Great Theoretical Ideas In Computer Science John LaffertyCS Fall 2006 Lecture 10 Sept. 28, 2006Carnegie Mellon University Classics.
Coherent Communication of Classical Messages Aram Harrow (MIT) quant-ph/
An Introduction to Quantum Computation Sandy Irani Department of Computer Science University of California, Irvine.
Probability Distribution. Probability Distributions: Overview To understand probability distributions, it is important to understand variables and random.
We want to see who has the luck! Tally up the number of times each player wins. Play from games. PlayersTallyGames Won Player 1 Player 2 Player 3.
Cosmological Computation Computers in a weird universe Patrick Rall Ph70 May 10, 2016.
Great Theoretical Ideas in Computer Science.
Non-locality and quantum games Dmitry Kravchenko University of Latvia Theory days at Jõulumäe, 2008.
Statistical methods in NLP Course 2 Diana Trandab ă ț
Statistical methods in NLP Course 2
5.2 Mean, Variance, Standard Deviation, and Expectation
Introduction to Discrete Mathematics
EXAMPLE 1 Find a sample space
HUDM4122 Probability and Statistical Inference
Probability Trees By Anthony Stones.
A D D A D.
Lecture 22 Section 7.1 – Wed, Oct 20, 2004
Section 1.1: Equally Likely Outcomes
Probability.
Quantum Computing and the Quest for Quantum Computational Supremacy
1. Identify the following mixed number.
I flip a coin two times. What is the sample space?
Entropy CSCI284/162 Spring 2009 GWU.
e is the possible out comes for a model
Lesson #5: Probability Distributions
 I can construct models to represent the probability of compound events.  
Lecture 9 Randomized Algorithms
Lecture 12 More Probability (Section 0.2)
Presentation transcript:

Quantum Information Theory But, we are going to be even more ridiculous later and consider bits written on one atom instead of the present atoms. Such nonsense is very entertaining to professors like me. I hope you will find it interesting and entertaining as well. --Richard Feynman, Feynman Lectures on Computation

Entanglement Concentration and Dilution Given a biased coin, how can one simulate tosses from an unbiased coin? In general, if two parties share secret, correlated random bits, how can they change one probability distribution to another? What if they receive their bits through a noisy channel?

A Quantum Love Story based on the classic tale of Pyramus and Thisbe

Chaniltonian Communication Capacity How does capacity scale with power and dimension? How does the communication capacity compare with the entanglement capacity? Are forward and backward capacities always equal? Can free entanglement change the world?

Answers HT I win, TH you win, HH or TT we flip again. Asymptotically, many of copies of any distributions can be converted to any other distribution with roughly equal entropy. The general problem of noisy secret correlations (mixed-state entanglement) is not solved.