Shared May 14, 2018
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/resea...
Lunch & Learn: Quantum Computing
P vs. NP and the Computational Complexity Zoo
The accelerating Universe: Nobel Laureate Brian Schmidt
What did NASA's New Horizons discover around Pluto?
1. Introduction to Human Behavioral Biology
How To Make a Quantum Bit
Artificial Intelligence, the History and Future - with Chris Bishop
Things you can make from old, dead laptops
💻 - See How Computers Add Numbers In One Lesson
What is a Quantum computer? How does Quantum Computer work?.
Measure for Measure: Quantum Physics and Reality
A Beginner’s Guide To Quantum Computing
Computing Limit - Computerphile
Will Quantum Computers break encryption?
The Mathematics of Quantum Computers | Infinite Series
Why Everything You Thought You Knew About Quantum Physics is Different - with Philip Ball
Can we make quantum technology work? | Leo Kouwenhoven | TEDxAmsterdam
This equation will change how you see the world