{"ID":2862229,"CreatedAt":"2026-06-01T04:54:23.091178241Z","UpdatedAt":"2026-06-01T04:54:23.091178241Z","DeletedAt":null,"paper_url":"https://arxiv.org/abs/2510.01154","arxiv_id":"2510.01154","title":"Advantage for Discrete Variational Quantum Algorithms in Circuit Recompilation","abstract":"The relative power of quantum algorithms, using an adaptive access to quantum devices, versus classical post-processing methods that rely only on an initial quantum data set, remains the subject of active debate. Here, we present evidence for an exponential separation between adaptive and non-adaptive strategies in a quantum circuit recompilation task. Our construction features compilation problems with loss landscapes for discrete optimization that are unimodal yet non-separable, a structure known in classical optimization to confer exponential advantages to adaptive search. Numerical experiments show that optimization can efficiently uncover hidden circuit structure operating in the regime of volume-law entanglement and high-magic, while non-adaptive approaches are seemingly limited to exhaustive search requiring exponential resources. These results indicate that adaptive access to quantum hardware provides a fundamental advantage.","short_abstract":"The relative power of quantum algorithms, using an adaptive access to quantum devices, versus classical post-processing methods that rely only on an initial quantum data set, remains the subject of active debate. Here, we present evidence for an exponential separation between adaptive and non-adaptive strategies in a q...","url_abs":"https://arxiv.org/abs/2510.01154","url_pdf":"https://arxiv.org/pdf/2510.01154v1","authors":"[\"Oleksandr Kyriienko\",\"Chukwudubem Umeano\",\"Zoë Holmes\"]","published":"2025-10-01T17:42:55Z","proceeding":"quant-ph","tasks":"[\"quant-ph\",\"cs.NE\"]","methods":"[]","has_code":false}