Papers
Topics
Authors
Recent
Search
2000 character limit reached

ECDQC: Efficient Compilation for Distributed Quantum Computing with Linear Layout

Published 31 Oct 2024 in quant-ph and cs.DC | (2410.23857v2)

Abstract: In this paper, we propose an efficient compilation method for distributed quantum computing (DQC) using the Linear Nearest Neighbor (LNN) architecture. By exploiting the LNN topology's symmetry, we optimize quantum circuit compilation for High Local Connectivity, Sparse Full Connectivity (HLC-SFC) algorithms like Quantum Approximate Optimization Algorithm (QAOA) and Quantum Fourier Transform (QFT). We also utilize dangling qubits to minimize non-local interactions and reduce SWAP gates. Our approach significantly decreases compilation time, gate count, and circuit depth, improving scalability and robustness for large-scale quantum computations.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (26)
  1. P. W. Shor, “Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer,” SIAM Journal on Computing, vol. 26, no. 5, pp. 1484–1509, 1997.
  2. D. Herman, C. Googin, X. Liu, A. Galda, I. Safro, Y. Sun, M. Pistoia, and Y. Alexeev, “A survey of quantum computing for finance,” arXiv preprint arXiv:2201.02773, 2022.
  3. Y. Cao, J. Romero, J. P. Olson, M. Degroote, P. D. Johnson, M. Kieferová, I. D. Kivlichan, T. Menke, B. Peropadre, N. P. Sawaya, et al., “Quantum chemistry in the age of quantum computing,” Chemical reviews, vol. 119, no. 19, pp. 10856–10915, 2019.
  4. J. Preskill, “Quantum Computing in the NISQ era and beyond,” Quantum, vol. 2, p. 79, Aug. 2018.
  5. B. Nash, V. Gheorghiu, and M. Mosca, “Quantum circuit optimizations for nisq architectures,” Quantum Science and Technology, vol. 5, no. 2, p. 025010, 2020.
  6. P. W. Shor, “Fault-tolerant quantum computation,” in Proceedings of 37th conference on foundations of computer science, pp. 56–65, IEEE, 1996.
  7. F. Gaitan, Quantum error correction and fault tolerant quantum computing. CRC Press, 2008.
  8. F. Burt, K.-C. Chen, and K. Leung, “Generalised circuit partitioning for distributed quantum computing,” 2024.
  9. M. Caleffi, M. Amoretti, D. Ferrari, J. Illiano, A. Manzalini, and A. S. Cacciapuoti, “Distributed quantum computing: A survey,” Computer Networks, vol. 254, p. 110672, 2024.
  10. F. Hua, Y. Jin, A. Li, C. Liu, M. Wang, Y. Chen, C. Zhang, A. Hayes, S. Stein, M. Guo, Y. Huang, and E. Z. Zhang, “A synergistic compilation workflow for tackling crosstalk in quantum machines,” 2023.
  11. Y. Zhu, Y. Zhou, J. Cheng, Y. Jin, B. Li, S. Niu, and Z. Liang, “Coqa: Blazing fast compiler optimizations for qaoa,” 2024.
  12. C. H. Bennett and G. Brassard, “Quantum cryptography: Public key distribution and coin tossing,” Theoretical Computer Science, vol. 560, p. 7–11, Dec. 2014.
  13. M. A. Nielsen and I. L. Chuang, Quantum Computation and Quantum Information: 10th Anniversary Edition. Cambridge University Press, 2010.
  14. D. Bouwmeester, J.-W. Pan, K. Mattle, M. Eibl, H. Weinfurter, and A. Zeilinger, “Experimental quantum teleportation,” Nature, vol. 390, p. 575–579, Dec. 1997.
  15. R. Horodecki, P. Horodecki, M. Horodecki, and K. Horodecki, “Quantum entanglement,” Rev. Mod. Phys., vol. 81, pp. 865–942, Jun 2009.
  16. C. H. Bennett, G. Brassard, C. Crépeau, R. Jozsa, A. Peres, and W. K. Wootters, “Teleporting an unknown quantum state via dual classical and einstein-podolsky-rosen channels,” Phys. Rev. Lett., vol. 70, pp. 1895–1899, Mar 1993.
  17. Y.-H. Luo, H.-S. Zhong, M. Erhard, X.-L. Wang, L.-C. Peng, M. Krenn, X. Jiang, L. Li, N.-L. Liu, C.-Y. Lu, A. Zeilinger, and J.-W. Pan, “Quantum teleportation in high dimensions,” Phys. Rev. Lett., vol. 123, p. 070505, Aug 2019.
  18. K. S. Chou, J. Z. Blumoff, C. S. Wang, P. C. Reinhold, C. J. Axline, Y. Y. Gao, L. Frunzio, M. Devoret, L. Jiang, and R. Schoelkopf, “Deterministic teleportation of a quantum gate between two logical qubits,” Nature, vol. 561, no. 7723, pp. 368–373, 2018.
  19. J. Eisert, K. Jacobs, P. Papadopoulos, and M. B. Plenio, “Optimal local implementation of nonlocal quantum gates,” Phys. Rev. A, vol. 62, p. 052317, Oct 2000.
  20. Y.-F. Huang, X.-F. Ren, Y.-S. Zhang, L.-M. Duan, and G.-C. Guo, “Experimental teleportation of a quantum controlled-not gate,” Physical review letters, vol. 93, no. 24, p. 240501, 2004.
  21. J.-Y. Wu, K. Matsui, T. Forrer, A. Soeda, P. Andrés-Martínez, D. Mills, L. Henaut, and M. Murao, “Entanglement-efficient bipartite-distributed quantum computing,” Quantum, vol. 7, p. 1196, Dec. 2023.
  22. S. Rodrigo, S. Abadal, E. Alarcón, and C. G. Almudever, “Will quantum computers scale without inter-chip comms? a structured design exploration to the monolithic vs distributed architectures quest,” in 2020 XXXV Conference on Design of Circuits and Integrated Systems (DCIS), pp. 1–6, 2020.
  23. D. Llewellyn, Y. Ding, I. I. Faruque, S. Paesani, D. Bacco, R. Santagati, Y.-J. Qian, Y. Li, Y.-F. Xiao, M. Huber, et al., “Chip-to-chip quantum teleportation and multi-photon entanglement in silicon,” Nature Physics, vol. 16, no. 2, pp. 148–153, 2020.
  24. P. Inc, :, F. Afzal, M. Akhlaghi, S. J. Beale, O. Bedroya, K. Bell, L. Bergeron, K. Bonsma-Fisher, P. Bychkova, Z. M. E. Chaisson, C. Chartrand, C. Clear, A. Darcie, A. DeAbreu, C. DeLisle, L. A. Duncan, C. D. Smith, J. Dunn, A. Ebrahimi, N. Evetts, D. F. Pinheiro, P. Fuentes, T. Georgiou, B. Guha, R. Haenel, D. Higginbottom, D. M. Jackson, N. Jahed, A. Khorshidahmad, P. K. Shandilya, A. T. K. Kurkjian, N. Lauk, N. R. Lee-Hone, E. Lin, R. Litynskyy, D. Lock, L. Ma, I. MacGilp, E. R. MacQuarrie, A. Mar, A. M. Khah, A. Matiash, E. Meyer-Scott, C. P. Michaels, J. Motira, N. K. Noori, E. Ospadov, E. Patel, A. Patscheider, D. Paulson, A. Petruk, A. L. Ravindranath, B. Reznychenko, M. Ruether, J. Ruscica, K. Saxena, Z. Schaller, A. Seidlitz, J. Senger, Y. S. Lee, O. Sevoyan, S. Simmons, O. Soykal, L. Stott, Q. Tran, S. Tserkis, A. Ulhaq, W. Vine, R. Weeks, G. Wolfowicz, and I. Yoneda, “Distributed quantum computing in silicon,” 2024.
  25. G. Li, Y. Ding, and Y. Xie, “Tackling the qubit mapping problem for nisq-era quantum devices,” in Proceedings of the twenty-fourth international conference on architectural support for programming languages and operating systems, pp. 1001–1014, 2019.
  26. Y. Jin, J. Luo, L. Fong, Y. Chen, A. B. Hayes, C. Zhang, F. Hua, and E. Z. Zhang, “A structured method for compilation of qaoa circuits in quantum computing,” arXiv preprint arXiv:2112.06143, 2021.

Summary

No one has generated a summary of this paper yet.

Sign Up to Summarize

Paper to Video (Beta)

No one has generated a video about this paper yet.

Sign Up to Generate All Videos Subscribe on YouTube

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Sign Up to Generate

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Generate Now

Continue Learning

We haven't generated follow-up questions for this paper yet.

Generate Now

Collections

Sign up for free to add this paper to one or more collections.

Sign Up

Tweets

Sign up for free to view the 2 tweets with 0 likes about this paper.

Sign Up for Free