arXiv (All)
open access
Quantum Space-Time Tradeoffs for TSP and Hypercube Path via Extremal Set Systems
We give a quantum analogue of the extremal set-system framework introduced by Ameli, Nederlof and Wang (FOCS 2026) and Dallant and Kozma (FOCS 2026) for space-time tradeoffs in TSP and related permutation problems. Let $1<S\leq 2$, and let $P_S$ denote the optimal inverse normalized chain density am
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
- Dynamic Entanglement Packet Scheduling for Quantum Networks#238548
- Resource-Aware Quantum Programming with General Recursion and Quantum Control#670409
- Resource-Aware Quantum Programming with General Recursion and Quantum Control#668344
- Riemannian Optimization for Multi-Player Quantum Games on Product Unitary Manifolds#984323
- End-to-end Optimization of Single-Shot Quantum Machine Learning for Bayesian Inference#1048309
Record · ID 1116367
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