Syndrome decoding is NP-complete problem [page 6 of this reference].
There are some special linear codes for which we know efficient classical decoding algorithms, such as Reed-Solomon, LDPC and etc.
...
I try to immagine the hadamard gate on a bloch sphere and it is obvious that it is the sum of the pauli $x$ and $z$ gate matrices.
So that means we rotate the "vector" around the x axe and ...
I have two circuits (below) : first works fine (no complaints from stim); second comes back with a "non-deterministic detector" error. The difference between the two circuits is that the ...
Recently, I have watched video on 3Blue1Brown about Grover's algorithm. He give an example that:
To find a secret number in the range from 0 to n−1, you can query a
hidden function that returns “true”...
One of the common claims about quantum computers is their ability to "break" conventional cryptography. This is because conventional cryptography is based on prime factors, something which is ...
Let's say we have a circuit with $2$ Hadamard gates:
Let's take the $|00\rangle$ state as input. The vector representation of $|00\rangle$ state is $[1 \ 0 \ 0 \ 0]$, but this is the representation of ...
This can be seen as the software complement to How does a quantum computer do basic math at the hardware level?
The question was asked by a member of the audience at the 4th network of the Spanish ...
The terms Quantum Computing Race and Global Quantum Computing Race have been used in the press and research communities lately in an effort to describe countries making investments into a "battle" to ...
For simplicity, let's take a density matrix for a single qubit, written in the $\{|0\rangle,|1\rangle\}$ basis:
$$ \rho = \begin{pmatrix} \rho_{00} & \rho_{01} \\ \rho_{10}^* & 1-\rho_{00} \...