qSHIFT: An Adaptive Sampling Protocol for Higher-Order Quantum Simulation

Abstract:Early fault-tolerant quantum computers are expected to support reliable but depth-limited quantum circuits, while classical computational resources remain available. These conditions have motivated hybrid coherent algorithms which use quantum simulation as a central algorithmic primitive. This trend calls for quantum-simulation methods that operate with shallow circuits and admit systematic improvements in gate-complexity scaling. Here, we introduce qSHIFT, an adaptive sampling protocol for simulating a Hamiltonian $H=\sum_{i=1}^{L}h_iH_i$. qSHIFT achieves gate complexity $\mathcal{O}_r\left((\lambda t)^{1+1/r}/\varepsilon^{1/r}\right)$, where $r$ is an algorithmic parameter, $\lambda=\sum_i |h_i|$ and $\varepsilon$ denotes the target precision. Relative to qDRIFT, increasing $r$ systematically improves the gate complexity for a given target precision without incurring extra quantum cost. Unlike Trotterization, the number of sampled gates is nominally independent of $L$. qSHIFT retains the elementary gate set of qDRIFT and, unlike qSWIFT, requires neither ancillary qubits nor controlled operations. The improved gate complexity scaling is obtained at the cost of a classical calculation involving $L^r$ coefficients at each adaptive sampling round.

arXiv:2604.26263 [quant-ph]

(or arXiv:2604.26263v3 [quant-ph] for this version)

https://doi.org/10.48550/arXiv.2604.26263 Focus to learn more arXiv-issued DOI via DataCite

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.