arXiv:2107.01307 · Physical Review X

Variational Power of Quantum Circuit Tensor Networks

Reza Haghshenas, Johnnie Gray, Andrew C. Potter, Garnet Kin‐Lic Chan

Published Mar 11, 2022• 80 citations

Abstract

We characterize the variational power of quantum circuit tensor networks in the representation of physical many-body ground states.Such tensor networks are formed by replacing the dense block unitaries and isometries in standard tensor networks by local quantum circuits.We explore both quantum circuit matrix product states and the quantum circuit multiscale entanglement renormalization Ansatz, and introduce an adaptive method to optimize the resulting circuits to high fidelity with more than 10 4 parameters.We benchmark their expressiveness against standard tensor networks, as well as other common circuit architectures, for the 1D and 2D Heisenberg and 1D Fermi-Hubbard models.We find quantum circuit tensor networks to be substantially more expressive than other quantum circuits for these problems, and that they can even be more compact than standard tensor networks.Extrapolating to circuit depths which can no longer be emulated classically, this suggests a region of advantage in quantum expressiveness in the representation of physical ground states.

DOI: 10.1103/physrevx.12.011047

Related papers

Optimization schemes for unitary tensor-network circuit

Reza Haghshenas

An efficient representation of a quantum circuit is of great importance in achieving a quantum advantage on current noisy intermediate scale quantum (NISQ) devices and the classical simulation of quantum manybody systems.The quantum circuits are playing the key ingredient in the performance of variational quantum algorithms and quantum dynamics in problems of physics and chemistry.In this paper, we study the role of the network structure of a quantum circuit in its performance.We discuss the variational optimization of quantum circuit (a unitary tensor-network circuit) with different network structures.The ansatz is performed based on a generalization of well-developed multiscale entanglement renormalization algorithm and also the conjugategradient method with an effective line search.We present the benchmarking calculations for different network structures by studying the Heisenberg model in a strongly disordered magnetic field and a tensor-network QR decomposition.Our work can contribute to achieve the most out of NISQ hardware and to classically develop isometric tensor network states.

arXiv:2009.02606Physical Review ResearchMay 26, 202115 citations

Tensor-network-assisted variational quantum algorithm

Junxiang Huang, Wenhao He, Yukun Zhang +3 more

Near-term quantum devices generally suffer from shallow circuit depth and hence limited expressivity due to noise and decoherence. To address this, we propose tensor-network-assisted parametrized quantum circuits, which concatenate a classical tensor-network operator with a quantum circuit to effectively increase the circuit's expressivity without requiring a physically deeper circuit. We present a framework for tensor-network-assisted variational quantum algorithms that can solve quantum many-body problems using shallower quantum circuits. We demonstrate the efficiency of this approach by considering two examples of unitary matrix-product operators and unitary tree tensor networks, showing that they can both be implemented efficiently. Through numerical simulations, we show that the expressivity of these circuits is greatly enhanced with the assistance of tensor networks. We apply our method to two-dimensional Ising models and one-dimensional time-crystal Hamiltonian models with up to 16 qubits and demonstrate that our approach consistently outperforms conventional methods using shallow quantum circuits.

arXiv:2212.10421Physical Review ANov 7, 202314 citations

Classical versus quantum: Comparing tensor-network-based quantum circuits on Large Hadron Collider data

Jack Y. Araz, Michael Spannowsky

Tensor networks (TN) are approximations of high-dimensional tensors designed to represent locally entangled quantum many-body systems efficiently. This paper provides a comprehensive comparison between classical TNs and TN-inspired quantum circuits in the context of machine learning on highly complex, simulated Large Hadron Collider data. We show that classical TNs require exponentially large bond dimensions and higher Hilbert-space mapping to perform comparably to their quantum counterparts. While such an expansion in the dimensionality allows better performance, we observe that, with increased dimensionality, classical TNs lead to a highly flat loss landscape, rendering the usage of gradient-based optimization methods highly challenging. Furthermore, by employing quantitative metrics, such as the Fisher information and effective dimensions, we show that classical TNs require a more extensive training sample to represent the data as efficiently as TN-inspired quantum circuits. We also engage with the idea of hybrid classical-quantum TNs and show possible architectures to employ a larger phase space from the data. We offer our results using three main TN Ans\"atze: Tree tensor networks, matrix product states, and multiscale entanglement renormalization Ans\"atze.

arXiv:2202.10471Physical Review ADec 19, 202232 citations

Quantum circuit simulation with a local time-dependent variational principle

Jens Eisert, Aaron Sander, Maximilian Fröhlich +6 more

Abstract Classical simulations of quantum circuits are vital for assessing potential quantum advantage and benchmarking devices, yet they require sophisticated methods to avoid the exponential growth of resources. Tensor network approaches, in particular matrix product states (MPS) combined with the time-evolving block decimation (TEBD) algorithm, currently dominate large-scale circuit simulations. These methods scale efficiently when entanglement is limited but suffer rapid bond dimension growth with increasing entanglement and handle long-range gates via costly SWAP insertions. Motivated by the success of the time-dependent variational principle (TDVP) in many-body physics, we reinterpret quantum circuits as series of discrete time evolutions, using gate generators to construct an MPS-based circuit simulation via a local TDVP formulation. This addresses TEBD's key limitations by (1) naturally accommodating long-range gates and (2) optimally representing states on the MPS manifold. By diffusing entanglement more globally, the method suppresses local bond growth and reduces memory and runtime costs. We benchmark the approach on five 49-qubit circuits: three Hamiltonian circuits (1D open and periodic Heisenberg, 2D 7x7 Ising) and two algorithmic ones (quantum approximate optimization, hardware-efficient ansatz). Across all cases, our method yields substantial resource reductions over standard tools, establishing a new state-of-the-art for circuit simulation and enabling advances across quantum computing, condensed matter, and beyond.

Dec 5, 20250 citations

Disentangling interacting systems with fermionic Gaussian circuits: Application to quantum impurity models

Ang-Kun Wu, Benedikt Kloss, Wladislaw Krinitsin +3 more

Tensor network quantum states are powerful tools for strongly correlated systems, tailored to capture local correlations such as in ground states with entanglement area laws. When applying tensor network states to interacting fermionic systems, a proper choice of the basis or orbitals can reduce the bond dimension of tensors and provide physically relevant orbitals. We introduce such a change of basis with unitary gates obtained from compressing fermionic Gaussian states into quantum circuits corresponding to various tensor networks. These circuits can reduce the ground-state entanglement entropy and improve the performance of algorithms such as the density matrix renormalization group. We study the Anderson impurity model with one and two impurities to show the potential of the method for improving computational efficiency and interpreting impurity physics. Furthermore, fermionic Gaussian circuits can also suppress entanglement during the time evolution out of low-energy state. Last, we consider Gaussian multiscale entanglement renormalization ansatz (GMERA) circuits which compress fermionic Gaussian states hierarchically. The emergent coarse-grained physical models from these GMERA circuits are studied in terms of their entanglement properties and suitability for performing time evolution.

arXiv:2212.09798Physical review. B./Physical review. BJan 9, 202511 citations

Simulating and sampling from quantum circuits with 2D tensor networks

Manuel S. Rudolph, Joseph Tindall

Classical simulations of quantum circuits play a vital role in the development of quantum computers and in taking the temperature of the field. Here, we classically simulate various physically-motivated circuits using 2D tensor network ansätze for the many-body wavefunction, which match the geometry of the underlying quantum processor. We employ a generalized boundary Matrix Product State contraction algorithm to controllably generate samples from the resultant tensor network states. Our approach systematically converges both the quality of the final state and the samples drawn from it to the true distribution defined by the circuit, with GPU hardware providing significant speedups over CPU hardware. Using these methods, we simulate the largest local unitary Jastrow ansatz circuit from recent IBM experiments to numerical precision. We also study a domain-wall quench in a 2D discrete-time Heisenberg model on large heavy-hex and rotated square lattices, reflecting IBM’s and Google’s latest processors, respectively. We observe a rapid buildup of complex loop correlations on the Google Willow geometry, which significantly impacts local properties of the system. Meanwhile, loop correlations build up extremely slowly on heavy-hex processors, with almost negligible impact even at large circuit depths. Our results underscore the role processor geometry plays in classical simulability.

arXiv:2507.11424npj Quantum InformationSep 24, 20261 citation