Dynamical cluster-based optimization of tensor network algorithms for quantum circuit simulations

• URL: http://arxiv.org/abs/2502.19289v1
• Date: Wed, 26 Feb 2025 16:49:11 GMT
• Title: Dynamical cluster-based optimization of tensor network algorithms for quantum circuit simulations
• Authors: Andrea De Girolamo, Paolo Facchi, Peter Rabl, Saverio Pascazio, Cosmo Lupo, Giuseppe Magnifico,
• Abstract summary: We introduce a variation of the standard TEBD algorithm, "cluster-TEBD", which dynamically arranges qubits into entanglement clusters, enabling the exact contraction of multiple circuit layers in a single time step.<n>We analyze the performances of these enhanced algorithms in simulating both stabilizer and non-stabilizer random circuits, with up to $1000$ qubits and $100$ layers of Clifford and non-Clifford gates, and in simulating Shor's quantum algorithm with tens of thousands of layers.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We optimize Matrix-Product State (MPS)-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 non-stabilizer random circuits, with up to $1000$ qubits and $100$ layers of Clifford and non-Clifford gates, and in simulating Shor's quantum algorithm with tens 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.

Related papers

• Fast Expectation Value Calculation Speedup of Quantum Approximate Optimization Algorithm: HoLCUs QAOA [55.2480439325792]
  We present a new method for calculating expectation values of operators that can be expressed as a linear combination of unitary (LCU) operators. This method is general for any quantum algorithm and is of particular interest in the acceleration of variational quantum algorithms.
  arXiv  Detail & Related papers  (2025-03-03T17:15:23Z)
• Adaptive variational quantum dynamics simulations with compressed circuits and fewer measurements [4.2643127089535104]
  We show an improved version of the adaptive variational quantum dynamics simulation (AVQDS) method, which we call AVQDS(T) The algorithm adaptively adds layers of disjoint unitary gates to the ansatz circuit so as to keep the McLachlan distance, a measure of the accuracy of the variational dynamics, below a fixed threshold. We also show a method based on eigenvalue truncation to solve the linear equations of motion for the variational parameters with enhanced noise resilience.
  arXiv  Detail & Related papers  (2024-08-13T02:56:43Z)
• Floorplanning of VLSI by Mixed-Variable Optimization [42.82770651937298]
  This paper proposes memetic algorithms to solve mixed-variable floorplanning problems. Proposed algorithms are superior to some celebrated B*-tree based floorplanning algorithms.
  arXiv  Detail & Related papers  (2024-01-27T06:34:16Z)
• Improved real-space parallelizable matrix-product state compression and its application to unitary quantum dynamics simulation [0.0]
  We introduce an improved real-space parallelizable matrix-product state (MPS) compression method. We apply this method to simulate unitary quantum dynamics and introduce an improved parallel time-evolving block-decimation algorithm. The obtained numerical results unequivocally demonstrate that the improved pTEBD algorithm achieves the same level of simulation precision as the current state-of-the-art MPS algorithm.
  arXiv  Detail & Related papers  (2023-12-05T11:14:48Z)
• Hybrid discrete-continuous compilation of trapped-ion quantum circuits with deep reinforcement learning [1.7087507417780985]
  We show that we can significantly reduce the size of relevant quantum circuits for trapped-ion computing.<n>Our framework can also be applied to an experimental setup whose goal is to reproduce an unknown unitary process.
  arXiv  Detail & Related papers  (2023-07-12T14:55:28Z)
• Exploring the role of parameters in variational quantum algorithms [59.20947681019466]
  We introduce a quantum-control-inspired method for the characterization of variational quantum circuits using the rank of the dynamical Lie algebra. A promising connection is found between the Lie rank, the accuracy of calculated energies, and the requisite depth to attain target states via a given circuit architecture.
  arXiv  Detail & Related papers  (2022-09-28T20:24:53Z)
• Automatic and effective discovery of quantum kernels [41.61572387137452]
  Quantum computing can empower machine learning models by enabling kernel machines to leverage quantum kernels for representing similarity measures between data.<n>We present an approach to this problem, which employs optimization techniques, similar to those used in neural architecture search and AutoML.<n>The results obtained by testing our approach on a high-energy physics problem demonstrate that, in the best-case scenario, we can either match or improve testing accuracy with respect to the manual design approach.
  arXiv  Detail & Related papers  (2022-09-22T16:42:14Z)
• Decomposition of Matrix Product States into Shallow Quantum Circuits [62.5210028594015]
  tensor network (TN) algorithms can be mapped to parametrized quantum circuits (PQCs) We propose a new protocol for approximating TN states using realistic quantum circuits. Our results reveal one particular protocol, involving sequential growth and optimization of the quantum circuit, to outperform all other methods.
  arXiv  Detail & Related papers  (2022-09-01T17:08:41Z)
• A density-matrix renormalization group algorithm for simulating quantum circuits with a finite fidelity [3.965473736150699]
  We develop a density-matrix renormalization group (DMRG) algorithm for the simulation of quantum circuits. For small circuit depths, the technique is exact and equivalent to other matrix product state (MPS) based techniques.
  arXiv  Detail & Related papers  (2022-07-12T15:28:55Z)
• Adaptive pruning-based optimization of parameterized quantum circuits [62.997667081978825]
  Variisy hybrid quantum-classical algorithms are powerful tools to maximize the use of Noisy Intermediate Scale Quantum devices. We propose a strategy for such ansatze used in variational quantum algorithms, which we call "Efficient Circuit Training" (PECT) Instead of optimizing all of the ansatz parameters at once, PECT launches a sequence of variational algorithms.
  arXiv  Detail & Related papers  (2020-10-01T18:14:11Z)
• A Generic Compilation Strategy for the Unitary Coupled Cluster Ansatz [68.8204255655161]
  We describe a compilation strategy for Variational Quantum Eigensolver (VQE) algorithms. We use the Unitary Coupled Cluster (UCC) ansatz to reduce circuit depth and gate count.
  arXiv  Detail & Related papers  (2020-07-20T22:26:16Z)
• Iterative Algorithm Induced Deep-Unfolding Neural Networks: Precoding Design for Multiuser MIMO Systems [59.804810122136345]
  We propose a framework for deep-unfolding, where a general form of iterative algorithm induced deep-unfolding neural network (IAIDNN) is developed. An efficient IAIDNN based on the structure of the classic weighted minimum mean-square error (WMMSE) iterative algorithm is developed. We show that the proposed IAIDNN efficiently achieves the performance of the iterative WMMSE algorithm with reduced computational complexity.
  arXiv  Detail & Related papers  (2020-06-15T02:57:57Z)

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.