Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2607.14231

A Compass on the Quantum State Sphere: The Hopf Ansatz for Arbitrary Pure-State Optimization

Ruge Lin, Guangxi Li

quant-phSubmitted Jul 15, 2026• Announced Jul 17, 2026• 1 citation
v1 · Jul 15, 2026v2 · Oct 19, 2026
arXivHTMLPDF

Abstract

Optimizing arbitrary quantum state vectors is like navigating the unit sphere in Hilbert space: beyond target reachability, optimization asks for coordinates, local distance information, and measurable directions. We introduce the Hopf ansatz, a binary-tree circuit for arbitrary normalized real and complex state vectors. Internal angles steer probability between subtrees, leaf phases carry the complex degrees of freedom, and the same tree gives state preparation and an explicit inverse map from amplitudes to physical angles. Together these structures act as a compass for the search: the inverse map gives coordinates, the diagonal induced metric gives local distance information, and nonzero coordinate tangents become preparable normalized states. For Hamiltonian objectives, and for objectives with the same local transition-moment form, each gradient component is a known scale factor times a transition moment between the current state and a tangent state. A branch-state construction expresses these moments through expectation-value measurements, while the tree organizes the compiled gradient settings by magnitude layer and leaf-indexed phase family. Thus the number of distinct compiled gradient-access circuit families grows only logarithmically with Hilbert-space dimension, while the measurement budget required for a chosen precision remains a separate statistical cost. In deterministic real-state benchmarks with exact costs, exact gradients, and known global optima, metric-aware Hopf optimizers reach numerical-precision median gaps, with the clearest baseline gains in smaller VQE mean final gaps and stronger concentration of metrology-inspired traces at numerical precision. The Hopf ansatz turns universal state preparation into a navigable framework for arbitrary pure-state optimization.

Related papers

Compass in the Mirror: Quantum Backpropagation with the Hopf Ansatz

Ruge Lin, Ranyiliu Chen

A variational quantum state may have many control angles, and its complete gradient contains one derivative for each. The task is to turn access to selected derivatives into a shared finite-shot record for the complete vector. The Hopf ansatz supplies the setting: it constructs any normalized pure state from nested two-way magnitude splits and, for complex states, leaf phases, with one directly programmed angle per split or phase. Earlier Hopf constructions prepare the state, recover coordinates from known amplitudes, and provide indexed derivative access. With a phase-calibrated controlled reflection, the inverse Hopf frame maps each normalized magnitude direction to a computational label, so every all-$X$ outcome contributes to every magnitude derivative. A separate signed leaf record supplies the complex phase block. A checkpoint variant reverses only the suffix below a selected depth and returns that layer's gradient block. For a complete chart with $M$ real-valued parameters, sufficient execution counts are $\mathcal{O}(\log\log M)$ for the global method and $\mathcal{O}(\log M\log\log M)$ for the complete checkpoint schedule at fixed additive coordinate accuracy and confidence. The global saving is record reuse, not a reduction of the $M$-entry output. Under the designated direct-angle schedules, the global method's assigned Hopf CNOT work and input/output-inclusive storage have at most logarithmic overhead relative to a matched scalar evaluation. The same Hopf geometry thus carries a state forward and the objective's complete coordinate response backward.

quant-pharXiv:2610.14177•Oct 13, 2026•0 citations

A hardware-efficient variational ansatz with an exact diagonal metric for real- and imaginary-time evolution and Haar sampling

Dario Picozzi

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ätze); 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.

quant-pharXiv:2607.07942•Jul 10, 2026•1 citation

Z-basis metrics for parameterized quantum circuits: exact identities, structural blind spots, pole-damped optimization, and a relaxation-aware entropy benchmark

Vicente Humberto Monteverde

The Qang (qg) framework [1] expresses single-qubit rotations through two measurement-level quantities, the polar bias qgZ = ⟨σz⟩ and the outcome entropy qgS = H(p0). We report results obtained with the open-source reference implementation qang. First, the two metrics are linked by an exact, branch-free identity, qgS = H (1 + qgZ)/2 , which holds for any single-qubit state. Consequently, any new multi-qubit information must come from the joint outcome distribution. We name the resulting Z-basis total correlation and give its bounds and its scope: it is not an entanglement measure. Second, we identify exact blind spots: graph-state entanglement and readout-only dephasing are invisible to every Z-diagonal statistic, and qg-space updates cannot reach optima outside [0, π] because of the arccos range. On H2 they recover none of the correlation energy. Third, we study a pole-damped gradient step whose damping schedule is |dqgZ/dθ|. On a 300-landscape benchmark, H2, and a 4-qubit LiH Hamiltonian with a mixed Ry/Rx ansatz, it trades 3-20× more iterations at well-tuned learning rates for convergence where plain gradient descent diverges. Fourth, as a benchmark, qgS tracks heavy output probability (r = −0.93) and needs no calibration, unlike linear XEB. However, it is ÙOÍ monotonic under amplitude damping: under device-calibrated noise with added idle relaxation it falls below its own noiseless value. Pairing qgS with the register-averaged qgZ removes the ambiguity in 23 of 24 circuits tested. Every number is reproduced by a script and pinned by a regression test in the public repository.

•Sep 23, 2026•0 citations

Z-basis metrics for parameterized quantum circuits: exact identities, structural blind spots, pole-damped optimization, and a relaxation-aware entropy benchmark

Vicente Humberto Monteverde

The Qang () framework [1] expresses single-qubit rotations through two measurement-level quantities, the polar bias and the outcome entropy . We report results obtained with the open-source reference implementation qang. First, the two metrics are linked by an exact, branch-free identity, , which holds for any single-qubit state. Consequently, any new multi-qubit information must come from the joint outcome distribution. We name the resulting Z-basis total correlation and give its bounds and its scope: it is not an entanglement measure. Second, we identify exact blind spots: graph-state entanglement and readout-only dephasing are invisible to every Z-diagonal statistic, and qg-space updates cannot reach optima outside because of the range. On H unsigned qg updates recover none of the correlation energy. Keeping the sign of as a branch label removes this limit and reaches the FCI energy, but the best signed update reduces to -space descent, so qg coordinates bring no optimization gain. Third, we study a pole-damped gradient step whose damping schedule is . On a 300-landscape benchmark, H, and a 4-qubit LiH Hamiltonian with a mixed ansatz, it trades 3–20 more iterations at well-tuned learning rates for convergence where plain gradient descent diverges. Fourth, as a benchmark, tracks heavy output probability () and needs no calibration, unlike linear XEB. However, it is not monotonic under amplitude damping: under device-calibrated noise with added idle relaxation it falls below its own noiseless value. Pairing with the register-averaged removes the ambiguity in 23 of 24 circuits tested. A summary section lists fifty-two follow-up studies (QML encoding, control quantization, noise-type detection, circuit knitting, chemistry, error mitigation, thermal states, error correction, Hubbard dynamics, constrained QAOA, qubit characterization, syndrome tracking, coherence, few-shot estimation, IonQ noise models, shot-noise propagation, neural quantum states, coherent gate errors, symmetry checks in rotated bases, Heisenberg-chain dynamics, classical shadows, noisy Grover search, GHZ metrology, circuit-level surface codes, a lattice gauge theory, and the choice between filter and ZNE by shot budget), each with its classical or standard control; for the qg quantities, direct measurement is 3–41 cheaper than classical shadows, and the per-qubit reading loses to the outcome histogram when the answer is a bitstring; the symmetry-witness results are developed in a companion paper. Every number is reproduced by a script and pinned by a regression test in the public repository.

•Sep 30, 2026•0 citations

Multivariate quantum signal processing with optimal query complexity

Mingrui Jing, Xin Wang, Zhan Yu +1 more

Polynomial transformations of data encoded in quantum operations are a building block of quantum algorithms, and their query complexity measures how often those operations are used. For multiple variables, existing methods either realize restricted polynomial families or implement monomials separately at a query cost exponential in the number of variables. We present a quantum circuit that implements every multivariate trigonometric polynomial up to an explicit normalization. The circuit processes one variable coherently over the frequency components of the remaining variables, allowing all components to share the same signal queries. Each variable is queried exactly as many times as its degree in the polynomial, and we prove that this query complexity is optimal. We further extend the construction to commuting unitaries. The resulting circuit applies the multivariate polynomial simultaneously across their shared eigenbasis, using the minimum numbers of forward and inverse queries to each unitary. We also study trainable rotations with fixed preparation and a local readout of the last input. At query depth at least two, independent uniform initialization gives every active readout gradient a variance lower bound set by its squared branch weight and the inverse square root of the depth, uniformly over data states and dimensions. For supervised squared loss, retaining sample correlations gives an initialization gradient-variance bound in terms of targets and input spectra. This also bounds the expected loss decrease after the first exact gradient step with a specified step size. These results provide a scalable and practical solution for developing multivariate quantum algorithms and quantum learning models.

quant-pharXiv:2610.03393•Oct 5, 2026•1 citation

Efficient Complex-Valued State Preparation on Bucket Brigade QRAM

Alessandro Berti, Francesco Ghisoni

Efficient quantum state preparation is a critical component in quantum algorithms that process large classical data, and it is fundamental to realizing quantum advantage in domains such as machine learning, quantum linear algebra, and quantum finance. Building on the framework of~\cite{berti2025efficient}, which integrates Bucket Brigade QRAM (BBQRAM) with a segment tree to achieve amplitude encoding in polylogarithmic query time, we present two improvements within the same architecture-aware framework. First, we remove the $U_{2\mathrm{CR}}$ subroutine by classically precomputing the rotation angles determined by the segment tree and storing these angles directly in the BBQRAM cells. The tradeoff is that the classically loaded QRAM stores precomputed fixed-point angles rather than raw subtree weights. Second, we extend the construction to complex-valued matrices $A \in \mathbb{C}^{M \times N}$ by storing a leaf phase alongside each precomputed rotation angle and using a two-step magnitude-then-phase procedure; the real signed case is naturally subsumed as a one-bit phase specialization. At unchanged $\mathcal{O}(\log_2^2(MN))$ BBQRAM query complexity, the QPU procedure reduces to BBQRAM retrievals and controlled-rotation cascades, with $\mathcal{O}(MN)$ memory cells per matrix and no reversible arithmetic on the QPU.

quant-pharXiv:2604.25644•Apr 29, 2026•0 citations
Optimizing arbitrary quantum state vectors is like navigating the unit sphere in Hilbert space: beyond target reachability, optimization asks for coordinates, local distance information, and measurable directions. We introduce the Hopf ansatz, a binary-tree circuit for arbitrary normalized real and complex state vectors. Internal angles steer probability between subtrees, leaf phases carry the complex degrees of freedom, and the same tree gives state preparation and an explicit inverse map from amplitudes to physical angles. Together these structures act as a compass for the search: the inverse map gives coordinates, the diagonal induced metric gives local distance information, and nonzero coordinate tangents become preparable normalized states.
For Hamiltonian objectives, and for objectives with the same local transition-moment form, each gradient component is a known scale factor times a transition moment between the current state and a tangent state. A branch-state construction expresses these moments through expectation-value measurements, while the tree organizes the compiled gradient settings by magnitude layer and leaf-indexed phase family. Thus the number of distinct compiled gradient-access circuit families grows only logarithmically with Hilbert-space dimension, while the measurement budget required for a chosen precision remains a separate statistical cost. In deterministic real-state benchmarks with exact costs, exact gradients, and known global optima, metric-aware Hopf optimizers reach numerical-precision median gaps, with the clearest baseline gains in smaller VQE mean final gaps and stronger concentration of metrology-inspired traces at numerical precision. The Hopf ansatz turns universal state preparation into a navigable framework for arbitrary pure-state optimization.
A variational quantum state may have many control angles, and its complete gradient contains one derivative for each. The task is to turn access to selected derivatives into a shared finite-shot record for the complete vector. The Hopf ansatz supplies the setting: it constructs any normalized pure state from nested two-way magnitude splits and, for complex states, leaf phases, with one directly programmed angle per split or phase. Earlier Hopf constructions prepare the state, recover coordinates from known amplitudes, and provide indexed derivative access. With a phase-calibrated controlled reflection, the inverse Hopf frame maps each normalized magnitude direction to a computational label, so every all-XXX outcome contributes to every magnitude derivative. A separate signed leaf record supplies the complex phase block. A checkpoint variant reverses only the suffix below a selected depth and returns that layer's gradient block. For a complete chart with MMM real-valued parameters, sufficient execution counts are O(log⁡log⁡M)\mathcal{O}(\log\log M)O(loglogM) for the global method and O(log⁡Mlog⁡log⁡M)\mathcal{O}(\log M\log\log M)O(logMloglogM) for the complete checkpoint schedule at fixed additive coordinate accuracy and confidence. The global saving is record reuse, not a reduction of the MMM-entry output. Under the designated direct-angle schedules, the global method's assigned Hopf CNOT work and input/output-inclusive storage have at most logarithmic overhead relative to a matched scalar evaluation. The same Hopf geometry thus carries a state forward and the objective's complete coordinate response backward.
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 nnn-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 kkk 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 kkk; a variant reaches near-optimal O(nk/log⁡n)O(nk/\log n)O(nk/logn) 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 kkk (a boundary proved for a general class of sector-sparse ansätze); 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.
The Qang (qg) framework [1] expresses single-qubit rotations through two measurement-level quantities, the polar bias qgZ = ⟨σz⟩ and the outcome entropy qgS = H(p0). We report results obtained with the open-source reference implementation qang. First, the two metrics are linked by an exact, branch-free identity, qgS = H (1 + qgZ)/2 , which holds for any single-qubit state. Consequently, any new multi-qubit information must come from the joint outcome distribution. We name the resulting Z-basis total correlation and give its bounds and its scope: it is not an entanglement measure. Second, we identify exact blind spots: graph-state entanglement and readout-only dephasing are invisible to every Z-diagonal statistic, and qg-space updates cannot reach optima outside [0, π] because of the arccos range. On H2 they recover none of the correlation energy. Third, we study a pole-damped gradient step whose damping schedule is |dqgZ/dθ|. On a 300-landscape benchmark, H2, and a 4-qubit LiH Hamiltonian with a mixed Ry/Rx ansatz, it trades 3-20× more iterations at well-tuned learning rates for convergence where plain gradient descent diverges. Fourth, as a benchmark, qgS tracks heavy output probability (r = −0.93) and needs no calibration, unlike linear XEB. However, it is ÙOÍ monotonic under amplitude damping: under device-calibrated noise with added idle relaxation it falls below its own noiseless value. Pairing qgS with the register-averaged qgZ removes the ambiguity in 23 of 24 circuits tested. Every number is reproduced by a script and pinned by a regression test in the public repository.
The Qang () framework [1] expresses single-qubit rotations through two measurement-level quantities, the polar bias and the outcome entropy . We report results obtained with the open-source reference implementation qang. First, the two metrics are linked by an exact, branch-free identity, , which holds for any single-qubit state. Consequently, any new multi-qubit information must come from the joint outcome distribution. We name the resulting Z-basis total correlation and give its bounds and its scope: it is not an entanglement measure. Second, we identify exact blind spots: graph-state entanglement and readout-only dephasing are invisible to every Z-diagonal statistic, and qg-space updates cannot reach optima outside because of the range. On H unsigned qg updates recover none of the correlation energy. Keeping the sign of as a branch label removes this limit and reaches the FCI energy, but the best signed update reduces to -space descent, so qg coordinates bring no optimization gain. Third, we study a pole-damped gradient step whose damping schedule is . On a 300-landscape benchmark, H, and a 4-qubit LiH Hamiltonian with a mixed ansatz, it trades 3–20 more iterations at well-tuned learning rates for convergence where plain gradient descent diverges. Fourth, as a benchmark, tracks heavy output probability () and needs no calibration, unlike linear XEB. However, it is not monotonic under amplitude damping: under device-calibrated noise with added idle relaxation it falls below its own noiseless value. Pairing with the register-averaged removes the ambiguity in 23 of 24 circuits tested. A summary section lists fifty-two follow-up studies (QML encoding, control quantization, noise-type detection, circuit knitting, chemistry, error mitigation, thermal states, error correction, Hubbard dynamics, constrained QAOA, qubit characterization, syndrome tracking, coherence, few-shot estimation, IonQ noise models, shot-noise propagation, neural quantum states, coherent gate errors, symmetry checks in rotated bases, Heisenberg-chain dynamics, classical shadows, noisy Grover search, GHZ metrology, circuit-level surface codes, a lattice gauge theory, and the choice between filter and ZNE by shot budget), each with its classical or standard control; for the qg quantities, direct measurement is 3–41 cheaper than classical shadows, and the per-qubit reading loses to the outcome histogram when the answer is a bitstring; the symmetry-witness results are developed in a companion paper. Every number is reproduced by a script and pinned by a regression test in the public repository.
Polynomial transformations of data encoded in quantum operations are a building block of quantum algorithms, and their query complexity measures how often those operations are used. For multiple variables, existing methods either realize restricted polynomial families or implement monomials separately at a query cost exponential in the number of variables. We present a quantum circuit that implements every multivariate trigonometric polynomial up to an explicit normalization. The circuit processes one variable coherently over the frequency components of the remaining variables, allowing all components to share the same signal queries. Each variable is queried exactly as many times as its degree in the polynomial, and we prove that this query complexity is optimal. We further extend the construction to commuting unitaries. The resulting circuit applies the multivariate polynomial simultaneously across their shared eigenbasis, using the minimum numbers of forward and inverse queries to each unitary. We also study trainable rotations with fixed preparation and a local readout of the last input. At query depth at least two, independent uniform initialization gives every active readout gradient a variance lower bound set by its squared branch weight and the inverse square root of the depth, uniformly over data states and dimensions. For supervised squared loss, retaining sample correlations gives an initialization gradient-variance bound in terms of targets and input spectra. This also bounds the expected loss decrease after the first exact gradient step with a specified step size. These results provide a scalable and practical solution for developing multivariate quantum algorithms and quantum learning models.
Efficient quantum state preparation is a critical component in quantum algorithms that process large classical data, and it is fundamental to realizing quantum advantage in domains such as machine learning, quantum linear algebra, and quantum finance. Building on the framework of~\cite{berti2025efficient}, which integrates Bucket Brigade QRAM (BBQRAM) with a segment tree to achieve amplitude encoding in polylogarithmic query time, we present two improvements within the same architecture-aware framework. First, we remove the U2CRU_{2\mathrm{CR}}U2CR​ subroutine by classically precomputing the rotation angles determined by the segment tree and storing these angles directly in the BBQRAM cells. The tradeoff is that the classically loaded QRAM stores precomputed fixed-point angles rather than raw subtree weights. Second, we extend the construction to complex-valued matrices A∈CM×NA \in \mathbb{C}^{M \times N}A∈CM×N by storing a leaf phase alongside each precomputed rotation angle and using a two-step magnitude-then-phase procedure; the real signed case is naturally subsumed as a one-bit phase specialization. At unchanged O(log⁡22(MN))\mathcal{O}(\log_2^2(MN))O(log22​(MN)) BBQRAM query complexity, the QPU procedure reduces to BBQRAM retrievals and controlled-rotation cascades, with O(MN)\mathcal{O}(MN)O(MN) memory cells per matrix and no reversible arithmetic on the QPU.