arXiv (All)
open access
Quantum Query Lower Bounds for Triangle-Listing and Spanners
This paper gives quantum query lower bounds for two relational graph problems, triangle listing and explicit multiplicative spanner construction, in the general graph query model, where quantum adjacency, degree and neighborhood queries are all available in arbitrary superposition. Both results are
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
- Generating Dicke State Graphs#1037247
- Microwave Quantum Key Distribution with Cryogenic Microwave Components for Superconducting Quantum Computing#475843
- Deployment of Large IQP Circuit Born Machines on Qubit-Limited Hardware Using Noise Injection#1129760
- A Quantum Framework for K Coloring of Graphs#1116679
- Distributing Quantum Computations, Shot-Wise#274736
Record · ID 1132292
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