arXiv (All)
open access
Quantum chemistry with provable convergence via randomized sample-based Krylov quantum diagonalization
Quantum algorithms based on classical processing of individual samples have recently emerged as a promising route to perform large-scale quantum-chemical calculations on pre-fault-tolerant and early-fault-tolerant quantum devices. In these algorithms, the quantum computer acts as a sampling engine t
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Approximate Quantum State Preparation Through Proximal Policy Optimization#394428
- Probing the Error-Mitigation Threshold with Matrix Product States#998504
- Robustness of quantum spectrum estimation: weak Schur sampling under noisy inputs#1188260
- Bootstrapping Disordered Quantum Systems#1034890
- SAFE Quantum Machine Learning with Variational Quantum Classifiers#196455
Record · ID 1201905
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive