24 citations · 57 across the 20 of their papers we have counts for
4 papers · 1 filter
Quasi-quantum states and the quasi-quantum PCP theorem
Itai Arad, Miklos Santha
We introduce -local quasi-quantum states: a superset of the regular quantum states, defined by relaxing the positivity constraint. We show that a -local quasi-quantum state o…
Polynomial Time Algorithms for Integer Programming and Unbounded Subset Sum in the Total Regime
Divesh Aggarwal, Antoine Joux, Miklos Santha +1
The Unbounded Subset Sum (USS) problem is an NP-hard computational problem where the goal is to decide whether there exist non-negative integers such that $x_1 a…
On the dynamical Lie algebras of quantum approximate optimization algorithms
Jonathan Allcock, Miklos Santha, Pei Yuan +1
Dynamical Lie algebras (DLAs) have emerged as a valuable tool in the study of parameterized quantum circuits, helping to characterize both their expressiveness and trainability. In…
Beyond Bell sampling: stabilizer state learning and quantum pseudorandomness lower bounds on qudits
Jonathan Allcock, Joao F. Doriguello, Gábor Ivanyos +1
Bell sampling is a simple yet powerful measurement primitive that has recently attracted a lot of attention, and has proven to be a valuable tool in studying stabiliser states. Unf…