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:2502.01737 · Physical Review Research

Heisenberg picture tensor network formalism for optical circuits

Dario Cilluffo, Matthias Kost, Nicola Lorenzoni, Martin Bodo Plenio

Published Mar 27, 2026• 1 citation
arXivHTMLPDF

Abstract

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.

DOI
10.1103/wtwl-979d

Related papers

Formal Specification of Quantum Algorithms via Tensor Networks

Jincheng Zhang

Quantum algorithms offer the potential for exponential speedups over classical algorithms for specific computational tasks. However, the inherent complexity and probabilistic nature of quantum mechanics pose significant challenges in verifying and understanding these algorithms. Traditional approaches, relying on simulations and theoretical arguments, often struggle to provide definitive proof of correctness and to guide the optimization of quantum circuits. This paper proposes a novel approach to formally specifying quantum algorithms by representing them using tensor networks. Tensor networks provide a powerful mathematical framework for describing multi-dimensional quantum states and operations, allowing for a precise and rigorous description of the algorithm's evolution. We demonstrate how tensor network techniques can be used to capture the unitary transformations that constitute a quantum algorithm, providing a foundation for automated verification and optimization strategies. The key contribution of this work is the application of tensor networks to the formal specification of quantum algorithms, addressing a critical gap in the field and paving the way for more robust and reliable quantum computation. The formal specification allows for the definition of the algorithm's state space and the evolution operator, enabling the application of mathematical techniques to analyze and improve the algorithm's performance.

•Aug 31, 2026•0 citations

Tensor-network approach to quantum optical state evolution beyond the Fock basis

Nikolay Kapridov, Egor Tiunov, Dmitry Chermoshentsev

Understanding the quantum evolution of light in nonlinear media is central to the development of next-generation quantum technologies. Yet, modeling these processes remains computationally demanding, as the required resources grow rapidly with photon number and phase-space resolution. Here, we introduce a tensor-network approach that efficiently captures the dynamics of nonlinear optical systems in a continuous-variable representation. Using the matrix product state (MPS) formalism, both quantum states and operators are encoded in a highly compressed form, enabling direct numerical integration of the Schrödinger equation. We demonstrate the method by simulating degenerate spontaneous parametric down-conversion (SPDC) and show that it accurately reproduces established theoretical benchmarks - energy conservation, pump depletion, and quadrature squeezing - even in regimes where conventional Fock-basis simulations become infeasible. For high-intensity pump fields $(α=100)$, the MPS representation achieves compression ratios below $3\times10^{-4}$ while preserving physical fidelity. This framework opens a scalable route to modeling multimode quantum light and nonlinear optical phenomena beyond the reach of traditional methods.

quant-pharXiv:2511.15295•Nov 20, 2025•0 citations

Simulating Gaussian Boson Sampling with Tensor Networks in the Heisenberg picture

Dario Cilluffo, Nicola Lorenzoni, Martin Bodo Plenio

Although the Schr{ö}dinger and Heisenberg pictures are equivalent formulations of quantum mechanics, simulations performed choosing one over the other can greatly impact the computational resources required to solve a problem. Here we demonstrate that in Gaussian boson sampling, a central problem in quantum computing, a good choice of representation can shift the boundary between feasible and infeasible numerical simulability. To achieve this, we introduce a novel method for computing the probability distribution of boson sampling based on the time evolution of tensor networks in the Heisenberg picture. In addition, we overcome limitations of existing methods enabling simulations of realistic setups affected by non-uniform photon losses. Our results demonstrate the effectiveness of the method and its potential to advance quantum computing research.

arXiv:2305.11215•May 18, 2023•2 citations

Quantum circuit simulation with high-order optical tensor processing

Yufeng Zhang, Xuhan Guo, Zixuan Ning +5 more

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.

quant-pharXiv:2610.36172•Oct 28, 2026•0 citations

Tensor Network Techniques for Quantum Computation

Mario Collura, Guglielmo Lami, Nishan Ranabhat +1 more

This book serves as an introductory yet thorough guide to tensor networks and their applications in quantum computation and quantum information, designed for advanced undergraduate and graduate-level readers. In Part I, foundational topics are covered, including tensor structures and network representations like Matrix Product States (MPS) and Tree Tensor Networks (TTN). These preliminaries provide readers with the core mathematical tools and concepts necessary for quantum physics and quantum computing applications, bridging the gap between multi-linear algebra and complex quantum systems. Part II explores practical applications of tensor networks in simulating quantum dynamics, with a particular focus on the efficiency they offer for systems of high computational complexity. Key topics include Hamiltonian dynamics, quantum annealing, open system dynamics, and optimization strategies using TN frameworks. A final chapter addresses the emerging role of “quantum magic” in tensor networks. It delves into non-stabilizer states and their contribution to quantum computational power beyond classical simulability, featuring methods such as stabilizer-enhanced MPS and the Clifford-dressed TDVP. In presenting tensor networks as tools for understanding quantum complexity, this book aims to foster a deeper collaboration between the many-body physics and quantum computing communities, inviting a broader audience to engage with these recent developments.

arXiv:2503.04423•Dec 1, 2024•7 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
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.
Quantum algorithms offer the potential for exponential speedups over classical algorithms for specific computational tasks. However, the inherent complexity and probabilistic nature of quantum mechanics pose significant challenges in verifying and understanding these algorithms. Traditional approaches, relying on simulations and theoretical arguments, often struggle to provide definitive proof of correctness and to guide the optimization of quantum circuits. This paper proposes a novel approach to formally specifying quantum algorithms by representing them using tensor networks. Tensor networks provide a powerful mathematical framework for describing multi-dimensional quantum states and operations, allowing for a precise and rigorous description of the algorithm's evolution. We demonstrate how tensor network techniques can be used to capture the unitary transformations that constitute a quantum algorithm, providing a foundation for automated verification and optimization strategies. The key contribution of this work is the application of tensor networks to the formal specification of quantum algorithms, addressing a critical gap in the field and paving the way for more robust and reliable quantum computation. The formal specification allows for the definition of the algorithm's state space and the evolution operator, enabling the application of mathematical techniques to analyze and improve the algorithm's performance.
Understanding the quantum evolution of light in nonlinear media is central to the development of next-generation quantum technologies. Yet, modeling these processes remains computationally demanding, as the required resources grow rapidly with photon number and phase-space resolution. Here, we introduce a tensor-network approach that efficiently captures the dynamics of nonlinear optical systems in a continuous-variable representation. Using the matrix product state (MPS) formalism, both quantum states and operators are encoded in a highly compressed form, enabling direct numerical integration of the Schrödinger equation. We demonstrate the method by simulating degenerate spontaneous parametric down-conversion (SPDC) and show that it accurately reproduces established theoretical benchmarks - energy conservation, pump depletion, and quadrature squeezing - even in regimes where conventional Fock-basis simulations become infeasible. For high-intensity pump fields (α=100)(α=100)(α=100), the MPS representation achieves compression ratios below 3×10−43\times10^{-4}3×10−4 while preserving physical fidelity. This framework opens a scalable route to modeling multimode quantum light and nonlinear optical phenomena beyond the reach of traditional methods.
Although the Schr{ö}dinger and Heisenberg pictures are equivalent formulations of quantum mechanics, simulations performed choosing one over the other can greatly impact the computational resources required to solve a problem. Here we demonstrate that in Gaussian boson sampling, a central problem in quantum computing, a good choice of representation can shift the boundary between feasible and infeasible numerical simulability. To achieve this, we introduce a novel method for computing the probability distribution of boson sampling based on the time evolution of tensor networks in the Heisenberg picture. In addition, we overcome limitations of existing methods enabling simulations of realistic setups affected by non-uniform photon losses. Our results demonstrate the effectiveness of the method and its potential to advance quantum computing research.
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.
This book serves as an introductory yet thorough guide to tensor networks and their applications in quantum computation and quantum information, designed for advanced undergraduate and graduate-level readers. In Part I, foundational topics are covered, including tensor structures and network representations like Matrix Product States (MPS) and Tree Tensor Networks (TTN). These preliminaries provide readers with the core mathematical tools and concepts necessary for quantum physics and quantum computing applications, bridging the gap between multi-linear algebra and complex quantum systems. Part II explores practical applications of tensor networks in simulating quantum dynamics, with a particular focus on the efficiency they offer for systems of high computational complexity. Key topics include Hamiltonian dynamics, quantum annealing, open system dynamics, and optimization strategies using TN frameworks. A final chapter addresses the emerging role of “quantum magic” in tensor networks. It delves into non-stabilizer states and their contribution to quantum computational power beyond classical simulability, featuring methods such as stabilizer-enhanced MPS and the Clifford-dressed TDVP. In presenting tensor networks as tools for understanding quantum complexity, this book aims to foster a deeper collaboration between the many-body physics and quantum computing communities, inviting a broader audience to engage with these recent developments.
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.