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)

Simulation of Continuous-Variable Quantum Systems with Tensor Network

Ryutaro Nagai, Takao Tomono, Yuichiro Minato

Published Oct 1, 2021• 3 citations
Publisher

Abstract

Tensor network is known as a powerful method to simulate quantum computation on a classical computer. Recently, the random quantum circuit used in the demonstration of quantum supremacy by Sycamore quantum computer have been simulated with tensor network method. Compared to the application of tensor networks to Discrete-Variable (DV) quantum computation, there are very few examples of application of tensor network to Continuous-Variable (CV) quantum computation. Therefore, we applied a tensor network structure called Matrix Product States (MPS) to CV quantum computation. Tensor network is expected to be useful for simulating Gaussian Boson Sampling (GBS), which is a promised near-term application of photonic quantum system. We outline the performance of tensor network-based simulation of CV quantum computation in GBS.

DOI
10.1109/qce52317.2021.00067

Related papers

Variational tensor network simulation of Gaussian boson sampling and beyond

Jonas Vinther, Michael J. Kastoryano

The continuous variable quantum computing platform constitutes a promising candidate for realizing quantum advantage, as exemplified in Gaussian Boson Sampling. While noise in the experiments makes the computation attainable for classical simulations, it has been suggested that the addition of non-linear elements to the experiment will help retain the quantum advantage. We propose a classical simulation tool for general continuous variable sampling problems, including Gaussian Boson Sampling and beyond. We reformulate the sampling problem as that of finding the ground state of a simple few-body Hamiltonian. This allows us to employ powerful variational methods based on tensor networks and to read off the simulation error directly from the expectation value of the Hamiltonian. We validate our method by simulating Gaussian Boson Sampling, where we achieve results comparable to the state of the art. We also consider a non-Gaussian sampling problem, for which we develop novel local basis optimization techniques based on a non-linear parameterization of the implicit basis, resulting in high effective cutoffs with diminished computational overhead.

arXiv:2410.18740•Physical Review A•Jul 7, 2025•2 citations

Tensor Network-Based Continuous Variable Quantum Circuit Optimization for Preparation of GKP State

Ryutaro Nagai, Takao Tomono

Tensor networks are highly promising methods for efficiently simulating quantum systems using classical computers. In recent years, the efficiency of tensor networks has been eagerly harnessed to simulate NISQ devices in the era of quantum supremacy. However, as of now, quantum advantage with NISQ devices has not been clearly demonstrated in practical applications. This provide impetus for us to intensify our effort in fault tolerant quantum computation (FTQC). Various physical systems and schemes for FTQC have been proposed, with GKP encoding in bosonic systems being one such example. The preparation of GKP states serves as an important building block for realizing FTQC with the GKP code. We introduce tensor networks for simulating and optimizing the GKP state preparation circuit. It is known that the generation of approximated GKP states is achievable through photon counting and post-selection applied to properly prepared multimode Gaussian states. However, it requires optimization of numerous circuit parameters, which is typically computationally challenging on classical computers due to the involvement of the photon counting measurement process. We attempt to utilize tensor networks for more efficient parameter optimization. Additionally, we explore further efficient approach in terms of tensor network structure. We propose a multi-cutoff dimension approach combined with a tree tensor network structure.

IEEE International Conference on Quantum Computing and Engineering (QCE)•Sep 17, 2023•0 citations

Symbolic Simulation of Quantum Circuits with Tensor Networks

Jincheng Zhang

The accurate simulation of quantum circuits remains a significant challenge due to the exponential scaling of computational resources with circuit size. This work explores the application of tensor network methods, specifically Matrix Product States (MPS), to provide a scalable approach for simulating quantum circuits. We demonstrate how tensor networks can efficiently represent and manipulate the states of quantum circuits, reducing the computational burden associated with traditional methods. The core claim of this research is that tensor networks offer a viable path to accurately simulating larger and more complex quantum systems. This research introduces a novel framework for symbolic simulation, leveraging the power of tensor network representations to overcome the limitations of conventional simulation techniques. The effectiveness of this approach is illustrated through theoretical analysis and conceptual examples.

•Sep 5, 2026•0 citations

Quantum Simulation of Molecular Dynamics with Tensor Networks

Jincheng Zhang

This paper explores the application of tensor network methods for simulating molecular dynamics on quantum computers. Traditional molecular dynamics simulations are computationally expensive, particularly for complex systems exhibiting strong quantum correlations. Tensor networks provide a powerful framework for representing and manipulating high-dimensional quantum states, potentially offering a pathway to efficiently simulate molecular dynamics by directly leveraging quantum computational resources. This work details the theoretical framework, outlining how tensor network techniques, specifically Matrix Product States (MPS) and Tree Tensor Networks (TTN), can be adapted for this purpose. We present a simplified model of a diatomic molecule to illustrate the core concept: the construction of a tensor network representation of the molecular wavefunction, followed by the application of time evolution operators to simulate dynamics. The focus is on demonstrating the potential of this approach rather than a fully optimized simulation, highlighting key challenges and future research directions. The efficiency gains compared to classical methods are discussed, acknowledging the significant technological hurdles involved in realizing this approach on near-term quantum devices. We investigate the scalability of the method, considering the limitations imposed by the bond dimension of the tensor network. The ultimate goal is to demonstrate how tensor networks can provide a viable strategy for tackling computationally intractable molecular dynamics problems, paving the way for a new era of quantum-enhanced molecular simulations.

•Sep 5, 2026•0 citations

Harnessing CUDA-Q’s MPS for Tensor Network Simulations of Large-Scale Quantum Circuits

Gabin Schieffer, Stefano Markidis, Ivy Bo Peng

Quantum computer simulators are an indispensable tool for prototyping quantum algorithms and verifying the functioning of existing quantum computer hardware. The current largest quantum computers feature more than one thousand qubits, challenging their classical simulators. Statevector quantum simulators are challenged by the exponential increase of representable quantum states with respect to the number of qubits, making more than fifty qubits practically unfeasible. A more appealing approach for simulating quantum computers is adopting the tensor network approach, whose memory requirements fundamentally depend on the level of entanglement in the quantum circuit, and allows simulating the current largest quantum computers. This work investigates and evaluates the CUDA-Q tensor network simulators on an Nvidia Grace Hopper system, particularly the Matrix Product State (MPS) formulation. We compare the performance of the CUDA-Q state vector implementation and validate the correctness of MPS simulations. Our results highlight that tensor network-based methods provide a significant opportunity to simulate large-qubit circuits, albeit approximately. We also show that current GPUaccelerated computation cannot fully utilize GPU efficiently in the case of MPS simulations.

arXiv:2501.15939•Euromicro International Conference on Parallel, Distributed and Network-Based Processing (PDP)•Mar 12, 2025•11 citations

Heisenberg picture tensor network formalism for optical circuits

Dario Cilluffo, Matthias Kost, Nicola Lorenzoni +1 more

Tensor network formalisms have emerged as powerful tools for simulating quantum state evolution. While widely applied in the study of optical quantum circuits, such as boson sampling, existing tensor network approaches fail to address the complexity mismatch between tensor contractions and the calculation of photon-counting probability amplitudes. Here, we present an alternative tensor network framework that exploits the input-output relations of quantum optical circuits encoded in the unitary interferometer matrix. Our approach bridges the complexity gap by enabling the computation of the permanent—central to boson sampling—with the same computational complexity as the best known classical algorithm based on a graphical representation of the operator-basis matrix product states that we introduce. Furthermore, we exploit the flexibility of tensor networks to extend our formalism to incorporate partial distinguishability and photon loss, two key imperfections in practical interferometry experiments. This work offers a significant step forward in the simulation of large-scale quantum optical systems and the understanding of their computational complexity.

arXiv:2502.01737•Physical Review Research•Mar 27, 2026•2 citations
Tensor network is known as a powerful method to simulate quantum computation on a classical computer. Recently, the random quantum circuit used in the demonstration of quantum supremacy by Sycamore quantum computer have been simulated with tensor network method. Compared to the application of tensor networks to Discrete-Variable (DV) quantum computation, there are very few examples of application of tensor network to Continuous-Variable (CV) quantum computation. Therefore, we applied a tensor network structure called Matrix Product States (MPS) to CV quantum computation. Tensor network is expected to be useful for simulating Gaussian Boson Sampling (GBS), which is a promised near-term application of photonic quantum system. We outline the performance of tensor network-based simulation of CV quantum computation in GBS.
The continuous variable quantum computing platform constitutes a promising candidate for realizing quantum advantage, as exemplified in Gaussian Boson Sampling. While noise in the experiments makes the computation attainable for classical simulations, it has been suggested that the addition of non-linear elements to the experiment will help retain the quantum advantage. We propose a classical simulation tool for general continuous variable sampling problems, including Gaussian Boson Sampling and beyond. We reformulate the sampling problem as that of finding the ground state of a simple few-body Hamiltonian. This allows us to employ powerful variational methods based on tensor networks and to read off the simulation error directly from the expectation value of the Hamiltonian. We validate our method by simulating Gaussian Boson Sampling, where we achieve results comparable to the state of the art. We also consider a non-Gaussian sampling problem, for which we develop novel local basis optimization techniques based on a non-linear parameterization of the implicit basis, resulting in high effective cutoffs with diminished computational overhead.
Tensor networks are highly promising methods for efficiently simulating quantum systems using classical computers. In recent years, the efficiency of tensor networks has been eagerly harnessed to simulate NISQ devices in the era of quantum supremacy. However, as of now, quantum advantage with NISQ devices has not been clearly demonstrated in practical applications. This provide impetus for us to intensify our effort in fault tolerant quantum computation (FTQC). Various physical systems and schemes for FTQC have been proposed, with GKP encoding in bosonic systems being one such example. The preparation of GKP states serves as an important building block for realizing FTQC with the GKP code. We introduce tensor networks for simulating and optimizing the GKP state preparation circuit. It is known that the generation of approximated GKP states is achievable through photon counting and post-selection applied to properly prepared multimode Gaussian states. However, it requires optimization of numerous circuit parameters, which is typically computationally challenging on classical computers due to the involvement of the photon counting measurement process. We attempt to utilize tensor networks for more efficient parameter optimization. Additionally, we explore further efficient approach in terms of tensor network structure. We propose a multi-cutoff dimension approach combined with a tree tensor network structure.
The accurate simulation of quantum circuits remains a significant challenge due to the exponential scaling of computational resources with circuit size. This work explores the application of tensor network methods, specifically Matrix Product States (MPS), to provide a scalable approach for simulating quantum circuits. We demonstrate how tensor networks can efficiently represent and manipulate the states of quantum circuits, reducing the computational burden associated with traditional methods. The core claim of this research is that tensor networks offer a viable path to accurately simulating larger and more complex quantum systems. This research introduces a novel framework for symbolic simulation, leveraging the power of tensor network representations to overcome the limitations of conventional simulation techniques. The effectiveness of this approach is illustrated through theoretical analysis and conceptual examples.
This paper explores the application of tensor network methods for simulating molecular dynamics on quantum computers. Traditional molecular dynamics simulations are computationally expensive, particularly for complex systems exhibiting strong quantum correlations. Tensor networks provide a powerful framework for representing and manipulating high-dimensional quantum states, potentially offering a pathway to efficiently simulate molecular dynamics by directly leveraging quantum computational resources. This work details the theoretical framework, outlining how tensor network techniques, specifically Matrix Product States (MPS) and Tree Tensor Networks (TTN), can be adapted for this purpose. We present a simplified model of a diatomic molecule to illustrate the core concept: the construction of a tensor network representation of the molecular wavefunction, followed by the application of time evolution operators to simulate dynamics. The focus is on demonstrating the potential of this approach rather than a fully optimized simulation, highlighting key challenges and future research directions. The efficiency gains compared to classical methods are discussed, acknowledging the significant technological hurdles involved in realizing this approach on near-term quantum devices. We investigate the scalability of the method, considering the limitations imposed by the bond dimension of the tensor network. The ultimate goal is to demonstrate how tensor networks can provide a viable strategy for tackling computationally intractable molecular dynamics problems, paving the way for a new era of quantum-enhanced molecular simulations.
Quantum computer simulators are an indispensable tool for prototyping quantum algorithms and verifying the functioning of existing quantum computer hardware. The current largest quantum computers feature more than one thousand qubits, challenging their classical simulators. Statevector quantum simulators are challenged by the exponential increase of representable quantum states with respect to the number of qubits, making more than fifty qubits practically unfeasible. A more appealing approach for simulating quantum computers is adopting the tensor network approach, whose memory requirements fundamentally depend on the level of entanglement in the quantum circuit, and allows simulating the current largest quantum computers. This work investigates and evaluates the CUDA-Q tensor network simulators on an Nvidia Grace Hopper system, particularly the Matrix Product State (MPS) formulation. We compare the performance of the CUDA-Q state vector implementation and validate the correctness of MPS simulations. Our results highlight that tensor network-based methods provide a significant opportunity to simulate large-qubit circuits, albeit approximately. We also show that current GPUaccelerated computation cannot fully utilize GPU efficiently in the case of MPS simulations.
Tensor network formalisms have emerged as powerful tools for simulating quantum state evolution. While widely applied in the study of optical quantum circuits, such as boson sampling, existing tensor network approaches fail to address the complexity mismatch between tensor contractions and the calculation of photon-counting probability amplitudes. Here, we present an alternative tensor network framework that exploits the input-output relations of quantum optical circuits encoded in the unitary interferometer matrix. Our approach bridges the complexity gap by enabling the computation of the permanent—central to boson sampling—with the same computational complexity as the best known classical algorithm based on a graphical representation of the operator-basis matrix product states that we introduce. Furthermore, we exploit the flexibility of tensor networks to extend our formalism to incorporate partial distinguishability and photon loss, two key imperfections in practical interferometry experiments. This work offers a significant step forward in the simulation of large-scale quantum optical systems and the understanding of their computational complexity.