Papers
Topics
Authors
Recent
2000 character limit reached

Scalability enhancement of quantum computing under limited connectivity through distributed quantum computing (2405.10942v2)

Published 17 May 2024 in quant-ph

Abstract: We employ quantum-volume random-circuit sampling to benchmark the two-QPU entanglement-assisted distributed quantum computing (DQC) and compare it with single-QPU quantum computing. We first specify a single-qubit depolarizing noise model in the random circuit. Based on this error model, we show the one-to-one correspondence of three figures of merits, namely average gate fidelity, heavy output probability, and linear cross-entropy. We derive an analytical approximation of the average gate fidelity under the specified noise model, which is shown to align with numerical simulations. The approximation is calculated based on a noise propagation matrix obtained from the extended connectivity graph of a DQC device. In numerical simulation, we unveil the scalability enhancement in DQC for the QPUs with limited connectivity. Furthermore, we provide a simple formula to estimate the average gate fidelity, which also provides us with a heuristic method to evaluate the scalability enhancement in DQC, and a guide to optimize the structure of a DQC configuration.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (26)
  1. Distributed quantum computing: a survey, 2022.
  2. Review of distributed quantum computing. from single qpu to high performance quantum computing, 2024.
  3. Simulating large quantum circuits on a small quantum computer. Phys. Rev. Lett., 125:150504, 2020.
  4. K. Mitarai and K. Fujii. Overhead for simulating a non-local channel with local channels by quasiprobability sampling. Quantum, 5:388, 2021.
  5. K. Mitarai and K. Fujii. Constructing a virtual two-qubit gate by sampling single-qubit operations. 23(2):023021.
  6. Quasiprobability decompositions with reduced sampling overhead. 8(1).
  7. C. Piveteau and D. Sutter. Circuit knitting with classical communication. IEEE Transactions on Information Theory, 70(4):2734 – 2745, 2024.
  8. D. Gottesman and I. L. Chuang. Demonstrating the viability of universal quantum computation using teleportation and single-qubit operations. Nature, 402:390–393, 1999.
  9. Optimal local implementation of nonlocal quantum gates. Physical Review A, 62:052317, 2000.
  10. Quantum remote control: Teleportation of unitary operations. Physical Review A, 63:042303, 2001.
  11. Remote control of restricted sets of operations: Teleportation of angles. Physical Review A, 65:042316, 2002.
  12. Distributed quantum computation based on small quantum registers. Physical Review A, 76:062323, 2007.
  13. Arithmetic on a distributed-memory quantum multicomputer. ACM Journal on Emerging Technologies in Computing Systems (JETC), 3(4):1–23, 2008.
  14. Efficient Distribution of Quantum Circuits. In 35th International Symposium on Distributed Computing (DISC 2021), volume 209 of Leibniz International Proceedings in Informatics (LIPIcs), pages 41:1–41:20, Dagstuhl, Germany, 2021.
  15. Entanglement-efficient bipartite-distributed quantum computing. Quantum, 7:1196, 2023.
  16. Distributing circuits over heterogeneous, modular quantum computing network architectures. arXiv:2305.14148.
  17. K. Życzkowski and H.-J. Sommers. Average fidelity between random quantum states. Physical Review A, 71:032313, 2005.
  18. Validating quantum computers using randomized model circuits. Physical Review A, 100:032328, 2019.
  19. Quantum supremacy using a programmable superconducting processor. Nature, 574(7779):505–510, 2019.
  20. S. Aaronson and L. Chen. Complexity-theoretic foundations of quantum supremacy experiments. In Proceedings of the 32nd Computational Complexity Conference, CCC ’17, Dagstuhl, DEU, 2017. Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik.
  21. M. A. Nielsen. A simple formula for the average gate fidelity of a quantum dynamical operation. 303(4):249–252.
  22. Teleporting an unknown quantum state via dual classical and einstein-podolsky-rosen channels. Physical Review Letters, 70:1895–1899, 1993.
  23. A. A. Mele. Introduction to Haar Measure Tools in Quantum Information: A Beginner’s Tutorial.
  24. Quantum Theory from First Principles: An Informational Approach. Cambridge University Press, 2017.
  25. Qubit allocation for distributed quantum computing. In IEEE INFOCOM 2023 - IEEE Conference on Computer Communications. IEEE.
  26. Generating random quantum channels. 62(6):062201.

Summary

We haven't generated a summary for this paper yet.

Whiteboard

Open Problems

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

Continue Learning

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

Collections

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

Tweets

Sign up for free to view the 1 tweet with 1 like about this paper.