arXiv (All)
open access
Reliable Sample-Level Quantum Error Mitigation via Dominance-Aware Clustering
Many quantum algorithms for classically difficult optimization tasks must return high-quality bitstrings from finitely many circuit executions, whereas most quantum error-mitigation methods target expectation values. We study sample-level recovery when measured probability mass is distributed around
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
- Hardware-Efficient Error Mitigation and Shot-Efficient Sampling on IBM Quantum Hardware#792535
- Hardware-Efficient Error Mitigation and Shot-Efficient Sampling on IBM Quantum Hardware#788535
- Fault-Tolerant Quantum Computation with Adversarial Errors#625405
- Fault-Tolerant Quantum Computation with Adversarial Errors#623132
- Mitigating errors by quantum verification and post-selection#1011931
Record · ID 822173
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