We have seen previously the Bernstein-Vazirani algorithm.

This algorithm is a search algorithm. Given an unknown function \(f\) that returns \(1\) only for a single value \(x\), and \(0\) otherwise. Well, \(f\) is not completely unknown. We know it is a dot product of its input with a secret key …

Computing is about writing code. Whether it is with punched cards, assembly, Python, or vibe coding using prompts for retards, we need a way to tell the computer which algorithm we want to execute.

I'm currently experimenting with qiskit, the IBM Python library for quantum computing. I don't know if …

I continue this journey in quantum computing with a completly useless, however fundamental, quantum algorithm: The Deutsch Algorithm.

– Hurray, yet another theorical tool that I will never use...

Remember the last time you have to use a Turing machine ? Right. But without Turing Machine, there won't be any of todays …

We have seen before some quantum gates acting on a single qbit. We will now see a family of qgates taking 2 qbits as input and returning 2 qbits: the Controlled gates.

– Why does it return 2 qbits ? In classical logic, gates take 2 bits and return only 1 bit …

Like the classical AND, OR, NOT, etc... gates for classical bit, there are Quantum Gates for QBits. We will see some examples on Quantum gates acting on a single QBit.

Small reminder of classical gates

A boolean gate is a gate taking one or several boolean values as input, and …

I don't like deep learning and current AI buzz. Really. That "Hey, let's initialize billions of values and make them converge to whatever good enough solution could solve some problem with good probability, but we don't know how" really annoys me. So I decided to take a look at the …