REVIEW 2 cited by
Distributed Quantum Simulation
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
Quantum simulation is a promising pathway toward practical quantum advantage by simulating large-scale quantum systems. In this work, we propose communication-efficient distributed quantum simulation protocols by exploring three quantum simulation algorithms, including the product formula, the truncated Taylor series, and the processing of quantum signals over a quantum network. Our protocols are further shown to be optimal by deriving a lower bound on the quantum communication complexity for distributed quantum simulations with respect to evolution time and the number of distributed quantum processing units. Additionally, our distributed techniques go beyond quantum simulation and are applied to distributed versions of Grover's algorithms and quantum phase estimation. Our work not only paves the way for achieving a practical quantum advantage by scalable quantum simulation but also enlightens the design of more general distributed architectures across various physical systems for quantum computation.
Forward citations
Cited by 2 Pith papers
-
COSMA: Communication-aware Optimization of Fermionic Simulation Kernels for Modular Quantum Architectures
COSMA jointly optimizes fermion-to-qubit mapping, Pauli scheduling, and multi-core allocation, cutting inter-core transfer cost by up to 2.5× (median ~1.7×) on molecular Trotter kernels.
-
Trotterization, Operator Scrambling, and Entanglement
Trotter simulation error for observables is bounded by operator scrambling, and sufficient entanglement reduces this error to a normalized Frobenius-norm scaling.
Discussion (0). Continue with ORCID to comment.