qTorch: The Quantum Tensor Contraction Handler

Abstract

Classical simulation of quantum computation is necessary for studying the numerical behavior of quantum algorithms, as there does not yet exist a large viable quantum computer on which to perform numerical tests. Tensor network (TN) contraction is an algorithmic method that can efficiently simulate some quantum circuits, often greatly reducing the computational cost over methods that simulate the full Hilbert space. In this study we implement a tensor network contraction program for simulating quantum circuits using multi-core compute nodes. We show simulation results for the Max-Cut problem on 3- through 7-regular graphs using the quantum approximate optimization algorithm (QAOA), successfully simulating up to 100 qubits. We test two different methods for generating the ordering of tensor index contractions: one is based on the tree decomposition of the line graph, while the other generates ordering using a straight-forward stochastic scheme. Through studying instances of QAOA circuits, we show the expected result that as the treewidth of the quantum circuit's line graph decreases, TN contraction becomes significantly more efficient than simulating the whole Hilbert space. The results in this work suggest that tensor contraction methods are superior only when simulating Max-Cut/QAOA with graphs of regularities approximately five and below. Insight into this point of equal computational cost helps one determine which simulation method will be more efficient for a given quantum circuit. The stochastic contraction method outperforms the line graph based method only when the time to calculate a reasonable tree decomposition is prohibitively expensive. Finally, we release our software package, qTorch (Quantum TensOR Contraction Handler), intended for general quantum circuit simulation.

21 pages, 8 figures

References in corpus (12)

• A Quantum Approximate Optimization Algorithm
• Toward the first quantum simulation with quantum speedup
• Low-distance Surface Codes under Realistic Quantum Noise
• Advances on Tensor Network Theory: Symmetries, Fermions, Entanglement, and Holography
• 64-Qubit Quantum Circuit Simulation
• A Quantum Approximate Optimization Algorithm Applied to a Bounded Occurrence Constraint Problem
• Practical optimization for hybrid quantum-classical algorithms
• Simulation of low-depth quantum circuits as complex undirected graphical models
• Classical Simulation of Intermediate-Size Quantum Circuits
• Pareto-Efficient Quantum Circuit Simulation Using Tensor Contraction Deferral
• The sum-over-histories formulation of quantum computing
• Simulation of Quantum Circuits via Stabilizer Frames

Cited by in corpus (26)

• Strawberry Fields: A Software Platform for Photonic Quantum Computing
• Simulation of quantum circuits by low-rank stabilizer decompositions
• QuEST and High Performance Simulation of Quantum Computers
• Improving Variational Quantum Optimization using CVaR
• Hyper-optimized tensor network contraction
• Performance of hybrid quantum/classical variational heuristics for combinatorial optimization
• Qibo: a framework for quantum simulation with hardware acceleration
• Intel Quantum Simulator: A cloud-ready high-performance simulator of quantum circuits
• Multi-block ADMM Heuristics for Mixed-Binary Optimization on Classical and Quantum Computers
• Tropical Tensor Network for Ground States of Spin Glasses
• Validating Quantum-Classical Programming Models with Tensor Network Simulations
• Pareto-Efficient Quantum Circuit Simulation Using Tensor Contraction Deferral
• Alibaba Cloud Quantum Development Platform: Applications to Quantum Algorithm Design
• Qibolab: an open-source hybrid quantum operating system
• Benchmarking treewidth as a practical component of tensor-network--based quantum simulation
• Simulation of Quantum Computing on Classical Supercomputers
• Algorithms for Tensor Network Contraction Ordering
• Quantum Circuit Parameters Learning with Gradient Descent Using Backpropagation
• Loop Series Expansions for Tensor Networks
• Tensor Networks for Simulating Quantum Circuits on FPGAs
• Methods for Classically Simulating Noisy Networked Quantum Architectures
• Distributed Memory Techniques for Classical Simulation of Quantum Circuits
• A Synthesis of Hidden Subgroup Quantum Algorithms and Quantum Chemical Dynamics
• Quantum max-flow in the bridge graph
• Efficient 2D Tensor Network Simulation of Quantum Systems
• Logical Abstractions for Noisy Variational Quantum Algorithm Simulation