Natural computing

Verifiable quantum advantage: old and new ideas

Optimization by Decoded Quantum Interferometry | Quantum Colloquium

Microsoft Announces World's First Topological Quantum Chip - Majorana 1 Explained

The Truth About Microsoft’s Quantum Breakthrough

What They Rarely Reveal About Quantum Computing: Without an Algorithm, It's Hype

Scalable quantum dynamics compilation via quantum machine learning

Google dévoile son projet QUANTIQUE ! "Willow" le processeur qui va changer le monde !

Google unveils its QUANTUM project! "Willow" the processor that will change the world!

Crafting Qubits: Harnessing Quantum Mechanics for Computation | World Science Festival

Intro to Quantum Gibbs Samplers: Algorithmic Ingredients

Straight Talk on Quantum Computing | World Science Festival

QEC and Quantum Information Theory: Lecture 21 Concavity of the von Neumann entropy

#99/100: Quantum Algorithms Recap: Factoring || Quantum Computer Programming in 100 Easy Lessons

#100/100: Why study quantum computing? || Quantum Computer Programming in 100 Easy Lessons

#98/100: Quantum algs recap: Grover's Alg & SAT || Quantum Computer Programming in 100 Easy Lessons

#96/100: Factoring finally finished! || Quantum Computer Programming in 100 Easy Lessons

#95/100: Rotation Estimation in superposition: 1 || Quantum Computer Programming in 100 Easy Lessons

#94/100: Equal superposition of steering wheels || Quantum Computer Programming in 100 Easy Lessons

#93/100: IncrL's rotation planes: perpendicular || Quantum Computer Programming in 100 Easy Lessons

#92/100: Recapping Factoring technical details || Quantum Computer Programming in 100 Easy Lessons

#91/100: All the planes of rotation for IncrL || Quantum Computer Programming in 100 Easy Lessons

#90/100: Verifying the first SW vector properties | Quantum Computer Programming in 100 Easy Lessons

#89/100: One Steering Wheel vector for IncrL || Quantum Computer Programming in 100 Easy Lessons

#88/100: Planes of rotation for IncrL, Part 1|| Quantum Computer Programming in 100 Easy Lessons

#87/100: Finding "L" from the clues || Quantum Computer Programming in 100 Easy Lessons

#86/100: Rotation Estimation gives clues about L || Quantum Computer Programming in 100 Easy Lessons

#85/100: We need to find the length of a cycle || Quantum Computer Programming in 100 Easy Lessons

#84/100: Factoring Algorithm: the overview || Quantum Computer Programming in 100 Easy Lessons

#83/100: The Hadamard Test: analysis || Quantum Computer Programming in 100 Easy Lessons

#82/100: The Hadamard Test || Quantum Computer Programming in 100 Easy Lessons

#81/100: Rotation Estimation: different settings || Quantum Computer Programming in 100 Easy Lessons

#80/100: Rotation Estimation: Bird's-Eye View || Quantum Computer Programming in 100 Easy Lessons

#79/100: Quantum win probability of CHSH is 85% | Quantum Computer Programming in 100 Easy Lessons

#78/100: Classical win probability of CHSH is 75% | Quantum Computer Programming in 100 Easy Lessons

#77/100: The CHSH Game || Quantum Computer Programming in 100 Easy Lessons

#76/100: How Alice & Bob mutually rotate |EPR〉|| Quantum Computer Programming in 100 Easy Lessons

#75/100: The key property of |EPR〉|| Quantum Computer Programming in 100 Easy Lessons

#74/100: Quantum teleportation: Part 2 || Quantum Computer Programming in 100 Easy Lessons

#73/100: Quantum teleportation: Part 1 || Quantum Computer Programming in 100 Easy Lessons

#72/100: Ops on separate qubits: order doesn't matter || Quantum Computer Prog. in 100 Easy Lessons

#71/100: Entanglement || Quantum Computer Programming in 100 Easy Lessons