REVIEW 4 cited by
Distributed Quantum Computing: a Survey
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
read the original abstract
Nowadays, quantum computing has reached the engineering phase, with fully-functional quantum processors integrating hundred of noisy qubits available. Yet -- to fully unveil the potential of quantum computing out of the labs and into business reality -- the challenge ahead is to substantially scale the qubit number, reaching orders of magnitude exceeding the thousands (if not millions) of noise-free qubits. To this aim, there exists a broad consensus among both academic and industry communities about considering the distributed computing paradigm as the key solution for achieving such a scaling, by envision multiple moderate-to-small-scale quantum processors communicating and cooperating to execute computational tasks exceeding the computational resources available within a single processing device. The aim of this survey is to provide the reader with an overview about the main challenges and open problems arising with distributed quantum computing, and with an easy access and guide towards the relevant literature and the prominent results from a computer/communications engineering perspective.
Forward citations
Cited by 4 Pith papers
-
A Framework for Quantum Data Center Emulation Using Digital Quantum Computers
Partitioning a single quantum processor into logical QPUs with collisional-model noise emulates a quantum data center on real hardware.
-
Fat-Tree QRAM: A High-Bandwidth Shared Quantum Random Access Memory for Parallel Queries
Fat-Tree QRAM pipelines up to log(N) simultaneous queries to a size-N memory in about log(N) time, using only about twice the hardware of a bucket-brigade QRAM.
-
CFT Complexity and Penalty Factors
A submersion-based method turns weighted generator costs into state-complexity metrics for CFTs, giving analytic formulas in simple limits and constraints on which weight choices are viable.
-
Toward Autonomous Digital Populations for Communication-Sensing-Computation Ecosystem
Proposes a digital-twin-based architectural vision in which edge devices form evolvable digital populations integrated into an autonomous communication-sensing-computation ecosystem.
Discussion (0). Continue with ORCID to comment.