Tensor Networks for Simulating Quantum Circuits on FPGAs

Most research in quantum computing today is performed against simulations of quantum computers rather than true quantum computers. Simulating a quantum computer entails implementing all of the unitary operators corresponding to the quantum gates as tensors. For high numbers of qubits, performing tensor multiplications for these simulations becomes quite expensive, since N -qubit gates correspond to 2 -dimensional tensors. One way to accelerate such a simulation is to use field programmable gate array (FPGA) hardware to efficiently compute the matrix multiplications. Though FPGAs can efficiently perform tensor multiplications, they are memory bound, having relatively small block random access memory. One way to potentially reduce the memory footprint of a quantum computing system is to represent it as a tensor network; tensor networks are a formalism for representing compositions of tensors wherein economical tensor contractions are readily identified. Thus we explore tensor networks as a means to reducing the memory footprint of quantum computing systems and broadly accelerating simulations of such systems.

[1]  Franck Cappello,et al.  Full-state quantum circuit simulation by using data compression , 2019, SC.

[2]  Vaughn Betz,et al.  SymbiFlow and VPR: An Open-Source Design Flow for Commercial and Novel FPGAs , 2020, IEEE Micro.

[3]  Liancheng Jia,et al.  Generating Systolic Array Accelerators With Reusable Blocks , 2020, IEEE Micro.

[4]  Jens Eisert,et al.  Expressive power of tensor-network factorizations for probabilistic modeling, with applications from hidden Markov models to quantum machine learning , 2019, NeurIPS.

[5]  R. Feynman.  Simulating physics with computers , 1999 .

[6]  White,et al.  Density matrix formulation for quantum renormalization groups. , 1992, Physical review letters.

[7]  Peter W. Shor,et al.  Algorithms for quantum computation: discrete logarithms and factoring , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.

[8]  Guangwen Yang,et al.  Quantum computational advantage using photons , 2020, Science.

[9]  G. Vidal.  Entanglement renormalization. , 2005, Physical review letters.

[10]  F. Verstraete,et al.  Renormalization algorithms for Quantum-Many Body Systems in two and higher dimensions , 2004, cond-mat/0407066.

[11]  Glen Evenbly.  TensorTrace: an application to contract tensor networks , 2019, ArXiv.

[12]  S. Betelú.  The limits of quantum circuit simulation with low precision arithmetic , 2020, ArXiv.

[13]  Igor L. Markov,et al.  Simulating Quantum Computation by Contracting Tensor Networks , 2008, SIAM J. Comput..

[14]  M. Pelcat,et al.  Tactics to Directly Map CNN Graphs on Embedded FPGAs , 2017, IEEE Embedded Systems Letters.

[15]  K. Brown,et al.  Graduate Texts in Mathematics , 1982 .

[16]  E. Farhi,et al.  A Quantum Approximate Optimization Algorithm , 2014, 1411.4028.

[17]  J. Zittartz,et al.  Matrix Product Ground States for One-Dimensional Spin-1 Quantum Antiferromagnets , 1993, cond-mat/9307028.

[18]  Lei Wang,et al.  Systolic Array Based Accelerator and Algorithm Mapping for Deep Learning Algorithms , 2018, NPC.

[19]  T. Hoefler,et al.  Flexible Communication Avoiding Matrix Multiplication on FPGA with High-Level Synthesis , 2019, FPGA.

[20]  Alán Aspuru-Guzik,et al.  qTorch: The quantum tensor contraction handler , 2017, PloS one.

[21]  Jakob N. Foerster,et al.  Exploratory Combinatorial Optimization with Reinforcement Learning , 2020, AAAI.

[22]  Johnnie Gray,et al.  quimb: A python package for quantum information and many-body calculations , 2018, J. Open Source Softw..

[23]  Jason Cong,et al.  AutoSA: A Polyhedral Compiler for High-Performance Systolic Arrays on FPGA , 2021, FPGA.

[24]  Alexander McCaskey,et al.  Validating quantum-classical programming models with tensor network simulations , 2018, PloS one.

[25]  Eriko Nurvitadhi,et al.  Can FPGAs Beat GPUs in Accelerating Next-Generation Deep Neural Networks? , 2017, FPGA.

[26]  Thierry Moreau,et al.  A Hardware–Software Blueprint for Flexible Deep Learning Specialization , 2018, IEEE Micro.

[27]  Hamed Tabkhi,et al.  A Reconfigurable Streaming Processor for Real-Time Low-Power Execution of Convolutional Neural Networks at the Edge , 2018, EDGE.

[28]  Johnnie Gray,et al.  Hyper-optimized tensor network contraction , 2020, Quantum.

[29]  Albert J. Ou,et al.  Gemmini: An Agile Systolic Array Generator Enabling Systematic Evaluations of Deep-Learning Architectures , 2019, ArXiv.

[30]  G. Vidal,et al.  Classical simulation of quantum many-body systems with a tree tensor network , 2005, quant-ph/0511070.

[31]  H. T. Kung.  Why systolic architectures? , 1982, Computer.

[32]  Derek G. Corneil,et al.  Complexity of finding embeddings in a k -tree , 1987 .

[33]  Lov K. Grover.  A fast quantum mechanical algorithm for database search , 1996, STOC '96.

[34]  John Wawrzynek,et al.  Chisel: Constructing hardware in a Scala embedded language , 2012, DAC Design Automation Conference 2012.