>> GOOD MORNING EVERYBODY. >> GOOD 
MORNING. >> THERE WE GO. I'M MARK 
RUSSINOVICH I'M TECHNIQUE TECHNOLOGY 
OFFICER OF AZURE. THEY WOULDN'T 
LET ME PUT 500 IN. IT'S 400. IT'S 
QUANTUM COMPETING. [APPLAUSE] LOT 
MORE TECHNICAL THAN ANY KIND OF 
POWER SHELL SESSION YOU MIGHT GO 
TO. [LAUGHTER] LET'S TALK ABOUT 
WHAT WE'RE GOING TO COVER THIS MORNING 
IN 75 MINUTES. I DON'T HOPE TO MAKE 
YOU QUANTUM COMPUTING EXPERTS. WHAT 
I DO WANT DO IS INTRODUCE YOU TO 
THE WORLD OF QUANTUM MECHANICS. 
SO YOU GET AN IDEA WHAT THE WHOLE 
EFFORT THAT WE'RE UNDERTAKING INDUSTRY 
AT LARGE IS GOING AFTER AND WHY 
IT'S SO EXCITING AND KIND OF GIVE 
YOU A VIEW INTO THE PROGRESS TO 
CREATE A SCALE. SOME OF THE THINGS 
WE'RE DOING TODAY TO TAKE ADVANTAGE 
SOME OF THE LEARNINGS WE GOT LOOKING 
AT QUANTUM COMPUTING. I WANT TO 
TALK ABOUT WHY QUANTUM COMPUTING. 
YOU MIGHT HAVE SEEN SOME OF THE 
MOTIVATION FOR THIS. ONE OF THE 
VERY SPECIFIC PROBLEMS THAT QUANTUM 
COMPUTING IS PROMISING TO GIVE US 
AN ANSWER TO IS FERTILIZING THE 
PLANETS. IF YOU LOOK AT -- ACTUALLY 
HERE'S THE AGENDA SLIDE THAT I SKIPPED 
OVER. WHY QUANTUM COMPUTING. I WILL 
TELL YOU ABOUT QUANTUM COMPUTING 
APPLICATIONS. I'LL TAKE YOU INTO 
WHAT IT TAKES TO BUILD ANQUAN -- 
QUANTUM COMPUTES TO SOLVE PROBLEMS 
TODAY EVEN WE DON'T HAVE QUANTUM 
COMPUTERS. AS I WAS SAYING, ONE 
OF THE VERY EXCITING KIND OF PROBLEMS 
PROBLEMS THAT QUANTUM COMPUTING 
IS FERTILIZING THE PLANTS USED TO 
FEED THE PLANET. IF YOU TAKE LOOK 
AT FERTILIZER, MANURE IS A COMMON 
FERTILIZER. ONE OF THE KEY INGREDIENTS 
FOR PLANTS TO GROW IS NITROGEN. 
TURNS OUT THAT USING LOTS OF CALCIUM 
TO PRODUCE MANURE IS PRETTY INEFFICIENT. 
BACK IN 1910 THEY CAME UP WITH A 
WAY TO PRODUCE ARTIFICIAL FERTILIZER 
BY CREATING AMMONIA. IT CAN BE BROKEN 
DOWN BY PLANTS AND TO YIELD THE 
NITROGEN THAT NEED TO GROW. THE 
PROBLEM THOUGH WITH THE WAY WE'RE 
CREATING THESE ARTIFICIAL FERTILIZER 
THAT ARE AMMONIA BASED THE PROCESS 
TO DO IS ENERGY INTENSIVE. IT'S 
ESTIMATED THAT ABOUT 3 OF THE WORLD'S 
ENERGY GOES TO CREATING THIS FERTILIZER. 
IT'S DONE AT EXTREMELY HIGH TEMPERATURES, 
400 DEGREES FAHRENHEIT. IT'S INCREDIBLY 
INEFFICIENT. THE FACT IS THAT PLANTS 
BEES PRODUCE FERTILIZER THEMSELVES. 
THEY USE -- THEY PRODUCE THIS FERTILIZER 
USING THIS ENZYME WHICH IS A PROTEIN. 
THE CHALLENGE IS WE HAVE NO IDEA 
HOW TO PRODUCE THIS ENZYME. IT'S 
AN INCREDIBLY COMPLICATED MOLECULE. 
WE ESTIMATE THAT IT WOULD TAKE ABOUT 
170 CUBICS TO PRODUCE IT TO MODEL 
IN ENZYME. WITH 170 CUBICS WE CAN 
CRACK THE STRUCTURE OF THIS THING 
AND CREATE IT ARTIFICIALLY. THIS 
IS THE PROBLEM ONE OF THOSE ONCE 
YOU SOLVE IT, IT'S SOLVED. FERTILIZER 
IS ONE OF THOSE QUANTUM PROBLEMS 
ONCE WE SOLVE IT, WE HAVE THIS VERY 
EFFICIENT WAY TO FERTILIZE THE PLANTS 
IN OUR FOOD SUPPLY. THAT'S JUST 
ONE EXCITING EXAMPLE OF HOW QUANTUM 
CAN HELP US. IMAGINE ALL OF THESE 
OTHER TYPES OF PROBLEMS THAT WE 
CAN APPLY QUANTUM TO. EVERYTHING 
FROM NITROGEN FIXATION WHICH IS 
WHAT I WAS JUST TELLING YOU ABOUT 
TO CARBON CAPTURE TO ADDRESS GLOBAL 
WARMING TO MACHINE LEARNING TO PHARMACEUTICALS 
TO BASICALLY ANYTHING WHERE THERE'S 
AN OPTIMIZATION PROBLEM WHERE YOU 
CAN ACHIEVE QUADRATIC SPEED USING 
THE ELEMENTS OF QUANTUM COMPUTING. 
IT'S A POTENTIAL AREA WHERE WE CAN 
USE QUANTUM. ONE THING THAT, WHY 
QUANTUM COMPUTING ABLE TO SOLVE 
A PROBLEM LIKE NITROGEN FIXATION 
IN A WAY THAT TAKES CLASSIC COMPUTER 
CAN'T. THE ANSWER BOILS DOWN TO 
BASIC PROPERTIES OF QUANTUM MECHANICS 
THAT WE TAKE ADVANTAGE OF WITH THE 
COMPUTATIONAL MODEL ON TOP OF THEM. 
I WANT TO SHOW YOU AN EXAMPLE LIVE 
OF QUANTUM MECHANICS IN EFFECT. 
THIS IS ONE OF THE THINGS WHERE 
I REALLY GOTTEN PASSIONATE ABOUT 
QUANTUM COMPUTING PERSONALLY I STARTED 
TO UNDERSTAND THE BIZARRE BEHAVIORS 
THAT EXIST AT THE QUANTUM LEVEL, 
MY MIND WAS BLOWN. WHAT I WANTED 
TO -- ONE OF MY GOALS IS TO BLOW 
YOUR MIND WITH THE SAME THING. THIS 
IS ONE OF THOSE THINGS THAT I CAN'T 
BELIEVE THAT I WENT ALL THROUGH 
ELEMENTARY SCHOOL, HIGH SCHOOL, 
COLLEGE, MASTERS PROGRAM AND I NEVER 
RAN INTO QUANTUM MECHANICSES IN 
THIS WAY THAT KIND OF BLOWS MY MIND 
TODAY AS I'VE UNDERSTOOD IT. I WILL 
SHOW YOU AN EXPERIMENT. IT'S CALLED 
THE DOUBLE SPLIT QUANTUM ERASER. 
I WILL EXPLAIN WHAT THE GRAPHIC 
WHAT WE'RE LOOK AT. WE'VE GOT A 
LASER AND THAT LASER IS GOING TO 
SEND BEAM OF LIGHT THROUGH TWO SLITS. 
SLIGHTLY SPREAD APART, THOSE TWO 
BEAMS OF LIGHT ARE GOING TO SHINE 
ON TO A TARGET. THE TARGET IS GOING 
TO BE OVER HERE. THIS LITTLE PIECE 
OF PAPER BASICALLY CARDBOARD OVER 
THERE. WHAT YOU WILL SEE ON THAT 
IS THAT THE TWO BEAMS CAUSE AN INTERFERENCE 
PATTERN ON THAT MEASUREMENT DEVICE 
THERE. THAT'S EFFECTIVELY A MEASUREMENT 
DEVICE. WE'RE LOOKING AT WHAT HAPPENS 
TO THE PHOTONS AS THEY GO THROUGH 
THE TWO SLITS. THEY ACT LIKE WAVES. 
THOSE WAVES HAVE PLACES WHERE THEY 
INTERFERE CONSTRUCTIVELY AND PLACES 
WHERE THEY INTERFERE DESTRUCTIVELY. 
YOU HAVE THIS WAVE PATTERN OF DIFFERENT 
STRIPES OF INTENSITY. AMAZING THING 
ABOUT IT IF YOU PUT POLARIZERS IN 
FRONT OF THOSE TWO DIFFERENT PATHS, 
YOU PUT A HORIZONTAL POLARIZER OVER 
ONE AND VERTICAL ONE OVER THE OTHER, 
INTERFERENCE PATTERN DISAPPEARS. 
THOSE POLARIZERS ARE ALLOWING YOU 
TO MEASURE WHICH PHOTON GOES THROUGH 
ONE SLIT VERSUS THE OTHER SLIT. 
THIS IS THE MIND BLOWING THING ABOUT 
QUANTUM MECHANICS, THE PHOTONS TRAVEL 
EVERYWHERE UNTIL YOU MEASURE AND 
DETERMINE WHERE THEY WENT AND THEY 
DECIDE WHERE THEY WENT. THEY BOIL 
DOWN TO PARTICLE LIKE BEHAVIOR. 
INTERFERENCE PATTERN GOES AWAY. 
MORE MIND BLOWING THING, IF YOU 
PUT 45-DEGREE POLARIZER IN FRONT 
OF THAT, THE INTERFERENCE PATTERN 
COMES BACK. THAT'S BECAUSE YOU'VE 
ERATED THE INFORMATION ABOUT WHICH 
POLARIZER WENT THROUGH. YOU CAN'T 
TELL ANYMORE AND YOU'VE EFFECTIVELY 
ERASED THAT MEASUREMENT. MIND BLOWN 
YET? NOW LET'S SEE THAT IN ACTION. 
HERE'S ANOTHER LOOK AT THAT. LET'S 
TAKE A LOOK AT IT LIVE HERE. I GOT 
THIS LASER. THE LASER IS GOING THROUGH 
A 45-DEGREE POLARIZER. WHAT I WANT 
TO DO IS, TAKE THIS DOUBLE SLIT. 
I WILL PUT THIS LASER THROUGH A 
DOUBLE SLIT AND NOW YOU'RE GOING 
TO SEE THE INTERFERENCE PATTERN 
SHOW UP BECAUSE IT'S ACTING LIKE 
WAVES GOING THROUGH THOSE TWO SLITS. 
I THINK I'M SUPPOSED TO SWITCH TO 
CAMERA. YOU SEE IS THE INTERFERENCE 
PATTERN? LIGHT ACTING AS WAVES. 
I GOT THIS OTHER FILM HERE. IT'S 
THE SAME TWO DOUBLE SLITS EXCEPT 
THERE'S HORIZONTAL POLARIZER AND 
VERTICAL POLARIZER. NOW THE INTERFERENCE 
PATTERN IS GONE. AS WE'D EXPECT. 
NOW WE'VE ERASED WHICH PATH. I WILL 
PUT THE 45-DEGREE POLARIZER IN FRONT 
OF THAT AND THE INTERFERENCE PATTERN 
IS BACK. SEE THAT? IT'S LITTLE BIT 
FADED. THE POLARIZER CAUSED LOTS 
OF PHOTONS ON THE WAY THROUGH. WE'VE 
JUST ERASED WHICH WAY INFORMATION 
IN CAME FROM THOSE INTERMEDIATE 
POLARIZERS. THANKS. CAMERA MAN, 
THANKS. [LAUGHTER] WE CAN TURN BACK 
TO THE PRESENTATION NOW. YOU WANT 
YOUR MIND BLOWN JUST A LITTLE BIT 
MORE? IF YOU SEND ONE PHOTON AT 
A TIME AND YOU DON'T MEASURE WHICH 
PATH IT'S GOING, YOU SEE THE INTERFERENCE 
PATTERN SHOW UP. IF YOU GOT PHOTON 
DETECTOR ON THAT FILM RIGHT THERE. 
DETECT WHERE THE PHOTONS ARE HITTING. 
IN FACT, THE PHOTONS ARE COMING 
THROUGH. YOU HAVEN'T BEEN ABLE TO TELL
WHICH 
PATH THEY TOOK. THEY ACT LIKE WAVES 
EVEN THOUGH THERE'S NO OTHER PHOTONS 
FOR IT TO INTERFEAR WITH. IT'S INTERFERING 
WITH ITSELF. IF WE DID THAT SAME 
EXPERIMENT WE HAD THAT LASER, PULSE 
ONE PHOTON AT A TIME, IT WOULD HAVE 
BEHAVED THE SAME WAY WE SAW. THAT'S 
KIND OF THE MIND-BLOWING EFFECTS 
OF QUANTUM MECHANICS. THERE'S MORE 
THAT I GOT COMING FOR YOU IN A MINUTE 
HERE. HERE'S ANOTHER WAY TO LOOK 
AT THAT EXPERIMENT. THIS IS CALLED 
WHEELER'S DELAYED CHOICE EXPERIMENT. 
THIS IS PHYSICISTS WHO SAID IF THERE'S 
GALAXY, WE'LL HAVE LIGHT BEND AROUND 
THAT GALAXY. IF YOU GOT A TELESCOPE 
POSITIONED TO POINT AT ONE SIDE 
OF THAT GALAXY AND ANOTHER TELESCOPE 
POSITION ANOTHER SIDE, THEY ARE 
MEASURING WHICH ONES ARE DETECTING 
PULSES COMING -- PHOTONS COMING 
FROM THAT QASAR, YOU DETECTING WHICH 
PHOTONS HAVE TAKEN. THE MIND BLOWING 
THING IS IF YOU PUT A BEAM SPLITTER 
IN THE MIRROR THERE SO YOU CAUSE 
THOSE PHOTON STRINGS FROM THE QASAR 
TO MEET, YOU'LL SEE CONSTRUCTIVE 
AND DESTRUCTIVE INTERFERENCE SHOW 
UP AS IF THERE WERE ACTING LIKE 
WAVES. WHAT YOU'VE DONE AT THAT 
POINT IS ERASE THE WHICH WAY INFORMATION. 
THE PHOTON WAY BACK POTENTIALLY 
MILLIONS OF YEARS AGO, LOOKS LIKE 
IT DECIDED WAY BACK THEN WHETHER 
TO BEHAVE LIKE A PHOTON OR WAVE 
BASED ON WHAT YOU'VE DONE ON THE 
RECEIVING SIDE. THIS IS JUST ANOTHER 
MIND-BENDING VIEW OF THAT WHICH 
WAY QUANTUM ERASER EXPERIMENT WE 
LOOKED AT. HOW MANY OF YOU HEARD 
-- THIS KIND OF SAME BEHAVIOR THAT 
YOU'RE SEEING THERE. THERE'S RADIOACTIVE 
SITTING IN THERE WITH THE CAT. WHICH 
WILL THEN BREAK A VILE OF POISONOUS 
GAS AND KILL THE CAT. THE DECAY 
OF RADIOACTIVE PARTICLES IS PART 
OF QUANTUM BEHAVIOR. KIND OF THE 
SAME WAY WE MEASURED THERE TO SEE 
WHICH WAY THE PHOTON WENT. AS LONG 
AS YOU'RE NOT MEASURING, THE IDEA 
IS THAT THE RADIOACTIVE PARTICLES 
IN DECAY AND NON-DECAY, UNTIL YOU 
OPEN THE BOX TO MEASURE WHICH WAY 
IT WENT, THE CAT IS ALSO IN A STATE 
OF SUPERPOSITION BETWEEN DEAD AND 
ALIVE. YOU OPEN THE BOX AND AT THAT 
POINT, YOU'RE CAUSING THAT MEASUREMENT 
TO SAY WHICH WAY DID THAT PARTICLE 
GO IN TERMS OF THE DECAY. KIND OF 
ANOTHER WAY OF LOOKING AT THE DOUBLE 
SLIT. WHAT WE'VE BEEN TALKING ABOUT 
IS SOMETHING CALLED SUPERPOSITION. 
THIS IS ONE OF THE POWERFUL ASPECTS 
OF QUANTUM COMPUTING. BEING ABLE 
TO IMPOSE MULTIPLE STATES OF INFORMATION 
ON ONE BIT. IF YOU LOOK AT THE CLASSIC 
CUE BY CUE-- WHEN YOU LOOK AT A 
QUANTUM BIT, OR CUBIC IT CAN LIVE 
IN STATE POSITION WHERE IT'S NEITHER 
ONE OR ZERO. THE PROBABILITY CAN 
VARY. IT CAN BE 30, 0, 70, 1. THIS 
IS SUPERPOSITION AND THE KEY ASPECTS 
OF QUANTUM COMPUTING. HERE'S THE 
WAY TO DESCRIBE THAT IN MATHEMATICS 
AND QUANTUM COMPUTING LINGO IS TO 
REPRESENT IT AS THESE STATE VECTORS. 
YOU SEE 0 AND 1. THAT REPRESENTS 
THE STATE THAT CUBIC IS IN ZERO. 
THE ONE THAT IS IN THE STATE OF 
ONE. THEN YOU GOT PROBABILITY AMPLITUDES 
YOU GOT TO SQUARE THEM TO GET THE 
PROBABILITY THAT'S IN ONE OF THOSE 
TWO STATES. YOU SEE ALPHA 0 AND 
BETA 1. THE PROBABILITY OF IT BEING 
IN A STATE OF ZERO IS A A SQUARED. 
THE TRUE MATH BEHIND IS THOSE CAN 
BE COMPLEX NUMBERS.
IT CAN BE NEGATIVE 
AS WELL AND THEY CAN BE COMPLEX.
WHEN 
YOU SQUARE THEM, THEY END
UP BECOMING 
POSITIVE NUMBERS OF PROBABILITY.
THE TOTAL 
PROBABILITY IS ALWAYS GOING TO SUM 
UP TO ONE. THAT IS THE CORE PRINCIPLE 
OF QUANTUM COMPUTING. THIS IS MY 
SHIRT. THIS IS A CAT THAT'S ALIVE 
AND THAT'S A CAT THAT'S NOT ALIVE. 
THERE'S THE PROBABILITY AMPLITUDE 
. THIS REPRESENTS A QUANTUM EQUATION. 
[APPLAUSE] THE THING IS, SUPERPOSITION 
IS ONE OF THE POWERFUL ASPECTS OF 
QUANTUM COMPUTING. JUST TO GIVE 
YOU AN IDEA WHAT TO DO WITH IT. 
LET'S SAY YOU'RE SEARCHING FOR AN 
ANSWER. THIS IS A FAMOUS ALGORITHM 
THAT I'M DEMONSTRATING HERE THAT 
USES SUPERPOSITION TO COME UP WITH 
AN ANSWER. QUADRATICALLY FASTER 
THAN CLASSIC ALGORITHM CAN ON A 
REGULAR COMPUTER. ONE OF THEM IS 
THE NUMBER YOU'RE LOOKING FOR. THAT'S 
IDENTIFIED BY SOME ORACLE THAT SAYS 
THIS IS THE ANSWER. IF YOU TAKE 
A LOOK AT THE CLASSICAL SEARCH ALGORITHM 
YOU'RE STUCK WITH SEARCH LOOKING 
FOR THAT ONE NUMBER THAT IS THE 
NUMBER THAT IS GOING TO SAY, I'M 
THE ANSWER. THAT'S AN ORDER END 
PROBLEM ON A CLASSICAL COMPUTER. 
WITH A QUANTUM COMPUTER, YOU PUT 
THESE IN STATE OF SUPERPOSITION 
AND YOU MAGNIFY THE STATE OF THE 
ANSWER. BECAUSE IT'S GOT A SPECIAL 
CHARACTERISTIC TO IT THAT IDENTIFIES 
IT AS THE ANSWER. WHAT DO YOU IS 
YOU MAGNIFY THE PROBABILITY WHEN 
YOU MEASURE THE SYSTEM, YOU WILL 
COME UP WITH SIX. THAT'S ORDER SQUARED 
N IN ITEMS OF ITERATIONS YOU GO 
THROUGH OF TAKING THAT SUPERPOSITION, 
MAGNIFYING THE ONE THAT HAS THE 
ANSWER IN IT, REPEATING THAT AND 
I'LL SHOW YOU THAT IN A SECOND. 
THAT'S AN ORDER SQUARE OF N WHICH 
IS QUADRATIC SPEED UP OVER THE CLASSICAL 
ALGORITHM. THIS IS CORNERSTONE BREAK 
THROUGHS AND QUANTUM ALGORITHMS 
COMING UP WITH THIS WAY OF DOING 
SEARCH AND SHOWING CLASSICAL COMPUTERS 
CAN SOLVE PROBLEMS FASTER THAN NAL 
CLASSICAL COMPUTER. LET'S LOOK AT 
GROVER'S ALGORITHM MANY ACTION. 
ON A QUANTUM SIMULATOR . I'M LOCKED 
OUT. [LAUGHTER] I DIDN'T EXPECT 
APPLAUSE FOR THAT. [LAUGHTER] I 
DON'T KNOW WHAT I DID. THANKS FOR 
CHANGING THAT. [APPLAUSE] [LAUGHTER] 
>> OKAY. THIS IS A GROVER SEARCH 
ALGORITHM. YOU CAN SEE AS I STEP 
IN THIS, EXECUTING INSTRUCTIONS. 
IT ALLOCATES THREE QUANTUM BITS. 
WHEN I STEP OVER THAT INSTRUCTION, 
WHAT IT DOES IS APPLY SPECIAL QUANTUM 
GATE, H-GATE, TO PUT ALL THOSE CUBE 
BITS IN STATE OF SUPERPOSITION. 
IF YOU TAKE A LOOK THE PROBABILITY 
AMPLITUDES OF THEM ARE ALL THE SAME. 
THEY REPRESENT EIGHT STATES. THERE'S 
THREE CUBICS. THE POSSIBILITY OF 
GETTING ANY ONE OF THOSE EIGHT STATES 
IS EXACTLY THE SAME. WHAT THIS SIMULATOR 
AND THIS EXAMPLE WILL DO IS MAKE 
THE ANSWER TO ONE OF THOSE THAT 
EIGHTH STATE. WE CAN SEE THAT IT'S 
MAGNIFIED HERE. GROVER 'S ALGORITHM, 
IT WILL FLIP THIS. BECAUSE WE SQUARED 
THE PROBABILITY AMPLITUDES TO GET 
THE PROBABILITY, IT DOESN'T MATTER 
THAT THEY ARE NEGATIVE. THAT'S THE 
WAY CLASSICAL COMPUTING AND QUANTUM 
COMPUTING WORKS. GROVER ALGORITHM 
GOES THROUGH ITERATIONS TO MAGNIFYING 
THE ANSWER OF THE STATE THAT HAS 
THE ORACLE SAYING THIS IS THE ONE 
THAT IS THE ANSWER. I KNOW THAT'S 
HARD TO FOLLOW. BASICALLY THAT ALGORITHM 
THERE, YOU CAN SEE HOW IT'S EXECUTING 
ON TOP. NOW IF WE DO QUANTUM MEASUREMENT, 
WHEN YOU DO A QUANTUM MEASUREMENT 
YOU COLLAPSE THE STATE OF THE SYSTEM 
TO ANSWER ZERO OR ONE. THOSE TWO 
THREE CUBE BITS WHEN WE MEASURE, 
COLLAPSE INTO STATES OF 0 OR 1. 
THE CHANCE THEY'LL COLLAPSE STATE 
OF 111, THAT'S HIGH PROBABILITY. 
THAT'S EFFECTIVELY QUANTUM COMPUTING. 
HOW MEASUREMENTS WORK AND HOW COMPUTATIONS 
WORK. MANIPULATING THESE PROBABILITY 
AMPLITUDES TODAY. WHEN YOU DO A 
MEASUREMENT, THE SYSTEM IS SET TO 
COLLAPSE TO AN ANSWER OF ONE OF 
THE POSSIBILITIES. THE POSSIBILITY 
YOU GET, DEPENDS ON THESE PROBABILITY 
AMPLITUDES. LET'S TAKE A LOOK AT 
ANOTHER BIZARRE QUANTUM PROPERTY. 
IT'S CALLED ENTANGLEMENT. IT'S USED 
IN QUANTUM COMPUTING. THIS IS MORE 
BIZARRE THAN THE SUPERPOSITION. 
EINSTEIN WAS SO FREAKED OUT ABOUT 
THIS, HE CALLED IT SPOOKY ACTION 
AT A DISTANCE. HE DIDN'T BELIEVE 
IT WAS REAL. HE THOUGHT THERE WAS 
ABEXPLANATION FOR THIS BEHAVIOR. 
EXPERIMENT AFTER EXPERIMENT HAS 
SHOWN THAT WHAT I'M ABOUT TO TELL 
YOU IS REALLY THE WAY THE UNIVERSE 
WORKS. THERE'S AN EXPERIMENT DONE 
JUST A FEW YEARS AGO WHICH IS BELIEVED 
TO CONCLUSIVELY IT'S CALLED THE 
LOOPHOLE FREE BELL EXPERIMENT, DONE 
IN FRANCE. THEY ENTANGLED TWO PARTICLES 
AND SHOWED THERE'S NO WAY TO EXPLAIN 
IT OTHER THAN THE FACT THAT UNIVERSE 
BEHAVES WITH THIS ENTANGLEMENT PROPERTY. 
MOST OF THE PHYSICS COMMUNITY BELIEVES, 
THIS IS THE WAY IT WORKS. WHAT IS 
ENTANGLEMENT ALL ABOUT? IT'S ABOUT 
HAVING TWO PARTICLES THAT FATES 
ARE ATTACHED TO EACH OTHER. WHEN 
I MEASURE ONE, THE OTHER ONE COLLAPSES 
INTO A RELATED COROLLATED STATE. 
UNTIL I DO A MEASUREMENT, THEY ARE 
SITTING IN THIS STATE OF SUPERPOSITIONS 
THAT ARE RELATED TO EACH OTHER. 
IMAGINE THAT I'VE GOT PIN PONG BALL. 
I CAN PAINT IT A MIX OF COLORS . 
THEN SEND THAT TWO COPIES OF IT 
BASICALLY TO DIFFERENT SIDES OF 
THE UNIVERSE. THERE'S A PROBABILITY 
RED ONE AND YELLOW ONE COMBINE THEM 
TOGETHER AND THEN TAKE THE COMBINED 
PING-PONG BALLS AND SEND THE DIFFERENT 
PARTS TO THE UNIVERSE. THE ENTANGLEMENT 
PROPERTY SAY WHEN I MEASURE ONE, 
OTHER ONE WILL BE THE OPPOSITE COLOR. 
UNTIL I ACTUALLY DO THE MEASUREMENT, 
THEY'RE IN A STATE OF COMBINED SUPERPOSITION. 
WHERE THEY ARE BOTH RED AND YELLOW. 
IF WE TAKE A LOOK MEASURE ONE AND 
THE OTHER, WE GET THAT COROLLATED 
EFFECT. BUT THE BOTTOM LINE ABOUT 
ENTANGLEMENT IS THE STATES OF THESE 
THINGS AREN'T CORRALLATED. IF THERE'S 
A ONE THIRD CHANCE THAT THIS ONE 
IS RED, THEN IN TWO THIRD CHANCE 
THAT IT'S YELLOW, I MEASURE THIS 
ONE, IT'S RED, THE OTHER ONE IS 
GOING TO BE YELLOW. JUST GUARANTEED. 
IT'S NOT GOING TO BE LIKE I MEASURE 
THE OTHER ONE AND IT'S ONE THIRD 
OR TWO THIRDS. IT'S GOING TO COME 
OUT WITH THE ANSWER AS DEFINED BY 
WHATEVER I MEASURE ON THE OTHER 
SIDE. THAT IS THE BIZARRE EINSTEIN 
ANSWER OF ENTANGLEMENT. LET'S TALK 
ABOUT THAT WE'VE GOT THE TWO KINDS 
OF BASICS OF QUANTUM COMPUTING BEHIND 
US. WHICH IS SUPERPOSITION AND ENTANGLEMENT. 
LET'S LOOK AT HOW YOU BUILD QUANTUM 
APPLICATION IN QUANTUM COMPUTING. 
WE JUST ANNOUNCED AT THE KEYNOTE 
MICROSOFT AZURE QUANTUM, IT'S A 
COMPREHENSIVE PROGRAM THAT BRINGS 
TOGETHER COMPANIES THAT ARE DOING 
SOFTWARE, DEVELOPMENT, QUANTUM COMPUTING 
AND COMPANIES DOING HARDWARE WORK 
ANQUAN ITEM COMPUTING AND MAKING 
THAT AVAILABLE THROUGH AZURE. WHEN 
YOU TALK ABOUT BUILDING A QUANTUM 
APPLICATION USING THE TOOL KITS 
WE'VE GOT, WE'VE GOT SOMETHING CALLED 
THE QUANTUM DEVELOPMENT KIT. IT'S 
BEEN DOWNLOADED 200, 000 TIMES WHICH 
MEANS IF YOU ESTIMATE THAT ABOUT 
ONE PERCENT OF PEOPLE UNDERSTAND 
WHAT THEY ARE DOING WITH IT, THERE'S 
ABOUT 2000 PEOPLE OUT THERE THAT 
ARE MAKING GOOD USE OF QUANTUM COMPUTING. 
IF YOU TAKE A LOOK AT WHAT'S INSIDE 
OF IT, THERE'S COMPILER WHICH IS 
HOW YOU WRITE THE QUANTUM CODE. 
YOU HAVE THE CLASSICAL HOST PROGRAM. 
C-SHARP TO DRIVE THE CLASSIC COMPUTER. 
YOU CAN THINK OF QUANTUM COMPUTER 
AS AN ACCELERATOR. THERE'S THINGS 
IT CAN QUANTUM COMPUTER CAN DO EVERYTHING 
MORE THAN CLASSICAL COMPUTER ALSO 
THERE'S A BUNCH OF ALGORITHMS. THEN 
WHEN YOU DEPLOY IT, YOU CAN DEPLOY 
IT ON TO A CLASSICAL RUN TIME WHICH 
HAS FEW DIFFERENT PLUG-INS. ONE 
IS TO SIMULATE THE QUANTUM ALGORITHM. 
PRETEND THIS IS WHAT WOULD HAPPEN 
ON A QUANTUM COMPUTER. JUST BASED 
OFF PROBABILITY WHEN YOU DO A MEASUREMENT, 
JUST SAY THERE'S A 30 IT'S THIS 
AND 70 IS THAT. YOU KIND OF SIMULATE 
THE BEHAVIOR OF THE QUANTUM COMPUTER. 
THERE'S RESOURCE ESTIMATOR. AS WE 
GET READY FOR QUANTUM COMPUTERS 
WE NEED TO KNOW HOW COMPLICATED 
THE ALGORITHMS ARE IN TERMS OF QUANTUM 
HARDWARE. BUILT IN THAT IS HOW MANY 
QUANTUM GATES IS THIS GOING TO TAKE. 
THERE'S A SET OF THREE OR FOUR GATES 
THAT ARE CONSIDERED THE UNIVERSAL 
GATES. YOU CAN REPRESENT ANY QUANTUM 
CIRCUIT USING THEM. YOU USE THE 
SIMULATOR. RESOURCE ESTIMATOR TELLS 
YOU IF YOU USE ANY GATES THIS IS 
HOW MANY GATES DIFFERENT TYPES YOU'D 
NEED FOR THIS ALGORITHM ON A REAL 
QUANTUM COMPUTER. FINALLY, WE'RE 
BUILDING A REAL QUANTUM COMPUTER. 
I WANT TO SHOW YOU WHAT THIS QDK 
IS LIKE IN PRACTICE. THIS IS A QUANTUM 
NUMBER GENERATOR. I TOLD YOU ABOUT 
THAT H-GATE. THERE'S AN H. WE'RE 
TAKING A CUBIC THAT'S IN STATE ZERO. 
100 PROBABILITY IS ZERO. THE GREAT 
WILL PUT IT IN A STATE OF PERFECT 
SUPERPOSITION. 50 ZERO, 50 ONE. 
IT'S EFFECTIVELY THE WORLD'S PUREST 
RANDOM NUMBER GENERATOR. REALLY 
USING QUANTUM MECHANICS TO PUT IT 
IN RANDOM STATE. YOU CAN'T GET ANY 
MORE RAN DONE THAN THIS. THIS IS 
THE FUNDAMENTAL RANDOM OF THE UNIVERSE. 
THE BEST NUMBER ARE QUANTUM COMPUTERS. 
YOU CAN SEE HERE, THERE'S THE ONE 
PLUS ZERO. THAT'S REPRESENTING THE 
PROBABILITY AMPLITUDE THAT'S IN 
ZERO STATE. WHEN WE PUT IT TO THE 
H-GATE AND YOU MEASURE. LET'S LOOK 
AT THAT IN ACTION IN THE QDK. THIS 
DRIVER IS THE CLASSICAL PART OF 
IT. IT'S JUST DOING 10, 000 RUNS 
INVOKING QUANTUM SIMULATOR. FOR 
EACH OF THESE FOR THE QUANTUM SIMULATOR 
IT'S CALLING THIS RUN COMMAND WHICH 
CALLS INTO THE Q-SHARP PORTION, 
THE QUANTUM PORTION OF THE PROGRAM. 
IT GETS BACK A RESULT, WHICH IS 
GOING TO PRINT OUT IF IT'S ONE IT'S 
AN X IF IT'S A ZERO, IT'S A DOT. 
IF WE LOOK AT THE QUANTUM PART, 
HERE'S THE QUANTUM PART WHICH IS 
JUST HATAMAR GATE. Q-SHARP STATEMENT 
SAYING THIS IS WHAT I EXPECT THE 
PROBABILITIES TO BE. JUST VERIFY 
IT IS. THEN IT'S GOING TO DO THIS 
MEASUREMENT. ONE OF THE THINGS ABOUT 
THE MEASUREMENT IT'S CALLED RES 
RESET Z. M STANDS FOR MEASURE AND 
Z SAYS RESET THIS STATE. THAT'S 
ONE OF THE THINGS I TALKED ABOUT 
EARLIER. WHEN YOU MEASURE A QUANTUM 
STATE, IT COLLAPSES. YOU LOSE ALL 
THE INFORMATION ABOUT WHAT WAS IN 
THAT STATE. THAT GROVER ALGORITHM 
WHEN WE MEASURE, WE LOUIS -- LOSE 
PROBABILITY AMPLITUDE. THE BEST 
YOU CAN DO IS SIMULATE WHAT IT SHOULD 
BE OR MEASURE AND MEASURE OVER AND 
OVER. PUT IT BACK IN THAT STATE 
AND MEASURE AGAIN. THEN YOU CAN 
INFER WHAT THE PROBABILITIES ARE 
JUST BECAUSE YOU'RE GETTING RESULTS 
THAT MATCH THOSE PROBABILITIES. 
DOES THAT MAKE SENSE? 30 CHANCE 
IT'S IN THIS STATE, I MEASURE THREE 
TIMES I GET ONE TIME IN THAT, TWO 
IN THE OTHER. IT ABOUT LINES UP. 
THERE'S WAY FOR ME TO KNOW THAT 
IT'S 30. THAT'S WHAT THIS LITTLE 
PROGRAM IS DOING. WE'RE GOING TO 
RUN IT AND MEASURE AFTER WE'RE IN 
STATE OF SUPERPOSITION. WE SHOULD 
GET 50-50. THIS IS USING THE SIMULATOR. 
IT'S GOING TO BE SIMULATING THAT 
STATE, 50-50 SUPERPOSITION USING 
THE INTERNAL COMPUTER'S RANDOM NUMBER 
GENERATOR. WE SEE ABOUT 50-50XS 
AND DOTS. IT SAYS THE PROBABILITY 
ONES WAS 48. 93. PRETTY CLOSE TO 
50. THIS IS WHAT YOU WILL SEE ON 
A REAL QUANTUM COMPUTER BASICALLY. 
YOU CAN HAVE A BIZARRE RUN WHERE 
IT'S ALL ONE WAY OR THE OTHER AND 
THAT TOTALLY BLOWS YOUR ESTIMATES. 
ONE OF THE THINGS YOU CAN DO, USE 
DIFFERENT KINDS OF GATES TO PUT 
THE SYSTEM IN A DIFFERENT STATE 
OF SUPERPOSITION. I'M GOING TO PUT 
IT IN USING THIS PHASE ROTATION 
GATE, PUT IT IN A STATE USING THIS 
AND THE PHASES YOU DO ARE ON CIRCLE. 
OUR USING TWO PIE ROTATIONS. IF 
WE WANT TO PUT IT IN STATE THAT'S 
NOVEMBER, WE'LL USE THAT MATH. THAT'S 
A LITTLE BIT OF HELLO WORLD. YOU 
KIND OF SEEN HINT OF THE KINDS OF 
GATES THAT WE'RE TALKING ABOUT HERE. 
THERE'S UNDERNEATH THE GATES YOU'RE 
DEALING WITH MATRIX ALGEBRA. IF 
YOU'RE FAMILIAR WITH MACHINE LEARNING 
, QUANTUM COMPUTING IS BUILT ON 
TOP OF THE SAME MATH. IF YOU LOOK 
AT THE 01, ZERO IS THE LEFT COLUMN 
AND 1 IS THE RIGHT COLUMN. WHEN 
YOU TAKE A LOOK AT THE IDENTITY 
MATRIX, YOU'RE TAKING A CUBIC THAT'S 
IN SOME STATE. YOU'RE MULTIPLYING 
BY THIS MATRIX. IF YOU TAKE A VECTOR 
THAT HAS A ZERO ON TOP AND ONE ON 
THE BOTTOM. YOU MULTIPLY IT YOU'LL 
GET ZERO ON TOP AND ONE ON THE BOTTOM. 
IF YOU'RE NOT FAMILIAR WITH MATRIX 
MATH, NO BIG DEAL. FOR THOSE THAT 
ARE, THAT'S THE WAY YOU'RE DOING 
QUANTUM CALCULATIONS ON QUANTUM 
STATES. THESE DIFFERENT STATES ALLOW 
YOU TO MANIPULATE THE PHASES AND 
THE PROBABILITY AMPLITUDE OF THE 
DIFFERENT STATES REPRESENTED IN 
CUBICS. THOSE ARE SINGLE CUBIC GATES. 
MOST FAMOUS IS C-KNOT GATE. THAT'S 
THE WAY THE MATRIX LOOKS. THAT'S 
THE REPRESENTATION FOR IT AND QUANTUM 
CIRCUITS. THAT CIRCLE SAYS BASED 
OFF OF THE VALUE OF THIS CUBIC EITHER 
NOT THE CUBIC OR LEAVE IT ALONE. 
IF THIS CUE BIT IS A ONE, MEN FLIP 
THE STATE. YOU'RE EITHER MESSING 
WITH THE OTHER CUBIC AT THAT POINT 
AND PUTTING IT IN THE 50-50 STATE 
AS WELL AND WHAT YOU JUST DONE IS 
ENTANGLE THOSE TWO BITS TOGETHER. 
THIS GATE IS THE FUNDAMENTAL GATE 
FOR ENTANGLING THE TWO BITS TOGETHER. 
AFTER YOU EXECUTE THIS DIRECTLY 
RELATED TO THE TOP ONE. THE TOP 
ONE IN SUPERPOSITION AND COMMON 
WAY TO TOUT OF PUT IT IN SUPERPOSITION 
IS TO PUT IT IN H-GATE. NOW THAT 
OTHER BIT IS ALSO NOW ENTANGLED 
WITH THAT 50-50 SUPERPOSITION. THAT'S 
CALLED A BELL STATE. YOU WILL SEE 
THAT OVER AND OVER AGAIN AS YOU 
GET INTO QUANTUM COMPUTING. IN FACT, 
HERE'S A SAMPLE QUANTUM CIRCUIT. 
THIS ONE IS FOR SOMETHING CALLED 
QUANTUM TELEPORTATION. IT'S NOT 
THAT. HERE'S WHAT IT IS. WHAT QUANTUM 
TELEPORTATION MEANS, I TOLD YOU 
CAN'T SEE INSIDE OF A QUANTUM SYSTEM. 
WHEN YOU MEASURE QUANTUM SYSTEM 
IT COLLAPSES. YOU DON'T KNOW WHAT 
THE ORIGINAL STATE WAS. ONE OF THE 
OTHER KEY ASPECTS OF QUANTUM MECHANICS, 
YOU CAN'T COPY QUANTUM PARTICLE 
STATE. THERE'S NO WAY TO COPY IT. 
YOU CAN'T SEE INSIDE OF IT. WHAT 
YOU CAN DO IS TRANSFER IT FROM ONE 
PARTICLE TO ANOTHER. IN THE PROCESS 
OF TRANSFERRING IT, YOU DESTROY 
THE STATE OF THE ORIGINAL ONE. YOU 
COLLAPSE IT. YOU CAN MOVE THE STATE 
TO ANOTHER PARTICLE. THAT'S CALLED 
QUANTUM TELEPORTATION. TAKING THE 
STATE OF ONE PARTICLE AND TRANSFERRING 
IT TO ANOTHER ONE. THAT SOUNDS REALLY 
COOL. THAT IS KIND OF TELEPORTATION 
OF A STATE. WE'RE BUILT QUANTUM 
PARTICLES. IF WE CAN TAKE RANDOM 
SET OF PARTICLES STANDING NEXT TO 
ME AND TRANSFER MY STATE INTO THAT, 
I'VE TELEPORTED. THE CHALLENGE IS, 
THOUGH, THAT FOR ME TO FIGURE OUT 
NOW, WHAT -- FOR ME TO DO THE FINAL 
STEP OF TELEPORTATION I NEED TO 
PERFORM QUANTUM GATES ON THAT FINAL 
TELEPORTED V OF -- VERSIONS OF ME 
BASED OFF THE ORIGINAL VERSION. 
I WILL DESTROY THE ORIGINAL VERSION. 
I WILL GET SOME INFORMATION OUT 
OF IT. [SIRENS]. >> I THINK THIS 
HAPPENED LAST YEAR TOO. [LAUGHTER] 
AMBER ALERT, YEAH. I'LL JUST SPEAK 
OVER IT I DON'T KNOW -- IF YOU DON'T 
MIND. TELEPORTING MY STATE FROM 
ME TO ANOTHER VERSION OF ME. I'M 
GOING TO GET SOME INFORMATION THAT 
I NEED TO MANIPULATE THE STATE THAT 
TRANSPORTED ME. IN INFORMATION I 
GOT TO TAKE AND IT'S CLASSICAL INFORMATION. 
I GOT TO GET IT OVER THERE SOMEHOW. 
I CAN'T DO THAT ANY FASTER. I GOT 
TO MOVE IT ACROSS THE UNIVERSE. 
I CAN TELEPORT QUANTUM STATE. IF 
NOT, I'M NOT SHOWING UP ON THE OTHER 
SIDE. THAT INFORMATION IS GOING 
OVER THERE CLASSICALLY. THEY CAN 
SEE THAT REPRESENTING THIS QUANTUM 
CIRCUIT HERE. YOU CAN SEE THAT BELL 
STATE ENTANGLEMENT SHOW UP TWICE 
IN THIS. WE GOT THAT TOP QUANTUM 
STATE, ALPHA 0, BETA 1, I WANT TO 
SEND THAT DOWN TO THAT BOTTOM CUBIC. 
I'M USING THIS CUBIC IN THE MIDDLE 
TO ENTANGLE STATES TOGETHER. I WILL 
ENTANGLE THE BOTTOM CUBIC WITH THE 
MIDDLE CUBIC. I WILL ENTANGLE THAT 
WITH THE TOP CUBIC USING ANOTHER 
CONTROL KNOT. THEN I DO THE MEMORIES 
ON THE -- MEASUREMENTS ON THE TWO 
TOP CUBICS. THAT'S A CONTROLLED 
S-GATE. IF THAT'S A ZERO, THEN IT 
WILL FLIP THE STATE. BASICALLY, 
THAT'S THE CLASSICAL INFORMATION 
I HAVE TO SEND. IT'S EITHER 0 OR 
1 AND IT WILL COME OUT ONE OR THE 
OTHER. THAT IS QUANTUM ENTANGLEMENT. 
LET ME SHOW YOU THAT IN THE QUANTUM 
SIMULATOR. THIS IS A BRAND NEW QUANTUM 
SIMULATOR. IT'S CALLED BONO. HASHE 
IS THE ONE WHO WROTE IT. THIS IS 
HASHE'S BONO QUANTUM SIMULATOR. 
IT'S GRAPHICAL AND COOL. WHAT I 
CAN DO IS DO THAT SAME THING THAT 
I SHOWED YOU BEFORE. PUT THE HATAMAR 
GATE THERE. BONO SYSTEM IS CONSTANTLY 
DOING MEASUREMENTS ACCORDING TO 
PROBABILITIES. IT'S ABOUT 50 , 0001. 
THAT'S PERFECT SUPERPOSITION. THIS 
IS ONE WAY OF LOOKING AT SUPERPOSITION 
DIFFERENT WAY THAT ALPHA BETA WAY 
THEY SHOWED. THAT ARROW IS KIND 
OF THE PHASE. WHICH SAYS IF NEGATIVE 
OR POSITIVE EFFECTIVELY. THAT'S 
WHERE YOU GET INTERFERENCE. THIS 
IS GROWING SET OF SAMPLES. WE'VE 
GOT LOADED IN BONO. THERE'S QUANTUM 
TELEPORTATION THERE. THIS IS A COOL 
THING ABOUT BONO, IT'S GOT THIS 
CIRCUIT THAT SHOWS YOU THE EQUIVALENT 
Q-SHARP CODE. YOU CAN TAKE THAT 
CODE AND DROP IT INTO JUPITER NOTEBOOK 
SERVICE ON THE QUANTUM QDK. THIS 
IS SOMETHING ELSE WE GOT, JUPITER 
NOTEBOOK SERVICE IT'S PART OF THE 
QUANTUM DEVELOPMENT KIT. THEN I 
CAN RUN THAT IN THE SIMULATOR. I 
CAN TELEPORT SOME RANDOM MESSAGE 
AND THEN SHOW THAT I SENT THIS STATE 
AND I RECEIVED THAT STATE USING 
TELEPORTATION. THAT'S SOMETHING 
TO CHECK OUT. BONO IS OPEN SOURCE. 
WHAT I WILL DO HERE IS YOU CAN SEE 
IT SAYS MICROSOFT/BONO. I WILL GET 
HUB PUBLIC HERE. KIND OF ANNOUNCE 
IT TO THE WORLD. [APPLAUSE] LET'S 
TALK ABOUT SOME OTHER QUANTUM ALGORITHMS 
AND DIFFERENT APPLICATIONS FOR QUANTUM 
COMPUTERRING. I WILL SHOW ONE POSSIBLE 
APPLICATION OF QUANTUM COMPUTING 
TO GENERATE SECURE KEYS. THIS IS 
NOT THE STATE-OF-THE-ART ALGORITHM. 
THIS ONE IS SIMPLE ENOUGH TO EXPLAIN. 
TO GET THE IDEA HOW SECURE KEY GENERATION 
WORKS IN A QUANTUM WORLD. ONE OF 
THE GOALS OF GENERATING A SECURE 
KEY AND SHARING IT WITH SOMEBODY 
ELSE, YOU DON'T WANT SOMEBODY TO 
INTERCEPT IT ON THE WAY. WHAT QUANTUM 
COMPUTING DOES, IS IDENTIFY IF SOMEBODY 
IS SNOOPING. REMEMBER THAT PRINCIPLE 
OF IF I WANT TO SEE STATE OF QUANTUM 
SYSTEM I HAVE TO MEASURE IT. IN 
THE PROCESS OF MEASURING IT, I DESTROY 
INFORMATION. I CANNOT GET THAT INFORMATION 
BACK. I MEASURED AND GET SOME PROBABILITY 
OF IT BEING IN ONE STATE OR THE 
OTHER. THAT'S WHAT THAT ALGORITHM 
TAKES ADVANTAGE OF. YOU CAN GUESS 
WHAT YEAR IT PROBABLY CAME OUT. 
WE CAN DO MEASUREMENTS USING WHAT 
ARE CALLED DIFFERENT BASES. THESE 
BASES DETERMINES IF YOU HAVE 01, 
ZERO IS UP, ONE IS DOWN. IF I MEASURE 
IN THE VERTICAL BASES, I'LL MEASURE 
ZERO AND ONE. IF YOU GIVE ME 01, 
I WILL MEASURE 01. I CAN MEASURE 
IN HORIZONTAL BASES. IF I MEASURE 
IN THE HORIZONTAL BASES, I CAN'T 
TELL THE DIFFERENCE. I'LL GET RANDOMLY 
01. YOU HAVE TO MEASURE IN THE SAME 
BASES AS ME TO GET THE SAME VALUE. 
WE HAVE TO AGREE ON THE BASES. LET'S 
BOTH AGREE ON VERTICAL, WHEN I GIVE 
YOU A ZERO, THAT'S UP WHEN YOU MEASURE, 
YOU'LL SEE AN UP. WE'RE GOING TO 
USE A ZERO AS VERTICAL AND ONE AS 
HORIZONTAL. WHEN I SEND YOU BITS, 
I'M GOING TO SEND YOU THEM UP OR 
TO THE RIGHT. FOR YOU TO MEASURE 
THE BITS THAT I'M SENDING, YOU GOT 
TO PICK THE SAME ONES. I PICK RANDOM 
ONES TO SEND YOU. I'M PICKING RANDOM 
01 STREAM. YOU'RE PICKING A RANDOM 
BASES. VERTICAL OR HORIZONTAL TO 
MEASURE AT THE SAME TIME. YOU DO 
YOUR MEMORIES OR BOB DOES. BOB PICKS 
A RANDOM SET OF BASES, AND MEASURES. 
IF BOB PICKED THE SAME BASES AS 
ALICE, BOB IS GOING TO GET THE SAME 
VALUE THAT ALICE TRANSMITTED. IF 
BOB PICKED A DIFFERENT ONE, THEN 
BOB IS GOING TO GET A DIFFERENT 
ANSWER. WE DON'T KNOW EXACTLY WHAT 
ANSWER BOB WILL GET. GOING TO BE 
50-50. YOU CAN SEE THOSE ONES IN 
THE MIDDLE THAT AREN'T CIRCLED. 
THAT'S WHAT BOB PICKED A DIFFERENT 
BASES. WHO KNOWS WHAT BOB WILL GET. 
CERTAINLY NOT THEY'LL GET WHAT ALICE 
SENT. MAYBE OR MAYBE NOT. AT THIS 
POINT, WHAT BOB AND ALICE DO, ALICE 
CREATED THE STRING OF BITS. SENT 
THEM, NOW BOB PICKS BASES, MEASURES 
THE BITS, NOW BOB TELLS ALICE AND 
ALICE TELLS BOB WHICH BASES THEY 
USED FOR ALL OF THEIR BITS. THAT 
WAY THEY KNOW EXACTLY WHERE THEY 
MATCHED AND WHERE THEY DIFFERENT. 
THIS IS PUBLIC INFORMATION. WHAT 
THEY DO AT THAT POINT, THEY TAKE 
HALF OF THE BITS THAT MATCH AND 
SAY, HEY, DID YOU SEND THE ONE? 
I GOT A ONE. IF THEY DID, THEY SEE 
NO DISCREPANCIES, THEN THERE'S EXTREMELY 
HIGH CONFIDENCE THAT NOBODY WAS 
SNOOPING. THEY CAN USE THE OTHER 
HALF, THOSE BITS AS THEIR KEY. IN 
THIS CASE, THE KEY WOULD BE 1 AND 
1. WHAT WOULD HAPPEN IF EVE WAS 
TRYING TO INTERCEPT THEIR KEY EXCHANGE? 
LET'S TAKE THAT SAME THING. EXCEPT 
EVE IS NOW THERE. EVE DOESN'T KNOW 
THE BASES THAT ALICE IS SENDING. 
EVE JUST HAS TO PICK RANDOM ONES 
TOO JUST LIKE BOB WOULD. NOW EVE 
HAS PICKED SOME LONG ONES. LONG 
ONES ARE RED. FOR THOSE, EVE GETS 
A 01. NO GUARANTEE THEY GOT WHATEVER 
ALICE SENT. EVE FORWARDS THOSE MEASUREMENTS 
ALONG TO BOB. BOB DOES HIS MEASUREMENTS 
AND SOME OF THOSE ARE GOING TO MATCH 
WHAT ALICE DID AND SOME AREN'T. 
THEY TAKE THE ONES THAT MATCHED 
AND COMPARE THE VALUES AND THEY 
SAY, OOPS, EVE MEASURED AND COLLAPSED 
THAT SECOND HIGHLIGHTED BLUE, THERE 
ON THE TOP, GOT THE WRONG ANSWER 
BECAUSE EVE MEASURED IN A DIFFERENT 
BASES. THEY GOT A ONE INSTEAD OF 
A ZERO. THEY PASSED THAT ALONG TO 
BOB AND BOB GOES, WAIT A MINUTE, 
WE HAVE THE SAME BASES HERE. YOU 
SENT A ZERO BUT I GOT A ONE. SOMETHING 
FISHY HERE. EVE MUST BE IN THE MIDDLE. 
THEY THROW AWAY THAT KEY GENERATION 
AND THEY TRY AGAIN. OR THEY COME 
UP WITH SOME OTHER WAY TO EXCHANGE 
INFORMATION. THAT'S THE BASICS OF 
SECURE KEY EXCHANGE. WHICH LEADS 
US INTO THAT IN GENERAL. ONE OF 
THE BIG SCARY THINGS ABOUT QUANTUM 
COMPUTING IS THIS HERE. CRACKING 
RSA. THIS CHALLENGE IT'S CALLED 
RSA7068 CHALLENGE PROBLEM. TO TAKE 
768 BIT RSA KEY AND CRACK IT. THIS 
WAS SUCCESSFULLY CRACKED. THERE 
WAS VARIOUS ITERATIONS OF THIS PROBLEM 
STARTING WITH SMALLER KEYS BACK 
IN 1991, THERE WAS HUNDRED BIT RSA 
KEY WAS CRACKED . IT TOOK THE EQUIVALENT 
OF 2000 YEARS COMPUTER TIME TO CRASH. 
THEY DID IT IN TWO YEARS BECAUSE 
THEY HAD THOUSANDS PERILLISM. WHAT 
LENGTH KEY ARE WE USING TODAY? WHAT'S 
THE RECOMMENDATION? 2048. THERE'S 
A NEW CHALLENGE. THIS IS CRACKING 
THIS IS FACTORING LARGE NUMBER. 
HOW LONG THIS WOULD TAKE ON A CLASSICAL 
COMPUTER? THAT LONG. REALLY THIS 
IS WHY PEOPLE ARE LIKE, 2048 BITS, 
THAT SHOULD GET US BY FOR A WHILE. 
BUT, ALONG COMES QUANTUM COMPUTERS. 
HOW LONG WOULD IT TAKE QUANTUM COMPUTER 
OF SUFFICIENT SIZE TO CRACK 248 
BIT ENCRYPTION? ABOUT ONE AND A 
HALF. THIS IS THE SCARY THING ABOUT 
QUANTUM COMPUTERRING. THE WAY THIS 
IS SOLVED, SCIENTISTS, RESEARCHER 
AT MIT CAME UP WITH WAY TO ESTIMATE 
A NUMBER THAT IS LIKELY TO BE ONE 
OF THE PRIME FACTORS FOR ONE OF 
THESE LARGE, VERY LONG NUMBERS. 
USE A QUANTUM COMPUTER TO HELP GUESS 
THAT NUMBER. THE ALGORITHM IS A 
LITTLE BIT COMPLICATED. BASICALLY, 
YOU START WITH A GUESS OF A LARGE 
NUMBER THAT'S LESS THAN N. YOU USE 
THIS QUANTUM ALGORITHM TO ESTIMATE 
A PHASE OF THE LARGE NUMBER N AND 
THEN USE THAT PHASE TO COME UP WITH 
A BETTER GUESS BASED OFF THE ONE 
YOU CAME UP WITH. YOU CAN SEE THAT 
EQUATION AT THE BOTTOM. INSTEAD 
OF USING G, YOU USE G TO THE PHASE 
OVER TWO PLUS OR MINUS ONE. YOU 
SAY, MAYBE THAT'S THE RIGHT ANSWER. 
YOU START IT'S RATING OFF -- IT'S 
IT'S --THIS IS CALLED A QUANTUM 
TRANSFER, QFT ALGORITHM TO ESTIMATE 
THAT PHASE. THAT IS THE SECRET SAUCE. 
THAT'S WHAT QUANTUM COMPUTERS ARE 
GOOD AT. IF YOU IMAGINE SUPERPOSITION 
S INSTRUCTIONIVE INTERFERENCE. LET'S 
SEE THAT IN ACTION. WE'RE GOING 
TO GO CRACK A PRIME NUMBER. USING 
THE QDK. THIS IS Q-SHARP. RIGHT 
THERE. ONE OF THEM SHOW IS IT'S 
GOING TO FACTOR 15. IT'S GOING TO 
TAKE GUESSES AND IT'S GOING TO ITERATE 
AND GET SOME OF THEM WRONG. IT'S 
GOING TO TAKE A WHILE. SOMETIMES 
YOU NEED TO START THE THING OVER. 
WHILE THAT'S RUNNING. I WANT TO 
SHOW YOU SOMETHING ELSE. SOMETIMES 
THIS FINISHES FAST, SOMETIMES IT 
TAKES LONGER. WE'RE HAVING BAD LUCK 
WITH AZURE'S ALGORITHM TODAY. BOTTOM 
LINE IS THIS IS THE ALGORITHM THAT'S 
PART OF THE Q-SHARP. YOU CAN LOOK 
AT IT. ONE OF THE REASONS WHY IT'S 
SO HARD TO SIMULATE QUANTUM COMPUTER 
IS THE AMOUNT OF MEMORY REQUIRED 
TO MODEL THE STATES THAT IT'S IN. 
YOU CAN ONLY MODEL A QUANTUM COMPUTER 
UP TO A CERTAIN SIZE ON TOP OF A 
CLASSICAL COMPUTER. I GOT THIS PROGRAM 
HERE. ALL IT DOES IS ALLOCATES CUBICS. 
I WILL TRY TO ALLOCATE CUBICS FROM 
THE QUANTUM SIMULATOR FROM EACH 
CUBIC I ADD, I TUBE THE END GROW 
THE AMOUNT OF STATES IT KEEP TRACK 
OF. WHEN I HAVE THREE CUBICS THAT'S 
EIGHT POTENTIAL STATES. WHEN I RUN 
THIS, YOU'RE GOING TO SEE HOW MUCH 
RAM THE SIMULATOR ASSUMES TO KEEP 
TRACK ALL THE CUBICS. 28 CUBICS 
IS 4 GIG. THIS IS WHY IT'S SO HARD 
TO DO THESE KINDS OF PROBLEMS THAT 
ON A QUANTUM COMPUTER ARE TRIVIAL. 
IT'S BECAUSE OF THAT. WE JUST CRASHED 
-- RAN OUT OF MEMORY. SYSTEM RUN 
TIME EXCEPTION. WE'VE BOTTOMED OUT 
OF IT. 8 GIG AT 29 CUBICS. THAT'S 
FUNDAMENTALLY WHY IT'S SO HARD TO 
SIMULATE A CLASSICAL ALGORITHM LIKE 
QUANTUM ALGORITHM. THEY STORE SO 
MUCH INFORMATION OFFICIALLY. HOW 
MANY CUBICS DOES IT TAKE TO SOLVE? 
2048 BIT ENCRYPTION. ABOUT 2000 
CUBICS. I WILL TALK ABOUT MORE ABOUT 
WHAT THAT MEANS IN A SECOND. THE 
TIME LINE FOR THIS, WE NEED TO START 
GETTING READY FOR THIS. IT'S NOT 
A MATTER OF IF, IT'S A MATTER OF 
WHEN. NOBODY KNOWS WHEN. THERE'S 
A LOT OF BREAK THROUGHS THAT STILL 
HAVE TO BE DONE. WE'RE ESTIMATING 
AT MICROSOFT WE'RE SHOOTING FOR 
2030 AT OUR TARGET. KIND OF REST 
OF THE SCIENTIFIC WORLD AND QUANTUM 
WORLD AGREES WITH THE ASSESSMENT, 
ROUGHLY THEY BELIEVE, -- WE NEED 
TO BE READY. YOU CAN SEE CLOSE TO 
2010, THERE'S BEEN A TON OF R&D. 
WE GOT PILOTS IN FLIGHT FOR DIFFERENT 
ALGORITHMS. WE'RE GOING TO START 
ROLLING OUT POST-QUANTUM ALGORITHMS. 
PQ C ALGORITHMS IN THE NEXT YEAR 
TO TWO YEARS AND START ROLLING THOSE 
OUT ACROSS OUR SOFTWARE PRODUCTS. 
DECOMMISSIONING THE OLD ALGORITHMS 
LIKE RSA AND MIGRATING OUR SYSTEMS 
TO THESE NEW ALGORITHMS. HOPEFULLY 
THE WORLD WILL BE READY. THIS WILL 
BE THE Y2K SITUATION. ALL ALONG, 
THERE'S BEEN STANDARD DISCUSSIONS. 
WE NEED TO AGREE WHAT KIND OF ALGORITHMS 
TO USE. WE'RE ALL SPEAKING THE SAME 
LANGUAGE. WE ALL AGREE ON THE STRENGTH 
OF THESE ALGORITHMS. THERE'S ABOUT 
70 SUBMISSIONS. SIX OF THEME HAVE 
BEEN WITHDRAWN. NINE HAVE BEEN SUCCUMB 
TO ATTACKS. MICROSOFT SUBMITTED 
FOUR, TWO AND ENCRYPTION CATEGORY, 
TWO IN THE SIGNATURE CATEGORY. BOTH 
OF THEM MADE IT THROUGH. ROUND TWO 
WAS ANNOUNCED LATE JANUARY 2019, 
26 ALGORITHMS ADVANCED FROM THAT. 
WHILE WE'RE WORKING ON QUANTUM COMPUTING 
ON ONE HAND AND KIND OF BEING PART 
OF THE PROBLEM,
WE'RE ALSO WORKING ON THIS 
OTHER SIDE TO BE THE ANSWER TO THE
PROBLEM FOR YOU TOO.
THEN QUANTUM TEAM HAS BEEN 
WORKING WITH CONSORTIUM, OPEN QUANTUM 
SAFE PROJECT, TO MAKE
QUANTUM ALGORITHMS 
AVAILABLE EARLY TO START TESTING 
THEM. LIKE OPEN SSL AND OPEN SSH 
AND THEY'VE EVEN SET UP THIS PQVPN 
PROJECT WHICH IS A VPN GATEWAY WITH 
POST-QUANTUM ALGORITHMS ON IT. YOU 
THINK THESE GUYS ARE REALLY IN SECURITY. 
LOOK AT HOW THEY'RE TRYING TO HELP 
SECURE THE WORLD. I LOOK AT THE 
TOP OF THIS THING AND I'M LIKE, 
OKAY. YOU'RE A GREAT PHYSICIST AND 
MATHEMATICIAN. WE TALKED ABOUT THE 
THEORY OF QUANTUM COMPUTING AND 
MECHANICS AND THESE S KS. -- SD 
KS. YOU NEED REAL QUANTUM HARD WORK. 
WHAT DOES IT TAKE? THIS IS WHAT 
IT TAKES TO BUILD A QUANTUM COMPUTER. 
YOU STEP BACK AND THINK ABOUT IT, 
HAVING FEW CUBICS. YOU NEED WHOLE 
TOP TO BOTTOM SYSTEM. THESE ARE 
KIND OF THE CHARACTERISTICS THAT 
WE SET IN FRONT OF OURSELVES AFTER 
WE GO AFTER BUILDING QUANTUM COMPUTER. 
WE NEED TO RESET IT AND IT NEEDS 
TO BE EXTREMELY STABLE. ONE OF THE 
CHALLENGES WITH CUBICS IS THAT QUANTUM 
STATES ARE FRAGILE. THEY CAN EFFECTIVELY 
BE MEASURED BY RANDOM INTERFERENCE. 
ONCE YOU'RE MEASURE THEM, YOU'RE 
DONE WITH THEM. THAT'S A PROCESS 
CALLED DECOHERENCE. COMPUTERS NEED 
TO KEEP THE CUBICS STABLE. THEY 
NEED TO BE MEASURABLE. IT TAKE US 
TO WHAT IS A CUBIC IN THE REAL WORLD? 
WELL, THERE'S DIFFERENT TYPES OF 
CUBICS. THE CUBICS WE'VE BEEN TALKING 
ABOUT ARE THE KIND OF PERFECT CUBICS 
WHEN I SAY 170 CUBICS TO SOLVE A 
PROBLEM, THAT IS ASSUMING YOU GOT 
PERFECT CUBICS. YOU CAN DO COMPUTATIONS 
ON THEM FOR SECONDS, MINUTES, HOURS. 
WHEN YOU DO MEASUREMENTS ON THEM, 
YOU WILL GET BACK THE PROBABILITY 
OF QUANTUM STATES. THAT DOESN'T 
EXIST IN THE REAL WORLD TO HARNESS. 
WE CAN'T HAVE PURE THEORETICAL CUBICS 
BECAUSE THE REAL WORLD INTERFERES. 
WHAT WE'VE BEEN TALKING ABOUT ARE 
LOGICAL CUBICS. THEY ARE ONES THAT 
WE CAN BUILD OURSELVES AND THAT 
DO HAVE VERY LOW ERROR RATES. LOW 
ENOUGH THAT WE CAN DO SOLVE REAL 
PROBLEMS AND HAVE HIGH CONFIDENCE 
THAT THE ANSWERS ARE VALID. LOGICAL 
CUBICS, THOUGH, THERE'S NO SUCH 
THING AS A VERY LOW ERROR RATE CUBIC 
PHYSICALLY THAT WE CAN USE. THE 
REAL CUBICS LOOK LIKE THIS. [LAUGHTER] 
THESE ARE PHYSICAL CUBICS THAT WE 
GOT IN THE REAL WORLD TODAY. WHAT 
IS A REAL CUBIC? A PHYSICAL CUBIC, 
THERE'S LOTS OF DIFFERENT OBJECTS 
THAT EXHIBIT QUANTUM EFFECTS. ONCE 
YOU START TO GET DOWN ON QUANTUM 
SCALES LIKE AN ATOM OR MOLECULES 
YOU START TO SEE QUANTUM EFFECTS 
SUPERPOSITION ENTANGLEMENT. THERE'S 
LOTS OF DIFFERENT WAYS TO BUILD 
A CUBIC. HERE'S A SLIDE OF SOME 
OF THE TYPES OF CUBICS PEOPLE ARE 
BUILDING OUT THERE . PHOTONS AND 
DIFFERENT POLARIZERRIZATIONS. THIS 
IS THE MOST POPULAR. IBM, GOOGLE, 
GOING AFTER SUPERCONDUCTING CUBICS. 
THERE'S SPIN CUBICS. THERE'S TRAPPED 
IONS. THIS IS TAKING THE STATES 
ENERGY STATES OF ATOMS. THEN TRAPPING 
THEM AND HIGH FIELD MAGNETIC FIELDS 
OR USING TRAPPING THEM WITH LASERS. 
THEN THERE'S TOP LOGICAL CUBIC. 
THAT'S THE ONE WE'RE GOING AFTER. 
EACH ONE HAS DIFFERENT CHARACTERISTICS. 
DIFFERENT CHARACTERISTICS IN TERMS 
OF STABILITY. IN TERMS OF HOW MUCH 
COMPLEXITY THERE IS TO MAKE ONE 
LIKE WHEN YOU TALK ABOUT LACERS, 
YOU NEED LOTS OF LASERS TO KEEP 
THEM IN THEIR TRAPPED ION STATES. 
EACH ONE HAS PROS AND CONS. WHEN 
YOU TAKE A LOOK AT THE ERROR RATES 
THAT WE SEE WITH THE CUBICS THAT 
WE'VE GOT TODAY IN THE REAL WORLD, 
WE SEE ERROR RATES THAT UP ON THE 
RIGHT SIDE OF THAT GRAPH THERE, 
UP IN THE 10 MINUS 3X AXIS, ONE 
OF THE GOALS IS TO HAVE AN ERROR 
RATE THAT IS 10 TO MINUS 12TH RANGE. 
ONLY CUBICS YOU CAN DO A REAL KIND 
OF COMPUTATION. THE CUBICS THAT 
YOU SEE PEOPLE USING INCLUDING GOOGLE 
AND IBM, THEY ARE CALLED NOISY INTERMEDIATE 
SCALE QUANTUM CUBICS. THEY GOT VERY 
HIGH ERROR RATES. THEY NEED TREMENDOUS 
AMOUNT OF ERROR CORRECTIONS. CUBIC 
THAT WE'RE GOING AFTER, WE BELIEVE 
MEANS ON THE ORDER OF HUNDREDS, 
LOW HUNDREDS, DOZENS MAYBE PHYSICAL 
CUBICS TO CREATE A LOGICAL CUBIC. 
FURTHER, WE BELIEVE TOP LOGICAL 
CUBIC STRUCTURE ALLOWS US TO BE 
MUCH MORE COMPACT. THAT IS THE BET 
WE'VE BEEN MAKING IS THIS TOP LOGICAL 
CUBICS. THIS AN EXAMPLE THE CIRCUIT 
THAT WE'RE CREATING. YOU CREATE 
A WIRE AND YOU INDUCE THE EXISTENCE 
OF A QUASI PARTICLE WHICH EXIST 
IN TWO PLACES AT TWO ENDS OF THAT 
NANO WIRE. YOU CAN PUT THAT IN STATES 
OF SUPERPOSITION . WE GOT EVIDENCE 
WE'VE BEEN ABLE TO CREATE ONE. WHAT 
WE'RE DOING IS BUILDING THEM UP 
INTO REAL CUBICS THAT WE CAN CONTROL 
AND CUBIC QUANTUM GATES ON TOP OF 
THAT. THE REALLY POWERFUL THING 
ABOUT TOP LOGICAL CUBICS YOU CAN 
TAKE THEIR PAIRS AND PUT THEM NEXT 
TO EACH OTHER AND WHAT THEY CREATE, 
THOSE CONNECTIONS BETWEEN THE TWO 
HALVES OF THEM ARE WHAT ARE CALLED 
BRAIDS. THE MORE YOU HAVE TOGETHER, 
THERE ARE SIX HERE, THE STRONGER 
THEY GET. THE MORE RESISTENT TO 
INTERFERENCE THEY BECOME. REINFORCE 
EACH OTHER. THESE TWO EXAMPLE PICTURES 
THAT HAVE DIFFERENT STRUCTURES, 
THEY AREN'T IN THE SAME VALUE. THEY 
CAN BE INTERFERED WITH HEAT AND 
LIGHT AND MAGNETIC FIELDS AND STILL 
MAINTAIN THEIR VALUE. THEY GOT A 
MUCH HIGHER STABILITY. ORDERS OF 
MAGNITUDE OVER OTHER TYPES OF CUBICS 
LIKE THE SEMICONDUCTOR CUBICS. WE'RE 
AT MICROSOFT WORKING ON BUILDING 
A TRUE SCALABLE QUANTUM COMPUTER 
OFF TOPLOGICAL CUBICS. THERE'S EIGHT 
LABS AROUND THE WORLD WHERE WE'RE 
BUILDING QUANTUM COMPUTERS. IT'S 
TAKING RESEARCHERS WORKING WITH 
MICROSOFT RESEARCHERS TOGETHER ON 
BUILDING IT. I THOUGHT I'D SHOW 
YOU PICTURES. THIS IS THE ZOOM VIEW 
FROM THE MATERIAL GROWTH CHAMBER. 
THIS IS CALLED SELECTIVE AREA GROWTH 
TO CREATE SEMICONDUCTOR MATERIALS 
THAT LAY ON TOP OF EACH OTHER TO 
CREATE THE ENVIRONMENT WHERE WE 
CAN CREATE THESE. JUST TO SHOW YOU 
THAT QUANTUM SCIENTISTS HAVE A SENSE 
OF HUMOR. THIS IS ONE OF THE THINGS 
THEY GOT IN THAT. [LAUGHTER] I THOUGHT 
IT WAS PRETTY FUNNY. NOW, THIS IS 
WHAT WE USED TO BUILD MATERIALS 
IN THE QUANTUM PROCESSOR. NEED TO 
OPERATE THINGS THAT ARE EXTREMELY 
LOW TEMPERATURES. WE USE THESE FRIDGES 
TO TAKE LIQUID HELIUM DOWN TO TEMPERATURE. 
LIQUID NITROGEN AT THE TOP AND LIQUID 
HELIUM AT THE BOTTOM. THIS CREATES 
THIS COLDER THAN THE COLDEST OF 
SPACE IN ENVIRONMENT FOR THE CUBICS 
TO OPERATE. HERE'S RICH ROSS HE'S 
WORKING A PROBE WHAT HOLDS QUANTUM 
COMPUTER. HE'S LOOKING FOR JEFFREY'S 
FAN BASE THERE. [LAUGHTER] DON'T 
TELL HIM I SAID THAT. ONE OF THE 
THINGS THAT YOU CAN LOOK EVERY COMPANY 
START-UP, ONE OF THE THINGS THEY 
DO GET CONTROL WIRES DOWN IN THE 
QUANTUM PROCESSOR. YOU CAN SEE HUNDREDS 
OF CONTROL WIRES NEEDED TO CONTROL 
QUANTUM PROCESSOR. THIS IS WHAT 
THE GENERAL INDUSTRIES DOING. WE 
AT MICROSOFT JUST MADE A BREAK THROUGH 
RECENTLY OF BEING ABLE TO REDUCE 
THAT COMPLEXITY AND TO CONTROL THE 
QUANTUM COMPUTER WITH JUST THREE 
WIRES. THERE'S HUNDREDS OF WIRES 
YOU SAW, CONTROL ABOUT HUNDRED CUBICS. 
THESE THREE WIRES WE CAN USE USING 
THIS PROCESSOR ON THE LEFT. WHICH 
IS CONTROLLING THE QUANTUM PROCESSOR 
ON THE RIGHT, THREE WIRES WILL ALLOW 
US TO CONTROL 50, 000 CUBICS. THIS 
IS ONE OF THE EXAMPLE SCALABILITY 
CHALLENGES THAT WE'RE THINKING THROUGH 
FROM TOP TO BOTTOM. IF YOU GOT 50, 
000 CUBIC QUANTUM COMPUTER, YOU 
CAN'T HAVE 50, 000 WIRES COMING 
OUT THAT FRIDGE. FINALLY, I WANT 
TO TALK ABOUT QUAN INSPIRED OPTIMIZATION. 
THIS IS HOW WE CAN TAKE QUANTUM 
TOME -- TODAY AND LEVERAGE QUANTUM 
EFFECTS TO INSPIRE US TO SOLVE OPTIMIZATION 
PROBLEMS IN WAYS WE COULDN'T BEFORE. 
THE MATH IS GOING TO BE VERY COMPLICATED. 
THIS IS KIND OF THE STANDARD THAT 
YOU SEE WITH OPTIMIZATION WHERE 
YOU GOT GLOBAL MAXIMA THAT YOU SEE 
ON RIGHT. YOU MIGHT LAND IN THE 
WRONG PLACE IN YOUR OPTIMIZATION 
SEARCH. IT'S LOCAL OPTIMA. YOU WANT 
TO GET TO A BETTER ONE AND THERE'S 
THE GLOBAL OPTIMA WITH A QUANTUM 
INSPIRED ALGORITHM INSTEAD OF TAKING 
THE LONG ROUTE, YOU USE TRICKS THAT 
ARE KIND OF LIKE QUANTUM TUNNELING 
TO GO FROM ONE LOW ENERGY STATE 
TO ANOTHER ONE. UNTIL YOU GET TO 
THE GLOBAL OPTIMA. THIS IS REAL. 
WE GOT A TEAM OF ALGORITHMIC RESEARCHERS 
THAT WORK ON QUANTUM ALGORITHMS 
PEP THEY TAKE THEIR INSPIRATIONS 
FROM THAT OUT INTO A BUNCH OF DIFFERENT 
INDUSTRIES THAT WE SEE THIS APPLYING 
TO. YOU CAN SEE BUNCH OF THEM HERE. 
THE ONE MENTIONED IN THE KEYNOTE 
IS CASE WESTERN RESERVE USING THESE 
OPTIMIZATION ALGORITHMS TO REDUCE 
THE NUMBER OF MRI MEASUREMENTS BY 
3X. YOU CAN GET 3X RESOLUTION OR 
YOU CAN SPEED UP THE TIME TO GET 
AN ANSWER BY 3X. THEY ARE USING 
THE TIME ASPECT TO SAVE MONEY, POTENTIALLY 
IT'S GOING TO BE TENS OF BILLIONS 
OF DOLLARS WORLDWIDE AND SAVINGS 
OF MRI MACHINERY USE USING THIS 
OPTIMIZATION ALGORITHM. OTHER ONE 
IS IN TRAFFIC OPTIMIZATION. WHICH 
IS A HUGE PROBLEM INCLUDING IN SEATTLE. 
IT'S GETTING WORSE AND WORSE. HOW 
CAN WE LEVERAGE QUANTUM ALGORITHMS 
TO BETTER ROUTE TRAFFIC. THIS IS 
A COMPARISON OF THE DIFFERENT ITERATIONS 
WE'VE TAKEN ON THIS PATH. YOU CAN 
SEE THAT WE USED A D-WAVE WHICH 
IS A OPTIMIZATION QUANTUM COMPUTER 
THAT'S COMMERCIALLY AVAILABLE. WE'RE 
ABLE TO SOLVE THIS ROUTE PROBLEM. 
YOU CAN SEE ON THE LEFT NUMBER OF 
ROUTE OPTIONS. WE'RE ON VERSION 
TWO THERE YOU CAN SEE 5000 CARS, 
5000 MADE ROUTES WITH TEN ROUTE 
OPTIONS. WE'RE ABLE TO SOLVE THAT 
PROBLEM IN A FRACTION OF A SECOND. 
WHICH USED TO TAKE MINUTES ON KIND 
OF EVEN QUANTUM COMPUTER. WE'RE 
ABLE TO DO THAT IN JUST FRACTION 
OF A SECOND ON A CLASSICAL COMPUTER. 
I GOT ONE LAST THING TO SHOW YOU, 
WHICH IS JUST A LIVE DEMONSTRATION 
ONE OF THOSE LIVE ALGORITHMS. HASHE 
MY MACHINE IS LOCKED AGAIN. EVERYBODY 
WELCOME HASHE BACK TO THE STATE. 
[APPLAUSE] WHILE HE'S GETTING THAT 
SET UP, I WANT TO TALK ABOUT ONE 
LAST THING. REACH UNDER YOUR CHAIR. 
YOU MAY FIND A PACKET OF POLARIZED 
FILM. INSIDE THERE'S THREE SQUARES 
POLARIZED FILM. HOW MANY PEOPLE 
DISOF DID NOT GET ONE? THAT'S PROBABLY 
DISTRIBUTION AT WORK. WE'LL BE HANDING 
OUT MORE AT THE DOOR. EVERYBODY 
SHOULD HOPEFULLY GET ONE. WHAT YOU 
WILL DO WITH THESE THINGS, YOU CAN'T 
USE THEM YET BECAUSE THEY GOT PROTECTIVE 
FILMS ON THEM. I GOT EXAMPLE OF 
THIS UP HERE TO SHOW YOU WHAT I'VE 
GOT. YOU CAN SEE THE QUANTUM ERASER 
EXPERIMENT IN ACTION. IF I TAKE 
THE FILM AND -- POLARIZED IF I TAKE 
ONE AND ROTATE ONE AND MOVE IT IN 
HORIZONTAL POPULATION, DE POSITION 
-- POSITION, YOU CAN SEE LOT LESS 
LIGHT COMES THROUGH. THAT'S EFFECTIVELY 
MEASURING WHICH WAY THE LIGHT WILL 
GO. WHEN I TAKE ANOTHER PIECE OF 
FILM AND PUT IT OVER 45 DEGREES, 
THE LIGHT STARTS TO COME THROUGH 
AGAIN. THAT'S ERASING WHICH WAY 
INFORMATION. THAT IS THE QUANTUM 
ERASER EFFECT. I'M NOT SURE I'M 
GETTING THIS. YOU CAN PUT IN EXTRA 
PIECE OF FILM AND THAT'S THE QUANTUM 
ERASER. LAST THING IS TO RUN THIS 
DEMO HERE. WHEN I RUN THE OPTIMIZATION. 
THIS IS THE SCALE OPTIMIZATION. 
WHICH IS USING THAT QUANTUM INSPIRED 
ALGORITHM TO CONVERGE ON OPTIMAL 
SOLUTION. IF YOU HAD TO PICK THREE 
BOOKINGS, THESE ARE ONES I WOULD 
RECOMMEND. HOW TO TEACH QUANTUM 
PHYSICS TO YOUR DOG. THIS IS KIND 
OF A FUN BOOK. IT'S A GREAT INTRODUCTION 
TO THE QUANTUM MECHANICS LIKE SUPERPOSITION 
THE BELL STATE I TALKED ABOUT. THERE'S 
QUANTUM PHYSICS EVERYONE NEEDS KNOW. 
FINALLY QUANTUM COMPUTING FOR EVERYONE 
WHICH IS FROM A REAL QUANTUM COMPUTER 
SCIENTIST. ONE THAT DOES IT AS THEIR 
JOB AND RESEARCH. WROTE A BOOK TO 
BE AS ACCESSIBLE AS POSSIBLE. THERE'S 
SOME MATRIX MATH BUT IT'S SIMPLE 
AND EXPLAINS IT PRETTY WELL. WITHOUT 
GETTING TO COME, HE AVOIDS COMPLEX 
NUMBERS. THAT'S A TRUE PART OF REAL 
QUANTUM COMPUTING. ANOTHER GREAT 
STEP IN QUANTUM COMPUTING. THANK 
YOU VERY MUCH, I HOPE YOU FOUND 
