Quantum Phase Estimation Algorithm

Start date 01/01/2006
End date The project is closed: 01/01/0001

The kth step of the iterative PEA, implemented on a two-qubi  
The kth step of the iterative PEA, implemented on a two-qubit system using the entangling gate ZZ(a).

The phase estimation algorithm (PEA) is an algorithm to determine the eigenvalue of a unitary operator U and it is closely related to the quantum Fourier transform (QFT). The algorithm relevance has been proven for Shor's factoring algorithm and for quantum simulations.

We study the implementation of an iterative PEA variant which is using minimal resources in terms of needed qubits. Furthermore, we suggest how to use the smallest possible realization of this algorithm to characterize (benchmark) two-qubit systems. We exemplify with a superconducting circuit and take into account realistic obstacles such as imprecise manipulation of qubits and dephasing [1].

The experimental verification of our work has been performed by Xiu-Mei et. al. [2] and theoretical broadening can be found in [3,4].

The next step is to extend our knowledge about the algorithm performance and its fine tuning in the noisy three-qubit domain. The chief goal is to employ PEA in simple quantum simulations - to read out static properties of simulated systems such as groud state energies.



This page is only available in english

Published: Mon 13 Nov 2017.