Constructive quantum scaling of unitary matrices. - Adam Glos; Przemyslaw Sadowski (Quantum Inf. Process., 2016)

Quantum inferring acausal structures and the Monty Hall problem. - Dariusz Kurzyk; Adam Glos (Quantum Inf. Process., 2016)

The role of quantum correlations in Cop and Robber game. - Adam Glos; Jaroslaw Adam Miszczak (CoRR, 2017)

Superdiffusive quantum stochastic walk definable on arbitrary directed graph. - Krzysztof Domino; Adam Glos; Mateusz Ostaszewski (Quantum Inf. Comput., 2017)

Impact of the malicious input data modification on the efficiency of quantum algorithms. - Adam Glos; Jaroslaw Adam Miszczak (CoRR, 2018)

Hiding higher order cross-correlations of multivariate data using Archimedean copulas. - Krzysztof Domino; Adam Glos (CoRR, 2018)

Properties of quantum stochastic walks from the asymptotic scaling exponent. - Krzysztof Domino; Adam Glos; Mateusz Ostaszewski; Lukasz Pawela; Przemyslaw Sadowski (Quantum Inf. Comput., 2018)

Vertices cannot be hidden from quantum spatial search for almost all random graphs. - Adam Glos; Aleksandra Krawiec; Ryszard Kukulski; Zbigniew Puchala (Quantum Inf. Process., 2018)

QSWalk.jl: Julia package for quantum stochastic walks analysis. - Adam Glos; Jaroslaw Adam Miszczak; Mateusz Ostaszewski (Comput. Phys. Commun., 2019)

Impact of the malicious input data modification on the efficiency of quantum spatial search. - Adam Glos; Jaroslaw Adam Miszczak (Quantum Inf. Process., 2019)

LP WAN Gateway Location Selection Using Modified K-Dominating Set Algorithm. - Artur Frankiewicz; Adam Glos; Krzysztof Grochla; Zbigniew Laskarzewski; Jaroslaw Adam Miszczak; Konrad Polys; Przemyslaw Sadowski; Anna Strzoda (MASCOTS (Revised Selected Papers), 2020)

Quantum Optimization for the Graph Coloring Problem with Space-Efficient Embedding. - Zsolt Tabi; Kareem H. El-Safty; Zsófia Kallus; Péter Hága; Tamás Kozsik; Adam Glos; Zoltán Zimborás (QCE, 2020)

Quantum Speedups for Dynamic Programming on n-Dimensional Lattice Graphs. - Adam Glos; Martins Kokainis; Ryuhei Mori; Jevgenijs Vihrovs (MFCS, 2021)

Quantum speedups for dynamic programming on n-dimensional lattice graphs. - Adam Glos; Ryuhei Mori; Jevgenijs Vihrovs (CoRR, 2021)

Application of graph theory in quantum computer science. - Adam Glos (CoRR, 2021)

Upperbounds on the probability of finding marked connected components using quantum walks. - Adam Glos; Nikolajs Nahimovs; Konstantin Balakirev; Kamil Khadiev (Quantum Inf. Process., 2021)

Unconstrained binary models of the travelling salesman problem variants for quantum optimization. - Özlem Salehi; Adam Glos; Jaroslaw Adam Miszczak (Quantum Inf. Process., 2022)

Optimizing the Production of Test Vehicles Using Hybrid Constrained Quantum Annealing. - Adam Glos; Akash Kundu; Özlem Salehi (SN Comput. Sci., 2023)

Classification and transformations of quantum circuit decompositions for permutation operations. - Ankit Khandelwal; Handy Kurniawan; Shraddha Aangiras; Özlem Salehi; Adam Glos (Quantum Inf. Process., 2024)

Prog-QAOA: Framework for resource-efficient quantum optimization through classical programs. - Bence Bakó; Adam Glos; Özlem Salehi; Zoltán Zimborás (Quantum, 2025)