Pith. sign in

REVIEW 5 cited by

Quantum Data Center Infrastructures: A Scalable Architectural Design Perspective

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2501.05598 v1 pith:OHAYQQTH submitted 2025-01-09 quant-ph physics.optics

classification quant-phphysics.optics
keywords quantumarchitecturescomputingdatadesigndevelopmentnetworksprocessors
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

This paper presents the design of scalable quantum networks that utilize optical switches to interconnect multiple quantum processors, facilitating large-scale quantum computing. By leveraging these novel architectures, we aim to address the limitations of current quantum processors and explore the potential of quantum data centers. We provide an in-depth analysis of these architectures through the development of simulation tools and performance metrics, offering a detailed comparison of their advantages and trade-offs. We hope this work serves as a foundation for the development of efficient and resilient quantum networks, designed to meet the evolving demands of future quantum computing applications.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 5 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. A Framework for Quantum Data Center Emulation Using Digital Quantum Computers

    quant-ph 2025-09 unverdicted novelty 7.0 of 10

    Partitioning a single quantum processor into logical QPUs with collisional-model noise emulates a quantum data center on real hardware.

  2. Entanglement Cost of Erasure Correction in Quantum MDS Codes

    quant-ph 2025-05 conditional novelty 6.0 of 10

    For an [[n,2t-n]]_Q quantum MDS code, correcting a single erased node over a star network costs exactly 2t qudits when the replacement node is the hub and 2t minus 1 qudits when a helper node is the hub.

  3. Network-Aware Scheduling for Remote Gate Execution in Quantum Data Centers

    quant-ph 2025-04 conditional novelty 5.0 of 10

    In simulated quantum data centers, dynamic scheduling of entanglement generation reduces circuit execution delay compared to static scheduling, though aggressive lookahead hurts when qubit coherence is short.

  4. Optimized Quantum Circuit Partitioning Across Multiple Quantum Processors

    quant-ph 2025-01 reject novelty 4.0 of 10

    A window-based circuit partitioning heuristic with dynamic one-way teleportation reduces EPR pairs versus a static baseline, and a structured QFT distribution uses nm/2 EPR pairs on m processors.

  5. Performance Analysis of QAOA Across Distributed Quantum Network Topologies Using SwitchQNet

    quant-ph 2026-07 conditional novelty 3.5 of 10

    QAOA on SwitchQNet yields modest ~1.4–2.2× communication-latency reductions across QDC topologies and is useful mainly as a diagnostic benchmark for entanglement-aware scheduling.

Pith tools