Quantum Speedups for Approximating the John Ellipsoid

TL;DR

This paper introduces the first quantum algorithm for approximating the John ellipsoid, achieving quadratic speedup over classical algorithms and enabling faster computations in high-dimensional convex geometry.

Contribution

The paper presents a novel quantum algorithm for computing the John ellipsoid with improved runtime, leveraging spectral and leverage score approximation techniques.

Findings

Achieves quadratic speedup in tall matrix regimes.

Runs in $O(\sqrt{n}d^{1.5} + d^\omega)$ time, outperforming classical methods.

Provides the first quantum approach to this classical problem.

Abstract

In 1948, Fritz John proposed a theorem stating that every convex body has a unique maximal volume inscribed ellipsoid, known as the John ellipsoid. The John ellipsoid has become fundamental in mathematics, with extensive applications in high-dimensional sampling, linear programming, and machine learning. Designing faster algorithms to compute the John ellipsoid is therefore an important and emerging problem. In [Cohen, Cousins, Lee, Yang COLT 2019], they established an algorithm for approximating the John ellipsoid for a symmetric convex polytope defined by a matrix $A \in \mathbb{R}^{n \times d}$ with a time complexity of $O(nd^2)$. This was later improved to $O(\text{nnz}(A) + d^\omega)$ by [Song, Yang, Yang, Zhou 2022], where $\text{nnz}(A)$ is the number of nonzero entries of $A$ and $\omega$ is the matrix multiplication exponent. Currently $\omega \approx 2.371$ [Alman, Duan, Williams, Xu, Xu, Zhou 2024]. In this work, we present the first quantum algorithm that computes the John ellipsoid utilizing recent advances in quantum algorithms for spectral approximation and leverage score approximation, running in $O(\sqrt{n}d^{1.5} + d^\omega)$ time. In the tall matrix regime, our algorithm achieves quadratic speedup, resulting in a sublinear running time and significantly outperforming the current best classical algorithms.