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.
A. Khandelwal, H. Kurniawan, S. Aangiras, Ö. Salehi, A. Glos,
Classification and transformations of quantum circuit decompositions for permutation operations, Quantum Information Processing, Vol. 23, No.322 (2024),
DOI:10.1007/s11128-024-04508-5,
arXiv:2312.11644.
Tamal Acharya, Akash Kundu, Aritra Sarkar,
A scalable quantum gate-based implementation for causal hypothesis testing,
Advanced Quantum Technologies, pp. 2300326 (2024),
DOI:10.1002/qute.202300326,
arXiv:2209.02016.
J.-X. Peng, A. Kundu, Z.-X. Liu, A. ur Rahman, N. Akhtar, M. Asjad,
Vector photon-magnon-phonon coherence in a polarized microwave driven cavity magnomechanical system,
Phys. Rev. B 109, 064412 (2024),
DOI:10.1103/PhysRevB.109.064412.
A. Kundu, L. Botelho, A. Glos,
Hamiltonian-Oriented Homotopy QAOA, Physical Review A, 109, 022611 (2024)
DOI:10.1103/PhysRevA.109.022611,
arXiv:2301.13170.
Y.J. Patel, A. Kundu, M. Ostaszewski, X. Bonet-Monroig, V. Dunjko, O. Danaci,
Curriculum reinforcement learning for quantum architecture search under hardware errors,
12th International Conference on Learning Representations (ICLR) (2024),
arXiv:2402.03500.
A. Kundu, P. Bedełek, M. Ostaszewski, O. Danaci, Y.J. Patel, V. Dunjko, J.A. Miszczak,
Enhancing variational quantum state diagonalization using reinforcement learning techniques,
New Journal of Physics, 26, 013034 (2024),
DOI:10.1088/1367-2630/ad1b7f,
arXiv:2306.11086.
J.A. Miszczak, Symbolic quantum programming for supporting applications of quantum computing technologies,
Programming '23 Companion: Companion Proceedings of the 7th International Conference on the Art, Science, and Engineering of Programming, pp. 101-108 (2023),
DOI:10.1145/3594671.3594688,
arXiv:2302.09401.
B. G. Bach, A. Kundu, T. Acharya, A. Sarkar,
Visualizing Quantum Circuit Probability: Estimating Quantum State Complexity for Quantum Program Synthesis,
Entropy, 25(5), 763 (2023),
DOI:10.3390/e25050763,
arXiv:2304.02358.
R. Glück, I. Lanese, C.A. Mezzina, J.A. Miszczak, I. Phillips, I. Ulidowski, G. Vidal,
Towards a Taxonomy for Reversible Computation Approaches,
M. Kutrib and U. Meyer (Eds.): RC 2023,15th International Conference on Reversible Computation (RC),
18-19 July, 2023, Giessen, Germany,
Lecture Notes in Computer Science, Vol. 13960, pp. 24–39, (2023),
DOI:10.1007/978-3-031-38100-3_3.
A. Glos, A. Kundu, Ö. Salehi,
Optimizing the Production of Test Vehicles using Hybrid Constrained Quantum Annealing,
SN Computer Science, 4 (5), 609 (2023),
DOI:10.1007/s42979-023-02071-x,
arXiv:2203.15421.
K. Domino, A. Kundu, Ö. Salehi, K. Krawiec,
Quadratic and Higher-Order Unconstrained Binary Optimization of Railway Dispatching Problem for Quantum Computing,
Quantum Information Processing, 21:337 (2022),
DOI:10.1007/s11128-022-03670-y,
arXiv:2107.03234.
A. Kundu, J.A. Miszczak,
Transparency and enhancement in fast and slow light in q-deformed optomechanical system,
Annalen der Physik, Vol. 534, No. 8, 2200026 (2022),
DOI: 10.1002/andp.202200026,
arXiv: 2205.15800.
A. Kundu, J.A. Miszczak,
Variational certification of quantum devices,
Quantum Science and Technology, Vol. 7, 045017 (2022),
DOI: 10.1088/2058-9565/ac8572,
arXiv:2011.01879.
L. Botelho, A. Glos, A. Kundu, J.A. Miszczak, Ö. Salehi, Z. Zimborás,
Error mitigation for variational quantum algorithms through mid-circuit measurements,
Physical Review A, Vol. 105, 022441 (2022),
DOI: 10.1103/PhysRevA.105.022441,
arXiv:2108.10927.
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,
Physical Review D, Vol. 105, 076012 (2022),
DOI: 10.1103/PhysRevD.105.076012,
arXiv:2104.11583.
A. Arya, L. Botelho, F. Cañete, D. Kapadia, Ö. Salehi,
Applications of Quantum Annealing to Music Theory
in Eduardo Reck Miranda (ed.),
Quantum Computer Music: Foundations, Methods and Advanced Concepts, pp 373–406 (2022),
ISBN: 978-3-031-13908-6 (hardcover), 978-3-031-13911-6 (softcover)
DOI:10.1007/978-3-031-13909-3_15,
arXiv:2201.10557.
A. Glos, A. Krawiec, Z. Zimboras,
Space-efficient binary optimization for variational computing,
npj Quantum Information, Vol. 8, No. 1 (39) (2022),
DOI: 10.1038/s41534-022-00546-y,
arXiv:2009.07309.
Ö. Salehi, A. Glos, J.A. Miszczak,
Unconstrained Binary Models of the Travelling Salesman Problem Variants for Quantum Optimization,
Quantum Information Processing, Vol. 21, 67 (2022),
DOI:10.1007/s11128-021-03405-5,
arXiv:2106.09056.
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.
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.
preprints:
Aritra Sarkar, Akash Kundu, Matthew Steinberg, Sibasish Mishra, Sebastiaan Fauquenot, Tamal Acharya, Jarosław A Miszczak, Sebastian Feld,
YAQQ: Yet Another Quantum Quantizer--Design Space Exploration of Quantum Gate Sets using Novelty Search,
arXiv:2406.17610 (2024).
Ludmila Botelho, Özlem Salehi,
Fixed interval scheduling problem with minimal idle time with an application to music arrangement problem,
arXiv:2310.14825 (2023)
Mostafa Atallah, Haemanth Velmurugan, Rohan Sharma, Siddhant Midha, Shamim Al Mamun, Ludmila Botelho, Adam Glos, Özlem Salehi,
Integer Factorization through Func-QAOA,
arXiv:2309.15162 (2023).
Mátyás Koniorczyk, Krzysztof Krawiec, Ludmila Botelho, Nikola Bešinović, Krzysztof Domino,
Application of a Hybrid Algorithm Based on Quantum Annealing to Solve a Metropolitan Scale Railway Dispatching Problem,
arXiv:2309.06763 (2023).
Bence Bakó, Adam Glos, Özlem Salehi, Zoltán Zimborás,
Near-optimal circuit design for variational quantum optimization,
arXiv:2209.03386 (2022).
T. Chatterjee, S.I. Mohtashim, A. Kundu,
On The Variational Perspectives To The Graph Isomorphism Problem,
arXiv:2111.09821 (2021).
Ö. Salehi, A. Yakaryılmaz,
State-efficient QFA Algorithm for Quantum Computers,
arXiv:2107.02262 (2021).
R. Kukulski, A. Glos,
Comment to Spatial Search by Quantum Walk is Optimal for Almost all Graphs,
arXiv:arXiv:2009.13309 (2020).
visitors:
Mátyás Koniorczyk, Wigner Research Centre for Physics, Budapest, 05-08.02.2023.
Abuzer Yakaryilmaz, Faculty of Computing, University of Latvia, 24.06.2021.
dissemination:
Poster Curriculum reinforcement learning for quantum architecture search under hardware errors at ICRL 2024 presented by Akash Kundu, 07/05/2020.
Jupyter notebook with codes used for generating the music pieces presented in the chapter Music Composition Using Quantum Annealing,
DOI:10.5281/zenodo.5856930
(GitHub repo).
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/2025.
updates:
05/2024 - Akash Kundu joins University of Helsinki in the scope of Finnish Quantum Flagship. Congratulations!
04/2024 - Ludmila Botelho joins AlgorithmiQ as a developer. Congratulations!
21/02/2024 - PhD thesis of Akash Kundu Reinforcement learning-assisted quantum architecture search for variational quantum algorithms available on arXiv as preprint arXiv:2402.13754
01/2024 - Akash Kundu awarded with the scholarship for publishing with researcher from top-tier internatioanl institutions. Congratulations!
01/11/2023 - Özlem Salehi joined AlgorithmiQ Congratulations!
10/11/2022 - Akash Kundu has been awarded a scholarship by the Rector of the Silesian University of Technology for publishing in one of the top-ranked journals. Congratulations!
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.
