Attila Lovas

Dr. Attila Lovas


Research Focus & Metrics

Academic Career Length

12Years (2015-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
29 June 2017 in Journal of Physics A: Mathematical and Theoretical
Verified
Journal Article
Closed access
PDF file
ALAttila Lovas
Attila Lovas
AAAttila Andai
Attila Andai
The geometric separability probability of composite quantum systems has been extensively studied in the recent decades. One of the simplest but strikingly difficult problem is to compute the separability probability of qubit–qubit and rebit–rebit quantum states with respect to the Hilbert–Schmidt measure. A lot of numerical simulations confirm the P r e b i t − r e b i t = 29 64 and P q u b i t − q u b i t = 8 33 conjectured probabilities. We provide a rigorous proof for the separability probability in the real case and we give explicit integral formulas for the complex and quaternionic case. Milz and Strunz studied the separability probability with respect to given subsystems. They conjectured that the separability probability of qubit–qubit (and qubit-qutrit) states of the form of ( D 1 C C ∗ D 2 ) depends on D = D 1 + D 2 (on single qubit subsystems), moreover it depends only on the Bloch radii ( r ) of D and it is constant in r . Using the Peres–Horodecki criterion for separability we give a mathematical proof for the 29 64 probability and we present an integral formula for the complex case which hopefully will help to prove the 8 33 probability, too. We prove Milz and Strunz’s conjecture for rebit–rebit and qubit–qubit states. The case, when the state space is endowed with the volume form generated by the operator monotone function f ( x ) = x is also studied in detail. We show that even in this setting Milz and Strunz’s conjecture holds true and we give an integral formula for separability probability according to this measure.

12 October 2018 in Reviews in Mathematical Physics
Verified
Journal Article
Open access
PDF file
ALAttila Lovas
Attila Lovas
AAAttila Andai
Attila Andai
The simplest building blocks for quantum computations are the qubit-qubit quantum channels. In this paper, we analyze the structure of these channels via their Choi representation. The restriction of a quantum channel to the space of classical states (i.e. probability distributions) is called the underlying classical channel. The structure of quantum channels over a fixed classical channel is studied, the volume of the general and unital qubit channels with respect to the Lebesgue measure is computed and explicit formulas are presented for the distribution of the volume of quantum channels over given classical channels. We study the state transformation under uniformly random quantum channels. If one applies a uniformly random quantum channel (general or unital) to a given qubit state, the distribution of the resulted quantum states is presented.

17 July 2015 in International Journal of Biometeorology
Verified
Journal Article
Closed access
PDF file
KTKlara Toro
Klara Toro
RPRita Pongracz
Rita Pongracz
JBJudit Bartholy
Judit Bartholy
AVAletta Váradi-T
Aletta Váradi-T
BMBoglárka Marcsa
Boglárka Marcsa
PSPéter Sótonyi
Péter Sótonyi

28 August 2023 in Applied Mathematics & Optimization
Verified
Journal Article
Open access
PDF file
ALAttila Lovas
Attila Lovas
MRM. Rásonyi
M. Rásonyi
We study the mixing properties of an important optimization algorithm of machine learning: the stochastic gradient Langevin dynamics (SGLD) with a fixed step size. The data stream is not assumed to be independent hence the SGLD is not a Markov chain, merely a Markov chain in a random environment, which complicates the mathematical treatment considerably. We derive a strong law of large numbers and a functional central limit theorem for SGLD.

1 September 2021 in Operations Research Letters
Verified
Journal Article
Open access
ALAttila Lovas
Attila Lovas
MRMiklós Rásonyi
Miklós Rásonyi

5 November 2024 in Journal of Applied Probability
Verified
Journal Article
Open access
PDF file
LGLászló Györfi
László Györfi
ALAttila Lovas
Attila Lovas
MRMiklós Rásonyi
Miklós Rásonyi
We revisit processes generated by iterated random functions driven by a stationary and ergodic sequence. Such a process is called strongly stable if a random initialization exists for which the process is stationary and ergodic, and for any other initialization the difference of the two processes converges to zero almost surely. Under some mild conditions on the corresponding recursive map, without any condition on the driving sequence we show the strong stability of iterations. Several applications are surveyed such as generalized autoregression and queuing. Furthermore, new results are deduced for Langevin-type iterations with dependent noise and for multitype branching processes.