Impact of input data alteration and modification of the algorithm parameters on the efficiency of quantum programs
Wpływ zmiany danych wejściowych i modyfikacji parametrów algorytmu na wydajność programów kwantowych
description:
While the excitement in the area of quantum computing is fully justified by the
new theoretical developments, year by year scientists have discovered new
limitations of quantum computing devices. In particular, unitary operation
decomposition provides a number of problems including the applications to
hardware with fixed topology. Moreover, quantum algorithms have proved to be
sensitive to noise, which may impact the results of the computation. This
resulted in the development of a new branch of quantum computing, namely the
theory of quantum error-correcting codes. This aspect became even more critical
when first commercial quantum computing systems became available. Furthermore,
for quantum cryptographic protocols, hardware attacks, based on the security
holes of conventional electronics, have been discovered. This demonstrated that
the theoretical security confirmed by the laws of physics in the ideal
environment could lead to the creation of insecure protocols the real-world
applications.
The main goal of the project is to develop theoretical methods suitable for
analysing the impact of quantum programme alternation – input data modification
or imprecise implementation of the algorithm – on the efficiency of quantum
algorithms. Quantum programme is a sequence of quantum operations and the
quantum representation of input data which are sent to the quantum processor. In
some cases, we can consider quantum programme alternation as an action of a
malicious party, and in this scenario, we can understand it as an attack on a
quantum processor or quantum program.
J.A. Miszczak, Variational certification of quantum devices,
arXiv:2011.01879 (2020).
A. Glos, A. Krawiec, Z. Zimboras,
Space-efficient binary optimization for variational computing,
arXiv:2009.07309 (2020).
Z. Tabi, K. H. El-Safty, Z. Kallus, P. Hága, T. Kozsik, A. Glos, Z. Zimborás,
Quantum Optimization for the Graph Coloring Problem with Space-Efficient Embedding,
2020 IEEE International Conference on Quantum Computing and Engineering (QCE), 12-16 Oct. 2020,
DOI:10.1109/QCE49297.2020.00018,
arXiv:2009.07314 (2020).
R. Kukulski, A. Glos,
Comment to Spatial Search by Quantum Walk is Optimal for Almost all Graphs,
arXiv:2009.13309 (2020).
This project has been supported by the Polish
National Science Center under
the grant agreement 2019/33/B/ST6/02011 for the period 30/01/2020 - 29/01/2023.
While the excitement in the area of quantum computing is fully justified by the
new theoretical developments, year by year scientists have discovered new
limitations of quantum computing devices. In particular, unitary operation
decomposition provides a number of problems including the applications to
hardware with fixed topology. Moreover, quantum algorithms have proved to be
sensitive to noise, which may impact the results of the computation. This
resulted in the development of a new branch of quantum computing, namely the
theory of quantum error-correcting codes. This aspect became even more critical
when first commercial quantum computing systems became available. Furthermore,
for quantum cryptographic protocols, hardware attacks, based on the security
holes of conventional electronics, have been discovered. This demonstrated that
the theoretical security confirmed by the laws of physics in the ideal
environment could lead to the creation of insecure protocols the real-world
applications.
