Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2212.10421 · Physical Review A

Tensor-network-assisted variational quantum algorithm

Junxiang Huang, Wenhao He, Yukun Zhang, Yusen Wu, Bujiao Wu, Xiao Yuan

Published Nov 7, 2023• 19 citations
arXivHTMLPDF

Abstract

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.

DOI
10.1103/physreva.108.052407

Related papers

A joint optimization approach of parameterized quantum circuits with a tensor network

Clara Ferreira Cores, Kaur Kristjuhan, Mark Jones

Despite the advantage quantum computers are expected to deliver when performing simulations compared to their classical counterparts, the current noisy intermediate-scale quantum (NISQ) devices remain limited in their capabilities. The training of parameterized quantum circuits (PQCs) remains a significant practical challenge, exacerbated by the requirement of shallow circuit depth necessary for their hardware implementation. Hybrid methods employing classical computers alongside quantum devices, such as the Variational Quantum Eigensolver (VQE), have proven useful for analyzing the capabilities of NISQ devices to solve relevant optimization problems. Still, in the simulation of complex structures involving the many-body problem in quantum mechanics, major issues remain about the representation of the system and obtaining results which clearly outperform classical computational devices. In this research contribution we propose the use of parameterized Tensor Networks (TNs) to attempt an improved performance of the VQE algorithm. A joint approach is presented where the Hamiltonian of a system is encapsulated into a Matrix Product Operator (MPO) within a parameterized unitary TN hereby splitting up the optimization task between the TN and the VQE. We show that the hybrid TN-VQE implementation improves the convergence of the algorithm in comparison to optimizing randomly-initialized quantum circuits via VQE.

arXiv:2402.12105•Feb 19, 2024•1 citation

Embedding of Tree Tensor Networks into Shallow Quantum Circuits

Shota Sugawara, Kazuki Inomata, Tsuyoshi Okubo +1 more

Variational Quantum Algorithms (VQAs) are being highlighted as key quantum algorithms for demonstrating quantum advantage on Noisy Intermediate-Scale Quantum (NISQ) devices, which are limited to executing shallow quantum circuits because of noise. However, the barren plateau problem, where the gradient of the loss function becomes exponentially small with system size, hinders this goal. Recent studies suggest that embedding tensor networks into quantum circuits and initializing the parameters can avoid the barren plateau. Yet, embedding tensor networks into quantum circuits is generally difficult, and methods have been limited to the simplest structure, Matrix Product States (MPSs). This study proposes a method to embed Tree Tensor Networks (TTNs), characterized by their hierarchical structure, into shallow quantum circuits. TTNs are suitable for representing two-dimensional systems and systems with long-range correlations, which MPSs are inadequate for representing. Our numerical results show that embedding TTNs provides better initial quantum circuits than MPS. Additionally, our method has a practical computational complexity, making it applicable to a wide range of TTNs. This study is expected to extend the application of VQAs to two-dimensional systems and those with long-range correlations, which have been challenging to utilize.

arXiv:2501.18856•International Conference on Agents and Artificial Intelligence (ICAART)•Jan 1, 2025•12 citations

Concatenated tensor network states

R Hübener, V Nebendahl, Wolfgang Dür

We introduce the concept of concatenated tensor networks to efficiently describe quantum states. We show that the corresponding concatenated tensor network states can efficiently describe time evolution and possess arbitrary block-wise entanglement and long-ranged correlations. We illustrate the approach for the enhancement of matrix product states, i.e. one-dimensional (1D) tensor networks, where we replace each of the matrices of the original matrix product state with another 1D tensor network. This procedure yields a 2D tensor network, which includes—already for tensor dimension 2—all states that can be prepared by circuits of polynomially many (possibly non-unitary) two-qubit quantum operations, as well as states resulting from time evolution with respect to Hamiltonians with short-ranged interactions. We investigate the possibility of efficiently extracting information from these states, which serves as the basic step in a variational optimization procedure. To this aim, we utilize the known exact and approximate methods for 2D tensor networks and demonstrate some improvements thereof, which are also applicable e.g. in the context of 2D projected entangled pair states. We generalize the approach to higher dimensional and tree tensor networks.

arXiv:0904.1925•New Journal of Physics•Feb 26, 2010•45 citations

Structured Unitary Tensor Network Representations for Circuit-Efficient Quantum Data Encoding

Guang Lin, Toshihisa Tanaka, Qibin Zhao

Encoding classical data into quantum states is a central bottleneck in quantum machine learning: many widely used encodings are circuit-inefficient, requiring deep circuits and substantial quantum resources, which limits scalability on quantum hardware. In this work, we propose tensor network-based quantum data encoding (TNQE), a circuit-efficient framework built on structured unitary tensor network (TN) representations. TNQE first represents each classical input via a TN decomposition and then compiles the resulting tensor cores into an encoding circuit through two complementary core-to-circuit strategies. To make this compilation trainable while respecting the unitary nature of quantum operations, we introduce a unitary-aware constraint that parameterizes TN cores as learnable block unitaries, enabling them to be directly optimized and directly encoded as quantum operators. The proposed TNQE framework enables explicit control over circuit depth and qubit resources, allowing the construction of shallow, resource-efficient circuits. Across a range of benchmarks, TNQE achieves encoding circuits as shallow as $0.04\times$ the depth of amplitude encoding, while naturally scaling to high-resolution images ($256 \times 256$) and demonstrating practical feasibility on real quantum hardware.

quant-pharXiv:2602.16266•Feb 19, 2026•2 citations

Quantum Circuit Optimization using Differentiable Programming of Tensor Network States

David Rogerson, Ananda Roy

Efficient quantum circuit optimization schemes are central to quantum simulation of strongly interacting quantum many body systems. Here, we present an optimization algorithm which combines machine learning techniques and tensor network methods. The said algorithm runs on classical hardware and finds shallow, accurate quantum circuits by minimizing scalar cost functions. The gradients relevant for the optimization process are computed using the reverse mode automatic differentiation technique implemented on top of the time-evolved block decimation algorithm for matrix product states. A variation of the ADAM optimizer is utilized to perform a gradient descent on the manifolds of charge conserving unitary operators to find the optimal quantum circuit. The efficacy of this approach is demonstrated by finding the ground states of spin chain Hamiltonians for the Ising, three-state Potts and the massive Schwinger models for system sizes up to L=100. The first ten excited states of these models are also obtained for system sizes L=24. All circuits achieve high state fidelities within reasonable CPU time and modest memory requirements.

arXiv:2408.12583•Aug 22, 2024•16 citations

Variational Power of Quantum Circuit Tensor Networks

Reza Haghshenas, Johnnie Gray, Andrew C. Potter +1 more

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.

arXiv:2107.01307•Physical Review X•Mar 11, 2022•93 citations
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.
Despite the advantage quantum computers are expected to deliver when performing simulations compared to their classical counterparts, the current noisy intermediate-scale quantum (NISQ) devices remain limited in their capabilities. The training of parameterized quantum circuits (PQCs) remains a significant practical challenge, exacerbated by the requirement of shallow circuit depth necessary for their hardware implementation. Hybrid methods employing classical computers alongside quantum devices, such as the Variational Quantum Eigensolver (VQE), have proven useful for analyzing the capabilities of NISQ devices to solve relevant optimization problems. Still, in the simulation of complex structures involving the many-body problem in quantum mechanics, major issues remain about the representation of the system and obtaining results which clearly outperform classical computational devices. In this research contribution we propose the use of parameterized Tensor Networks (TNs) to attempt an improved performance of the VQE algorithm. A joint approach is presented where the Hamiltonian of a system is encapsulated into a Matrix Product Operator (MPO) within a parameterized unitary TN hereby splitting up the optimization task between the TN and the VQE. We show that the hybrid TN-VQE implementation improves the convergence of the algorithm in comparison to optimizing randomly-initialized quantum circuits via VQE.
Variational Quantum Algorithms (VQAs) are being highlighted as key quantum algorithms for demonstrating quantum advantage on Noisy Intermediate-Scale Quantum (NISQ) devices, which are limited to executing shallow quantum circuits because of noise. However, the barren plateau problem, where the gradient of the loss function becomes exponentially small with system size, hinders this goal. Recent studies suggest that embedding tensor networks into quantum circuits and initializing the parameters can avoid the barren plateau. Yet, embedding tensor networks into quantum circuits is generally difficult, and methods have been limited to the simplest structure, Matrix Product States (MPSs). This study proposes a method to embed Tree Tensor Networks (TTNs), characterized by their hierarchical structure, into shallow quantum circuits. TTNs are suitable for representing two-dimensional systems and systems with long-range correlations, which MPSs are inadequate for representing. Our numerical results show that embedding TTNs provides better initial quantum circuits than MPS. Additionally, our method has a practical computational complexity, making it applicable to a wide range of TTNs. This study is expected to extend the application of VQAs to two-dimensional systems and those with long-range correlations, which have been challenging to utilize.
We introduce the concept of concatenated tensor networks to efficiently describe quantum states. We show that the corresponding concatenated tensor network states can efficiently describe time evolution and possess arbitrary block-wise entanglement and long-ranged correlations. We illustrate the approach for the enhancement of matrix product states, i.e. one-dimensional (1D) tensor networks, where we replace each of the matrices of the original matrix product state with another 1D tensor network. This procedure yields a 2D tensor network, which includes—already for tensor dimension 2—all states that can be prepared by circuits of polynomially many (possibly non-unitary) two-qubit quantum operations, as well as states resulting from time evolution with respect to Hamiltonians with short-ranged interactions. We investigate the possibility of efficiently extracting information from these states, which serves as the basic step in a variational optimization procedure. To this aim, we utilize the known exact and approximate methods for 2D tensor networks and demonstrate some improvements thereof, which are also applicable e.g. in the context of 2D projected entangled pair states. We generalize the approach to higher dimensional and tree tensor networks.
Encoding classical data into quantum states is a central bottleneck in quantum machine learning: many widely used encodings are circuit-inefficient, requiring deep circuits and substantial quantum resources, which limits scalability on quantum hardware. In this work, we propose tensor network-based quantum data encoding (TNQE), a circuit-efficient framework built on structured unitary tensor network (TN) representations. TNQE first represents each classical input via a TN decomposition and then compiles the resulting tensor cores into an encoding circuit through two complementary core-to-circuit strategies. To make this compilation trainable while respecting the unitary nature of quantum operations, we introduce a unitary-aware constraint that parameterizes TN cores as learnable block unitaries, enabling them to be directly optimized and directly encoded as quantum operators. The proposed TNQE framework enables explicit control over circuit depth and qubit resources, allowing the construction of shallow, resource-efficient circuits. Across a range of benchmarks, TNQE achieves encoding circuits as shallow as 0.04×0.04\times0.04× the depth of amplitude encoding, while naturally scaling to high-resolution images (256×256256 \times 256256×256) and demonstrating practical feasibility on real quantum hardware.
Efficient quantum circuit optimization schemes are central to quantum simulation of strongly interacting quantum many body systems. Here, we present an optimization algorithm which combines machine learning techniques and tensor network methods. The said algorithm runs on classical hardware and finds shallow, accurate quantum circuits by minimizing scalar cost functions. The gradients relevant for the optimization process are computed using the reverse mode automatic differentiation technique implemented on top of the time-evolved block decimation algorithm for matrix product states. A variation of the ADAM optimizer is utilized to perform a gradient descent on the manifolds of charge conserving unitary operators to find the optimal quantum circuit. The efficacy of this approach is demonstrated by finding the ground states of spin chain Hamiltonians for the Ising, three-state Potts and the massive Schwinger models for system sizes up to L=100. The first ten excited states of these models are also obtained for system sizes L=24. All circuits achieve high state fidelities within reasonable CPU time and modest memory requirements.
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.