arXiv (All)
open access
Optimized Compilation for Distributed Quantum Computing
In many practical applications, quantum algorithms require several qubits, significantly more than those available with current noisy intermediate-scale quantum processors. Distributed quantum computing (DQC) is considered a scalable approach to increasing the number of available qubits for computat
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
- DPRQ: A Dynamic Programming-based Qubit Routing Algorithm for Collective Communication in Distributed Quantum Computing#985277
- Towards Reproducible Evaluation of Distributed Quantum Circuit Partitioning Algorithms#996939
- Hybrid quantum-classical algorithms for high performance computing#357463
- A Modular, Topology-Aware Software Stack for Entanglement-Based Distributed Quantum Computing#1109698
- Quantum Approximate Optimization via Noise-Directed Adaptive Warm-Starting#1063965
Record · ID 996883
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