Martin Plesch
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Research Interests
Martin Plesch has a total of 68 co-authors. Here are the top co-authors by number of shared publications:
- Matej Pivoluska
Institute of Physics, Slovak Academy of Sciences, 845 11 Bratislava, Slovakia
18 shared publications Jan Bouda
Masaryk Univ. (Czech Republic)
6 shared publicationsVladimír Bužek
6 shared publications- Mário Ziman
Slovak Academy of Sciences
5 shared publications - Marcin Pawłowski
International Centre for Theory of Quantum Technologies University of Gdansk Jana Bażyńskiego 1A 80-309 Gdansk Poland
4 shared publications Matej Pivoluska
Institute of Physics, Slovak Academy of Sciences, Bratislava, Slovak Republic
4 shared publications
Latest Publications
- Open Access
- 3 September 2025
- Published by IOP Publishing in European Journal of Physics
- Vol. 46 (5) , 055804
Development of soft and hard skills of high-school students via young physicists’ tournament
The Young Physicists’ Tournament (YPT) inspires high-school students to immerse themselves into an inquiry process closely resembling real physics research. Using questionnaires’ replies from the students and their teachers engaged in the YPT, we investigated the perception of teachers and students on how the preparation for the YPT contributes to the development of hard skills (physics content knowledge, mathematics, modelling…) and soft skills (communication, team work, organization…) of the students, and how it compares to regular classes and other activities. This comparison shows a positive role of the YPT among students, and even a more positive perception among teachers. The significant development of a wide range of advanced skills justifies the substantial effort, resources and dedication of both teachers and students required for the participation in the YPT.
- 3 September 2025
- Published by IOP Publishing in European Journal of Physics
- Vol. 46 (5) , 055804
Open AccessDevelopment of soft and hard skills of high-school students via young physicists’ tournament
The Young Physicists’ Tournament (YPT) inspires high-school students to immerse themselves into an inquiry process closely resembling real physics research. Using questionnaires’ replies from the students and their teachers engaged in the YPT, we investigated the perception of teachers and students on how the preparation for the YPT contributes to the development of hard skills (physics content knowledge, mathematics, modelling…) and soft skills (communication, team work, organization…) of the students, and how it compares to regular classes and other activities. This comparison shows a positive role of the YPT among students, and even a more positive perception among teachers. The significant development of a wide range of advanced skills justifies the substantial effort, resources and dedication of both teachers and students required for the participation in the YPT.
- Open Access
Development of soft and hard skills of high-school students via Young Physicists' Tournament
The Young Physicists' Tournament (YPT) inspires high-school students to immerse themselves into an inquiry process closely resembling the real physics research. Using questionnaires' replies from the students and their teachers engaged in YPT, we investigated the perception of teachers and students on how the preparation for YPT contributes to the development of hard skills (physics content knowledge, mathematics, modelling...) and soft skills (communication, team work, organization...) of the students, and how it compares to regular classes and other activities. This comparison shows a positive role of YPT among students, and even a more positive perception among teachers. The significant development of a wide range of advanced skills justifies the substantial effort, resources and dedication of both teachers and students required for the participation in YPT.
Open AccessDevelopment of soft and hard skills of high-school students via Young Physicists' Tournament
The Young Physicists' Tournament (YPT) inspires high-school students to immerse themselves into an inquiry process closely resembling the real physics research. Using questionnaires' replies from the students and their teachers engaged in YPT, we investigated the perception of teachers and students on how the preparation for YPT contributes to the development of hard skills (physics content knowledge, mathematics, modelling...) and soft skills (communication, team work, organization...) of the students, and how it compares to regular classes and other activities. This comparison shows a positive role of YPT among students, and even a more positive perception among teachers. The significant development of a wide range of advanced skills justifies the substantial effort, resources and dedication of both teachers and students required for the participation in YPT.
- Open Access
HOPSO: A Robust Classical Optimizer for VQE
Variational Quantum Eigensolver (VQE) algorithm is one of few approaches where the hope for near-term quantum advantage concentrates. However, they face challenges connected with measurement stochastic noise, barren plateaus, and optimization difficulties in periodic parameter spaces. While most of the efforts concentrates on optimizing the quantum part of the procedure, here we aim to enhance the classical optimization by utilizing a modified version of Harmonic Oscillator-based Particle Swarm Optimization (HOPSO). By adapting its dynamics to respect the periodicity of quantum parameters and enhance noise resilience, we show its strengths on hydrogen (H2) and lithium hydride (LiH) molecules modeled as 4- and 8-qubit Hamiltonians. HOPSO achieves competitive ground-state energy approximations and demonstrates improved robustness compared to COBYLA, Differential Evolution (DE), and standard Particle Swarm Optimization (PSO) methods in all situations and outperforms other methods under realistic noise conditions. These results suggest that a properly tailored classical part of VQE algorithms can tackle with current problems and gives hope for its scalability for larger systems.
Open AccessHOPSO: A Robust Classical Optimizer for VQE
Variational Quantum Eigensolver (VQE) algorithm is one of few approaches where the hope for near-term quantum advantage concentrates. However, they face challenges connected with measurement stochastic noise, barren plateaus, and optimization difficulties in periodic parameter spaces. While most of the efforts concentrates on optimizing the quantum part of the procedure, here we aim to enhance the classical optimization by utilizing a modified version of Harmonic Oscillator-based Particle Swarm Optimization (HOPSO). By adapting its dynamics to respect the periodicity of quantum parameters and enhance noise resilience, we show its strengths on hydrogen (H2) and lithium hydride (LiH) molecules modeled as 4- and 8-qubit Hamiltonians. HOPSO achieves competitive ground-state energy approximations and demonstrates improved robustness compared to COBYLA, Differential Evolution (DE), and standard Particle Swarm Optimization (PSO) methods in all situations and outperforms other methods under realistic noise conditions. These results suggest that a properly tailored classical part of VQE algorithms can tackle with current problems and gives hope for its scalability for larger systems.
- Open Access
- 5 May 2024
- Published by Springer Nature in Scientific Reports
- Vol. 14 (1) , 1-10
Meta-optimization of resources on quantum computers
The current state of quantum computing is commonly described as the Noisy Intermediate-Scale Quantum era. Available computers contain a few dozens of qubits and can perform a few dozens of operations before the inevitable noise erases all information encoded in the calculation. Even if the technology advances fast within the next years, any use of quantum computers will be limited to short and simple tasks, serving as subroutines of more complex classical procedures. Even for these applications the resource efficiency, measured in the number of quantum computer runs, will be a key parameter. Here we suggest a general meta-optimization procedure for hybrid quantum-classical algorithms that allows finding the optimal approach with limited quantum resources. This method optimizes the usage of resources of an existing method by testing its capabilities and setting the optimal resource utilization. We demonstrate this procedure on a specific example of variational quantum algorithm used to find the ground state energy of a hydrogen molecule.
- 5 May 2024
- Published by Springer Nature in Scientific Reports
- Vol. 14 (1) , 1-10
Open AccessMeta-optimization of resources on quantum computers
The current state of quantum computing is commonly described as the Noisy Intermediate-Scale Quantum era. Available computers contain a few dozens of qubits and can perform a few dozens of operations before the inevitable noise erases all information encoded in the calculation. Even if the technology advances fast within the next years, any use of quantum computers will be limited to short and simple tasks, serving as subroutines of more complex classical procedures. Even for these applications the resource efficiency, measured in the number of quantum computer runs, will be a key parameter. Here we suggest a general meta-optimization procedure for hybrid quantum-classical algorithms that allows finding the optimal approach with limited quantum resources. This method optimizes the usage of resources of an existing method by testing its capabilities and setting the optimal resource utilization. We demonstrate this procedure on a specific example of variational quantum algorithm used to find the ground state energy of a hydrogen molecule.
- Open Access
Development of Scientific Skills via IYPT -- How does YPT participation lead to hard-skill development?
The Young Physicists' Tournament (YPT) inspires high-school students to immerse themselves into an inquiry process closely resembling the real physics research. Using questionnaires' replies from the students and their teachers engaged in YPT, we investigated how the preparation for YPT contributes to the development of hard - scientific - skills of the students, and how it compares to regular classes and other activities.
Open AccessDevelopment of Scientific Skills via IYPT -- How does YPT participation lead to hard-skill development?
The Young Physicists' Tournament (YPT) inspires high-school students to immerse themselves into an inquiry process closely resembling the real physics research. Using questionnaires' replies from the students and their teachers engaged in YPT, we investigated how the preparation for YPT contributes to the development of hard - scientific - skills of the students, and how it compares to regular classes and other activities.
- 27 May 2022
- Published by American Physical Society (APS) in Physical Review A
- Vol. 105 (5) , 052227
Self-testing quantum states via nonmaximal violation in Hardy's test of nonlocality
Self-testing protocols enable the certification of quantum devices without demanding full knowledge about their inner workings. A typical approach in designing such protocols is based on observing nonlocal correlations which exhibit maximum violation in a Bell test. We show that in the Bell experiment known as Hardy's test of nonlocality, not only does the maximally nonlocal correlation self-test a quantum state, rather a nonmaximal nonlocal behavior can serve the same purpose. We, in fact, completely characterize all such behaviors leading to a self-test of every pure two-qubit entangled state except for the maximally entangled ones. Apart from presenting an alternative self-testing protocol, our method provides a powerful tool towards characterizing the complex boundary of the set of quantum correlations.
- 27 May 2022
- Published by American Physical Society (APS) in Physical Review A
- Vol. 105 (5) , 052227
Self-testing quantum states via nonmaximal violation in Hardy's test of nonlocality
Self-testing protocols enable the certification of quantum devices without demanding full knowledge about their inner workings. A typical approach in designing such protocols is based on observing nonlocal correlations which exhibit maximum violation in a Bell test. We show that in the Bell experiment known as Hardy's test of nonlocality, not only does the maximally nonlocal correlation self-test a quantum state, rather a nonmaximal nonlocal behavior can serve the same purpose. We, in fact, completely characterize all such behaviors leading to a self-test of every pure two-qubit entangled state except for the maximally entangled ones. Apart from presenting an alternative self-testing protocol, our method provides a powerful tool towards characterizing the complex boundary of the set of quantum correlations.
- Open Access
- 7 April 2022
- Published by Springer Nature in Scientific Reports
- Vol. 12 (1) , 1-9
Implementation of quantum compression on IBM quantum computers
Advances in development of quantum computing processors brought ample opportunities to test the performance of various quantum algorithms with practical implementations. In this paper we report on implementations of quantum compression algorithm that can efficiently compress unknown quantum information. We restricted ourselves to compression of three pure qubits into two qubits, as the complexity of even such a simple implementation is barely within the reach of today’s quantum processors. We implemented the algorithm on IBM quantum processors with two different topological layouts—a fully connected triangle processor and a partially connected line processor. It turns out that the incomplete connectivity of the line processor affects the performance only minimally. On the other hand, it turns out that the transpilation, i.e. compilation of the circuit into gates physically available to the quantum processor, crucially influences the result. We also have seen that the compression followed by immediate decompression is, even for such a simple case, on the edge or even beyond the capabilities of currently available quantum processors.
- 7 April 2022
- Published by Springer Nature in Scientific Reports
- Vol. 12 (1) , 1-9
Open AccessImplementation of quantum compression on IBM quantum computers
Advances in development of quantum computing processors brought ample opportunities to test the performance of various quantum algorithms with practical implementations. In this paper we report on implementations of quantum compression algorithm that can efficiently compress unknown quantum information. We restricted ourselves to compression of three pure qubits into two qubits, as the complexity of even such a simple implementation is barely within the reach of today’s quantum processors. We implemented the algorithm on IBM quantum processors with two different topological layouts—a fully connected triangle processor and a partially connected line processor. It turns out that the incomplete connectivity of the line processor affects the performance only minimally. On the other hand, it turns out that the transpilation, i.e. compilation of the circuit into gates physically available to the quantum processor, crucially influences the result. We also have seen that the compression followed by immediate decompression is, even for such a simple case, on the edge or even beyond the capabilities of currently available quantum processors.
- Open Access
Best-Practice Aspects of Quantum-Computer Calculations: A Case Study of the Hydrogen Molecule
Quantum computers are reaching one crucial milestone after another. Motivated by their progress in quantum chemistry, we performed an extensive series of simulations of quantum-computer runs that were aimed at inspecting the best-practice aspects of these calculations. In order to compare the performance of different setups, the ground-state energy of the hydrogen molecule was chosen as a benchmark for which the exact solution exists in the literature. Applying the variational quantum eigensolver (VQE) to a qubit Hamiltonian obtained by the Bravyi–Kitaev transformation, we analyzed the impact of various computational technicalities. These included (i) the choice of the optimization methods, (ii) the architecture of the quantum circuits, as well as (iii) the different types of noise when simulating real quantum processors. On these, we eventually performed a series of experimental runs as a complement to our simulations. The simultaneous perturbation stochastic approximation (SPSA) and constrained optimization by linear approximation (COBYLA) optimization methods clearly outperformed the Nelder–Mead and Powell methods. The results obtained when using the variational form were better than those obtained when the form was used. The choice of an optimum entangling layer was sensitively interlinked with the choice of the optimization method. The circular entangling layer was found to worsen the performance of the COBYLA method, while the full-entangling layer improved it. All four optimization methods sometimes led to an energy that corresponded to an excited state rather than the ground state. We also show that a similarity analysis of measured probabilities can provide a useful insight.Open AccessBest-Practice Aspects of Quantum-Computer Calculations: A Case Study of the Hydrogen Molecule
Quantum computers are reaching one crucial milestone after another. Motivated by their progress in quantum chemistry, we performed an extensive series of simulations of quantum-computer runs that were aimed at inspecting the best-practice aspects of these calculations. In order to compare the performance of different setups, the ground-state energy of the hydrogen molecule was chosen as a benchmark for which the exact solution exists in the literature. Applying the variational quantum eigensolver (VQE) to a qubit Hamiltonian obtained by the Bravyi–Kitaev transformation, we analyzed the impact of various computational technicalities. These included (i) the choice of the optimization methods, (ii) the architecture of the quantum circuits, as well as (iii) the different types of noise when simulating real quantum processors. On these, we eventually performed a series of experimental runs as a complement to our simulations. The simultaneous perturbation stochastic approximation (SPSA) and constrained optimization by linear approximation (COBYLA) optimization methods clearly outperformed the Nelder–Mead and Powell methods. The results obtained when using the variational form were better than those obtained when the form was used. The choice of an optimum entangling layer was sensitively interlinked with the choice of the optimization method. The circular entangling layer was found to worsen the performance of the COBYLA method, while the full-entangling layer improved it. All four optimization methods sometimes led to an energy that corresponded to an excited state rather than the ground state. We also show that a similarity analysis of measured probabilities can provide a useful insight. - Open Access
- 14 January 2022
- Published by MDPI AG in Nanomaterials
- Vol. 12 (2) , 243
The Cost of Improving the Precision of the Variational Quantum Eigensolver for Quantum Chemistry
New approaches into computational quantum chemistry can be developed through the use of quantum computing. While universal, fault-tolerant quantum computers are still not available, and we want to utilize today’s noisy quantum processors. One of their flagship applications is the variational quantum eigensolver (VQE)—an algorithm for calculating the minimum energy of a physical Hamiltonian. In this study, we investigate how various types of errors affect the VQE and how to efficiently use the available resources to produce precise computational results. We utilize a simulator of a noisy quantum device, an exact statevector simulator, and physical quantum hardware to study the VQE algorithm for molecular hydrogen. We find that the optimal method of running the hybrid classical-quantum optimization is to: (i) allow some noise in intermediate energy evaluations, using fewer shots per step and fewer optimization iterations, but ensure a high final readout precision; (ii) emphasize efficient problem encoding and ansatz parametrization; and (iii) run all experiments within a short time-frame, avoiding parameter drift with time. Nevertheless, current publicly available quantum resources are still very noisy and scarce/expensive, and even when using them efficiently, it is quite difficult to perform trustworthy calculations of molecular energies.
- 14 January 2022
- Published by MDPI AG in Nanomaterials
- Vol. 12 (2) , 243
Open AccessThe Cost of Improving the Precision of the Variational Quantum Eigensolver for Quantum Chemistry
New approaches into computational quantum chemistry can be developed through the use of quantum computing. While universal, fault-tolerant quantum computers are still not available, and we want to utilize today’s noisy quantum processors. One of their flagship applications is the variational quantum eigensolver (VQE)—an algorithm for calculating the minimum energy of a physical Hamiltonian. In this study, we investigate how various types of errors affect the VQE and how to efficiently use the available resources to produce precise computational results. We utilize a simulator of a noisy quantum device, an exact statevector simulator, and physical quantum hardware to study the VQE algorithm for molecular hydrogen. We find that the optimal method of running the hybrid classical-quantum optimization is to: (i) allow some noise in intermediate energy evaluations, using fewer shots per step and fewer optimization iterations, but ensure a high final readout precision; (ii) emphasize efficient problem encoding and ansatz parametrization; and (iii) run all experiments within a short time-frame, avoiding parameter drift with time. Nevertheless, current publicly available quantum resources are still very noisy and scarce/expensive, and even when using them efficiently, it is quite difficult to perform trustworthy calculations of molecular energies.
- Open Access
Device-independent bounds from Cabello's nonlocality argument
Hardy-type arguments manifest Bell nonlocality in one of the simplest possible ways. Except for demonstrating nonclassical signature of entangled states in question, they can also serve for device-independent self-testing of states, as shown, e.g., in Phys. Rev. Lett. 109, 180401 (2012). Here we develop and broaden these results to an extended version of Hardy's argument, often referred to as Cabello's nonlocality argument. We show that, as in the simpler case of Hardy's nonlocality argument, the maximum quantum value for Cabello's nonlocality is achieved by a pure two-qubit state and projective measurements that are unique up to local isometries. We also examine the properties of a more realistic case when small errors in the ideal constraints are accepted within the probabilities obtained and prove that also in this case the two-qubit state and measurements are sufficient for obtaining the maximum quantum violation of the classical bound.
Open AccessDevice-independent bounds from Cabello's nonlocality argument
Hardy-type arguments manifest Bell nonlocality in one of the simplest possible ways. Except for demonstrating nonclassical signature of entangled states in question, they can also serve for device-independent self-testing of states, as shown, e.g., in Phys. Rev. Lett. 109, 180401 (2012). Here we develop and broaden these results to an extended version of Hardy's argument, often referred to as Cabello's nonlocality argument. We show that, as in the simpler case of Hardy's nonlocality argument, the maximum quantum value for Cabello's nonlocality is achieved by a pure two-qubit state and projective measurements that are unique up to local isometries. We also examine the properties of a more realistic case when small errors in the ideal constraints are accepted within the probabilities obtained and prove that also in this case the two-qubit state and measurements are sufficient for obtaining the maximum quantum violation of the classical bound.