4 papers · 1 filter
Solving Sparse SDPs in Sublinear Time: A Classical Algorithm Inspired by the Quantum OR Lemma
Fernando G. S. L. Brandão, Alexander M. Dalzell, András Gilyén +1
We give the first sublinear-time classical solvers for sparse semidefinite programs in the bounded-radius regime, without low-rank assumptions or Frobenius norm dependence on the c…
Depth-Optimal Quantum Compilation
Francisca Vasconcelos
We achieve the first constant-depth circuit for arbitrary single-qubit gate synthesis. Unlike prior approaches, the construction is fully unitary and requires no pre-supplied catal…
2-Fold Forrelation is in QAC
Francisca Vasconcelos
We show that 2-fold Forrelation with inverse-polylogarithmic promise gap can be solved, with bounded error, by polynomial-size QAC circuits. Unlike the standard oracle-based Fo…
Constant-Depth Unitary Preparation of Dicke States
Malvika Raj Joshi, Francisca Vasconcelos
Dicke states serve as a critical resource in quantum metrology, communication, and computation. However, unitary preparation of Dicke states is limited to logarithmic depth in stan…