activity
20172026
most citedLearning dynamic polynomial proofs

3 citations · 3 across the 7 of their papers we have counts for

collaborators

20 papers

quant-ph2026

Automated near-term quantum algorithm discovery for molecular ground states

Fabian Finger, Frederic Rapp, Pranav Kalidindi +10

Designing quantum algorithms is a complex and counterintuitive task, making it an ideal candidate for AI-driven algorithm discovery. To this end, we employ the Hive, an AI platform…

quant-ph2026

Fast convergence of Majorana Propagation for weakly interacting fermions

Giorgio Facelli, Hamza Fawzi, Omar Fawzi

Simulating the time dynamics of an observable under Hamiltonian evolution is one of the most promising candidates for quantum advantage as we do not expect efficient classical algo…

math.OC2025

Exact algorithms for quadratic optimization over roots of unity

Ahmad Al-Sulami, Hamza Fawzi, Shengding Sun

We consider the problem of optimizing a multivariate quadratic function where each decision variable is constrained to be a complex 'th root of unity. Such problems have applica…

math.OC2025

Convergence of linear programming hierarchies for Gibbs states of spin systems

Hamza Fawzi, Omar Fawzi

We consider the problem of computing expectation values of local functions under the Gibbs distribution of a spin system. In particular, we study two families of linear programming…

quant-ph2025

Adversarial quantum channel discrimination

Kun Fang, Hamza Fawzi, Omar Fawzi

We introduce a new framework for quantum channel discrimination in an adversarial setting, where the tester plays against an adversary. We show that in asymmetric hypothesis testin…

quant-ph2025

Classical Estimation of the Free Energy and Quantum Gibbs Sampling from the Markov Entropy Decomposition

Samuel O. Scalet, Angela Capel, Anirban N. Chowdhury +4

We revisit the Markov Entropy Decomposition, a classical convex relaxation algorithm introduced by Poulin and Hastings to approximate the free energy in quantum spin lattices. We i…