Skip to content

Commit 9a2d67e

Browse files
committed
change name PEA -> QPE, IPEA -> IQPE
1 parent 41cc4b9 commit 9a2d67e

File tree

3 files changed

+8
-7
lines changed

3 files changed

+8
-7
lines changed

README.md

+4-3
Original file line numberDiff line numberDiff line change
@@ -9,12 +9,13 @@
99
This is a collection of tutorials for quantum algorithms.
1010
Here is the list of the tutorials (existing and planned).
1111

12-
* [Iterative phase estimation algorithm (IPEA)](https://github.com/DavitKhach/quantum-algorithms-tutorials/blob/master/iterative_phase_estimation.ipynb)
12+
* [Iterative quantum phase estimation algorithm (IQPE or IPEA)](https://github.com/DavitKhach/quantum-algorithms-tutorials/blob/master/iterative_quantum_phase_estimation.ipynb)
13+
14+
* [Quantum phase estimation algorithm (QPE or PEA)](https://github.com/DavitKhach/quantum-algorithms-tutorials/blob/master/quantum_phase_estimation.ipynb)
1315

1416
* [Variational quantum eigensolver (VQE)](https://github.com/DavitKhach/quantum-algorithms-tutorials/blob/master/variational_quantum_eigensolver.ipynb)
1517

16-
* *Phase estimation algorithm (PEA)* (next)
17-
* *HHL algorithm* (planed)
18+
* *HHL algorithm* (next)
1819
* *Simon's algorithm* (planed)
1920
* *Shor's quantum factoring algorithm* (planed)
2021
* ...

iterative_phase_estimation.ipynb renamed to iterative_quantum_phase_estimation.ipynb

+2-2
Original file line numberDiff line numberDiff line change
@@ -7,10 +7,10 @@
77
"<img src=\"images/quantum_algorithms_tutorials.png\" alt=\"drawing\" width=\"100\" align=\"left\"/>\n",
88
"\n",
99
"<h1 align=\"center\">\n",
10-
"\tIterative phase estimation algorithm\n",
10+
"Iterative quantum phase estimation\n",
1111
"</h1>\n",
1212
"\n",
13-
"The iterative phase estimation algorithm is a quantum algorithm for estimating the phase (or eigenvalue) of an eigenvector of a unitary operator [[1](https://en.wikipedia.org/wiki/Quantum_phase_estimation_algorithm), [2](https://www.tandfonline.com/doi/abs/10.1080/00268976.2011.552441)]. One of the main applications of the algorithm is to estimate eigenvalues (energies) of some molecule's $H$ Hamiltonian. Because $H$ is a Hermitian operator, not unitary, (the algorithm works only with unitary operators) we can't estimate directly its eigenvalues. Instead, we create some unitary operator from $H$ and estimate not the eigenvalues of $H$, but something different (the phase). From the estimated phase one can obtain the corresponding eigenvalue of $H$. So, in the end, we are not only estimating the phase but, what is more important, the desired eigenvalue. Here are the main steps of the algorithm:\n",
13+
"The iterative quantum phase estimation (IQPE, also known as IPEA) algorithm is a quantum algorithm for estimating the phase (or eigenvalue) of an eigenvector of a unitary operator [[1](https://en.wikipedia.org/wiki/Quantum_phase_estimation_algorithm), [2](https://www.tandfonline.com/doi/abs/10.1080/00268976.2011.552441)]. One of the main applications of the algorithm is to estimate eigenvalues (energies) of some molecule's $H$ Hamiltonian. Because $H$ is a Hermitian operator, not unitary, (the algorithm works only with unitary operators) we can't estimate directly its eigenvalues. Instead, we create some unitary operator from $H$ and estimate not the eigenvalues of $H$, but something different (the phase). From the estimated phase one can obtain the corresponding eigenvalue of $H$. So, in the end, we are not only estimating the phase but, what is more important, the desired eigenvalue. Here are the main steps of the algorithm:\n",
1414
"\n",
1515
"1) Create unitary operator $U$ from given $H$: \n",
1616
"$$U = e^{iHt}.$$ \n",

quantum_phase_estimation.ipynb

+2-2
Original file line numberDiff line numberDiff line change
@@ -27,7 +27,7 @@
2727
"\n",
2828
"where $E_1$ and $E_2$ are the eigenvalues of the $\\hat{H}$, $\\varphi_2 = \\frac{E_2 t}{2 \\pi}$ is the phase that the algorithm is capable to estimate. Note that $U = e^{i H t}$ is a unitary operator and in the code, we will name it as ```unitary```.\n",
2929
"\n",
30-
"The code and the algorithm is similar to the [IPEA](https://github.com/DavitKhach/quantum-algorithms-tutorials/blob/master/iterative_phase_estimation.ipynb) algorithm, which tutorial we also have covered. IPEA actually is a modification of QPE algorithm. So, that's why some parts/explanations are omitted here and more details are provided about the parts of QPE that are different from IPEA.\n",
30+
"The code and the algorithm is similar to the [IQPE](https://github.com/DavitKhach/quantum-algorithms-tutorials/blob/master/iterative_quantum_phase_estimation.ipynb) algorithm, which tutorial we also have covered. IPEA actually is a modification of QPE algorithm. So, that's why some parts/explanations are omitted here and more details are provided about the parts of QPE that are different from IQPE.\n",
3131
"\n",
3232
"In the first code, all necessary packages are imported and the diagonal matrix is created:"
3333
]
@@ -371,7 +371,7 @@
371371
"\n",
372372
"How you have seen we did the job of the algorithm without SWAP gates and obtained the result. The SWAP gates don't add anything to this algorithm and we can omit them. Not only they increase the gate number of the circuit, but also they add errors. So, that is why we are avoiding SWAP gates.\n",
373373
"\n",
374-
"They are some details about Trotterization, the $t$ parameter in the $U = e^{iHt}$, what should we do when the eigenvalue is negative that we don't cover here. If you interested in these topics you can check our [IPEA](https://github.com/DavitKhach/quantum-algorithms-tutorials/blob/master/iterative_phase_estimation.ipynb) tutorial, that is a modification of QPE algorithm. There are two main differences between QPE and IPEA algorithms. QPE demands $n$ ancillary qubits for $n$ bit phase estimation, IPEA demands only one ancillary qubit for any $n$ bit phase estimation. The second difference is that QPE applies inverse QFT, and IPEA applies inverse QFT iteratively ($R_z$ rotations are applied iteratively)."
374+
"They are some details about Trotterization, the $t$ parameter in the $U = e^{iHt}$, what should we do when the eigenvalue is negative that we don't cover here. If you interested in these topics you can check our [IQPE](https://github.com/DavitKhach/quantum-algorithms-tutorials/blob/master/iterative_quantum_phase_estimation.ipynb) tutorial, that is a modification of QPE algorithm. There are two main differences between QPE and IQPE algorithms. QPE demands $n$ ancillary qubits for $n$ bit phase estimation, IQPE demands only one ancillary qubit for any $n$ bit phase estimation. The second difference is that QPE applies inverse QFT, and IQPE applies inverse QFT iteratively ($R_z$ rotations are applied iteratively)."
375375
]
376376
},
377377
{

0 commit comments

Comments
 (0)