arXiv (All)
open access
Exact Maximum Likelihood Decoding beyond Treewidth via Rank-Decomposition Dynamic Programming
Maximum-likelihood decoding provides an optimal decoding strategy for quantum error correction under stochastic Pauli noise. However, computing logical-class probabilities is challenging, and the leading exact tensor-network contraction requires time exponential in treewidth. In this work, we introd
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
- Classical-Quantum Algorithm for Solving Stochastic Programs#631401
- A quantum-assisted framework for PDE-based Bayesian inverse problems#780769
- A quantum-assisted framework for PDE-based Bayesian inverse problems#779394
- Per-Matrix Optimality Is Not Enough: Three-Level Optimization for Low-Rank LLM Compression#1109878
- Cycle Codes and Decoded Quantum Interferometry#1145203
Record · ID 1144523
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