arXiv (All)
open access
Quantum Algorithms on Edge Lists: Hiding, Shuffling, and Cycle Finding
The edge list model is arguably the simplest input model for graphs, where the graph is specified by a list of its edges. In this model, we study the quantum query complexity of three variants of the triangle finding problem. The first asks whether there exists a triangle containing a target edge an
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
- Simultaneously Query-Optimal Quantum Linear-System Algorithm#1118759
- Quantum Query Complexity for List Search#1143337
- One-Shot and Concurrent Hitting Times for Grover-Coined Quantum Walks on Cubelike Graphs#927788
- Batched pattern search for QAOA parameter optimization on cloud-accessed quantum hardware#1071436
- A log-depth in-place quantum Fourier transform that rarely needs ancillas#1110088
Record · ID 1037691
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