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

IEEE International Conference on Quantum Computing and Engineering (QCE)

A PEPS Plugin for TNQVM

Srikar Chundury, Justin G. Lietz, E. A. Coello Pérez, Amir Shehata, In‐Saeng Suh, Frank Mueller

Published Sep 17, 2023• 1 citation
Publisher

Abstract

This work introduces an extension to the Tensor Network Quantum Virtual Machine (TNQVM) tool, enhancing the existing stack of ExaScale Tensor Network (ExaTN), ExaScale Accelerator (XACC), and TNQVM. It features a new plugin that enables efficient simulation of a Projected Entangled Pair State (PEPS), a 2D tensor network. To improve simulation efficiency for PEPS, we have implemented the snake boundary contraction algorithm. By integrating this capability into the existing stack, we enhance the overall functionality and versatility of the framework. We tested this new PEPS topology for a simple GHZ bell-pair generation quantum circuit and saw that its runtime is very close to that of the MPS topology. We estimate that the real potential of the PEPS topology becomes discernible when quantum circuits with multidimensional entanglement are simulated using tensor networks. In such cases, 1D tensor networks fail to represent or contract them efficiently.

DOI
10.1109/qce57702.2023.10293

Related papers

Efficient 2D Tensor Network Simulation of Quantum Systems

Yuchen Pang, Tianyi Hao, Annika Dugad +2 more

Simulation of quantum systems is challenging due to the exponential size of the state space. Tensor networks provide a systematically improvable approximation for quantum states. 2D tensor networks such as Projected Entangled Pair States (PEPS) are well-suited for key classes of physical systems and quantum circuits. However, direct contraction of PEPS networks has exponential cost, while approximate algorithms require computations with large tensors. We propose new scalable algorithms and software abstractions for PEPS-based methods, accelerating the bottleneck operation of contraction and refactorization of a tensor subnetwork. We employ randomized SVD with an implicit matrix to reduce cost and memory footprint asymptotically. Further, we develop a distributed-memory PEPS library and study accuracy and efficiency of alternative algorithms for PEPS contraction and evolution on the Stampede2 supercomputer. We also simulate a popular near-term quantum algorithm, the Variational Quantum Eigensolver (VQE), and benchmark Imaginary Time Evolution (ITE), which compute ground states of Hamiltonians.

arXiv:2006.15234•International Conference for High Performance Computing, Networking, Storage and Analysis (SC)•Nov 1, 2020•17 citations

Tensor Network Approaches for Higher-Dimensional Quantum Lattice Models

Shi-Ju Ran, Emanuele Tirrito, Cheng Peng +4 more

In this section, we will show several representative TN Tensor network (TN) approaches for simulating the quantum lattice models in (d > 1) dimensions. We will mainly use the language of TN contractions. One may refer to several existing reviews (Schollwöck, Ann Phys 326:96–192, 2011; Verstraete et al., Adv Phys 57:143–224, 2008; Cirac and Verstraete, J Phys A Math Theor 42:504004, 2009; Orús, Ann Phys 349:117, 2014; Haegeman and Verstraete, Ann Rev Condens Matter Phys 8(1):355–406, 2017) for more exhaustive understanding on the TN simulations for quantum problems. We will focus on the algorithms based on PEPS Projected entangled pair state (PEPS) , and show the key roles that the 2D TN contraction algorithms presented in Sect. 3 play in the higher-dimensional cases.

Lecture notes in physics•Jan 1, 2020•1 citation

Integrating Julia-ITensors into the Tensor Network Quantum Virtual Machine (TNQVM)

Zachary W. Windom, Daniel Claudino, Vicente Leyton-Ortega

The Tensor Network Quantum Virtual Machine (TNQVM) is a high-performance classical circuit simulation backend for the eXtreme-scale ACCelerator (XACC) framework that leverages the Intelligent Tensor (ITensor) library for tensor network--based quantum circuit simulation. However, TNQVM's original C++ ITensor backend is tied to an older integrated release, limiting access to newer tensor network algorithms, diagnostics, and performance improvements available in the actively developed Julia-based ITensors ecosystem. We introduce JuliaITensorTNQVM, an interoperability layer that bridges TNQVM's C++ visitor infrastructure and the Julia-ITensors runtime through a C-compatible application binary interface. This design preserves the existing XACC/TNQVM programming model while enabling access to modern tensor network capabilities, including entanglement entropy diagnostics exposed directly to XACC. We evaluate the implementation through two studies: a Page-curve verification protocol using Haar-random states, and QAOA MaxCut simulations on 3-regular graphs. Within these tested regimes, results are consistent with expected entanglement behavior and established scaling trends, supporting JuliaITensorTNQVM as a practical modernization path for tensor network simulation in TNQVM.

quant-pharXiv:2603.27037•Mar 31, 2026•0 citations

Validating quantum-classical programming models with tensor network simulations

Alexander McCaskey, Eugene Dumitrescu, Mengsu Chen +2 more

The exploration of hybrid quantum-classical algorithms and programming models on noisy near-term quantum hardware has begun. As hybrid programs scale towards classical intractability, validation and benchmarking are critical to understanding the utility of the hybrid computational model. In this paper, we demonstrate a newly developed quantum circuit simulator based on tensor network theory that enables intermediate-scale verification and validation of hybrid quantum-classical computing frameworks and programming models. We present our tensor-network quantum virtual machine (TNQVM) simulator which stores a multi-qubit wavefunction in a compressed (factorized) form as a matrix product state, thus enabling single-node simulations of larger qubit registers, as compared to brute-force state-vector simulators. Our simulator is designed to be extensible in both the tensor network form and the classical hardware used to run the simulation (multicore, GPU, distributed). The extensibility of the TNQVM simulator with respect to the simulation hardware type is achieved via a pluggable interface for different numerical backends (e.g., ITensor and ExaTENSOR numerical libraries). We demonstrate the utility of our TNQVM quantum circuit simulator through the verification of randomized quantum circuits and the variational quantum eigensolver algorithm, both expressed within the eXtreme-scale ACCelerator (XACC) programming model.

arXiv:1807.07914•PLoS ONE•Dec 10, 2018•43 citations

Tensor Network Quantum Virtual Machine for Simulating Quantum Circuits at Exascale

Thien Nguyen, Dmitry I. Lyakh, Eugene Dumitrescu +3 more

The numerical simulation of quantum circuits is an indispensable tool for development, verification, and validation of hybrid quantum-classical algorithms intended for near-term quantum co-processors. The emergence of exascale high-performance computing (HPC) platforms presents new opportunities for pushing the boundaries of quantum circuit simulation. We present a modernized version of the Tensor Network Quantum Virtual Machine (TNQVM) that serves as the quantum circuit simulation backend in the eXtreme-scale ACCelerator (XACC) framework. The new version is based on the scalable tensor network processing library ExaTN (Exascale Tensor Networks). It provides multiple configurable quantum circuit simulators that perform either an exact quantum circuit simulation via the full tensor network contraction or an approximate simulation via a suitably chosen tensor factorization scheme. Upon necessity, stochastic noise modeling from real quantum processors is incorporated into the simulations by modeling quantum channels with Kraus tensors. By combining the portable XACC quantum programming frontend and the scalable ExaTN numerical processing backend, we introduce an end-to-end virtual quantum development environment that can scale from laptops to future exascale platforms. We report initial benchmarks of our framework, which include a demonstration of the distributed execution, incorporation of quantum decoherence models, and simulation of the random quantum circuits used for the certification of quantum supremacy on Google’s Sycamore superconducting architecture.

arXiv:2104.10523•ACM Transactions on Quantum Computing•Jul 9, 2022•32 citations

Implementation of Tensor Network Simulation TN-Sim under NWQ-Sim

Aaron C. Hoyt, Jonathan S. Bersson, Sean Garner +2 more

Large-scale tensor network simulations are crucial for developing robust complexity-theoretic bounds on classical quantum simulation, enabling circuit cutting approaches, and optimizing circuit compilation, all of which aid efficient quantum computation on limited quantum resources. Modern exascale high-performance computing platforms offer significant potential for advancing tensor network quantum circuit simulation capabilities. We implement TN-Sim, a tensor network simulator backend within the NWQ-Sim software package that utilizes the Tensor Algebra for Many-body Methods (TAMM) framework to support both distributed HPC-scale computations and local simulations with ITensor. To optimize the scale up in computation across multiple nodes we implement a task based parallelization scheme to demonstrate parallelized gate contraction for wide quantum circuits with many gates per layer. Through the integration of the TAMM framework with Matrix Product State (MPS) tensor network approaches, we deliver a simulation environment that can scale from local systems to HPC clusters. We demonstrate an MPS tensor network simulator running on the state-of-the-art Perlmutter (NVIDIA) supercomputer and discuss the potential portability of this software to HPC clusters such as Frontier (AMD) and Aurora (Intel). We also discuss future improvements including support for different tensor network topologies and enhanced computational efficiency.

quant-pharXiv:2601.04422•IEEE High Performance Extreme Computing Conference•Jan 9, 2026•0 citations
This work introduces an extension to the Tensor Network Quantum Virtual Machine (TNQVM) tool, enhancing the existing stack of ExaScale Tensor Network (ExaTN), ExaScale Accelerator (XACC), and TNQVM. It features a new plugin that enables efficient simulation of a Projected Entangled Pair State (PEPS), a 2D tensor network. To improve simulation efficiency for PEPS, we have implemented the snake boundary contraction algorithm. By integrating this capability into the existing stack, we enhance the overall functionality and versatility of the framework. We tested this new PEPS topology for a simple GHZ bell-pair generation quantum circuit and saw that its runtime is very close to that of the MPS topology. We estimate that the real potential of the PEPS topology becomes discernible when quantum circuits with multidimensional entanglement are simulated using tensor networks. In such cases, 1D tensor networks fail to represent or contract them efficiently.
Simulation of quantum systems is challenging due to the exponential size of the state space. Tensor networks provide a systematically improvable approximation for quantum states. 2D tensor networks such as Projected Entangled Pair States (PEPS) are well-suited for key classes of physical systems and quantum circuits. However, direct contraction of PEPS networks has exponential cost, while approximate algorithms require computations with large tensors. We propose new scalable algorithms and software abstractions for PEPS-based methods, accelerating the bottleneck operation of contraction and refactorization of a tensor subnetwork. We employ randomized SVD with an implicit matrix to reduce cost and memory footprint asymptotically. Further, we develop a distributed-memory PEPS library and study accuracy and efficiency of alternative algorithms for PEPS contraction and evolution on the Stampede2 supercomputer. We also simulate a popular near-term quantum algorithm, the Variational Quantum Eigensolver (VQE), and benchmark Imaginary Time Evolution (ITE), which compute ground states of Hamiltonians.
In this section, we will show several representative TN Tensor network (TN) approaches for simulating the quantum lattice models in (d > 1) dimensions. We will mainly use the language of TN contractions. One may refer to several existing reviews (Schollwöck, Ann Phys 326:96–192, 2011; Verstraete et al., Adv Phys 57:143–224, 2008; Cirac and Verstraete, J Phys A Math Theor 42:504004, 2009; Orús, Ann Phys 349:117, 2014; Haegeman and Verstraete, Ann Rev Condens Matter Phys 8(1):355–406, 2017) for more exhaustive understanding on the TN simulations for quantum problems. We will focus on the algorithms based on PEPS Projected entangled pair state (PEPS) , and show the key roles that the 2D TN contraction algorithms presented in Sect. 3 play in the higher-dimensional cases.
The Tensor Network Quantum Virtual Machine (TNQVM) is a high-performance classical circuit simulation backend for the eXtreme-scale ACCelerator (XACC) framework that leverages the Intelligent Tensor (ITensor) library for tensor network--based quantum circuit simulation. However, TNQVM's original C++ ITensor backend is tied to an older integrated release, limiting access to newer tensor network algorithms, diagnostics, and performance improvements available in the actively developed Julia-based ITensors ecosystem. We introduce JuliaITensorTNQVM, an interoperability layer that bridges TNQVM's C++ visitor infrastructure and the Julia-ITensors runtime through a C-compatible application binary interface. This design preserves the existing XACC/TNQVM programming model while enabling access to modern tensor network capabilities, including entanglement entropy diagnostics exposed directly to XACC. We evaluate the implementation through two studies: a Page-curve verification protocol using Haar-random states, and QAOA MaxCut simulations on 3-regular graphs. Within these tested regimes, results are consistent with expected entanglement behavior and established scaling trends, supporting JuliaITensorTNQVM as a practical modernization path for tensor network simulation in TNQVM.
The exploration of hybrid quantum-classical algorithms and programming models on noisy near-term quantum hardware has begun. As hybrid programs scale towards classical intractability, validation and benchmarking are critical to understanding the utility of the hybrid computational model. In this paper, we demonstrate a newly developed quantum circuit simulator based on tensor network theory that enables intermediate-scale verification and validation of hybrid quantum-classical computing frameworks and programming models. We present our tensor-network quantum virtual machine (TNQVM) simulator which stores a multi-qubit wavefunction in a compressed (factorized) form as a matrix product state, thus enabling single-node simulations of larger qubit registers, as compared to brute-force state-vector simulators. Our simulator is designed to be extensible in both the tensor network form and the classical hardware used to run the simulation (multicore, GPU, distributed). The extensibility of the TNQVM simulator with respect to the simulation hardware type is achieved via a pluggable interface for different numerical backends (e.g., ITensor and ExaTENSOR numerical libraries). We demonstrate the utility of our TNQVM quantum circuit simulator through the verification of randomized quantum circuits and the variational quantum eigensolver algorithm, both expressed within the eXtreme-scale ACCelerator (XACC) programming model.
The numerical simulation of quantum circuits is an indispensable tool for development, verification, and validation of hybrid quantum-classical algorithms intended for near-term quantum co-processors. The emergence of exascale high-performance computing (HPC) platforms presents new opportunities for pushing the boundaries of quantum circuit simulation. We present a modernized version of the Tensor Network Quantum Virtual Machine (TNQVM) that serves as the quantum circuit simulation backend in the eXtreme-scale ACCelerator (XACC) framework. The new version is based on the scalable tensor network processing library ExaTN (Exascale Tensor Networks). It provides multiple configurable quantum circuit simulators that perform either an exact quantum circuit simulation via the full tensor network contraction or an approximate simulation via a suitably chosen tensor factorization scheme. Upon necessity, stochastic noise modeling from real quantum processors is incorporated into the simulations by modeling quantum channels with Kraus tensors. By combining the portable XACC quantum programming frontend and the scalable ExaTN numerical processing backend, we introduce an end-to-end virtual quantum development environment that can scale from laptops to future exascale platforms. We report initial benchmarks of our framework, which include a demonstration of the distributed execution, incorporation of quantum decoherence models, and simulation of the random quantum circuits used for the certification of quantum supremacy on Google’s Sycamore superconducting architecture.
Large-scale tensor network simulations are crucial for developing robust complexity-theoretic bounds on classical quantum simulation, enabling circuit cutting approaches, and optimizing circuit compilation, all of which aid efficient quantum computation on limited quantum resources. Modern exascale high-performance computing platforms offer significant potential for advancing tensor network quantum circuit simulation capabilities. We implement TN-Sim, a tensor network simulator backend within the NWQ-Sim software package that utilizes the Tensor Algebra for Many-body Methods (TAMM) framework to support both distributed HPC-scale computations and local simulations with ITensor. To optimize the scale up in computation across multiple nodes we implement a task based parallelization scheme to demonstrate parallelized gate contraction for wide quantum circuits with many gates per layer. Through the integration of the TAMM framework with Matrix Product State (MPS) tensor network approaches, we deliver a simulation environment that can scale from local systems to HPC clusters. We demonstrate an MPS tensor network simulator running on the state-of-the-art Perlmutter (NVIDIA) supercomputer and discuss the potential portability of this software to HPC clusters such as Frontier (AMD) and Aurora (Intel). We also discuss future improvements including support for different tensor network topologies and enhanced computational efficiency.