A hardware-efficient $n-qubit ansatz, which parametrises states by a binary tree and whose Fubini-Study pullback metric is diagonal in closed form, which reaches reference-level accuracy with one to three orders of magnitude fewer two-qubit gates than leading alternatives.
Abstract
Variational quantum algorithms depend on the geometry of their parametrised circuits: metric-aware optimisation and time evolution require the Fubini-Study metric, which has hitherto demanded costly auxiliary measurements and ill-conditioned inversions. This work introduces a hardware-efficient $n$-qubit ansatz, which parametrises states by a binary tree and whose Fubini-Study pullback metric is diagonal in closed form. Quantum natural gradient on the tree parameters, variational imaginary- and real-time evolution, and exact unitary-invariant (Haar) sampling on a symmetry sector run with no auxiliary metric circuits or matrix inversion. When the target state is supported on a subspace of $k$ computational-basis states, the redundant tree parameters carry a gauge freedom a pruning compiler converts into circuits whose two-qubit count provably grows linearly in $k$; a variant reaches near-optimal $O(nk/\log n)$ scaling with the closed-form metric intact. On electronic-structure calculations for small molecules and half-filled Hubbard quench dynamics, the method reaches reference-level accuracy with one to three orders of magnitude fewer two-qubit gates than leading alternatives. Interchangeable constructions (a Schur-transform dressing or internal reparameterisations) make the ansatz exactly spin-adapted, with fixed total spin at every parameter and no penalty terms. The bare ansatz is an exactly controllable, well-conditioned and barren-plateau-free primitive for preparing and sampling sector states: on its own, it is classically simulable in $k$ (a boundary proved for a general class of sector-sparse ans\"atze); composed with a classically hard dressing, it yields molecular ground states, sector-Haar benchmarking, thermal correlators, and exact effective Hamiltonians trained from energy measurements alone, with the composed circuit carrying the potential for quantum advantage.
Accurate real-time simulation of correlated quantum systems remains challenging for both classical methods and near-term quantum hardware. We introduce operator-projected variational quantum real-time evolution (OVQRTE), which updates a parameterized circuit by enforcing the Ehrenfest equations for a selected set of ob...
Aeishah Ameera Anuar, P. Sriluckshmy, Riccardo Rossi et al.· 1 citation
Deterministic exact inversion of an arbitrary $d$-dimensional unitary requires {$\Theta(d^2)$} coherent forward calls in the worst case. We ask how this cost changes for Hamiltonian evolution $U(x)=\exp(i\sum_j x_jH_j)$ when the generators are known but the parameters are hidden. For one-parameter families with a fixed...
Ji-Zhe Lai, M. Jing, Erdong Huang et al.· 0 citations
A protocol for approximating the measurement distributions of quantum states, extending beyond standard observable estimation is introduced, and tightened gate complexity bounds for practically relevant systems, including those with k-local interactions, long-tailed matrix ensembles, and conserved quantities are provid...
Arul Rhik Mazumder, James D. Watson, Samson Wang· 0 citations
A variational quantum eigensolver, whose qubit requirement is logarithmic in the matrix dimension is proposed, and the first end-to-end implementation of such an approach within a cutting-plane framework is presented, together with an operator-derived ansatz whose entanglement structure is read directly from the Pauli...
Gizem Ozbaygin, Burak Kocuk, Diego A. Mor'an· 0 citations
A qubit-efficient variational framework based on Pauli correlation encoding (PCE) is introduced and applied to electric power demand portfolio optimization, establishing PCE as a physically motivated and qubit-efficient framework for large-scale combinatorial optimization.
It is demonstrated that this problem can be effectively amortized across an arbitrary and universal set of Hamiltonians by a foundation model with $\sim0.5$B variational parameters, trained with contemporary techniques from large language models and deep reinforcement learning.
Timothy Heightman, Elena Orlova, Philip Mantrov et al.· 1 citation· ⚡1
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.