4 papers · 1 filter
Gradient descent reliably finds depth- and gate-optimal circuits for generic unitaries
Janani Gomathi, Alex Meiburg
When the gate set has continuous parameters, synthesizing a unitary operator as a quantum circuit is, in principle, always possible using exact methods. However, efficiently findin…
A Formalization of the Generalized Quantum Stein's Lemma in Lean
Alex Meiburg, Leonardo A. Lessa, Rodolfo R. Soldati
The Generalized Quantum Stein's Lemma is a theorem in quantum hypothesis testing that provides an operational meaning to the relative entropy within the context of quantum resource…
Quantum SAT Problems with Finite Sets of Projectors are Complete for a Plethora of Classes
Ricardo Rivera Cardoso, Alex Meiburg, Daniel Nagaj
Previously, all known variants of the Quantum Satisfiability (QSAT) problem, i.e. deciding whether a -local (-body) Hamiltonian is frustration-free, could be classified as be…
Quantum Constraint Problems can be complete for , , and more
Alex Meiburg
A quantum constraint problem is a frustration-free Hamiltonian problem: given a collection of local operators, is there a state that is in the ground state of each operator simulta…