Quantum error correction: an introduction to toric codes

While playing with the IBM Q experience in some of my recent posts, we have seen that real qubits are subject to geometric restrictions - two-qubit gates cannot involve arbitrary qubits, but only qubits that are in some sense neighbors. This suggests that efficient error correction codes need to tie to the geometry of the … Continue reading Quantum error correction: an introduction to toric codes

Factoring integers on a quantum computer with Qiskit

After all the work done in the previous posts, we are now ready to actually implement Shor's factoring algorithm on a real quantum computer, using once more IBMs Q Experience and the Qiskit framework. First, recall that Shor's algorithm is designed to factor an integer M, with the restriction that M is supposed to be … Continue reading Factoring integers on a quantum computer with Qiskit

Quantum phase estimation – the quantum algorithm Swiss army knife

When you are faced with a problem in linear algebra and have absolutely no idea what to do, an eigenvalue decomposition is the one thing that you would typically try first. In the world of quantum algorithms, the situation is similar - finding the eigenvalues of a matrix is a central building block of many … Continue reading Quantum phase estimation – the quantum algorithm Swiss army knife