MetaMorphQ defines five physics-derived invariants for VQE circuits that enable oracle-free testing with zero false positives and Youden's J of 0.57 on 500 benchmarks versus 0.02 for convergence testing.
The theory of variational hybrid quantum-classical algorithms
4 Pith papers cite this work. Polarity classification is still indexing.
years
2026 4verdicts
UNVERDICTED 4representative citing papers
GQKAE uses quantum-inspired Kolmogorov-Arnold networks to reduce parameters by 66% in generative quantum eigensolvers while achieving chemical accuracy on H4, N2, LiH, and other molecules.
SQMG introduces an atom-fixed, bond-reused variational quantum circuit for molecular graph generation that achieves linear qubit scaling and enables GPU-accelerated tensor-network simulation up to 40 heavy atoms.
Diagonal ANOs are mathematically equivalent to full ANOs modulo unitary similarity, reducing k-local observable complexity from O(4^k) to O(2^k) and lowering measurement-side classical computation while including conventional VQCs as a special case.
citing papers explorer
-
MetaMorphQ: Physics-Based Metamorphic Testing of Variational Quantum Circuits
MetaMorphQ defines five physics-derived invariants for VQE circuits that enable oracle-free testing with zero false positives and Youden's J of 0.57 on 500 benchmarks versus 0.02 for convergence testing.
-
Generative Quantum-inspired Kolmogorov-Arnold Eigensolver
GQKAE uses quantum-inspired Kolmogorov-Arnold networks to reduce parameters by 66% in generative quantum eigensolvers while achieving chemical accuracy on H4, N2, LiH, and other molecules.
-
Scalable Quantum Molecular Generation via GPU-Accelerated Tensor-Network Simulation
SQMG introduces an atom-fixed, bond-reused variational quantum circuit for molecular graph generation that achieves linear qubit scaling and enables GPU-accelerated tensor-network simulation up to 40 heavy atoms.
-
Diagonal Adaptive Non-local Observables on Quantum Neural Networks
Diagonal ANOs are mathematically equivalent to full ANOs modulo unitary similarity, reducing k-local observable complexity from O(4^k) to O(2^k) and lowering measurement-side classical computation while including conventional VQCs as a special case.