Quantum Computing: Computing with a Probabilistic Universe with Mark Russinovich - Ignite 2019

Quantum computing algorithms can solve problems in seconds that would take millions of years on classical computers. Mark describes the kinds of problems that quantum computing accelerates, then introduces quantum physics, the qubits that are the foundation for quantum computing, quantum gates, and then algorithms. He uses the Microsoft Quantum Development Kit with its Q# language and simulator to demonstrate concepts and show that even though scalable quantum computers are several years away, quantum-inspired algorithms are solving problems more efficiently.

[@RossYoungblood]

I keep trying to consider how a quantum gate fault models work. In classical computing a classical gate has stuck at 1, stuck at 0 and delay fault models. (Integrated Circuit Testing)
But to test a quantum gate, it's validating the probabilities. If a quantum gate tends to not favor the predicted probabilities, what kind of defect is this... or are there entanglement defects..

[@NdamuleloNemakh]

Camera man🤣