daknuett/bachelor_thesis
1
0
Fork 0
Code Issues Pull Requests Releases Wiki Activity

some little work here

Browse Source
This commit is contained in:
Daniel Knüttel
2020-03-26 22:40:41 +01:00
parent 78ec3aa4c9
commit b7c123a3b2
2 changed files with 13 additions and 7 deletions
Download Patch File Download Diff File Expand all files Collapse all files

5
thesis/chapters/appendix.tex
View File

@@ -74,9 +74,12 @@ It has been mentioned several times that the implementation using
implementation. To support this statement a simple benchmark can be used. The
relatively simple Pauli $X$ is used, more complicated gates like $CX$ or $H$
have worse performance when implemented in \lstinline{python}. The performance
improvement when using the \lstinline{ufunc} is around $1.7$ in this tested
improvement when using the \lstinline{ufunc} is a factor around $6.4$ in this tested
case. One must however note that the tested \lstinline{python} code is not
realistic and in a possible applications there would be a significant overhead.
\lstinputlisting[title={Code to Benchmark \lstinline{ufunc} Gates against Python}, language=Python, breaklines=True]{extra_benchmark/benchmark.py}
When using \lstinline{result_py[0::2] = qm_state[1::2]} the result is identical and
the performance is only increased by a factor around $1.7$. This method is however not
applicable to general act-qbits and the bit mask has to be used.