4 citations · 10 across the 19 of their papers we have counts for
6 papers · 1 filter
Topological Quantum Compilation Using Mixed-Integer Programming
Pavel Rytir, Phillip C. Burke, Christos Aravanis +2
We introduce the Mixed-Integer Quadratically Constrained Quadratic Programming framework for the quantum compilation problem and apply it in the context of topological quantum comp…
First passage time in space-dependent stochastic resetting
Johannes Aspman, Daniel Mastropietro, Jakub Marecek
We consider the mean first passage time (MFPT) through a target of interest for a diffusive particle of Langevin type, with the added condition that the particle is reset to its or…
ExMAG: Learning of Maximally Ancestral Graphs
Petr Ryšavý, Pavel Rytíř, Xiaoyu He +2
In mixed graphs, there are both directed and bidirected edges. An extension of acyclicity to this mixed-graph setting is known as maximally ancestral graphs. This extension is of c…
Sample Complexity of Bias Detection with Subsampled Point-to-Subspace Distances
German Martinez Matilla, Jakub Marecek
Sample complexity of bias estimation is a lower bound on the runtime of any bias detection method. Many regulatory frameworks require the bias to be tested for all subgroups, whose…
Power System Steady-State Estimation Revisited
Pavel Rytir, Ales Wodecki, Martin Malachov +4
In power system steady-state estimation (PSSE), one needs to consider (1) the need for robust statistics, (2) the nonconvex transmission constraints, (3) the fast-varying nature of…
Identifiability of Autonomous and Controlled Open Quantum Systems
Waqas Parvaiz, Johannes Aspman, Ales Wodecki +2
Open quantum systems are a rich area of research in the intersection of quantum mechanics and stochastic analysis. By considering a variety of master equations, we unify multiple v…