Tensor Networks for Simulating Quantum Circuits on FPGAs
- URL: http://arxiv.org/abs/2108.06831v1
- Date: Sun, 15 Aug 2021 22:43:38 GMT
- Title: Tensor Networks for Simulating Quantum Circuits on FPGAs
- Authors: Maksim Levental
- Abstract summary: Most research in quantum computing today is performed against simulations of quantum computers rather than true quantum computers.
One way to accelerate such a simulation is to use field programmable gate array (FPGA) hardware to efficiently compute the matrix multiplications.
One way to potentially reduce the memory footprint of a quantum computing system is to represent it as a tensor network.
- Score: 0.0
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: 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^{N}$-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.
Related papers
- Efficient Learning for Linear Properties of Bounded-Gate Quantum Circuits [63.733312560668274]
Given a quantum circuit containing d tunable RZ gates and G-d Clifford gates, can a learner perform purely classical inference to efficiently predict its linear properties?
We prove that the sample complexity scaling linearly in d is necessary and sufficient to achieve a small prediction error, while the corresponding computational complexity may scale exponentially in d.
We devise a kernel-based learning model capable of trading off prediction error and computational complexity, transitioning from exponential to scaling in many practical settings.
arXiv Detail & Related papers (2024-08-22T08:21:28Z) - Simplification of tensor updates toward performance-complexity balanced quantum computer simulation [0.0]
This work studies the tensor updates simplification in the context of the tensor network based quantum computer simulation.
According to the numerical simulations, a method called simple update, also originated in quantum many-body spin systems, shows a good balance of the fidelity and the computational complexity.
arXiv Detail & Related papers (2024-06-05T07:18:28Z) - Tensor Quantum Programming [0.0]
We develop an algorithm that encodes Matrix Product Operators into quantum circuits with a depth that depends linearly on the number of qubits.
It demonstrates effectiveness on up to 50 qubits for several frequently encountered in differential equations, optimization problems, and quantum chemistry.
arXiv Detail & Related papers (2024-03-20T10:44:00Z) - TeD-Q: a tensor network enhanced distributed hybrid quantum machine
learning framework [59.07246314484875]
TeD-Q is an open-source software framework for quantum machine learning.
It seamlessly integrates classical machine learning libraries with quantum simulators.
It provides a graphical mode in which the quantum circuit and the training progress can be visualized in real-time.
arXiv Detail & Related papers (2023-01-13T09:35:05Z) - RosneT: A Block Tensor Algebra Library for Out-of-Core Quantum Computing
Simulation [0.18472148461613155]
We present RosneT, a library for distributed, out-of-core block tensor algebra.
We use the PyCOMPSs programming model to transform tensor operations into a collection of tasks handled by the COMPSs runtime.
We report results validating our approach showing good scalability in simulations of Quantum circuits of up to 53 qubits.
arXiv Detail & Related papers (2022-01-17T20:35:40Z) - TensorLy-Quantum: Quantum Machine Learning with Tensor Methods [67.29221827422164]
We create a Python library for quantum circuit simulation that adopts the PyTorch API.
Ly-Quantum can scale to hundreds of qubits on a single GPU and thousands of qubits on multiple GPU.
arXiv Detail & Related papers (2021-12-19T19:26:17Z) - An Algebraic Quantum Circuit Compression Algorithm for Hamiltonian
Simulation [55.41644538483948]
Current generation noisy intermediate-scale quantum (NISQ) computers are severely limited in chip size and error rates.
We derive localized circuit transformations to efficiently compress quantum circuits for simulation of certain spin Hamiltonians known as free fermions.
The proposed numerical circuit compression algorithm behaves backward stable and scales cubically in the number of spins enabling circuit synthesis beyond $mathcalO(103)$ spins.
arXiv Detail & Related papers (2021-08-06T19:38:03Z) - A quantum algorithm for training wide and deep classical neural networks [72.2614468437919]
We show that conditions amenable to classical trainability via gradient descent coincide with those necessary for efficiently solving quantum linear systems.
We numerically demonstrate that the MNIST image dataset satisfies such conditions.
We provide empirical evidence for $O(log n)$ training of a convolutional neural network with pooling.
arXiv Detail & Related papers (2021-07-19T23:41:03Z) - Tensor Network Quantum Virtual Machine for Simulating Quantum Circuits
at Exascale [57.84751206630535]
We present a modernized version of the Quantum Virtual Machine (TNQVM) which serves as a quantum circuit simulation backend in the e-scale ACCelerator (XACC) framework.
The new version is based on the general purpose, scalable network processing library, ExaTN, and provides multiple quantum circuit simulators.
By combining the portable XACC quantum processors and the scalable ExaTN backend we introduce an end-to-end virtual development environment which can scale from laptops to future exascale platforms.
arXiv Detail & Related papers (2021-04-21T13:26:42Z) - Efficient 2D Tensor Network Simulation of Quantum Systems [6.074275058563179]
2D tensor networks such as Projected Entangled States (PEPS) are well-suited for key classes of physical systems and quantum circuits.
We propose new algorithms and software abstractions for PEPS-based methods, accelerating the bottleneck operation of contraction and scalableization of a subnetwork.
arXiv Detail & Related papers (2020-06-26T22:36:56Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.