arXiv (All)
open access
Robust Treasure Hunt in Anonymous Graphs with Quantum Pebbles by Oblivious Agents
and-cluster-computingdata-structures-and-algorithmsdistributedemerging-technologiesparallelquantum-physics
We study how to find a hidden treasure in anonymous graphs using an agent that has no persistent memory. The nodes are indistinguishable, and only edges have local port numbers. Classical pebbles placed by an oracle cannot guide an oblivious agent to the treasure. We introduce \emph{quantum pebbles}
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
- One-Way Quantum Symmetric Private Information Retrieval Protocol From A Single Database Server Using NISQ Devices#1157441
- When Claws Remember but Do Not Tell: Stealthy Memory Injection in Persistent Personal Agents#343361
- Mitigating errors by quantum verification and post-selection#1011931
- Purification of photonic graph states#985256
Record · ID 984892
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