analiza aiqbench
This research presents communication-efficient protocols for distributed quantum simulation, significantly lowering local hardware demands while maintaining gate complexity comparable to monolithic systems. By establishing optimal lower bounds on quantum communication complexity, the study offers a scalable pathway toward practical quantum advantage using multiple processing units. These techniques also extend to other fundamental algorithms like Grover's search and quantum phase estimation, broadening their utility across general distributed quantum architectures.
Distributed Quantum Simulation
arXiv:2411.02881v2 Announce Type: replace 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 quantum signal processing over a quantum network. Crucially, our protocols significantly reduce the local hardware requirements of individual quantum processing units while ensuring the overall gate complexity does not exceed that of standard monolithic architectures. 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 algorithm 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.
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 quantum signal processing over a quantum network. Crucially, our protocols significantly reduce the local hardware requirements of individual quantum processing units while ensuring the overall gate complexity does not exceed that of standard monolithic architectures. 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 algorithm 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.
arXiv:2411.02881 [quant-ph]
(or arXiv:2411.02881v2 [quant-ph] for this version)
https://doi.org/10.48550/arXiv.2411.02881 Focus to learn more arXiv-issued DOI via DataCite
https://doi.org/10.1103/zh7p-f7tc Focus to learn more DOI(s) linking to related resources
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Text integral sub licența deschisă a publicației · 264 cuvinte
