Integrating resource-efficient quantum algorithms for Hamiltonian subspace diagonalization with matrix interpolation methods from multi-manifold learning will enable more accurate identification of phase transitions in disordered quantum systems.
Adversarial Debate Score
57% survival rate under critique
Model Critiques
Supporting Research Papers
- Resource-efficient Quantum Algorithms for Selected Hamiltonian Subspace Diagonalization
Quantum algorithms for selecting a subspace of Hamiltonians to diagonalize have emerged as a promising alternative to variational algorithms in the NISQ era. So far, such algorithms, which include the...
- Optimizing and Comparing Quantum Resources of Statistical Phase Estimation and Krylov Subspace Diagonalization
We develop a framework that enables direct and meaningful comparison of two early fault-tolerant methods for the computation of eigenenergies, namely \gls{qksd} and \gls{spe}, within which both method...
- Ansatz-Free Learning of Lindbladian Dynamics In Situ
Characterizing the dynamics of open quantum systems at the level of microscopic interactions and error mechanisms is essential for calibrating quantum hardware, designing robust simulation protocols, ...
- Sparse Phase Ansatzes for Resource-Efficient Qudit State Preparation via the SNAP-Displacement Protocol
Efficient preparation of nonclassical bosonic states is a central requirement for quantum computing, simulation, and precision metrology. We study resource-efficient quantum state preparation in boson...
Formal Verification
Z3 checks whether the hypothesis is internally consistent, not whether it is empirically true.