activity
20202026
most citedTruss topology design under harmonic loads: Peak power minimization with semidefinite programming

4 citations · 10 across the 19 of their papers we have counts for

collaborators

20 papers

math.ST2026

Recovering Lower-Dimensional Semialgebraic Support of a Measure from its Moments

Ruben Karapetyan, Shenyuan Ma, Ales Wodecki +1

Recovering probability measures from their moments has numerous applications, esp. in connection with the method of moments in statistics and optimization. In the setting where mea…

cs.AI2026

When Can One Obtain Certificates of Optimality Using Positivstellensaetze?

Nayoon Kim, Allen Gehret, Shenyuan Ma +1

We study certificates of positivity and optimality for learning problems whose objectives and constraints need not be polynomial. We isolate an axiomatic core of Fischer's construc…

quant-ph2026

Setting angles in quantum approximate optimization at utility-scale

Maosheng Guo, Joel Jurado Diaz, Anurag Ramesh +16

The quantum approximate optimization algorithm (QAOA) is a powerful heuristic that seeks to solve combinatorial optimization problems using quantum hardware and classical optimizat…

quant-ph2025

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…

cond-mat.stat-mech2025

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…

cs.LG2025

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…

cs.LG2025

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…

math.OC2025

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…

quant-ph2025

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…

cs.LG2024

ExDBN: Learning Dynamic Bayesian Networks using Extended Mixed-Integer Programming Formulations

Pavel Rytir, Ales Wodecki, Georgios Korpas +1

Causal learning from data has received much attention recently. Bayesian networks can be used to capture causal relationships. There, one recovers a weighted directed acyclic graph…

quant-ph2024★ 3 cited

Topological quantum compilation of two-qubit gates

Phillip C. Burke, Christos Aravanis, Johannes Aspman +2

We investigate the topological quantum compilation of two-qubit operations within a system of Fibonacci anyons. Our primary goal is to generate gates that are approximately leakage…

cs.LG2024

Empirical Bayes for Dynamic Bayesian Networks Using Generalized Variational Inference

Vyacheslav Kungurtsev, Apaar, Aarya Khandelwal +3

In this work, we demonstrate the Empirical Bayes approach to learning a Dynamic Bayesian Network. By starting with several point estimates of structure and weights, we can use a da…

cs.LG2024

ExDAG: an MIQP Algorithm for Learning DAGs

Pavel Rytir, Ales Wodecki, Jakub Marecek

There has been a growing interest in causal learning in recent years. Commonly used representations of causal structures, including Bayesian networks and structural equation models…

quant-ph2024

Spectral Methods for Quantum Optimal Control: Artificial Boundary Conditions

Ales Wodecki, Jakub Marecek, Vyacheslav Kungurtsev +3

The problem of quantum state preparation is one of the main challenges in achieving the quantum advantage. Furthermore, classically, for multi-level problems, our ability to solve…

quant-ph2024

Learning quantum Hamiltonians at any temperature in polynomial time with Chebyshev and bit complexity

Ales Wodecki, Jakub Marecek

We consider the problem of learning local quantum Hamiltonians given copies of their Gibbs state at a known inverse temperature, following Haah et al. [2108.04842] and Bakshi et al…

math.OC2024

The Effects of Transmission-Rights Pricing on Multi-Stage Electricity Markets

Erwann de Belloy de Saint-Lienard, Jakub Marecek, Vyacheslav Kungurtsev

Cross-border transmission infrastructure is pivotal in balancing modern power systems, but requires fair allocation of cross-border transmission capacity, possibly via fair pricing…

math.OC2024★ 4 cited

Truss topology design under harmonic loads: Peak power minimization with semidefinite programming

Shenyuan Ma, Jakub Marecek, Vyacheslav Kungurtsev +1

Designing lightweight yet stiff structures that can withstand vibrations is a crucial task in structural optimization. Here, we present a novel framework for truss topology optimiz…

math.OC2023

Scheduling a Multi-Product Pipeline: A Discretized MILP Formulation

Ales Wodecki, Pavel Rytir, Vyacheslav Kungurtsev +1

Multi-product pipelines are a highly efficient means of transporting liquids. Traditionally used to transport petroleum, its products and derivatives, they are now being repurposed…

quant-ph2023★ 2 cited

Parallel variational quantum algorithms with gradient-informed restart to speed up optimisation in the presence of barren plateaus

Daniel Mastropietro, Georgios Korpas, Vyacheslav Kungurtsev +1

Inspired by the Fleming-Viot stochastic process, we propose a parallel implementation of variational quantum algorithms with the aim of reducing the time spent by the algorithm in…

quant-ph2020★ 1 cited

Quantum Optimal Control via Magnus Expansion and Non-Commutative Polynomial Optimization

Jakub Marecek, Jiri Vala

Quantum optimal control has numerous important applications ranging from pulse shaping in magnetic-resonance imagining to laser control of chemical reactions and quantum computing.…