Lossy Compression for Schrödinger-style Quantum Simulations (2401.11088v3)
Abstract: Simulating quantum circuits on classical hardware is a powerful and necessary tool for developing and testing quantum algorithms and hardware as well as evaluating claims of quantum supremacy in the Noisy Intermediate-Scale Quantum (NISQ) regime. Schr\"odinger-style simulations are limited by the exponential growth of the number of state amplitudes which need to be stored. In this work, we apply scalar and vector quantization to Schr\"odinger-style quantum circuit simulations as lossy compression schemes to reduce the number of bits needed to simulate quantum circuits. Using quantization, we can maintain simulation fidelities $>0.99$ when simulating the Quantum Fourier Transform, while using only 7 significand bits in a floating-point number to characterize the real and imaginary components of each amplitude. Furthermore, using vector quantization, we propose a method to bound the number of bits/amplitude needed to store state vectors in a simulation of a circuit that achieves a desired fidelity, and show that for a 6 qubit simulation of the Quantum Fourier Transform, 15 bits/amplitude is sufficient to maintain fidelity $>0.9$ at $104$ depth.
- Peter W Shor, Algorithms for quantum computation: discrete logarithms and factoring, IEEE Comput. Soc. Press, 1999.
- John Preskill, “Quantum computing and the entanglement frontier,” arXiv pre-print server, 2012.
- “Quantum computational supremacy,” Nature, vol. 549, no. 7671, pp. 203–209, 2017.
- Sergio Boixo and et al., “Characterizing quantum supremacy in near-term devices,” Nature Physics, vol. 14, no. 6, pp. 595–600, 2018.
- Frank Arute and et al., “Quantum supremacy using a programmable superconducting processor,” Nature, vol. 574, no. 7779, pp. 505–510, 2019.
- John Preskill, “Quantum computing in the nisq era and beyond,” Quantum, vol. 2, pp. 79, 2018.
- Thomas Jones and et al., “Quest and high performance simulation of quantum computers,” Scientific Reports, vol. 9, no. 1, 2019.
- Lukas Burgholzer and et al., “Hybrid schrödinger-feynman simulation of quantum circuits with decision diagrams,” in 2021 IEEE International Conference on Quantum Computing and Engineering (QCE), 2021, pp. 199–206.
- Yi-Hsiang Tsai and et al., “Bit-slicing the hilbert space: Scaling up accurate quantum circuit simulation,” IEEE, 2016.
- Gabriel F Viamontes and et al., “Gate-level simulation of quantum circuits,” IEEE, 2008.
- “A space-efficient quantum computer simulator suitable for high-speed fpga implementation,” in SPIE Defense, Security, and Sensing, Orlando, Florida, United States, 2009, SPIE.
- “Advanced simulation of quantum computations,” IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, vol. 38, no. 5, pp. 848–859, 2019.
- “Full-state quantum circuit simulation by using data compression,” in Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis, New York, NY, USA, 2019, SC ’19, Association for Computing Machinery.
- Santiago I. Betelu, “The limits of quantum circuit simulation with low precision arithmetic,” arXiv pre-print server, 2020.
- “Complexity-theoretic foundations of quantum supremacy experiments,” in Proceedings of the 32nd Computational Complexity Conference, Riga, Latvia, 2017, Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik.
- Xiang-Chao Wu and et al., “Amplitude-aware lossy compression for quantum circuit simulation,” arXiv pre-print server, 2018.
- Daniel Gottesman, “The heisenberg representation of quantum computers,” 1998.
- “A Study of BFLOAT16 for Deep Learning Training,” arXiv e-prints, p. arXiv:1905.12322, May 2019.
- “Bfloat16: The secret to high performance on cloud tpus,” August 2019.
- “Ieee standard for floating-point arithmetic,” IEEE Std 754-2019 (Revision of IEEE 754-2008), pp. 1–84, 2019.
- Stephen Jordan, “Quantum algorithm zoo,” 2011, updated June 26, 2022.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Collections
Sign up for free to add this paper to one or more collections.