QRSI spans degenerate quantum eigenspaces almost surely by conjugating the Hamiltonian with random unitaries on g parallel branches and using subspace estimation, while exactly preserving the spectral gap.
Quantum computing quantum monte carlo algorithm.Physical Review A, 112(2), August 2025
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
quant-ph 2years
2026 2verdicts
UNVERDICTED 2representative citing papers
QC-AFQMC per-step scaling reduced from O(N^5.5) to O(N^4.5) via Aitken's block transformation for singular Pfaffians and algorithmic differentiation for force bias, with demonstrations on H8 from real quantum data and Li2O4.
citing papers explorer
-
Quantum Randomized Subspace Iteration
QRSI spans degenerate quantum eigenspaces almost surely by conjugating the Hamiltonian with random unitaries on g parallel branches and using subspace estimation, while exactly preserving the spectral gap.
-
Quantum-Classical Auxiliary-Field Quantum Monte Carlo at the Edge of Practicability
QC-AFQMC per-step scaling reduced from O(N^5.5) to O(N^4.5) via Aitken's block transformation for singular Pfaffians and algorithmic differentiation for force bias, with demonstrations on H8 from real quantum data and Li2O4.