arXiv (All)
open access
Quantum WalkScore: Benchmarking Quantum Computers on the Graph Nodefinding Problem
Recent advances in quantum computing hardware toward fault-tolerance have increased interest in evaluating near-term quantum platforms on application-relevant quantum algorithms. In this work, we introduce Quantum WalkScore (QWS), a scalable application-oriented benchmark designed to assess the perf
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
- Demonstration of efficient predictive surrogates for large-scale quantum processors.#239670
- Sampled-Based Guided Quantum Walk: Non-variational quantum algorithm for combinatorial optimization#1156210
- Graph Neural Post-selection for Quantum Error Correction#1155439
- FT-Weave: Real-Time Compilation Framework for Reconfigurable Fault-Tolerant Quantum Architectures#1034386
- The Quantum Optimization Benchmarking Library.#315784
Record · ID 1014976
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