quantum computing and cryptography

April 2025
M	T	W	T	F	S	S
	1	2	3	4	5	6
7	8	9	10	11	12	13
14	15	16	17	18	19	20
21	22	23	24	25	26	27
28	29	30

Exploring Simon’s Algorithm

5 months ago4 months ago022 mins

Simon’s algorithm provided the first example of an exponential speedup over the best known classical algorithm by using a quantum computer to solve a particular problem. Originally published in 1994, Simon’s algorithm was a precursor to Shor’s well-known factoring algorithm, and it served as inspiration for many of the seminal works in quantum computation that…

The Deutsch-Jozsa Algorithm Explained

5 months ago4 months ago010 mins

When learning quantum computing algorithms from a textbook, there is usually a progression from the earliest, simplest algorithms to the later, more complex algorithms. Among the first of these textbook algorithms to be presented is often the Deutsch-Jozsa algorithm, whose small size and seeming simplicity belie its importance. What is the Deutsch-Jozsa algorithm? Using the…

Quantum Cryptography – Shor’s Algorithm Explained

5 months ago4 months ago020 mins

Anyone interested in learning quantum computing cannot avoid hearing about Shor’s Factoring Algorithm. It is one of the few textbook quantum algorithms, which means that it remains one of the rare examples of quantum computational advantage. In other words, the algorithm can compute something quantumly that is harder and slower to compute classically. In fact, this particular…