Era Quantic | Quantum Computing and Information Articles

  In my previous article, I wrote an introduction to quantum phase estimation and explained the working principle of a quantum circuit for a single qubit. As I mentioned before, in order to obtain the quantum phase precisely, we will either repeat our algorithm continuously or find a precise quantum phase in one goes using multiple qubits. The most logical solution is to create our quantum circuit with many qubits. So let's look at the details of our quantum circuit! This may remind you of the quantum Fourier transform . Yes, it's definitely a good guess. In the last step, if we apply the inverse quantum Fourier transform and measure, we will probably get the 2nϕ phase. Using multiple qubits, we found our quantum phase. We can now apply it to its important application, Shor's algorithm. Stay curious. :)           Reference https://www.youtube.com/watch?v=PhhsGb-pY94&list=PLqNc_xpYGu775P7iJA7Kvfxmv_Fm9wwHj&index=14

    We continue our series of fundamental and ongoing quantum algorithms. In today's post, we'll look at the eigenvalue calculation that is familiar to anyone in both the basic sciences and engineering. We will consider a slightly different situation, of course, our work is quantum. Let's consider the quantum state of a system! When we make an observation, we obtain real observation values by calculating the eigenvalues and eigenvectors of the state in that system, the mathematical calculation that helps us to have information about the position, momentum, or energy of that system. So, how can we find the eigenvalues of the unitary operators, which act on a system without changing its size, that is, preserve its physical size? To solve this problem, we will examine the Quantum Phase Estimation solution. In order to find the eigenvalues of the unit operator U, we need to find the value of the phase ϕ, which is inside the exponential value. However, it is not that easy. A qua...