arXiv (All)
open access
Parameterised graph theory for tensor networks: entanglement rerouting, structural simplification, and agnostic tomography
Parameterised graph theory studies how the complexity of graph-theoretic problems depends on structural parameters of the input graph. This perspective has proved useful in analysing tensor-network simulation (Markov and Shi, 2008). Its implications for tensor-network representations and tomography
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
- Entanglement without Quantum Mechanics: Operational Constraints on the Quantum Signature#1012099
- Multivariate quantum state preparation with optimized tensor networks#987066
- Overview of Tensor-Based Cooperative MIMO Communication Systems—Part 1: Tensor Modeling#20395
- Tight Lower Bounds for State Tomography with Limited Entanglement#972768
- Matrix Product Belief Propagation#972651
Record · ID 927031
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