Home
Search results “Error correction in quantum cryptography definition”
What is QUANTUM ERROR CORRECTION? What does QUANTUM ERROR CORRECTION mean?
 
04:03
What is QUANTUM ERROR CORRECTION? What does QUANTUM ERROR CORRECTION mean? ERROR CORRECTION definition - ERROR CORRECTION meaning - ERROR CORRECTION explanation. Source: Wikipedia.org article, adapted under https://creativecommons.org/licenses/by-sa/3.0/ license. Quantum error correction is used in quantum computing to protect quantum information from errors due to decoherence and other quantum noise. Quantum error correction is essential if one is to achieve fault-tolerant quantum computation that can deal not only with noise on stored quantum information, but also with faulty quantum gates, faulty quantum preparation, and faulty measurements. Classical error correction employs redundancy. The simplest way is to store the information multiple times, and—if these copies are later found to disagree—just take a majority vote; e.g. Suppose we copy a bit three times. Suppose further that a noisy error corrupts the three-bit state so that one bit is equal to zero but the other two are equal to one. If we assume that noisy errors are independent and occur with some probability p. It is most likely that the error is a single-bit error and the transmitted message is three ones. It is possible that a double-bit error occurs and the transmitted message is equal to three zeros, but this outcome is less likely than the above outcome. Copying quantum information is not possible due to the no-cloning theorem. This theorem seems to present an obstacle to formulating a theory of quantum error correction. But it is possible to spread the information of one qubit onto a highly entangled state of several (physical) qubits. Peter Shor first discovered this method of formulating a quantum error correcting code by storing the information of one qubit onto a highly entangled state of nine qubits. A quantum error correcting code protects quantum information against errors of a limited form. Classical error correcting codes use a syndrome measurement to diagnose which error corrupts an encoded state. We then reverse an error by applying a corrective operation based on the syndrome. Quantum error correction also employs syndrome measurements. We perform a multi-qubit measurement that does not disturb the quantum information in the encoded state but retrieves information about the error. A syndrome measurement can determine whether a qubit has been corrupted, and if so, which one. What is more, the outcome of this operation (the syndrome) tells us not only which physical qubit was affected, but also, in which of several possible ways it was affected. The latter is counter-intuitive at first sight: Since noise is arbitrary, how can the effect of noise be one of only few distinct possibilities? In most codes, the effect is either a bit flip, or a sign (of the phase) flip, or both (corresponding to the Pauli matrices X, Z, and Y). The reason is that the measurement of the syndrome has the projective effect of a quantum measurement. So even if the error due to the noise was arbitrary, it can be expressed as a superposition of basis operations—the error basis (which is here given by the Pauli matrices and the identity). The syndrome measurement "forces" the qubit to "decide" for a certain specific "Pauli error" to "have happened", and the syndrome tells us which, so that we can let the same Pauli operator act again on the corrupted qubit to revert the effect of the error. The syndrome measurement tells us as much as possible about the error that has happened, but nothing at all about the value that is stored in the logical qubit—as otherwise the measurement would destroy any quantum superposition of this logical qubit with other qubits in the quantum computer.
Views: 1252 The Audiopedia
Universal Fault-Tolerant Computing with Bacon-Shor Codes
 
58:41
We present a fault-tolerant universal gate set consisting of Hadamard and controlled-controlled-Z (CCZ) on Bacon-Shor subsystem codes. Transversal non-Clifford gates on these codes are intriguing in that higher levels of the Clifford hierarchy become accessible as the code becomes more asymmetric. For instance, in an appropriate gauge, Bacon-Shor codes on an m-by-mk lattice have transversal k-qubit-controlled Z. We also describe how, for any stabilizer code, logical operator asymmetry is a necessary condition for transversal gates in high levels of the Clifford hierarchy. For Bacon-Shor CCZ, through a variety of tricks, including intermediate error-correction and non-Pauli recovery, we reduce the overhead required for fault-tolerant implementation. We calculate pseudothresholds for our universal gate set on the smallest 3-by-3 Bacon-Shor code and also compare our gates with magic-states within the framework of a proposed ion trap architecture. See more at https://www.microsoft.com/en-us/research/video/universal-fault-tolerant-computing-with-bacon-shor-codes/
Views: 1027 Microsoft Research
Introduction to Learning With Errors (LWE) - Quantum Robust Public Key
 
07:13
http://asecuritysite.com/encryption/lwe Here is the Python code: import sys import numpy as np import random public_key=[] vals = [5, 8, 12, 16, 2, 6, 11, 3, 7, 10] s = 5 e = 12 message = 1 file='1111' val=0 for x in range(0,len(vals)): public_key.append(vals[x]*s+e) print "Message to send:",message print "Random values:",vals print "-----------------------\n" res = random.sample(public_key, len(public_key)/2) print "Public key",public_key print "Selected values",res sum = np.sum(res) print 'Sum is:',sum if (message==1): sum=sum+1 print 'Encrypted is:',sum rem = sum % s if (rem%2==0): print 'Message received is 0' else: print 'Message received is 1'
Views: 2184 Bill Buchanan OBE
Daniel Gottesman: The Definition(s) of Fault Tolerance
 
40:05
A talk by Daniel Gottesman at the 4th International Conference on Quantum Error Correction, hosted September 11-15, 2017 by Georgia Tech and the Joint Center for Quantum Information and Computer Science at the University of Maryland.
Views: 206 QuICS
The Hidden Subgroup Problem: Lecture 17 of Quantum Computation at CMU
 
01:23:24
Quantum Computation and Quantum Information Lecture 17: The Hidden Subgroup Problem Carnegie Mellon Course 15-859BB, Fall 2018 https://www.cs.cmu.edu/~odonnell/quantum18/ Course discussion board at https://www.diderot.one Email [email protected] for access Weekly work: http://www.cs.cmu.edu/~odonnell/quantum18/weekly-work-8.pdf Taught by Ryan O'Donnell Filmed by Dave A. for Panopto (http://www.panopto.com/) Thumbnail image by Eels and Ticha Sethapakdi
Views: 345 Ryan O'Donnell
Virtual Seminar: Pratik Rath "Holographic Renyi Entropy from Quantum Error Correction"
 
01:05:20
In this virtual talk, Pratik Rath (UC Berkeley) studies Renyi entropies in quantum error correcting codes and compares the answer to the cosmic brane prescription for computations. He finds that the general operator algebra codes have a similar, more general prescription. Notably, for the AdS/CFT code to match the specific cosmic brane prescription, he finds that the code must have maximal entanglement within eigenspaces of the area operator. This gives an improved definition of the area operator, and establishes a stronger connection between the Ryu-Takayanagi area term and the edge modes in lattice gauge theory. He also proposes a new interpretation of existing holographic tensor networks as area eigenstates instead of smooth geometries. This interpretation would explain why tensor networks have historically had trouble modeling the Renyi entropy spectrum of holographic CFTs, and it suggests a method to construct holographic networks with the correct spectrum. This talk was recorded on February 13, 2019 at the Albert Einstein Institute in Potsdam-Golm.
Quantum Computing for Computer Scientists
 
01:28:23
This talk discards hand-wavy pop-science metaphors and answers a simple question: from a computer science perspective, how can a quantum computer outperform a classical computer? Attendees will learn the following: - Representing computation with basic linear algebra (matrices and vectors) - The computational workings of qbits, superposition, and quantum logic gates - Solving the Deutsch oracle problem: the simplest problem where a quantum computer outperforms classical methods - Bonus topics: quantum entanglement and teleportation The talk concludes with a live demonstration of quantum entanglement on a real-world quantum computer, and a demo of the Deutsch oracle problem implemented in Q# with the Microsoft Quantum Development Kit. This talk assumes no prerequisite knowledge, although comfort with basic linear algebra (matrices, vectors, matrix multiplication) will ease understanding. See more at https://www.microsoft.com/en-us/research/video/quantum-computing-computer-scientists/
Views: 209660 Microsoft Research
Quantum Information Science - An Overview
 
02:19
Quantum Information Science - An Overview. We are starting with a series of lectures on Quantum Information Science. Each lecture will contain 4 parts (an introduction to the subject, key concepts, we will explain how it works and at the end we will do some practical example). So welcome to the first video in Quantum Information Science series of lectures and tutorials. Today's topic will be an overview of Quantum Information Science topic. The first part will be the introduction. We will start with the introduction to Quantum Information Science by explaining what Quantum Information Science actually is, tell you few main definitions and present the chapters we are going to cover until the end of the video. So Quantum Information Science is the area of study where information is affected, generated and processed by quantum behavior. The second part will be the key concepts. We will mention and explain all fundamental terms and concepts which are going to be covered in their own lecture, later in Quantum Information Science playlist. For Quantum Information Science, key terms are: -quantum computing -quantum algorithms -Quantum complexity theory -Quantum cryptography -Quantum error correction -Quantum information theory -Quantum entanglement Then we will give a real-world example on how the concept works including illustrations and explanation. For example, we will explain, animate and illustrate how quantum cryptography works indeed. And at the end we will do some hands-on project (coding or math background) so you could get a practical meaning for the specific topic. For example, we will write and explain in details theoretical computer science behind quantum complexity theory. That would be all for now. See you soon with the next lecture. Please make sure you subscribe (click on that bell icon, so you could get notifications when we release new video), like and comment on the video in case you want to share your thoughts or ask any questions. You can visit our official website: www.stemiac.com, where you will find the entire article about this topic, forum where you can ask and answer questions and be a part of our growing community. You can also find the entire source code for any given topic, all video lectures and many more! #QuantumInformationScience #QuantumScience #QuantumInformation
Views: 6 Stemiac
PQ Crypto Day 1: Decoding Linear Codes
 
18:30
Decoding Linear Codes with High Error Rate and its Impact for LPN Security
What is INFORMATION THEORY? What does INFORMATION THEORY mean? INFORMATION THEORY meaning
 
05:19
What is INFORMATION THEORY? What does INFORMATION THEORY mean? INFORMATION THEORY meaning. Source: Wikipedia.org article, adapted under https://creativecommons.org/licenses/by-sa/3.0/ license. Information theory studies the quantification, storage, and communication of information. It was originally proposed by Claude E. Shannon in 1948 to find fundamental limits on signal processing and communication operations such as data compression, in a landmark paper entitled "A Mathematical Theory of Communication". Now this theory has found applications in many other areas, including statistical inference, natural language processing, cryptography, neurobiology, the evolution and function of molecular codes, model selection in ecology, thermal physics, quantum computing, linguistics, plagiarism detection, pattern recognition, and anomaly detection. A key measure in information theory is "entropy". Entropy quantifies the amount of uncertainty involved in the value of a random variable or the outcome of a random process. For example, identifying the outcome of a fair coin flip (with two equally likely outcomes) provides less information (lower entropy) than specifying the outcome from a roll of a die (with six equally likely outcomes). Some other important measures in information theory are mutual information, channel capacity, error exponents, and relative entropy. Applications of fundamental topics of information theory include lossless data compression (e.g. ZIP files), lossy data compression (e.g. MP3s and JPEGs), and channel coding (e.g. for Digital Subscriber Line (DSL)). The field is at the intersection of mathematics, statistics, computer science, physics, neurobiology, and electrical engineering. Its impact has been crucial to the success of the Voyager missions to deep space, the invention of the compact disc, the feasibility of mobile phones, the development of the Internet, the study of linguistics and of human perception, the understanding of black holes, and numerous other fields. Important sub-fields of information theory include source coding, channel coding, algorithmic complexity theory, algorithmic information theory, information-theoretic security, and measures of information. Information theory studies the transmission, processing, utilization, and extraction of information. Abstractly, information can be thought of as the resolution of uncertainty. In the case of communication of information over a noisy channel, this abstract concept was made concrete in 1948 by Claude Shannon in his paper "A Mathematical Theory of Communication", in which "information" is thought of as a set of possible messages, where the goal is to send these messages over a noisy channel, and then to have the receiver reconstruct the message with low probability of error, in spite of the channel noise. Shannon's main result, the noisy-channel coding theorem showed that, in the limit of many channel uses, the rate of information that is asymptotically achievable is equal to the channel capacity, a quantity dependent merely on the statistics of the channel over which the messages are sent. Information theory is closely associated with a collection of pure and applied disciplines that have been investigated and reduced to engineering practice under a variety of rubrics throughout the world over the past half century or more: adaptive systems, anticipatory systems, artificial intelligence, complex systems, complexity science, cybernetics, informatics, machine learning, along with systems sciences of many descriptions. Information theory is a broad and deep mathematical theory, with equally broad and deep applications, amongst which is the vital field of coding theory. Coding theory is concerned with finding explicit methods, called codes, for increasing the efficiency and reducing the error rate of data communication over noisy channels to near the Channel capacity. These codes can be roughly subdivided into data compression (source coding) and error-correction (channel coding) techniques. In the latter case, it took many years to find the methods Shannon's work proved were possible. A third class of information theory codes are cryptographic algorithms (both codes and ciphers). Concepts, methods and results from coding theory and information theory are widely used in cryptography and cryptanalysis. See the article ban (unit) for a historical application. Information theory is also used in information retrieval, intelligence gathering, gambling, statistics, and even in musical composition.
Views: 3360 The Audiopedia
Science of Information | The Great Courses
 
01:47
Start your FREE Trial of The Great Courses Plus and watch the course here: https://www.thegreatcoursesplus.com/special-offer?utm_source=US_OnlineVideo&utm_medium=SocialMediaEditorialYouTube&utm_campaign=145596 The science of information is the most influential, yet perhaps least appreciated field in science today. Never before in history have we been able to acquire, record, communicate, and use information in so many different forms. Never before have we had access to such vast quantities of data of every kind. This revolution goes far beyond the limitless content that fills our lives, because information also underlies our understanding of ourselves, the natural world, and the universe. It is the key that unites fields as different as linguistics, cryptography, neuroscience, genetics, economics, and quantum mechanics. And the fact that information bears no necessary connection to meaning makes it a profound puzzle that people with a passion for philosophy have pondered for centuries. Little wonder that an entirely new science has arisen that is devoted to deepening our understanding of information and our ability to use it. Called information theory, this field has been responsible for path-breaking insights such as the following: What is information? In 1948, mathematician Claude Shannon boldly captured the essence of information with a definition that doesn’t invoke abstract concepts such as meaning or knowledge. In Shannon’s revolutionary view, information is simply the ability to distinguish reliably among possible alternatives. The bit: Atomic theory has the atom. Information theory has the bit: the basic unit of information. Proposed by Shannon’s colleague at Bell Labs, John Tukey, bit stands for “binary digit”—0 or 1 in binary notation, which can be implemented with a simple on/off switch. Everything from books to black holes can be measured in bits. Redundancy: Redundancy in information may seem like mere inefficiency, but it is a crucial feature of information of all types, including languages and DNA, since it provides built-in error correction for mistakes and noise. Redundancy is also the key to breaking secret codes. Building on these and other fundamental principles, information theory spawned the digital revolution of today, just as the discoveries of Galileo and Newton laid the foundation for the scientific revolution four centuries ago. Technologies for computing, telecommunication, and encryption are now common, and it’s easy to forget that these powerful technologies and techniques had their own Galileos and Newtons. The Science of Information: From Language to Black Holes covers the exciting concepts, history, and applications of information theory in 24 challenging and eye-opening half-hour lectures taught by Professor Benjamin Schumacher of Kenyon College. A prominent physicist and award-winning educator at one of the nation’s top liberal arts colleges, Professor Schumacher is also a pioneer in the field of quantum information, which is the latest exciting development in this dynamic scientific field. Start your FREE Trial of The Great Courses Plus and watch the course here: https://www.thegreatcoursesplus.com/special-offer?utm_source=US_OnlineVideo&utm_medium=SocialMediaEditorialYouTube&utm_campaign=145596 Don’t forget to subscribe to our channel – we are adding new videos all the time! https://www.youtube.com/subscription_center?add_user=TheGreatCourses
Helger Lipmaa "Succinct Non-Interactive Zero Knowledge Arguments from Span Programs and ..."
 
01:09:10
Helger Lipmaa (Tartu Universitāte) referāts "Succinct Non-Interactive Zero Knowledge Arguments from Span Programs and Linear Error-Correcting Codes", Recently, Gennaro, Gentry, Parno and Raykova [GGPR12] proposed an ecient non-interactive zero knowledge argument for Circuit-SAT, based on non-standard notions like conscientious and quadratic span programs. We propose a new non-interactive zero knowledge argument, based on a simple combination of standard span programs (that verify the correctness of every individual gate) and high-distance linear error-correcting codes (that check the consistency of wire assignments). We simplify all steps of the argument. As one of the corollaries, we design an (optimal) wire checker, based on systematic Reed-Solomon codes, of size 8n and degree 4n, while the wire checker from [GGPR12] has size 24n and degree 76n, where n is the circuit size. Importantly, the new argument has constant verier's computation. (publikācija: http://eprint.iacr.org/2013/121) Kvantu un kritpo diena 2013 (Quantum and Crypto Day 2013) Latvijas Universitātes Datorikas fakultātē notika 2013. gada 25. aprīlī. Plašāka informācija: http://www.df.lu.lv/zinas/t/20343/
WII? (2a) Information Theory, Claude Shannon, Entropy, Redundancy, Data Compression & Bits
 
24:17
What is Information? - Part 2a - Introduction to Information Theory: Script: http://crackingthenutshell.org/what-is-information-part-2a-information-theory ** Please support my channel by becoming a patron: http://www.patreon.com/crackingthenutshell ** Or... how about a Paypal Donation? http://crackingthenutshell.org/donate Thanks so much for your support! :-) - Claude Shannon - Bell Labs - Father of Information Theory - A Mathematical Theory of Communication - 1948 - Book, co-written with Warren Weaver - How to transmit information efficiently, reliably & securely through a given channel (e.g. tackling evesdropping) - Applications. Lossless data compression (ZIP files). Lossy data compression (MP3, JPG). Cryptography, thermal physics, quantum computing, neurobiology - Shannon's definition not related to meaningfulness, value or other qualitative properties - theory tackles practical issues - Shannon's information, a purely quantitative measure of communication exchanges - Shannon's Entropy. John von Neumann. Shannon's information, information entropy - avoid confusion with with thermodynamical entropy - Shannon's Entropy formula. H as the negative of a certain sum involving probabilities - Examples: fair coin & two-headed coin - Information gain = uncertainty reduction in the receiver's knowledge - Shannon's entropy as missing information, lack of information - Estimating the entropy per character of the written English language - Constraints such as "I before E except after C" reduce H per symbol - Taking into account redundancy & contextuality - Redundancy, predictability, entropy per character, compressibility - What is data compression? - Extracting redundancy - Source Coding Theorem. Entropy as a lower limit for lossless data compression. - ASCII codes - Example using Huffman code. David Huffman. Variable length coding - Other compression techniques: arithmetic coding - Quality vs Quantity of information - John Tukey's bit vs Shannon's bit - Difference between storage bit & information content. Encoded data vs Shannon's information - Coming in the next video: error correction and detection, Noisy-channel coding theorem, error-correcting codes, Hamming codes, James Gates discovery, the laws of physics, How does Nature store Information, biology, DNA, cosmological & biological evolution
Views: 57221 Cracking The Nutshell
The Fragility of Adversary Definitions in Cryptographic Protocols
 
01:17:40
Dr. Virgil Gligor, Professor of Electrical and Computer Engineering, Carnegie Mellon and Cylab, presents "On the Fragiliity of Adversary Definitions in Cryptographic Protocols" on November 6, 2008. Note: Original video was 320x240.
Views: 330 Rutgers University
Quantum Computers Explained – Limits of Human Technology
 
07:17
Where are the limits of human technology? And can we somehow avoid them? This is where quantum computers become very interesting. Check out THE NOVA PROJECT to learn more about dark energy: www.nova.org.au Support us on Patreon so we can make more stuff: https://www.patreon.com/Kurzgesagt?ty=h Get the music of the video here: https://soundcloud.com/epicmountain/quantum-computers https://epicmountainmusic.bandcamp.com/track/quantum-computers http://epic-mountain.com Wakelet: https://wakelet.com/wake/42ji9UMJzN?v=st Or follow us on social media or reddit: http://kurzgesagt.org https://www.reddit.com/r/kurzgesagt https://www.facebook.com/Kurzgesagt https://twitter.com/Kurz_Gesagt THANKS A LOT TO OUR LOVELY PATRONS FOR SUPPORTING US: Tamago231, H.H. Lewis, Kirin Tantinon, David, Max Lesterhuis, Marek Belski, Gisle, Colin Millions, Gregory Wolfe II, Lenoir Preminger, Abel X, Matt Knights, Amjad Al Taleb, Ian Bruce, Kris Wolfgramm, 麒麟 于, Christopher Shaw, 靖羊, Tomas Grolmus, Essena O’Neill, Kyle Messner, Pedro Devoto, Mark Radford, Ann-Marie Denham, Davide Pluda, Rik Vermeer, Justin Ritchie, Nicole White, Whireds, Claus Vallø, Jason Talley, Andrew Wu, Christian Dechery, Michael Howell, Michal Hanus, Cavit, Amary Wenger, JDKBot, Jason Eads, FreedomEagleAmerica, Roberto Maddaloni, TiagoF11, Harsha CS, Abhimanyu Yadav, Tracy Tobkin, Mike Fuchs, Elizabeth Mart, Jacob Wenger, Jeff Udall, Ricardo Affonso, Mauro Boffardi, Audrin Navarro, Troy Ross, Keith Tims, Santiago Perez, James, Jack Devlin, Chris Peters, Kenny Martin, Frederick Pickering, Lena Savelyeva, Ian Seale, Charles Ju, Brett Haugen, David Ramsey, Benjamin Dittes, Michelle Schoen, Albert Harguindey Sanchez, Michael King, Alex Kyriacou Alla Khvatova Thomas Rowan, Siim Sillamaa, David Bennell, Janzen,Bryn Farnsworth, Adam Recvlohe, Manuel Arredondo, Fred McIntyre, Maldock Manrique, Дмитрий, Ishita Bisht, Jake Ludwig, Zach Seggie, Casey Sloan, Myndert Papenhuyzen, rheingold3, AncientCulture, Orion Mondragon, Jan, Michael Kuperman, Alexander Argyropoulos Quantum Computers Explained – Limits of Human Technology Help us caption & translate this video! http://www.youtube.com/timedtext_cs_panel?c=UCsXVk37bltHxD1rDPwtNM8Q&tab=2
Lecture 1 | Quantum Information (PSI 17/18, Review) - Daniel Gottesman (Perimeter) 2018.2.20 11:30
 
01:00:41
Quantum Information (PSI 17/18, Review, PHYS 635) - Daniel Gottesman (Perimeter Institute) ▶ https://www.youtube.com/playlist?list=PLFMKfDJ8QzbMH2Fihc2Lrua9IgrWhQSee Lecture 1 Reversible computation, quantum gates Lecture 2 Universal gate sets, no-cloning theorem, teleportation, distance between quantum states (fidelity and trace distance) Lecture 3 DiVincenzo Criteria, Ion traps Lecture 4 Superconducting qubits Lecture 5 Complexity theory, Church-Turing thesis Lecture 6 Oracle model, Deutsch-Jozsa algorithm Lecture 7 Public key cryptography, RSA, period finding, overview of Shor's algorithm Lecture 8 Shor's algorithm Lecture 9 Grover's algorithm Lecture 10 Error correcting codes Lecture 11 Stabilizer codes, CSS codes, Fault tolerance Lecture 12 Quantum Key Distribution Lecture 13 Von Neumann entropy, Data compression, Quantum compression Lecture 14 Quantum channel capacity, Entanglement monotones 《Perimeter Scholars International (PSI) 2017-2018》 Full Programme: ▶ https://www.youtube.com/playlist?list=PLFMKfDJ8QzbNtOZc-duaUXBw7j_UvnvMg Core Topics (1)-(6): 1. Relativity (PHYS 604) - Neil Turok (Perimeter) ▶ https://www.youtube.com/playlist?list=PLFMKfDJ8QzbPzu2D5e0sy0CPvDokjHICQ 2. Quantum Theory (PHYS 605) - Joseph Emerson (Waterloo) ▶ https://www.youtube.com/playlist?list=PLFMKfDJ8QzbNtyWINH1W7ZmBv7y2BsD-M 3. Quantum Field Theory I (PHYS 601) - Dan Wohns & Tibra Ali (Perimeter) ▶ https://www.youtube.com/playlist?list=PLFMKfDJ8QzbOn3a1IB3uPG3vVHEKbemqB 4. Statistical Mechanics (PHYS 602) - David Kubiznak & Lauren Hayward Sierens (Perimeter) ▶ https://www.youtube.com/playlist?list=PLFMKfDJ8QzbMME6kmQNLJrnpxfn4ff4YU 5. Quantum Field Theory II (PHYS 603) - Francois David (CEA, Saclay) ▶ https://www.youtube.com/playlist?list=PLFMKfDJ8QzbOLdq8CAmeaLcMJIctUB9lz 6. Condensed Matter I (PHYS 611) - Rakesh Tiwari (Basel) ▶ https://www.youtube.com/playlist?list=PLFMKfDJ8QzbOiNJsx2se2-lm4cBBG74oq Reviews (7)-(15): 7. Standard Model (PHYS 622) - Sean Tulin (York) ▶ https://www.youtube.com/playlist?list=PLFMKfDJ8QzbPFvjsHPK7JW2op6rOkAAGd 8. Gravitational Physics (PHYS 636) - Ruth Gregory (Durham) ▶ https://www.youtube.com/playlist?list=PLFMKfDJ8QzbMH82adqat52KFVLNe_K4dw 9. Condensed Matter II (PHYS 637) - Alioscia Hamma (Perimeter) ▶ https://www.youtube.com/playlist?list=PLFMKfDJ8QzbO6hLC4NHszwUburFTzaQO- 10. Quantum Field Theory III (PHYS 777) - Jaume Gomis, Gang Xu & Dan Wohns (Perimeter) ▶ https://www.youtube.com/playlist?list=PLFMKfDJ8QzbOZlLFXkZxCWk2mKXIue8QF 11. Foundations of Quantum Mechanics (PHYS 639) - Lucien Hardy & Robert Spekkens (Perimeter) ▶ https://www.youtube.com/playlist?list=PLFMKfDJ8QzbOO1Cro-njvuH-s23VWze31 12. Cosmology (PHYS 621) - David Kubiznak (Perimeter) ▶ https://www.youtube.com/playlist?list=PLFMKfDJ8QzbM9Im5wHNd1SS_fJvNW7xfV 13. Beyond the Standard Model (PHYS 777) - Cliff Burgess (McMaster) ▶ https://www.youtube.com/playlist?list=PLFMKfDJ8QzbMHLQMWW4nZ0bkKbXcjDoPF 14. String Theory (PHYS 623) - Davide Gaiotto (Perimeter) ▶ https://www.youtube.com/playlist?list=PLFMKfDJ8QzbPsOcfOHio6EP8IhPNjdpS9 15. Quantum Information (PHYS 635) - Daniel Gottesman (Perimeter) ▶ https://www.youtube.com/playlist?list=PLFMKfDJ8QzbMH2Fihc2Lrua9IgrWhQSee Explorations (16)-(21): 16. Relativistic Quantum Information (PHYS 641) - Eduardo Martin-Martinez (Waterloo) ▶ https://www.youtube.com/playlist?list=PLFMKfDJ8QzbMLiVqu85axDb6Ttolu13oI 17. Explorations in Quantum Gravity (PHYS 650) - Maite Dupuis (Waterloo) ▶ https://www.youtube.com/playlist?list=PLFMKfDJ8QzbNv3kB68TC21i3VOBfvLL0W 18. Quantum Integrable Models (PHYS 777) - Alex Weekes & Kevin Costello (Perimeter) ▶ https://www.youtube.com/playlist?list=PLFMKfDJ8QzbPyh0E4g9C-RPZtrqtCINYt 19. Machine Learning for Many Body Physics (PHYS 777) - Lauren Hayward Sierens & Juan Carrasquilla (Perimeter), Roger Melko & Giacomo Torlai (Waterloo) ▶ https://www.youtube.com/playlist?list=PLFMKfDJ8QzbO99GSr1ns6NFTtb7ynjl18 20. Explorations in Cosmology (PHYS 649) - Kendrick Smith (Waterloo) ▶ https://www.youtube.com/playlist?list=PLFMKfDJ8QzbMnwJvT7_4RdwRQeOry7-59 21. Scattering Amplitudes in QFT & String Theory (PHYS 777) - Freddy Cachazo (Perimeter), Eduardo Casali (Oxford), Piotr Tourkine (CERN), Thales Azevedo (Uppsala), Yvonne Geyer & Nima Arkani-Hamed (IAS, Princeton), Oliver Schlotterer (Max Planck Institute) ▶ https://www.youtube.com/playlist?list=PLFMKfDJ8QzbPtYBvd06Xhbk8dXqUw_WZV 《PSI 17/18 Front End Courses》 Full Programme: ▶ https://www.youtube.com/playlist?list=PLFMKfDJ8QzbOHVKlxe88CFCWMjJ8XPOxJ 1. Theoretical Mechanics - David Kubiznak (Perimeter) 2. Lie Groups & Lie Algebras - Maite Dupuis (Waterloo) 3. Special Topics in Quantum Theory - Agata Branczyk (Perimeter) 4. Introduction to Mathematical Computing - Erik Schnetter (Perimeter) 5. Functions, "Functions", etc. - Dan Wohns (Perimeter)
Quantum Computing - The Qubit Technology Revolution
 
01:03:48
One of the strangest features of quantum mechanics is also potentially its most useful: entanglement. By harnessing the ability for two particles to be intimately intertwined across great distances, researchers are working to create technologies that even Einstein could not imagine, from quantum computers that can run millions of calculations in parallel, to new forms of cryptography that may be impossible to crack. Join us as we explore the coming age of quantum technology, which promises to bring with it a far deeper understanding of fundamental physics. PARTICIPANTS: Jerry Chow, Julia Kempe, Seth Lloyd, Kathy-Anne Soderberg MODERATOR: George Musser Original program date: JUNE 3, 2017 FIND OUT MORE ABOUT THE PROGRAM AND PARTICIPANTS: https://www.worldsciencefestival.com/programs/the-qubit-revolution/ This program is part of the Big Ideas Series, made possible with support from the John Templeton Foundation. SUBSCRIBE to our YouTube Channel for all the latest from WSF VISIT our Website: http://www.worldsciencefestival.com/ LIKE us on Facebook: https://www.facebook.com/worldsciencefestival FOLLOW us on Twitter: https://twitter.com/WorldSciFest Introduction of Participants 00:25 Program Begins: Quantum mechanics, weird or unfamiliar? 01:38 How much power is 20 Qubit's? 10:28 What are the pros and cons of Superconducting quantum computing? 25:55 The factorization problem 40:01 Is there a relationship between quantum computing and machine learning? 48:31 Q & A 54:17 This program was filmed live at the 2017 World Science Festival and edited for YouTube.
Views: 48204 World Science Festival
Hamming Code -  Simply Explained
 
03:37
Hamming Code Simply Explained ( Tutorial Video ) Calculating the Hamming Code: The key to the Hamming Code is the use of extra parity bits to allow the identification of a single error. Create the code word as follows: 1. Mark all bit positions that are powers of two as parity bits. (positions 1, 2, 4, 8, 16, 32, 64, etc.) 2. All other bit positions are for the data to be encoded. (positions 3, 5, 6, 7, 9, 10, 11, 12, 13, 14, 15, 17, etc.) 3. Each parity bit calculates the parity for some of the bits in the code word. The position of the parity bit determines the sequence of bits that it alternately checks and skips. Position 1: check 1 bit, skip 1 bit, check 1 bit, skip 1 bit, etc. (1,3,5,7,9,11,13,15,...) Position 2: check 2 bits, skip 2 bits, check 2 bits, skip 2 bits, etc. (2,3,6,7,10,11,14,15,...) Position 4: check 4 bits, skip 4 bits, check 4 bits, skip 4 bits, etc. (4,5,6,7,12,13,14,15,20,21,22,23,...) Position 8: check 8 bits, skip 8 bits, check 8 bits, skip 8 bits, etc. (8-15,24-31,40-47,...) Position 16: check 16 bits, skip 16 bits, check 16 bits, skip 16 bits, etc. (16-31,48-63,80-95,...) Position 32: check 32 bits, skip 32 bits, check 32 bits, skip 32 bits, etc. (32-63,96-127,160-191,...) etc. 4. Set a parity bit to 1 if the total number of ones in the positions it checks is odd. Set a parity bit to 0 if the total number of ones in the positions it checks is even. Simple method , easy method , animation , calculate
Views: 217914 Jithesh Kunissery
Network Security - Symmetric Key Algorithm
 
08:41
Fundamentals of Computer Network Security This specialization in intended for IT professionals, computer programmers, managers, IT security professionals who like to move up ladder, who are seeking to develop network system security skills. Through four courses, we will cover the Design and Analyze Secure Networked Systems, Develop Secure Programs with Basic Cryptography and Crypto API, Hacking and Patching Web Applications, Perform Penetration Testing, and Secure Networked Systems with Firewall and IDS, which will prepare you to perform tasks as Cyber Security Engineer, IT Security Analyst, and Cyber Security Analyst. course 2 Basic Cryptography and Programming with Crypto API: About this course: In this MOOC, we will learn the basic concepts and principles of cryptography, apply basic cryptoanalysis to decrypt messages encrypted with mono-alphabetic substitution cipher, and discuss the strongest encryption technique of the one-time-pad and related quantum key distribution systems. We will also learn the efficient symmetric key cryptography algorithms for encrypting data, discuss the DES and AES standards, study the criteria for selecting AES standard, present the block cipher operating modes and discuss how they can prevent and detect the block swapping attacks, and examine how to defend against replay attacks. We will learn the Diffie-Hellman Symmetric Key Exchange Protocol to generate a symmetric key for two parties to communicate over insecure channel. We will learn the modular arithmetic and the Euler Totient Theorem to appreciate the RSA Asymmetric Crypto Algorithm, and use OpenSSL utility to realize the basic operations of RSA Crypto Algorithm. Armed with these knowledge, we learn how to use PHP Crypto API to write secure programs for encrypting and decrypting documents and for signing and verify documents. We then apply these techniques to enhance the registration process of a web site which ensures the account created is actually requested by the owner of the email account. Module 2 - Symmetric Key Cryptography In this module we present the basic mechanism of symmetric key crytography algorithms, discuss the DES and AES standard, describe the criteria for selecting AES standard, present the block cipher operating modes and discuss how the block swapping attacks and replay attacks can be prevented and detected. Learning Objectives • Understand the criteria for selecting crypto algorithms • Perform cryptoanalysis on simple ciphers • Select operating modes for symmetric encryption and to prevent block swapping and replay attacks • Understand DES and AES standards and their buildig blocks Subscribe at: https://www.coursera.org
Views: 398 intrigano
Post quantum signatures | Melissa Chase (Microsoft Research) | RWC 2018
 
28:39
Technical talks from the Real World Crypto conference series.
Views: 877 Real World Crypto
Jan 12 Fernando Pastawski."Holographic quantum error- correcting codes.." (Part 2)
 
04:11
QIP 2016, Banff, 10-16 January 2016 Date: 12 Jan 2016 Title: "Holographic quantum error- correcting codes: toy models for the bulk/boundary correspondence" Authors: Fernando Pastawski, Beni Yoshida, Daniel Harlow and John Preskill. We propose a novel tensor network construction of quantum error-correcting codes inspired by properties of the celebrated holographic correspondence. Our building block is a special family of tensors with multiple indices of equal dimension and admitting a unitary interpretation for any balanced index bipartition. By properly identifying uncontracted indices as input or output, the entire tensor network can be interpreted as an isometry, an encoding map for a quantum error-correcting code. The resulting isometry captures key features of the holographic (bulk/boundary) correspondence. In particular, we provide a systematic procedure for representing logical operators on specific subsets of physical qubits which we call the greedy reconstruction algorithm. This procedure, mimics the Rindler-wedge reconstruction present in holography and explicitly realizes the connection with quantum codes proposed by Almheiri et al.. Furthermore, by interpreting the graph structure of a tensor network as a discrete geometry, we make contact with a holographic statement due to Ryu and Takayanagi relating entanglement with minimal surfaces. Namely, under simple graph theoretic assumptions, we prove a max-flow/min-cut statement by which the entanglement of a sub-region is equal to the minimal number of cuts needed to disconnect the region from its complement. The proposed framework provides a flexible way to design novel quantum codes, allows explicitly realizing tailored entanglement structures. http://arxiv.org/abs/1503.06237
Views: 101 Iqst Ucalgary
Privacy Amplification by Sampling and Renyi Differential Privacy
 
50:21
Yu-Xiang Wang (UC Santa Barbara) Privacy and the Science of Data Analysis https://simons.berkeley.edu/talks/tbd-43
Views: 105 Simons Institute
Daniel Lidar: "Quantum Information Processing: Are We There Yet?"
 
01:14:11
Daniel Lidar visited the Quantum AI Lab at Google LA to give a talk: "Quantum Information Processing: Are We There Yet?" This talk took place on January 22, 2015. Abstract: Quantum information processing holds great promise, yet large-scale, general purpose quantum computers capable of solving hard problems are not yet available despite 20+ years of immense effort. In this talk I will describe some of this promise and effort, as well as the obstacles and ideas for overcoming them using error correction techniques. I will focus on a special purpose quantum information processor called a quantum annealer, designed to speed up the solution to tough optimization problems. In October 2011 USC and Lockheed-Martin jointly founded a quantum computing center housing a commercial quantum annealer built by the Canadian company D-Wave Systems. A similar device is operated by NASA and Google. These processors use superconducting flux qubits to minimize the energy of classical spin-glass models with as many spins as qubits, an NP-hard problem with numerous applications. There has been much controversy surrounding the D-Wave processors, questioning whether they offer any advantage over classical computing. I will survey the recent work we have done to benchmark the processors against highly optimized classical algorithms, to test for quantum effects, and to perform error correction. Bio: Daniel Lidar has worked in quantum computing for nearly 20 years. He is a professor of electrical engineering, chemistry, and physics at USC, and hold a Ph.D. in physics from the Hebrew University of Jerusalem. His work revolves around various aspects of quantum information science, including quantum algorithms, quantum control, the theory of open quantum systems, and theoretical as well as experimental adiabatic quantum computation. He is a Fellow of the AAAS, APS, and IEEE. Lidar is the Director of the USC Center for Quantum Information Science and Technology, and is the Scientific Director of the USC-Lockheed Martin Center for Quantum Computing. Two of his former graduate students are now research scientists at Google’s quantum artificial intelligence lab.
Views: 13840 GoogleTechTalks
John Preskill - Introduction to Quantum Information (Part 1) - CSSQI 2012
 
01:00:27
John Preskill, Richard P. Feynman Professor of Theoretical Physics at the California Institute of Technology, gave a lecture about Introduction to Quantum Information. The lecture is the first of two parts, and was filmed at the Canadian Summer School on Quantum Information, held at the University of Waterloo in June of 2012. Find out more about IQC! Website - https://uwaterloo.ca/institute-for-quantum-computing/ Facebook - https://www.facebook.com/QuantumIQC Twitter - https://twitter.com/QuantumIQC
Panel Discussion: Is the World Ready for Quantum Technology? Benefits, Challenges, Applications.
 
51:08
Panel Discussion with leading Quantum computing technology experts exploring its future: challenges, applications, potential benefits, and threats. Panel participants Andrew Lord, Head of Optics at BT Kelly Richdale, VP Quantum Safe Security at ID Quantique Prof. Keith Martin, Information Security, Royal Holloway, UoL Richard Murray, Lead Technologist at Innovate UK Shadi Razak, CTO at CyNation Quantum technology is a technical reality and not a science fiction, and its certain uses are already revenue generating. £270m government investment into quantum computing technologies in 2013 was a great move, however, more must be invested if UK wants to further fuel its ambition of becoming a global leader and pioneer the industry. The ethical issues are going to be particularly important. The capability of a quantum computer to undermine most public-key cryptography (PKC) in use today, presents a serious challenge to society and, arguably, could prevent the technology from further commercialisation. Having said that, other technologies such as Artificial Intelligence are also contributing to this ethical challenge for economy and society. The ability to break PKC drives a massive research initiative to build new public key encryption algorithms and other cryptographic tools to safeguard data in a quantum computing world. However, another broadly used symmetric type of cryptography is quantum safe already and will be refined even further. Developing quantum algorithms will help financial sectors to conduct highly accurate financial modelling as well as predict future events in trading. A quantum computer can process a vast number of calculations simultaneously, analyse very complex variables, and build precise predictive models from complex data. This can be applied in weather forecasting, traffic management or route planning, to name a few. The issue of cybersecurity in the quantum age is manifold and strongly associated with the vulnerability of public key cryptography in use today in most infrastructures and systems. On the one hand, we do not know how much time it will take two or three major players to dominate the market and potentially break them; or whether it is going to happen at all – currently there is no a universal quantum computer having this capability. On the other hand, quantum-enabled security itself will offer 100% bullet-proof protection guaranteed by the laws of physics. Quantum enabled algorithms will enable organisations to rapidly detect infinite number of manifestations of malicious behaviours and fraud scenarios, making an attack non-viable. A powerful enough quantum computer to threaten cryptographic standards, will be put under lots of control and its owner may well face strong headwinds to get export clearance for its technology. However, since we do not have a “United Nations” of Cybersecurity or a single global regulator, we need to look very seriously at how to avoid the risk for public safety, and make sure the world is secure before quantum computers are unleashed. The other use cases of quantum we look forward to see in the future: • Quantum Artificial Intelligence application in scientific discovery, biotech and biological systems modelling; • Quantum simulation to accelerate the design of quantum electronic devices beyond the reach of supercomputers; • Quantum chemistry to design drugs in the form of small molecules to fight cancer; • Quantum gravity sensing devices to precisely analyse underground infrastructure and its composition; • Quantum glasses for the blind to recreate the surrounding environment within a certain distance. • Quantum PUF (physical unclonable function) to prevent counterfeit drugs; Stay tuned as more uses are coming! One will not have to be a quantum physicist to use them.
Views: 105 CyNation
Shoucheng Zhang: "Quantum Computing, AI and Blockchain: The Future of IT" | Talks at Google
 
58:10
Prof. Shoucheng Zhang discusses three pillars of information technology: quantum computing, AI and blockchain. He presents the fundamentals of crypto-economic science, and answers questions such as: What is the intrinsic value of a medium of exchange? What is the value of consensus and how does it emerge? How can math be used to create distributed self-organizing consensus networks to create a data-marketplace for AI and machine learning? Prof. Zhang is the JG Jackson and CJ Wood professor of physics at Stanford University. He is a member of the US National Academy of Science, the American Academy of Arts and Sciences and a foreign member of the Chinese Academy of Sciences. He discovered a new state of matter called topological insulator in which electrons can conduct along the edge without dissipation, enabling a new generation of electronic devices with much lower power consumption. For this ground breaking work he received numerous international awards, including the Buckley Prize, the Dirac Medal and Prize, the Europhysics Prize, the Physics Frontiers Prize and the Benjamin Franklin Medal. He is also the founding chairman of DHVC venture capital fund, which invests in AI, blockchain, mobile internet, big data, AR/VR, genomics and precision medicine, sharing economy and robotics.
Views: 93186 Talks at Google
Quantum computation ( Lecture 01) by Peter Young
 
01:23:58
ORGANIZERS : Abhishek Dhar and Sanjib Sabhapandit DATE : 27 June 2018 to 13 July 2018 VENUE : Ramanujan Lecture Hall, ICTS Bangalore This advanced level school is the ninth in the series. This is a pedagogical school, aimed at bridging the gap between masters-level courses and topics in statistical physics at the frontline of current research. It is intended for Ph.D. students, post-doctoral fellows and interested faculty members at the college and university level. The following courses will be offered.​ Preparatory​ lecturers by Abhishek​ Dhar​ ​(ICTS) and​ Sanjib​ Sabhapandit (RRI) Stochastic​ density​ functional​ theory​ for​ interacting​ Brownian​ particles by David​ ​Dean​ (Bordeaux,​ France) Mechanics​ of​ wrinkling,​ folding,​ and​ crumpling by Narayanan​ ​Menon​ (UMASS,​ USA) Network Dynamics by Sandeep Krishna (NCBS) and Shashi Thutupalli (NCBS-ICTS) Quantum​ computation by Peter​ ​Young​ (UCSC,​ USA) Quantum​ chaos,​ random​ matrices​ and​ statistical​ physics by Arul​ ​Lakshminarayan​ (IIT​ Madras,​ Chennai) Interacting​ particle​ systems by Anupam​​ Kundu​ (ICTS,​ Bangalore) PROGRAM LINK : https://www.icts.res.in/program/bssp2018
The Learning with Rounding Problem: Reductions and Applications
 
57:51
In this talk I will survey a recently introduced cryptographic problem called Learning with Rounding (LWR). I will show reductions from and to the more well-established Learning with Errors (LWE) problem, and demonstrate the applicability of LWR to the construction of efficient Pseudorandom Functions and other cryptographic primitives.
Views: 261 Microsoft Research
Confidentiality In A Post Quantum World: the case of LEDAkem and LEDApkc
 
57:51
A Google TechTalk, 2018-12-05, presented by Alessandro Barenghi ABSTRACT: This talk will present LEDAkem and LEDApkc, a key agreement scheme and a public key encryption scheme resistant against attacks with both classical and quantum computers. In this talk I will present the schemes and report recent results on how we can automatically generate key sizes and cryptosystem parameters tailored for a desired security level, providing practical performance figures. About the speaker: Alessandro Barenghi is currently assistant professor at Politecnico di Milano, and one of the proposers of the LEDAkem/LEDApkc cryptoschemes to the NIST post-quantum standardization initiative.
Views: 1171 GoogleTechTalks
Programming a quantum computer with Cirq (QuantumCasts)
 
10:40
Want to learn how to program a quantum computer using Cirq? In this episode of QuantumCasts, Dave Bacon (Twitter: @dabacon) teaches you what a quantum program looks like via a simple “hello qubit” program. You’ll also learn about some of the exciting challenges facing quantum programmers today, such as whether Noisy Intermediate-Scale Quantum (NISQ) processors have the ability to solve important practical problems. We’ll also delve a little into how the open source Python framework Cirq was designed to help answer that question. Follow these instructions to install Cirq → http://bit.ly/2IermSw Need to catch up? Watch every episode of QuantumCasts here → http://bit.ly/2Pw0xay Learn about the Google AI Quantum team → http://bit.ly/2DnvKLy Subscribe to the TensorFlow channel→ http://bit.ly/TensorFlow1
Views: 7332 TensorFlow
What is information theory? | Journey into information theory | Computer Science | Khan Academy
 
03:26
A broad introduction to this field of study Watch the next lesson: https://www.khanacademy.org/computing/computer-science/informationtheory/info-theory/v/language-of-coins-2-8-proto-writing?utm_source=YT&utm_medium=Desc&utm_campaign=computerscience Missed the previous lesson? https://www.khanacademy.org/computing/computer-science/cryptography/random-algorithms-probability/v/fermat-primality-test-prime-adventure-part-10?utm_source=YT&utm_medium=Desc&utm_campaign=computerscience Computer Science on Khan Academy: Learn select topics from computer science - algorithms (how we solve common problems in computer science and measure the efficiency of our solutions), cryptography (how we protect secret information), and information theory (how we encode and compress information). About Khan Academy: Khan Academy is a nonprofit with a mission to provide a free, world-class education for anyone, anywhere. We believe learners of all ages should have unlimited access to free educational content they can master at their own pace. We use intelligent software, deep data analytics and intuitive user interfaces to help students and teachers around the world. Our resources cover preschool through early college education, including math, biology, chemistry, physics, economics, finance, history, grammar and more. We offer free personalized SAT test prep in partnership with the test developer, the College Board. Khan Academy has been translated into dozens of languages, and 100 million people use our platform worldwide every year. For more information, visit www.khanacademy.org, join us on Facebook or follow us on Twitter at @khanacademy. And remember, you can learn anything. For free. For everyone. Forever. #YouCanLearnAnything Subscribe to Khan Academy’s Computer Science channel: https://www.youtube.com/channel/UC8uHgAVBOy5h1fDsjQghWCw?sub_confirmation=1 Subscribe to Khan Academy: https://www.youtube.com/subscription_center?add_user=khanacademy
Views: 154870 Khan Academy Labs
Continuous variable entropic uncertainty - Fabian Furrer
 
24:19
Fabian Furrer of Institut für Theoretische Physik, Universität Hannover and the University of Tokyo presented: Continuous variable entropic uncertainty relations in the presence of quantum memory on behalf of his co-authors Mario Berta (Institut für Theoretische Physik, ETH Zürich), Matthias Christandl (Institut für Theoretische Physik, ETH Zürich), Volkher Schultz (Institut für Theoretische Physik, ETH Zürich) and Marco Tomamichel (Centre for Quantum Technologies, National University of Singapore) at the 2013 QCrypt Conference in August. http://2013.qcrypt.net Find out more about IQC! Website - https://uwaterloo.ca/institute-for-quantum-computing/ Facebook - https://www.facebook.com/QuantumIQC Twitter - https://twitter.com/QuantumIQC
Realizing quantum solutions today with Quantum Inspired Optimization and the - BRK2033
 
56:42
Join our partner 1QBit to look at how quantum computing can solve real world problems in Chemistry using Q# and the new quantum libraries. And join our Quantum Inspired Optimization (QIO) team to learn how our current customers are using applications to find better classical solutions by looking at their quantum counterpart.
Views: 325 Microsoft Developer
Map of Computer Science
 
10:58
The field of computer science summarised. Learn more at this video's sponsor https://brilliant.org/dos Computer science is the subject that studies what computers can do and investigates the best ways you can solve the problems of the world with them. It is a huge field overlapping pure mathematics, engineering and many other scientific disciplines. In this video I summarise as much of the subject as I can and show how the areas are related to each other. You can buy this poster here: North America: https://store.dftba.com/products/map-of-computer-science-poster Everywhere else: https://www.redbubble.com/people/dominicwalliman/works/27929629-map-of-computer-science?p=poster&finish=semi_gloss&size=small Get all my other posters here: https://www.redbubble.com/people/dominicwalliman A couple of notes on this video: 1. Some people have commented that I should have included computer security alongside hacking, and I completely agree, that was an oversight on my part. Apologies to all the computer security professionals, and thanks for all the hard work! 2. I also failed to mention interpreters alongside compilers in the complier section. Again, I’m kicking myself because of course this is an important concept for people to hear about. Also the layers of languages being compiled to other languages is overly convoluted, in practice it is more simple than this. I guess I should have picked one simple example. 3. NP-complete problems are possible to solve, they just become very difficult to solve very quickly as they get bigger. When I said NP-complete and then "impossible to solve", I meant that the large NP-complete problems that industry is interested in solving were thought to be practically impossible to solve. And free downloadable versions of this and the other posters here. If you want to print them out for educational purposes please do! https://www.flickr.com/photos/[email protected]/ Thanks so much to my supporters on Patreon. If you enjoy my videos and would like to help me make more this is the best way and I appreciate it very much. https://www.patreon.com/domainofscience I also write a series of children’s science books call Professor Astro Cat, these links are to the publisher, but they are available in all good bookshops around the world in 18 languages and counting: Frontiers of Space (age 7+): http://nobrow.net/shop/professor-astro-cats-frontiers-of-space/ Atomic Adventure (age 7+): http://nobrow.net/shop/professor-astro-cats-atomic-adventure/ Intergalactic Activity Book (age 7+): http://nobrow.net/shop/professor-astro-cats-intergalactic-activity-book/ Solar System Book (age 3+, available in UK now, and rest of world in spring 2018): http://nobrow.net/shop/professor-astro-cats-solar-system/? Solar System App: http://www.minilabstudios.com/apps/professor-astro-cats-solar-system/ And the new Professor Astro Cat App: https://itunes.apple.com/us/app/galactic-genius-with-astro-cat/id1212841840?mt=8 Find me on twitter, Instagram, and my website: http://dominicwalliman.com https://twitter.com/DominicWalliman https://www.instagram.com/dominicwalliman https://www.facebook.com/dominicwalliman
Views: 1738763 Domain of Science
Large Modulus Ring LWE ^= Module LWE
 
18:27
Paper by Martin R. Albrecht and Amit Deo, presented at Asiacrypt 2017. See https://www.iacr.org/cryptodb/data/paper.php?pubkey=28290
Views: 67 TheIACR
What is Quantum Computing? - EEs Talk Tech Electrical Engineering Podcast #15
 
23:49
What is a quantum computer and what is quantum computing? Click to subscribe! ► http://bit.ly/Scopes_Sub ◄ Full agenda below! https://eestalktech.com/what-is-quantum-computing Twitter: @Keysight_Daniel https://twitter.com/Keysight_Daniel Learn more about using oscilloscopes: http://oscilloscopelearningcenter.com Check out the EEs Talk Tech electrical engineering podcast: https://eestalktech.com The 2-Minute Guru Season 2 playlist: https://www.youtube.com/playlist?list=PLzHyxysSubUlqBguuVZCeNn47GSK8rcso More about Keysight oscilloscopes: http://bit.ly/SCOPES Check out our blog: http://bit.ly/ScopesBlog Agenda: 0:45 Intro Lee Barford's job is to help to guide Keysight into the quantum computing industry and enable quantum computing experts 2:00 Why is quantum computing/a quantum computer important? Clock rates for digital processors stopped getting faster around 2006 because of excessive heat The processor manufacturers realized they needed more processor parallelism Graphics processor units (GPUs) can be used as vector and matrix computational machines Bitcoin utilizes this method. 6:00 What does the development of quantum computing and quantum computers mean for the future? Gates being made with feature size of the digital transistor that have an effective gate length of down to 7 nm Now we're pushing below 5 nm, and there are not many unit cells of silicon left in the layer. (one unit cell of silicon is 0.5 nanometer) The Heisenberg uncertainty principle comes into play at this point because there are few enough atoms that quantum mechanical effects will disturb electronics. These quantum mechanical effects include a superposition of states (Schrodinger's cat) and low error tolerance. 10:20 When will Moore's law fail?  Quantum computing and quantum computers are one way of moving the computing industry past this barrier by taking advantage of quantum effects - engineering with them - to build a quantum computer that will do certain tasks much faster than today's computers. 15:20 Questions for future episodes: What sort of technology does it take to make a quantum computer? Where are current experiments probing? Why are people funding quantum computing research and the building of quantum computers? What problems are quantum computing (and quantum computers) working to solve? 17:30 Using quantum effects Quantum computers probably won't be used in consumer devices because it currently requires a very low temperature and/or a vacuum. 18:00 The quantum computer's fundamental storage unit is a qubit (quantum bit). It can be in states 1 or 0 with some finite probability 19:00 You can set up a quantum register to store multiple potential qubits, and when read out, have an identical probability to be either of these numbers. A quantum register can store multiple states at once, but only one register value can be read out of the quantum register. 21:00 How do you get the desired value out of a quantum register? You do as much of the computation ahead of time and then read the quantum computers quantum register. It works because the answer is either such a high probability to be correct that you don't need to check it, or it is very easy to double check if the answer is correct. 21:00 How do you get the desired value out of a quantum register? You do as much of the computation ahead of time and then read the quantum computers quantum register. 22:30 Quantum computers are good at factoring very large numbers (breaking RSA in cryptography) #oscilloscope #oscilloscopes #electronics #electricalengineering
Views: 1814 Keysight Labs
SFI Community Lecture - Christopher Monroe - Quantum Computers
 
01:09:34
Quantum computers exploit the bizarre features of quantum mechanics to perform tasks that are impossible using conventional means. Sending instantaneous messages across long distances or quickly computing over ungodly amounts of data are just two possibilities that arise if we can design computers to exploit quantum uncertainty, entanglement, and measurement. In this SFI Community Lecture, scientist Christopher Monroe describes the architecture of a quantum computer based on individual atoms, suspended and isolated with electric fields, and individually addressed with laser beams. This leading physical representation of a quantum computer has allowed demonstrations of small algorithms and emulations of hard quantum problems with more than 50 quantum bits. While this system can solve some esoteric tasks that cannot be accomplished in conventional devices, it remains a great challenge to build a quantum computer big enough to be useful for society. But the good news is that we don’t see any fundamental limits to scaling atomic quantum computers, and Monroe speculates as to how this might happen. Christopher Monroe is a leading atomic physicist and quantum information scientist. He demonstrated the first quantum gate realized in any system at the National Institute of Standards and Technology (NIST) in the 1990s, and at University of Michigan and University of Maryland he discovered new ways to scale trapped ion qubits and simplify their control with semiconductor chip traps, simplified lasers, and photonic interfaces for long-distance entanglement. He received the American Physical Society I.I. Rabi Prize and the Arthur Schawlow Laser Science Prize, and has been elected into the National Academy of Sciences. He is Co-Founder and Chief Scientist at IonQ in College Park, MD.
Views: 1115 Santa Fe Institute
The Ultraviolet Catastrophe
 
06:32
How did the field of quantum mechanics come about in the first place? The Rayleigh-Jeans catastrophe, also known as the ultraviolet catastrophe was a prediction by the Rayleigh-Jeans law that a blackbody would radiate infinite amounts of ultraviolet light. It wasn’t until Max Planck came along and predicted that light came in packets or quanta that the field of quantum mechanics emerged and unintentionally solved the ultraviolet catastrophe. Help us translate our videos! http://www.youtube.com/timedtext_cs_panel?c=UC7DdEm33SyaTDtWYGO2CwdA&tab=2 Creator: Dianna Cowern Editor: Jabril Ashe Writer: Sophia Chen Animations: Jabril Ashe/Kyle Norby Thanks to Ashley Warner and Kyle Kitzmiller http://physicsgirl.org/ http://twitter.com/thephysicsgirl http://facebook.com/thephysicsgirl http://instagram.com/thephysicsgirl Subscribe to Physics Girl for more fun physics! Music: APM
Views: 514348 Physics Girl
Minimum Rényi Correlation Principle: From Marginals to Joint Distribution
 
21:17
Farzan Farnia, Stanford University Information Theory, Learning and Big Data http://simons.berkeley.edu/talks/farzan-farnia-2015-03-17
Views: 731 Simons Institute
Constant-Time Discrete Gaussian Sampling (1118)
 
05:57
Sampling from a discrete Gaussian distribution is an indispensable part of lattice-based cryptography. Several recent works have shown that the timing leakage from a non-constant-time implementation of the discrete Gaussian sampling algorithm could be exploited to recover the secret.
Views: 155 ieeeComputerSociety
What is EOS?
 
16:22
EOS is a decentralized web-application tool that is a direct rival to Ethereum. It has a similar model to ethereum, and does everything that Ethereum does, but better, and faster. It has nearly unlimited transactions per second to allow for EOS based applications to grow exponentially, and has a very nice growth potential from an investing standpoint. EOS uses Delegated Proof of Stake to validate transactions, along with a witness and stakeholder system Thank you to James for making a correction to the video: "EOS is not built on the backbone of Ethereum. It just uses the Ethereum system to manage the initial distribution of its tokens." Useful & Referenced Links: - https://eos.io/ - https://www.youtube.com/watch?v=QxKqKVsLYLA - https://steemit.com/eos/@theschrammhit001/why-eos-will-crush-ethereum - https://www.youtube.com/watch?v=uECDHQdeZHE - http://support.exodus.io/article/65-i-ve-received-eos-tokens-in-exodus-how-do-i-register-them If you enjoyed the video, please leave a like an subscribe! Follow me on Twitter: https://twitter.com/CryptoJebb?lang=en Sign up for Binance: https://www.binance.com/?ref=23699176 Sign up for Hashflare: https://hashflare.io/r/4C3A6AAF *I am not a financial adviser, this is not financial advice. All investments/trades/buys should be made at your own risk with your own capital* Spare Change? BTC 158kL4Tt7rTb9Z3D869PQLwqKFwSRjXnUa ETH 0x7F08D46Fcc3fFe420B7356D4a891E59653c18512 LTC LSPimHEkRZuSp9YWLVZsd97ZbrA9omjXT3 Please do not feel obligated to donate, though donations are appreciated!
Views: 598 Crypto Jebb
Amplifying Privacy in Privacy Amplification
 
17:51
Amplifying Privacy in Privacy Amplification by Leonid Reyzin, Yevgeniy Dodis, Divesh Aggarwal, Eric Miles, Zahra Jafargholi. Talk at Crypto 2014.
Views: 383 TheIACR
Extreme events in nature, rogue wave in optics, by J. Dudley
 
01:00:08
Understanding extreme events in nature is intrinsically challenging because the events themselves are rare, and often appear in environments where measurements are difficult. A particular case of interest concerns the infamous oceanic rogue or freak waves that have been associated with many catastrophic maritime disasters. There is a rigorous analogy between the physics of wave propagation on the ocean and light pulse propagation in optical fibre, and this has opened up possibilities to explore general properties of extreme value dynamics using a convenient benchtop optical environment. John Dudley is Professor of Physics at the University of Franche-Comté and the CNRS Institute FEMTO-ST in Besancon. His research covers broad areas of optical science. He was co-laureate of the ERC project MULTIWAVE and has won numerous awards and fellowships, including 3 Honorary Degrees, the Médaille d’Argent of the CNRS, and awards from SPIE, OSA, IOP and APS. He was President of the European Physical Society and in 2009, he initiated the International Year of Light.
AQA A’Level Encryption - Caesar cipher
 
03:17
AQA Specification Reference AS Level 3.5.6.8 A Level 4.5.6.10 Why do we disable comments? We want to ensure these videos are always appropriate to use in the classroom. However, we value your feedback, and are happy to consider amendments due to inaccuracies. Please get in touch with us directly at: [email protected] For all our support resources please visit: http://craigndave.org/ http://student.craigndave.org/
Views: 973 craigndave
A 0ne-pass Key Distribution Protocol Based on the Hamming Code
 
01:18
Encryption key distribution is a fundamental cryptographic research area. In this work, we present a one-pass key distribution protocol utilizing the Hamming Error Detection and Correction Code. The shared secret is a random string of bits. For high-security applications, this shared secret can be changed for generating a new key. For other types of applications, we show that this step is nonobligatory since the bit string is partially updated every time a new key is generated. Additionally, the Strict Avalanche Criteria (SAC) of any hash function design results in a change of 50% of the output bits for a one-bit change in the input to the hash function. Therefore, the shared secret is acquired only one time as an initial value (IV). It also serves as an authentication vehicle. The proposed technique uses simple arithmetic and logic operations that provide uncomplicated and efficient software and hardware implementations.
Views: 214 Magdy Saeb
The Cognitive and Computational Neuroscience of Categorization, Novelty-Detec...
 
01:02:14
Google Tech Talks November, 15 2007 ABSTRACT Neurocomputational models provide fundamental insights towards understanding the human brain circuits for learning new associations and organizing our world into appropriate categories. In this talk I will review the information-processing functions of four interacting brain systems for learning and categorization: (1) the basal ganglia which incrementally adjusts choice behaviors using environmental feedback about the consequences of our actions, (2) the hippocampus which supports learning in other brain regions through the creation of new stimulus representations (and, hence, new similarity relationships) that reflect important statistical regularities in the environment, (3) the medial septum which works in a feedback-loop with the hippocampus, using novelty-detection to alter the rate at which stimulus representations are updated through experience, (4) the frontal lobes which provide for selective attention and executive control of learning and memory. The computational models to be described have been evaluated through a variety of empirical methodoligies including human functional brain imaging, studies of patients with localized brain damage due to injury or early-stage neurodegenerative diseases, behavioral genetic studies of naturally-occuring individual variability, as well as comparative lesion and genetic studies with rodents. Our applications of these models to engineering and computer science including automated anomaly detection systems for mechanical fault diagnosis on US Navy helicopters and submarines as well more recent contributions to the DoD's DARPA program for Biologically Inspired Cognitive Architectures (BICA). Speaker: Dr. Mark Gluck Mark Gluck is a Professor of Neuroscience at Rutgers University - Newark, co-director of the Rutgers Memory Disorders Project, and publisher of the public health newsletter, Memory Loss and the Brain. He works at the interface between neuroscience, psychology, and computer science, where his research focuses on the neural bases of learning and memory, and the consequences of memory loss due to aging, trauma, and disease. He is the co-author of "Gateway to Memory: An Introduction to Neural Network Models of the Hippocampus and Memory " (MIT Press, 2001) and a forthcoming undergraduate textbook, "Learning and Memory: From Brain to Behavior." He has edited several other books and has published over 60 scientific journal articles. His awards include the Distinguished Scientific Award for Early Career Contributions from the American Psychological Society and the Young Investigator Award for Cognitive and Neural Sciences from the Office of Naval Research. In 1996, he was awarded a NSF Presidential Early Career Award for Scientists and Engineers by President Bill Clinton. For more information, see http://www.gluck.edu.
Views: 60323 GoogleTechTalks
a16z with Andreessen HorowitzPodcast: Quantum Computing, Now and Next
 
26:37
Moore's Law -- putting more and more transistors on a chip -- accelerated the computing industry by so many orders of magnitude, it has (and continues to) achieve seemingly impossible feats. However, we're now resorting to brute-force hacks to keep pushing it beyond its limits and are getting closer to the point of diminishing returns (especially given costly manufacturing infrastructure). Yet this very dynamic is leading to "a Cambrian explosion" in computing capabilities… just look at what's happening today with GPUs, FPGAs, and neuromorphic chips. Through such continuing performance improvements and parallelization, classic computing continues to reshape the modern world. But we're so focused on making our computers do more that we're not talking enough about what classic computers can't do -- and that's to compute things the way nature does, which operates in quantum mechanics. So our smart machines are really quite dumb, argues Rigetti Computing founder and CEO Chad Rigetti; they're limited to human-made binary code vs. the natural reality of continuous variables. This in turn limits our ability to work on problems that classic computers can't solve, such as key applications in computational chemistry or large-scale optimization for machine learning and artificial intelligence. Which is where quantum computing comes in. SUBCRIBE - https://goo.gl/aiECKP The a16z Podcast discusses tech and culture trends, news, and the future -- especially as ‘software eats the world’. It features industry experts, business leaders, and other interesting thinkers and voices from around the world. This podcast is produced by Andreessen Horowitz (aka “a16z”), a Silicon Valley-based venture capital firm. Multiple episodes are released every week; visit a16z.com for more details.
Adam Becker: "What is Real?" | Talks at Google
 
01:18:09
Adam Becker, PhD is an astrophysicist and science writer. His new book What Is Real? explores the history of quantum foundations and the questions that remain to be answered. Get the book: https://goo.gl/s2NGWM
Views: 9824 Talks at Google
INT 13-2a: Norm Tubman, Renyi Entropy
 
01:03:56
INT 13-2a: Norm Tubman, Renyi Entropy of Interacting Coulombic Systems
Views: 492 INT UW Seattle