activity
20222026
most citedTrainability barriers and opportunities in quantum generative modeling

41 citations · 42 across the 5 of their papers we have counts for

collaborators

6 papers

quant-ph2026

Certifying Measurement Incompatibility under Bounded Classical Communication

Oxana Shaya

Measurement incompatibility enables quantum advantages in communication and state discrimination. It is also necessary for Bell nonlocality, which is used in device-independent pro…

quant-ph2026

PauLie: Fast Classification of Pauli Dynamical Lie Algebras

Oxana Shaya, Konstantin Golovkin, Mainak Roy +1

The dynamical Lie algebra (DLA) governs the controllability, expressibility, and simulation complexity of a quantum system. Explicitly computing it has been a major computational b…

quant-ph2025★ 1 cited

On the Complexity of Quantum States and Circuits from the Orthogonal and Symplectic Groups

Oxana Shaya, Zoë Holmes, Christoph Hirche +1

Understanding the complexity of quantum states and circuits is a central challenge in quantum information science, with broad implications in many-body physics, high-energy physics…

cs.IT2025

Partial orders and contraction for BISO channels

Christoph Hirche, Oxana Shaya

A fundamental question in information theory is to quantify the loss of information under a noisy channel. Partial orders and contraction coefficients are typical tools to that end…

quant-ph2023★ 41 cited

Trainability barriers and opportunities in quantum generative modeling

Manuel S. Rudolph, Sacha Lerch, Supanut Thanasilp +5

Quantum generative models provide inherently efficient sampling strategies and thus show promise for achieving an advantage using quantum hardware. In this work, we investigate the…

quant-ph2022

When could NISQ algorithms start to create value in discrete manufacturing ?

Oxana Shaya

Are quantum advantages in discrete manufacturing achievable in the near term? As manufacturing-relevant NISQ algorithms, we identified Quantum Annealing (QA) and the Quantum Approx…