QuanPath: achieving one-step communication for distributed quantum circuit simulation

DOI10.1007/S11128-023-04192-XMaRDI QIDQ6142122zbMATH OpenFDO

Authors Yuhong Song, Edwin H.-M. Sha, Qingfeng Zhuge, Wenlong Xiao, Qijun Dai, Longshan Xu

Publication date 25 January 2024

Published in Quantum Information Processing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S11128-023-04192-X

zbMATH Keywords

communication optimizationdistributed computingquantum circuit simulation

Mathematics Subject Classification ID

Quantum computation (81P68)

Recommendations

• Optimized quantum circuit partitioning
• Parallel simulation of quantum networks with distributed quantum state management
• Efficient algorithm for full-state quantum circuit simulation with DD compression while maintaining accuracy
• Improving gate-level simulation of quantum circuits

Cites work

• Fast and scalable quantum computing simulation on multi-core and many-core platforms
• scientific article; zbMATH DE number 1579275 (Why is no real title available?)
• scientific article; zbMATH DE number 1256737 (Why is no real title available?)
• Massively parallel quantum computer simulator
• Massively parallel quantum computer simulator, eleven years later
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer

Cited in

(3)

• Efficient algorithm for full-state quantum circuit simulation with DD compression while maintaining accuracy
• Parallel simulation of quantum networks with distributed quantum state management
• QMin: quantum circuit minimization via gate fusions for efficient state vector simulation

This page was built for publication: QuanPath: achieving one-step communication for distributed quantum circuit simulation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6142122)