Dynamical cluster-based strategy for improving tensor network algorithms in quantum circuit simulations

Abstract

We optimize matrix-product state-based algorithms for simulating quantum circuits with finite fidelity, specifically the time-evolving block decimation (TEBD) and the density-matrix renormalization group (DMRG) algorithms, by exploiting the irregular arrangement of entangling operations in circuits. We introduce a variation of the standard TEBD algorithm, we termed "cluster-TEBD", which dynamically arranges qubits into entanglement clusters, enabling the exact contraction of multiple circuit layers in a single time step. Moreover, we enhance the DMRG algorithm by introducing an adaptive protocol, which analyzes the entanglement distribution within each circuit section to be contracted, dynamically adjusting the qubit grouping at each iteration. We analyze the performances of these enhanced algorithms in simulating both stabilizer and nonstabilizer random-structured quantum circuits, with up to 1000 qubits and 100 layers of Clifford and non-Clifford gates, and in simulating Shor's quantum algorithm with up to hundreds of thousands of layers. Our findings show that, even with reasonable computational resources per task, cluster-based approaches can significantly speed up simulations of large-sized quantum circuits and improve the fidelity of the final states.

17 pages, 12 figures. Published version, improvement of Shor's algorithm simulations

References in corpus (37)

• Quantum Computing in the NISQ era and beyond
• Supplementary information for "Quantum supremacy using a programmable superconducting processor"
• The density-matrix renormalization group
• Efficient classical simulation of slightly entangled quantum computations
• A Practical Introduction to Tensor Networks: Matrix Product States and Projected Entangled Pair States
• A Quantum Engineer's Guide to Superconducting Qubits
• Efficient simulation of one-dimensional quantum many-body systems
• Improved Simulation of Stabilizer Circuits
• The ITensor Software Library for Tensor Network Calculations
• Quantum Computational Supremacy
• Matrix Product States and Projected Entangled Pair States: Concepts, Symmetries, and Theorems
• Quantum error correction below the surface code threshold
• Classical simulation of quantum many-body systems with a tree tensor network
• Random Quantum Circuits
• Entropy scaling and simulability by Matrix Product States
• Random Quantum Circuits are Approximate 2-designs
• Local random quantum circuits are approximate polynomial-designs
• Quantum Supremacy and the Complexity of Random Circuit Sampling
• What limits the simulation of quantum computers?
• Hyper-optimized tensor network contraction
• A flexible high-performance simulator for verifying and benchmarking quantum circuits implemented on real hardware
• Solving the sampling problem of the Sycamore quantum circuits
• Efficient tensor network simulation of IBM's Eagle kicked Ising experiment
• The Tensor Networks Anthology: Simulation techniques for many-body quantum lattice systems
• Quantum simulation with hybrid tensor networks
• A density-matrix renormalization group algorithm for simulating quantum circuits with a finite fidelity
• Quantum Fourier Transform Has Small Entanglement
• Efficient tensor network simulation of IBM's largest quantum processors
• Gauging tensor networks with belief propagation
• Adaptive-weighted tree tensor networks for disordered quantum many-body systems
• Simulating quantum circuits using tree tensor networks
• Simple heuristics for efficient parallel tensor contraction and quantum circuit simulation
• Hybrid Tree Tensor Networks for quantum simulation
• Unitary Designs of Symmetric Local Random Circuits
• Simulating the quantum Fourier transform, Grover's algorithm, and the quantum counting algorithm with limited entanglement using tensor-networks
• Ab-initio tree-tensor-network digital twin for quantum computer benchmarking in 2D
• Characterization of randomness in quantum circuits of continuous gate sets