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:2610.36172

Quantum circuit simulation with high-order optical tensor processing

Yufeng Zhang, Xuhan Guo, Zixuan Ning, Zhiliang Yuan, Yikai Su, Kaizhi Wang, Sergei Turitsyn, Zhipei Sun

quant-phphysics.app-phphysics.opticsSubmitted Oct 26, 2026• Announced Oct 28, 2026• 0 citations
arXivHTMLPDF

Abstract

Classical simulation is essential for developing and testing quantum circuits, but the exponential growth of Hilbert space challenges conventional digital processors. Here, we introduce a classical optical quantum simulation architecture that treats gates and batches of input states as independent tensor dimensions rather than separate simulation instances, while mapping eligible tensor network contractions onto the same processor. Using co-designed multidimensional encoding and readout across spatial and wavelength degrees of freedom, we experimentally realize high-order tensor-matrix multiplication in a single propagation and process all computational-basis inputs for each 4-qubit gate. Using a physics-based optical propagation model, we further numerically evaluate the architecture for the Deutsch algorithm and for the tensor network of all 128 target instances of a 7-qubit Grover algorithm. These results establish a unified framework for gate-state batch and tensor network simulation, providing a route to exploit optical concurrency across quantum simulation tasks.

AI Summary

The paper addresses how classical optical hardware can support quantum-circuit simulation by processing batches of gates and input states and by executing tensor-network contractions. Its architecture represents gates and batches of input states as independent tensor dimensions, rather than treating each gate–input combination as a separate simulation instance. Spatial and wavelength degrees of freedom provide multidimensional encoding and readout, with eligible tensor-network contractions mapped onto the same optical processor. The experimental result is high-order tensor–matrix multiplication in a single optical propagation, including processing all $16$ computational-basis inputs for each demonstrated $4$-qubit gate. The architecture is also evaluated numerically using a physics-based optical propagation model for the Deutsch algorithm and for tensor networks representing all $128$ target instances of a $7$-qubit Grover algorithm. These algorithm-level results are simulations of the optical architecture, rather than experimental circuit demonstrations. The stated scope is a common architecture for gate–state batch processing and eligible tensor-network contractions. The abstract does not specify which contractions are eligible, nor does it report numerical accuracy, runtime, energy consumption, or comparisons with digital simulation methods. It also does not establish scaling beyond the reported small circuits or a reduction in the exponential resources generally required for classical quantum simulation. With only the abstract available, further implementation constraints and limitations cannot be assessed.

No sign of AI-generated textMissing comparisonUnclear novelty

Written by gpt-6.1-sol from the abstract only. Automated: it can be wrong.

Comments
17 pages, 4 figures

Related papers

Tensor Networks and Quantum-Inspired Machine Learning

Hamid D. Ismail

This chapter presents tensor networks as a unifying framework for quantum-inspired machine learning and for the analysis of near-term quantum learning models. Motivated by the challenge of high dimensionality, this chapter shows how tensor networks exploit locality, low-rank structure, and controlled correlations to represent high-order data efficiently while avoiding the exponential scaling of naïve tensor representations. Fundamental concepts including tensors, tensor contraction, and graphical network representations are introduced, followed by the development of key architectures such as Matrix Product States (Tensor Trains) and the Multi-scale Entanglement Renormalization Ansatz. Their roles in controlling expressivity, entanglement, and computational cost are emphasized throughout. This chapter further demonstrates the close correspondence between tensor networks and quantum circuits, showing how shallow quantum models can be interpreted as low-bond-dimension tensor networks and how this perspective clarifies classical simulability, representational capacity, and noisy intermediate-scale quantum (NISQ)-era limitations. Hybrid quantum-tensor network architectures are presented as a practical route for combining classical compression and representation learning with targeted quantum processing. Applications in natural language processing, biological sequence learning, and image and signal processing illustrate how tensor network methods serve as both efficient classical models and structured surrogates for quantum learning systems. Hands-on Qiskit and PennyLane examples connect these ideas to executable machine learning workflows.

CRC Press eBooks•Nov 4, 2026•0 citations

Exploiting Block Sparsity for Quantum Circuit Simulation

Innocenzo Fulginiti, Christian B. Mendl

Simulating quantum circuits on classical hardware remains essential for developing and validating quantum algorithms, particularly in this era of noisy and limited quantum devices. Classical simulation is computationally demanding, due to the exponential growth of the Hilbert space with the number of qubits, because of quantum entanglement. Tensor networks offer a versatile tool for quantum circuit simulation, helping to reduce the associated computational cost. While tensor networks leverage entanglement to represent quantum states in compressed form, many quantum systems also exhibit additional symmetries, such as conserved particle number, that induce block sparsity in quantum states and quantum operators. We demonstrate through numerical experiments how block sparsity can be exploited to enhance the performance of the simulation of quantum circuits, in terms of execution time and memory usage.

IEEE International Conference on Quantum Computing and Engineering (QCE)•Aug 30, 2025•0 citations

Distributed Quantum Simulation via Tensor Networks

Jincheng Zhang

This paper explores the potential of tensor networks for enabling distributed quantum simulation, a crucial step towards scaling up quantum computations. Traditional quantum simulation faces limitations due to the exponential growth of state vector sizes required for complex systems. Distributed quantum simulation aims to overcome this by partitioning the simulation across multiple quantum processors. However, efficient representation and manipulation of the resulting distributed quantum state remain a significant challenge. This work proposes utilizing tensor networks as a framework for representing and processing these distributed quantum states. Tensor networks offer an inherent structure that facilitates efficient parallel computation and minimizes communication overhead between quantum processors. We outline a theoretical framework, detailing the application of tensor network contractions and disentanglement techniques specifically tailored for distributed quantum simulation scenarios. The core claim of this work is that scaling up quantum simulations requires efficient methods for representing and manipulating quantum states, and tensor networks provide a promising avenue for achieving this goal. We present a method to reduce the computational complexity associated with simulating large quantum systems by leveraging the properties of tensor networks. The approach allows for a more scalable simulation strategy, moving beyond the limitations of traditional state vector representations. Further research will explore specific tensor network architectures and optimization strategies for different simulation problems.

•Sep 7, 2026•0 citations

Tensor-Network-Based Distributed Quantum Dynamics on Independent Quantum Computers

Anurag Dwivedi, Melissa C. Revelle, Daniel S. Lobser +6 more

We present an approach based on tensor networks for distributed quantum computing simulation of chemical wavepacket dynamics in a continuous variable representation. The central idea is that the tensor-network representation of the multidimensional time-evolution operator naturally induces an elevated Hilbert space where the dynamics decomposes into a set of independent lower-dimensional propagations. This transformation converts an entangled quantum evolution into a set of parallel computational tasks that can be executed asynchronously across heterogeneous quantum and classical computing architectures. The resulting formalism establishes a direct connection between tensor-network decompositions, uniformly controlled quantum circuits, and asynchronous distributed quantum computing. The approach is developed with a goal towards hybrid quantum/classical implementation, and is appropriate for a general heterogeneous mixture of quantum hardware systems. The experimental realization of the asynchronously distributed quantum processes that arise from the tensor-network decomposition are carried out on the Sandia National Laboratories' trapped-ion quantum computer, where the circuits are compiled using native partial-entangling $XX(θ)$ gates, reducing the expected two-qubit gate infidelity by more than 30\% relative to conventional fully entangling decompositions. We demonstrate the methodology by quantum computing the vibrational spectra of a small protonated water cluster that shows critical quantum nuclear behavior. Such water cluster systems have been found to be challenging for experimental action spectroscopy and for theory, and here, for the first time, we provide results for vibrational spectroscopy that are in agreement with the respective classical results to within 4cm$^{-1}$, thus allowing for the potential for spectroscopic accuracy from quantum computations.

quant-pharXiv:2606.11579•Jun 11, 2026•0 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

Matrix Product Evolution: A Method for Simulating Quantum Circuits Using Tensor Networks

Haruyuki Kawabe, Minoru Nagai, Tsuyoshi Okubo +1 more

Classical simulation of quantum circuits is an essential tool in quantum information science, but its applicability is constrained by the exponential growth of the Hilbert space and the entanglement structure of quantum states. In this work, we introduce Matrix Product Evolution (MPE), a tensor-train representation of quantum circuits constructed along the circuit depth rather than along the qubit index. Within this formulation, the simulation of a quantum circuit is modeled as the contraction of multiple MPE tensors. We develop an efficient contraction strategy based on a zip-up procedure to carry out this contraction in practice. We investigate the numerical behavior of this MPE-based contraction framework through simulations of random quantum circuits and the time evolution of a quantum many-body state. Our results characterize the growth of temporal bond dimensions, clarify how post-selection modifies the contraction cost and approximation accuracy, and identify regimes in which depth-oriented tensor-network contractions provide a useful complement to standard MPS-based simulation approaches.

quant-pharXiv:2608.03472•Aug 5, 2026•0 citations
Classical simulation is essential for developing and testing quantum circuits, but the exponential growth of Hilbert space challenges conventional digital processors. Here, we introduce a classical optical quantum simulation architecture that treats gates and batches of input states as independent tensor dimensions rather than separate simulation instances, while mapping eligible tensor network contractions onto the same processor. Using co-designed multidimensional encoding and readout across spatial and wavelength degrees of freedom, we experimentally realize high-order tensor-matrix multiplication in a single propagation and process all computational-basis inputs for each 4-qubit gate. Using a physics-based optical propagation model, we further numerically evaluate the architecture for the Deutsch algorithm and for the tensor network of all 128 target instances of a 7-qubit Grover algorithm. These results establish a unified framework for gate-state batch and tensor network simulation, providing a route to exploit optical concurrency across quantum simulation tasks.
The paper addresses how classical optical hardware can support quantum-circuit simulation by processing batches of gates and input states and by executing tensor-network contractions. Its architecture represents gates and batches of input states as independent tensor dimensions, rather than treating each gate–input combination as a separate simulation instance. Spatial and wavelength degrees of freedom provide multidimensional encoding and readout, with eligible tensor-network contractions mapped onto the same optical processor.
The experimental result is high-order tensor–matrix multiplication in a single optical propagation, including processing all 161616 computational-basis inputs for each demonstrated 444-qubit gate. The architecture is also evaluated numerically using a physics-based optical propagation model for the Deutsch algorithm and for tensor networks representing all 128128128 target instances of a 777-qubit Grover algorithm. These algorithm-level results are simulations of the optical architecture, rather than experimental circuit demonstrations.
The stated scope is a common architecture for gate–state batch processing and eligible tensor-network contractions. The abstract does not specify which contractions are eligible, nor does it report numerical accuracy, runtime, energy consumption, or comparisons with digital simulation methods. It also does not establish scaling beyond the reported small circuits or a reduction in the exponential resources generally required for classical quantum simulation. With only the abstract available, further implementation constraints and limitations cannot be assessed.
This chapter presents tensor networks as a unifying framework for quantum-inspired machine learning and for the analysis of near-term quantum learning models. Motivated by the challenge of high dimensionality, this chapter shows how tensor networks exploit locality, low-rank structure, and controlled correlations to represent high-order data efficiently while avoiding the exponential scaling of naïve tensor representations. Fundamental concepts including tensors, tensor contraction, and graphical network representations are introduced, followed by the development of key architectures such as Matrix Product States (Tensor Trains) and the Multi-scale Entanglement Renormalization Ansatz. Their roles in controlling expressivity, entanglement, and computational cost are emphasized throughout. This chapter further demonstrates the close correspondence between tensor networks and quantum circuits, showing how shallow quantum models can be interpreted as low-bond-dimension tensor networks and how this perspective clarifies classical simulability, representational capacity, and noisy intermediate-scale quantum (NISQ)-era limitations. Hybrid quantum-tensor network architectures are presented as a practical route for combining classical compression and representation learning with targeted quantum processing. Applications in natural language processing, biological sequence learning, and image and signal processing illustrate how tensor network methods serve as both efficient classical models and structured surrogates for quantum learning systems. Hands-on Qiskit and PennyLane examples connect these ideas to executable machine learning workflows.
Simulating quantum circuits on classical hardware remains essential for developing and validating quantum algorithms, particularly in this era of noisy and limited quantum devices. Classical simulation is computationally demanding, due to the exponential growth of the Hilbert space with the number of qubits, because of quantum entanglement. Tensor networks offer a versatile tool for quantum circuit simulation, helping to reduce the associated computational cost. While tensor networks leverage entanglement to represent quantum states in compressed form, many quantum systems also exhibit additional symmetries, such as conserved particle number, that induce block sparsity in quantum states and quantum operators. We demonstrate through numerical experiments how block sparsity can be exploited to enhance the performance of the simulation of quantum circuits, in terms of execution time and memory usage.
This paper explores the potential of tensor networks for enabling distributed quantum simulation, a crucial step towards scaling up quantum computations. Traditional quantum simulation faces limitations due to the exponential growth of state vector sizes required for complex systems. Distributed quantum simulation aims to overcome this by partitioning the simulation across multiple quantum processors. However, efficient representation and manipulation of the resulting distributed quantum state remain a significant challenge. This work proposes utilizing tensor networks as a framework for representing and processing these distributed quantum states. Tensor networks offer an inherent structure that facilitates efficient parallel computation and minimizes communication overhead between quantum processors. We outline a theoretical framework, detailing the application of tensor network contractions and disentanglement techniques specifically tailored for distributed quantum simulation scenarios. The core claim of this work is that scaling up quantum simulations requires efficient methods for representing and manipulating quantum states, and tensor networks provide a promising avenue for achieving this goal. We present a method to reduce the computational complexity associated with simulating large quantum systems by leveraging the properties of tensor networks. The approach allows for a more scalable simulation strategy, moving beyond the limitations of traditional state vector representations. Further research will explore specific tensor network architectures and optimization strategies for different simulation problems.
We present an approach based on tensor networks for distributed quantum computing simulation of chemical wavepacket dynamics in a continuous variable representation. The central idea is that the tensor-network representation of the multidimensional time-evolution operator naturally induces an elevated Hilbert space where the dynamics decomposes into a set of independent lower-dimensional propagations. This transformation converts an entangled quantum evolution into a set of parallel computational tasks that can be executed asynchronously across heterogeneous quantum and classical computing architectures. The resulting formalism establishes a direct connection between tensor-network decompositions, uniformly controlled quantum circuits, and asynchronous distributed quantum computing. The approach is developed with a goal towards hybrid quantum/classical implementation, and is appropriate for a general heterogeneous mixture of quantum hardware systems. The experimental realization of the asynchronously distributed quantum processes that arise from the tensor-network decomposition are carried out on the Sandia National Laboratories' trapped-ion quantum computer, where the circuits are compiled using native partial-entangling XX(θ)XX(θ)XX(θ) gates, reducing the expected two-qubit gate infidelity by more than 30\% relative to conventional fully entangling decompositions. We demonstrate the methodology by quantum computing the vibrational spectra of a small protonated water cluster that shows critical quantum nuclear behavior. Such water cluster systems have been found to be challenging for experimental action spectroscopy and for theory, and here, for the first time, we provide results for vibrational spectroscopy that are in agreement with the respective classical results to within 4cm−1^{-1}−1, thus allowing for the potential for spectroscopic accuracy from quantum computations.
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.
Classical simulation of quantum circuits is an essential tool in quantum information science, but its applicability is constrained by the exponential growth of the Hilbert space and the entanglement structure of quantum states. In this work, we introduce Matrix Product Evolution (MPE), a tensor-train representation of quantum circuits constructed along the circuit depth rather than along the qubit index. Within this formulation, the simulation of a quantum circuit is modeled as the contraction of multiple MPE tensors. We develop an efficient contraction strategy based on a zip-up procedure to carry out this contraction in practice. We investigate the numerical behavior of this MPE-based contraction framework through simulations of random quantum circuits and the time evolution of a quantum many-body state. Our results characterize the growth of temporal bond dimensions, clarify how post-selection modifies the contraction cost and approximation accuracy, and identify regimes in which depth-oriented tensor-network contractions provide a useful complement to standard MPS-based simulation approaches.