arXiv (All)
open access
Superlinear Quantum Query Lower Bounds for Subgraph Detection
Subgraph detection asks whether an $n$-vertex graph, accessed through queries to its adjacency matrix, contains a copy of a fixed graph $H$. We prove the first unconditional superlinear lower bounds on the bounded-error quantum query complexity of this problem, answering a longstanding open question
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
- Edge-Local and Qubit-Efficient Quantum Graph Learning for the NISQ Era#792704
- Edge-Local and Qubit-Efficient Quantum Graph Learning for the NISQ Era#788704
- Optimal T Counts under Sparsity: from QROM to State Preparation and Block Encoding#1157296
- Optimal inequalities for completely bounded polynomials and the limitations of quantum query algorithms#972144
- The optimal search on graph by continuous-time quantum walks#821630
Record · ID 1154524
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