quantum computer

Reviews the classical conjugate gradient method for solving linear equations, then studies qiskit's HHL algorithm for quantum linear system solving.

Explains Grover's algorithm, which searches unsorted data in O(√N) time, describing amplitude amplification theory as a rotation operation in vector space.

Reviews how RSA cryptography works, then explains Shor's algorithm, which could break RSA by using order-finding to perform prime factorization on a quantum computer.

Explains the theory of quantum phase estimation, combining phase kickback with the inverse quantum Fourier transform, then implements it in qiskit using a T-gate example.

Reviews the classical discrete Fourier transform and then applies the same idea to quantum states, explaining the theory of the quantum Fourier transform with qiskit.

Explains Simon's algorithm, which determines whether a function is one-to-one or two-to-one and finds the period of a two-to-one function, following the math step by step.

Explains the Deutsch-Jozsa algorithm, which determines with a single query whether a function is constant or balanced, following the underlying math step by step.

Explains how to represent two-qubit and three-qubit states using the tensor product, and covers the basics of multi-qubit gate operations in qiskit.

An introductory article on qiskit's basic syntax, creating quantum registers, and single-qubit operations such as the Hadamard and CNOT gates.