arXiv (All)
open access
A Quantum Algorithm for $st$-Transport on Flat Connection Graphs
We study a generalization of undirected $st$-connectivity to graphs whose edges carry quantum operations. Let $G=(V,E)$ be an undirected graph on $n$ vertices in which each edge $\{u,v\}$ is labeled by a unitary $U_{uv}\in\mathbb{C}^{k\times k}$, with $U_{vu}=U_{uv}^\dagger$. We assume the labels fo
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
- Diagonal Unitary Covariant Superchannels#1143659
- Experimental Protocol Fingerprinting in Quantum Networks via Physical Layer Side Channel Analysis#405584
- Dynamic Entanglement Packet Scheduling for Quantum Networks#238548
- A note on gauge-covariant vertex operators of the ambitwistor string#1063237
- Finite-Precision Quantum Mechanics: Quantum Parcels, Information and Geometry#652313
Record · ID 1154494
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