Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
139 tokens/sec
GPT-4o
47 tokens/sec
Gemini 2.5 Pro Pro
43 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
47 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Quantum Circuit Simulation with Fast Tensor Decision Diagram (2401.11362v1)

Published 21 Jan 2024 in quant-ph, cs.DS, and cs.ET

Abstract: Quantum circuit simulation is a challenging computational problem crucial for quantum computing research and development. The predominant approaches in this area center on tensor networks, prized for their better concurrency and less computation than methods using full quantum vectors and matrices. However, even with the advantages, array-based tensors can have significant redundancy. We present a novel open-source framework that harnesses tensor decision diagrams to eliminate overheads and achieve significant speedups over prior approaches. On average, it delivers a speedup of 37$\times$ over Google's TensorNetwork library on redundancy-rich circuits, and 25$\times$ and 144$\times$ over quantum multi-valued decision diagram and prior tensor decision diagram implementation, respectively, on Google random quantum circuits. To achieve this, we introduce a new linear-complexity rank simplification algorithm, Tetris, and edge-centric data structures for recursive tensor decision diagram operations. Additionally, we explore the efficacy of tensor network contraction ordering and optimizations from binary decision diagrams.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (25)
  1. X.-C. Wu, S. Di, E. M. Dasgupta, F. Cappello, H. Finkel, Y. Alexeev, and F. T. Chong, “Full-state quantum circuit simulation by using data compression,” in Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis (SC), Denver, Colorado, USA, 2019, pp. 1–24.
  2. G. Li, Y. Ding, and Y. Xie, “Eliminating redundant computation in noisy quantum computing simulation,” in 2020 57th ACM/IEEE Design Automation Conference (DAC), San Francisco, CA, USA, 2020, pp. 1–6.
  3. P. Das, E. Kessler, and Y. Shi, “The imitation game: Leveraging CopyCats for robust native gate selection in NISQ programs,” in 2023 IEEE International Symposium on High-Performance Computer Architecture (HPCA), Montreal, QC, Canada, 2023, pp. 787–801.
  4. F. Arute, K. Arya, R. Babbush, D. Bacon, J. C. Bardin, R. Barends, R. Biswas, S. Boixo, F. G. Brandao, D. A. Buell et al., “Quantum supremacy using a programmable superconducting processor,” Nature, vol. 574, no. 7779, pp. 505–510, 2019.
  5. G. S. Ravi, P. Gokhale, Y. Ding, W. Kirby, K. Smith, J. M. Baker, P. J. Love, H. Hoffmann, K. R. Brown, and F. T. Chong, “CAFQA: A classical simulation bootstrap for variational quantum algorithms,” in Proceedings of the 28th ACM International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS), Vancouver, BC, Canada, 2022, pp. 15–29.
  6. Y. Zhao, Y. Guo, Y. Yao, A. Dumi, D. M. Mulvey, S. Upadhyay, Y. Zhang, K. D. Jordan, J. Yang, and X. Tang, “Q-GPU: A recipe of optimizations for quantum circuit simulation using GPUs,” in 2022 IEEE International Symposium on High-Performance Computer Architecture (HPCA), Seoul, Republic of Korea, 2022, pp. 726–740.
  7. I. L. Markov, A. Fatima, S. V. Isakov, and S. Boixo, “Massively parallel approximate simulation of hard quantum circuits,” in 2020 57th ACM/IEEE Design Automation Conference (DAC), San Francisco, CA, USA, 2020, pp. 1–6.
  8. I. L. Markov and Y. Shi, “Simulating quantum computation by contracting tensor networks,” SIAM Journal on Computing, vol. 38, no. 3, pp. 963–981, 2008.
  9. B. Villalonga, S. Boixo, B. Nelson, C. Henze, E. Rieffel, R. Biswas, and S. Mandrà, “A flexible high-performance simulator for verifying and benchmarking quantum circuits implemented on real hardware,” npj Quantum Information, vol. 5, pp. 86–91, 2019.
  10. E. Pednault, J. A. Gunnels, G. Nannicini, L. Horesh, T. Magerlein, E. Solomonik, E. W. Draeger, E. T. Holland, and R. Wisnieff, “Pareto-efficient quantum circuit simulation using tensor contraction deferral,” 2020.
  11. R. Orús, “A practical introduction to tensor networks: Matrix product states and projected entangled pair states,” Annals of Physics, vol. 349, pp. 117–158, 2014.
  12. J. Gray and S. Kourtis, “Hyper-optimized tensor network contraction,” Quantum, vol. 5, pp. 410–431, 2021.
  13. A. Zulehner and R. Wille, “Advanced simulation of quantum computations,” IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, vol. 38, no. 5, pp. 848–859, 2019.
  14. X. Hong, X. Zhou, S. Li, Y. Feng, and M. Ying, “A tensor network based decision diagram for representation of quantum circuits,” ACM Transactions on Design Automation of Electronic Systems, vol. 27, no. 6, pp. 1–30, 2022.
  15. G. F. Viamontes, I. L. Markov, and J. P. Hayes, “Improving gate-level simulation of quantum circuits,” Quantum Information Processing, vol. 2, pp. 347–380, 2003.
  16. D. M. Miller and M. A. Thornton, “QMDD: A decision diagram structure for reversible and quantum circuits,” in 36th International Symposium on Multiple-Valued Logic (ISMVL), Singapore, 2006, pp. 30–35.
  17. P. Niemann, R. Wille, D. M. Miller, M. A. Thornton, and R. Drechsler, “QMDDs: Efficient quantum function representation and manipulation,” IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, vol. 35, no. 1, pp. 86–99, 2016.
  18. R. E. Bryant, “Graph-based algorithms for boolean function manipulation,” IEEE Trans. Comput., vol. C-35, no. 8, pp. 677–691, 1986.
  19. K. S. Brace, R. L. Rudell, and R. E. Bryant, “Efficient implementation of a BDD package,” in 27th ACM/IEEE Design Automation Conference (DAC), Orlando, FL, USA, 1990, pp. 40–45.
  20. S. Boixo, S. V. Isakov, V. N. Smelyanskiy, R. Babbush, N. Ding, Z. Jiang, M. J. Bremner, J. M. Martinis, and H. Neven, “Characterizing quantum supremacy in near-term devices,” Nature Physics, vol. 14, no. 6, pp. 595–600, 2018.
  21. N. Quetschlich, L. Burgholzer, and R. Wille, “MQT Bench: Benchmarking software and design automation tools for quantum computing,” Quantum, vol. 7, pp. 1062–1075, 2023.
  22. J. Preskill, “Quantum computing in the NISQ era and beyond,” Quantum, vol. 2, p. 79, aug 2018.
  23. A. Zulehner, S. Hillmich, and R. Wille, “How to efficiently handle complex values? Implementing decision diagrams for quantum computing,” in 2019 IEEE/ACM International Conference on Computer-Aided Design (ICCAD), Westminster, CO, USA, 2019, pp. 1–7.
  24. S. Hillmich, A. Zulehner, R. Kueng, I. L. Markov, and R. Wille, “Approximating decision diagrams for quantum circuit simulation,” ACM Transactions on Quantum Computing, vol. 3, no. 4, pp. 1–21, 2022.
  25. C. Roberts, A. Milsted, M. Ganahl, A. Zalcman, B. Fontaine, Y. Zou, J. Hidary, G. Vidal, and S. Leichenauer, “TensorNetwork: A library for physics and machine learning,” 2019.

Summary

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

Ai Sparkles Streamline Icon: https://streamlinehq.com Summarize Now
Github Logo Streamline Icon: https://streamlinehq.com

GitHub

  1. GitHub - QiruiZhang/FTDD: Quantum Circuit Simulation with Fast Tensor Decision Diagram (4 stars)
X Twitter Logo Streamline Icon: https://streamlinehq.com

Tweets