*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*

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.

Detailed description-
K. Domino, A. Kundu, K. Krawiec,
*Quadratic and Higher-Order Unconstrained Binary Optimization of Railway Dispatching Problem for Quantum Computing*, arXiv:2107.03234 (2021). -
Ö. Salehi, A. Glos, J.A. Miszczak,
*Unconstrained Binary Models of the Travelling Salesman Problem Variants for Quantum Optimization*, arXiv:2106.09056 (2021). -
A. Glos, R. Mori, J. Vihrovs,
*Quantum speedups for dynamic programming on n-dimensional lattice graphs*, arXiv:2104.14384 (2021), Accepted at 46th International Symposium on, Mathematical Foundations of Computer Science, August 23-27, 2021, Tallinn (Estonia). -
D. Magano, A. Kumar, M. Kālis, A. Locāns, A. Glos, S. Pratapsi, G. Quinta, M. Dimitrijevs, A. Rivošs, P. Bargassa, J. Seixas, A. Ambainis, Y. Omar,
*Investigating Quantum Speedup for Track Reconstruction: Classical and Quantum Computational Complexity Analysis*, arXiv:2104.11583 (2021). -
A. Kundu, C. Jin, J.-X. Peng,
*Study of the optical response and coherence of a quadratically coupled optomechanical system*, Physica Scripta, 96 065102 (2021), DOI:10.1088/1402-4896/abee4f. -
A. Kundu, C. Jin, J.-X. Peng,
*Optical response of a dual membrane active–passive optomechanical cavity*, Annals of Physics 429, 168465 (2021), DOI:10.1016/j.aop.2021.168465, arXiv:2011.05833 -
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:arXiv:2009.13309 (2020).

- Abuzer Yakaryilmaz, Faculty of Computing, University of Latvia, 24.06.2021.

- Adam Glos talk at Center for Theoretical Physics, June 17, 2021, 3:15 PM
- Talks QWorld Quantum Science Days 2021 | June 1-2, Online by Özlem Salehi, Adam Glos and Ludmila Botelho.
- A. Glos, Space-efficient binary optimization for variational computing
- L. Botelho, Infeasible space reduction for QAOA through encoding change
- Ö. Salehi, A computer science-oriented approach to introduce quantum computing to a new audience
- Talk at Krakow Quantum Informatics Seminar (KQIS), Akash Kundu, 11.05.2021 (abstract)
- Talk at Krakow Quantum Informatics Seminar (KQIS), Adam Glos, 02.03.2021 (abstract)
- Quantum Computing Thematic Track organized as a part of International Conference on Computational Science (planned for June 2021).
- Special issue of Entropy, devoted to methods and applications of quantum data processing (deadline in June 2021).
- Presentation during IEEE International Conference on Quantum Computing & Engineering as a part of Virtual IEEE Quantum Week (October 2020)

- Source code for executing TSPSW on D-Wave Advantage system, DOI:10.5281/zenodo.4966588 (GitHub repo)
- QuantumWalk.jl: Package for building algorithms based on quantum walks
- Random and quantum walks with examples (in progress)
- Quantum programming tutorial: slides and code examples

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.

- 29/10/2020 - Call for research scholarships in the scope of the project.
- 12/10/2020 - Second call for post-docs, see new announcement at Quantiki.
- 05/10/2020 - Special issue of Entropy, devoted to quantum data processing. More information about this on the publisher site and at Quantiki.
- 01/10/2020 - Results of the project will be presented during IEEE International Conference on Quantum Computing & Engineering as a part of Virtual IEEE Quantum Week.
- 28/09/2020 - Two PhD students accepted to the Joint Doctoral School.
- 02/07/2020 - Project received nomination for the Polish Intelligent Development Award 2020.
- 22/06/2020 - PhD offer published at Quantiki.
- 15/06/2020 - Added post-doc advert, see more on Quantiki.
- 27/03/2020 - Added project info and PhD opening.

© 2005-2020 J.A. Miszczak

Last modification: 08/07/2021