6 citations · 8 across the 6 of their papers we have counts for
6 papers
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…
Operator convexity along lines, self-concordance, and sandwiched Rényi entropies
Kerry He, James Saunderson, Hamza Fawzi
Barrier methods play a central role in the theory and practice of convex optimization. One of the most general and successful analyses of barrier methods for convex optimization, d…
QICS: Quantum Information Conic Solver
Kerry He, James Saunderson, Hamza Fawzi
We introduce QICS (Quantum Information Conic Solver), an open-source primal-dual interior point solver fully implemented in Python, which is focused on solving optimization problem…
Interior Point Methods for Structured Quantum Relative Entropy Optimization Problems
Kerry He, James Saunderson, Hamza Fawzi
Quantum relative entropy optimization refers to a class of convex problems in which a linear functional is minimized over an affine section of the epigraph of the quantum relative…
Efficient Computation of the Quantum Rate-Distortion Function
Kerry He, James Saunderson, Hamza Fawzi
The quantum rate-distortion function plays a fundamental role in quantum information theory, however there is currently no practical algorithm which can efficiently compute this fu…
A Bregman Proximal Perspective on Classical and Quantum Blahut-Arimoto Algorithms
Kerry He, James Saunderson, Hamza Fawzi
The Blahut-Arimoto algorithm is a well-known method to compute classical channel capacities and rate-distortion functions. Recent works have extended this algorithm to compute vari…