activity
20152026
most citedAn initialization strategy for addressing barren plateaus in parametrized quantum circuits

393 citations · 835 across the 28 of their papers we have counts for

collaborators
Showing quant-phShow all

15 papers · 1 filter

quant-ph2024★ 8 cited

Curriculum reinforcement learning for quantum architecture search under hardware errors

Yash J. Patel, Akash Kundu, Mateusz Ostaszewski +3

The key challenge in the noisy intermediate-scale quantum era is finding useful circuits compatible with current device limitations. Variational quantum algorithms (VQAs) offer a p…

quant-ph2023★ 11 cited

Enhancing variational quantum state diagonalization using reinforcement learning techniques

Akash Kundu, Przemysław Bedełek, Mateusz Ostaszewski +4

The variational quantum algorithms are crucial for the application of NISQ computers. Such algorithms require short quantum circuits, which are more amenable to implementation on n…

quant-ph2021★ 54 cited

Reinforcement learning for optimization of variational quantum circuit architectures

Mateusz Ostaszewski, Lea M. Trenkwalder, Wojciech Masarczyk +2

The study of Variational Quantum Eigensolvers (VQEs) has been in the spotlight in recent times as they may lead to real-world applications of near-term quantum devices. However, th…

quant-ph2019★ 209 cited

Structure optimization for parameterized quantum circuits

Mateusz Ostaszewski, Edward Grant, Marcello Benedetti

We propose an efficient method for simultaneously optimizing both the structure and parameter values of quantum circuits with only a small computational overhead. Shallow circuits…

quant-ph2019★ 393 cited

An initialization strategy for addressing barren plateaus in parametrized quantum circuits

Edward Grant, Leonard Wossnig, Mateusz Ostaszewski +1

Parametrized quantum circuits initialized with random initial parameter values are characterized by barren plateaus where the gradient becomes exponentially small in the number of…

quant-ph2018★ 18 cited

Approximation of quantum control correction scheme using deep neural networks

M. Ostaszewski, J. A. Miszczak, P. Sadowski +1

We study the functional relationship between quantum control pulses in the idealized case and the pulses in the presence of an unwanted drift. We show that a class of artificial ne…

quant-ph2018★ 1 cited

Geometrical versus time-series representation of data in quantum control learning

M. Ostaszewski, J. A. Miszczak, P. Sadowski

Recently machine learning techniques have become popular for analysing physical systems and solving problems occurring in quantum computing. In this paper we focus on using such te…

quant-ph2018★ 9 cited

QSWalk.jl: Julia package for quantum stochastic walks analysis

Adam Glos, Jarosław Adam Miszczak, Mateusz Ostaszewski

The presented paper describes QSWalk.jl package for Julia programming language, developed for the purpose of simulating the evolution of open quantum systems. The package enables t…

quant-ph2017★ 3 cited

Rapid and Robust generation of Einstein--Podolsky--Rosen pairs with Spin Chains

Kieran N. Wilkinson, Marta P. Estarellas, Timothy P. Spiller +1

We investigate the ability of dimerized spin chains with defects to generate EPR pairs to very high fidelity through their natural dynamics. We propose two protocols based on diffe…

quant-ph2017★ 5 cited

Limit properties of global interaction stochastic quantum walks on directed graphs

Adam Glos, Jarosław Adam Miszczak, Mateusz Ostaszewski

The main results of our work is determining the differences between limiting properties in various models of quantum stochastic walks. In particular, we prove that in the case of s…

quant-ph2017★ 28 cited

Superdiffusive quantum stochastic walk definable of arbitrary directed graph

Krzysztof Domino, Adam Glos, Mateusz Ostaszewski

In this paper we define a quantum stochastic walk on arbitrary directed graph with super-diffusive propagation on a line graph. Our model is based on global environment interaction…

quant-ph2016★ 28 cited

Efficient simulation of sparse Markovian quantum dynamics

Andrew M. Childs, Tongyang Li

Quantum algorithms for simulating Hamiltonian dynamics have been extensively developed, but there has been much less work on quantum algorithms for simulating the dynamics of open…

quant-ph2016★ 3 cited

Properties of quantum stochastic walks from the asymptotic scaling exponent

Krzysztof Domino, Adam Glos, Mateusz Ostaszewski +2

This work focuses on the study of quantum stochastic walks, which are a generalization of coherent, i. e. unitary quantum walks. Our main goal is to present a measure of a coherenc…

quant-ph2015★ 11 cited

Lively quantum walks on cycles

Przemysław Sadowski, Jarosław Adam Miszczak, Mateusz Ostaszewski

We introduce a family of quantum walks on cycles parametrized by their liveliness, defined by the ability to execute a long-range move. We investigate the behaviour of the probabil…

quant-ph2015★ 20 cited

Quantum image classification using principal component analysis

Mateusz Ostaszewski, Przemysław Sadowski, Piotr Gawron

We present a novel quantum algorithm for classification of images. The algorithm is constructed using principal component analysis and von Neuman quantum measurements. In order to…