Quantum Computing for Computer Scientists

Name: Quantum Computing for Computer Scientists
Uploaded: 2018-05-14T00:00:00.000Z
Duration: 1 h 28 min 22 s
Description: This talk proves a quantum computer can beat a classical computer on the Deutsch constant-vs-balanced problem in one query versus two, using only basic linear algebra, qubits, and Hadamard gates with no physics required.

Microsoft Research · 88:22 · Watch on YouTube

This talk proves a quantum computer can beat a classical computer on the Deutsch constant-vs-balanced problem in one query versus two, using only basic linear algebra, qubits, and Hadamard gates with no physics required.

Read the full summary on retube

한국어