21 citations · 21 across the 7 of their papers we have counts for
9 papers
Evaluating Calibration-Based Digital Twins for IBM Quantum Hardware Simulation
Edgars Bautra, Maksims Dimitrijevs, Abuzer Yakaryilmaz
We evaluate calibration-based digital twins for IBM Quantum hardware, aiming to reproduce hardware measurement outcomes on classical simulators. We present a workflow that builds t…
Benchmarking the Lights Out Problem on Real Quantum Hardware
Maksims Dimitrijevs, Maria Palchiha, Abuzer Yakaryilmaz
We implement the Lights Out problem on a 2D grid and on Mobius ladder graphs and evaluate the performance of Grover's search on real quantum hardware. We use two instances using 9…
Exploring Hybrid Quantum-Classical Methods for Practical Time-Series Forecasting
Maksims Dimitrijevs, Mārtiņš Kālis, Iļja Repko
Time-series forecasting is essential for strategic planning and resource allocation. In this work, we explore two quantum-based approaches for time-series forecasting. The first ap…
Quantum speedup for track reconstruction in particle accelerators
Duarte Magano, Akshat Kumar, Mārtiņš Kālis +10
To investigate the fundamental nature of matter and its interactions, particles are accelerated to very high energies and collided inside detectors, producing a multitude of other…
The minimal probabilistic and quantum finite automata recognizing uncountably many languages with fixed cutpoints
Aleksejs Naumovs, Maksims Dimitrijevs, Abuzer Yakaryılmaz
It is known that 2-state binary and 3-state unary probabilistic finite automata and 2-state unary quantum finite automata recognize uncountably many languages with cutpoints. These…
Postselecting probabilistic finite state recognizers and verifiers
Maksims Dimitrijevs, Abuzer Yakaryılmaz
In this paper, we investigate the computational and verification power of bounded-error postselecting realtime probabilistic finite state automata (PostPFAs). We show that PostPFAs…
Probabilistic verification of all languages
Maksims Dimitrijevs, Abuzer Yakaryılmaz
We present three protocols for verifying all languages: (i) For any unary (binary) language, there is a log-space (linear-space) interactive proof system (IPS); (ii) for any langua…
Uncountable realtime probabilistic classes
Maksims Dimitrijevs, Abuzer Yakaryılmaz
We investigate the minimum cases for realtime probabilistic machines that can define uncountably many languages with bounded error. We show that logarithmic space is enough for rea…
Uncountable classical and quantum complexity classes
Maksims Dimitrijevs, Abuzer Yakaryılmaz
Polynomial--time constant--space quantum Turing machines (QTMs) and logarithmic--space probabilistic Turing machines (PTMs) recognize uncountably many languages with bounded error…