aiqbench analysis
This research demonstrates how measurement feedback can transform shallow quantum circuits into classically hard problems by encoding discrete logarithm instances within local observables. The findings establish a strict hierarchy of computational power, proving that polynomial levels of adaptive feedback enable genuine quantum advantage even without deep circuit architectures. This work significantly advances the theoretical understanding of resource requirements for achieving practical supremacy in near-term devices.
Quantum Advantage with Adaptive Shallow Circuits
arXiv:2608.15545v1 Announce Type: new Abstract: Quantum advantage is widely expected to require sufficiently deep circuits, where correlations and global computational structure can grow beyond the reach of efficient classical simulation. This expectation is especially stark for constant-depth circuits with local readout: the expectation value of any fixed local observable lies within a bounded backward lightcone and is therefore classically tractable. Here we show that measurement feedback changes this picture. We establish a strict hierarchy of computational power: at fixed coherent depth, increasing the number of feedback outcomes strictly enlarges the class of functions accessible through a local expectation value. The two ends of this hierarchy exhibit distinct computational regimes. With logarithmic feedback, local expectation values for product-state inputs are efficiently classically simulable. Polynomial feedback, by contrast, enables an explicit family of adaptive shallow circuits to encode prime-field discrete logarithm problem~(DLP) into a fixed single-qubit expectation. Assuming the standard worst-case classical hardness of DLP, estimating this expectation value is classically hard. These results reveal a feedback-driven complexity transition, with further implications for resource lower bounds on DLP and the complexity of local-observable estimation under area-law entanglement. Our results open a new route to quantum advantage with shallow quantum circuits.
Abstract:Quantum advantage is widely expected to require sufficiently deep circuits, where correlations and global computational structure can grow beyond the reach of efficient classical simulation. This expectation is especially stark for constant-depth circuits with local readout: the expectation value of any fixed local observable lies within a bounded backward lightcone and is therefore classically tractable. Here we show that measurement feedback changes this picture. We establish a strict hierarchy of computational power: at fixed coherent depth, increasing the number of feedback outcomes strictly enlarges the class of functions accessible through a local expectation value. The two ends of this hierarchy exhibit distinct computational regimes. With logarithmic feedback, local expectation values for product-state inputs are efficiently classically simulable. Polynomial feedback, by contrast, enables an explicit family of adaptive shallow circuits to encode prime-field discrete logarithm problem~(DLP) into a fixed single-qubit expectation. Assuming the standard worst-case classical hardness of DLP, estimating this expectation value is classically hard. These results reveal a feedback-driven complexity transition, with further implications for resource lower bounds on DLP and the complexity of local-observable estimation under area-law entanglement. Our results open a new route to quantum advantage with shallow quantum circuits.
arXiv:2608.15545 [quant-ph]
(or arXiv:2608.15545v1 [quant-ph] for this version)
https://doi.org/10.48550/arXiv.2608.15545 Focus to learn more arXiv-issued DOI via DataCite (pending registration)
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Full text under the publisher's open licence · 284 words
Related coverage

Unconditional Quantum Advantage for Sampling with Shallow Circuits
Quantum Journal · Aug 12, 2026

Quantum Algorithms Refine Searches for Stable States in Noisy Computers
Quantum Zeitgeist · Jun 8, 2026
Learning to Prepare Molecular Ground States with Transformer Models
arXiv · Jul 28, 2026

Reinforcement learning cuts gate count for 4-qubit states
Quantum Zeitgeist · Oct 17, 2026