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

Functional matrix product state simulation of continuous variable quantum circuits

Andreas Bock Michelsen, Frederik K. Marqversen, Michael J. Kastoryano

Published Apr 8, 2025• 5 citations
arXivHTMLPDF

Abstract

We introduce a functional matrix product state (FMPS) based method for simulating the real-space representation of continuous-variable (CV) quantum computation. This approach efficiently simulates non-Gaussian CV systems by leveraging their functional form. By addressing scaling bottlenecks, FMPS enables more efficient simulation of shallow, multi-mode CV quantum circuits with non-Gaussian input states. The method is validated by simulating random shallow and cascaded circuits with highly non-Gaussian input states, showing superior performance compared to existing techniques, also in the presence of loss.

DOI
10.48550/arxiv.2504.05860

Related papers

Simulation of Continuous-Variable Quantum Systems with Tensor Network

Ryutaro Nagai, Takao Tomono, Yuichiro Minato

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.

IEEE International Conference on Quantum Computing and Engineering (QCE)•Oct 1, 2021•3 citations

Efficient Simulation of Hybrid Continuous- and Discrete-Variable Quantum Circuits via Gaussian Decompositions

Kazufumi Tanji, Dot Belin Pio, Shohei Kiryu +2 more

Hybrid quantum systems combining discrete-variable (DV) and continuous-variable (CV) subsystems arise across a broad range of physical platforms and enable quantum information processing beyond purely qubit-based designs. Their classical simulation, however, is challenging since computational costs of both CV and DV systems exponentially increase. In this paper, we introduce a simulation framework for CV--DV hybrid systems based on linear combination of Gaussian (LCoG) decomposition. We decompose the hybrid density matrix into blocks in a DV basis and represent each block as an LCoG expansion. Within the representation, Gaussian operations on the bosonic subsystem independently act on each Gaussian function. We derive analytic formulas describing how complex Gaussian functions transform under controlled Gaussian operations. We further extend the framework to controlled Gaussian channels with state-dependent Gaussian noise. The method avoids a Fock-space truncation for the CV subsystem, and the cost of updating each Gaussian term scales polynomially with the number of modes. The framework provides a general computational tool for analyzing hybrid quantum algorithms, quantum simulation protocols, and non-Gaussian state generation schemes. As an example, we simulate Gottesman--Kitaev--Preskill (GKP) state generation based on a cavity-QED system.

quant-pharXiv:2609.34793•Sep 29, 2026•0 citations

Quantum Circuit Fragments and Link Products in Continuous Variables

Amalina Lai, Graeme D. Berk, Minjeong Song +1 more

Quantum circuits are often drawn as complete processes, with fixed inputs and outputs. In many quantum-information tasks, however, the natural object is only a fragment of such a circuit: an unknown source of non-Markovian noise to be probed, a subroutine to be inserted into a larger algorithm, or an agent implementing an adaptive strategy. In finite dimensions, the link product provides a systematic means to analyze how such circuit fragments interact and compose. Here, we develop the corresponding framework for continuous-variable systems. We introduce continuous-variable circuit fragments and associated link products that stitch such fragments together into larger processes. We show that the formalism simplifies substantially in the Gaussian regime, where link products can be evaluated efficiently using covariance-matrix representations. We use the formalism to construct non-Markovian processes and adaptive agent-environment interactions from modular components. This extends the quantum-comb toolkit to continuous variables, providing systematic methods for adaptive sensing, non-Markovian noise mitigation, and higher-order quantum circuit design.

quant-pharXiv:2607.21215•Jul 24, 2026•0 citations

Entanglement scaling in matrix product state representation of smooth functions and their shallow quantum circuit approximations

Vladyslav Bohun, I. V. Lukin, Mykola Luhanko +4 more

Encoding classical data in a quantum state is a key prerequisite of many quantum algorithms. Recently, matrix product state (MPS) methods emerged as the most promising approach for constructing shallow quantum circuits approximating input functions, including probability distributions, with only linear number of gates. We derive rigorous asymptotic expansions for the decay of entanglement across bonds in the MPS representation depending on the smoothness of the input function, real or complex. We also consider the dependence of the entanglement on localization properties and function support. Based on these analytical results, we construct an improved MPS-based algorithm yielding shallow and accurate encoding quantum circuits. By using tensor cross interpolation, we are able to construct utility-scale quantum circuits in a compute- and memory-efficient way. We validate our methods by loading heavy-tailed distributions, including Lévy, important in finance, but they apply to any smooth function inputs. We test the performance of the resulting quantum circuits by executing and sampling from them on IBM quantum devices, for up to 156 qubits.

arXiv:2412.05202•Physical Review Research•Mar 2, 2026•13 citations

Classical simulation of Gaussian quantum circuits with non-Gaussian input states

Ulysse Chabaud, Giulia Ferrini, Frédéric Grosshans +1 more

We consider Gaussian quantum circuits supplemented with non-Gaussian input states and derive sufficient conditions for efficient classical strong simulation of these circuits. In particular, we generalise the stellar representation of continuous-variable quantum states to the multimode setting and relate the stellar rank of the input non-Gaussian states, a recently introduced measure of non-Gaussianity, to the cost of evaluating classically the output probability densities of these circuits. Our results have consequences for the strong simulability of a large class of near-term continuous-variable quantum circuits.

arXiv:2010.14363•Physical Review Research•Jul 6, 2021•47 citations

Fast simulations of continuous-variable circuits using the coherent state decomposition

Olga Solodovnikova, Ulrik L. Andersen, Jonas Schou Neergaard-Nielsen

We present \texttt{lcg\_plus}, an open-source Python library for the simulation of continuous-variable quantum circuits with both generaldyne and photon-number-resolving detector capabilities. Our framework merges the linear combination of Gaussians methodology with the coherent state decomposition of arbitrary non-Gaussian states, forming a bridge between the Gaussian and Fock basis representations. By tracking the Wigner function, we can simulate the action of Gaussian channels and measurements on multi-mode systems in a fast and accurate numerical framework. The calculation of the quality measures of quantum states is convenient in this formalism, and we derive expressions for the analytical gradients of these measures with respect to parameterized circuit elements. We demonstrate the utility of this methodology by optimizing the heralded preparation of a qunaught state, a crucial component for building a fault-tolerant photonic quantum computer, with a Gaussian Boson sampling circuit containing inefficient components.

arXiv:2508.06175•Aug 8, 2025•4 citations
We introduce a functional matrix product state (FMPS) based method for simulating the real-space representation of continuous-variable (CV) quantum computation. This approach efficiently simulates non-Gaussian CV systems by leveraging their functional form. By addressing scaling bottlenecks, FMPS enables more efficient simulation of shallow, multi-mode CV quantum circuits with non-Gaussian input states. The method is validated by simulating random shallow and cascaded circuits with highly non-Gaussian input states, showing superior performance compared to existing techniques, also in the presence of loss.
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.
Hybrid quantum systems combining discrete-variable (DV) and continuous-variable (CV) subsystems arise across a broad range of physical platforms and enable quantum information processing beyond purely qubit-based designs. Their classical simulation, however, is challenging since computational costs of both CV and DV systems exponentially increase. In this paper, we introduce a simulation framework for CV--DV hybrid systems based on linear combination of Gaussian (LCoG) decomposition. We decompose the hybrid density matrix into blocks in a DV basis and represent each block as an LCoG expansion. Within the representation, Gaussian operations on the bosonic subsystem independently act on each Gaussian function. We derive analytic formulas describing how complex Gaussian functions transform under controlled Gaussian operations. We further extend the framework to controlled Gaussian channels with state-dependent Gaussian noise. The method avoids a Fock-space truncation for the CV subsystem, and the cost of updating each Gaussian term scales polynomially with the number of modes. The framework provides a general computational tool for analyzing hybrid quantum algorithms, quantum simulation protocols, and non-Gaussian state generation schemes. As an example, we simulate Gottesman--Kitaev--Preskill (GKP) state generation based on a cavity-QED system.
Quantum circuits are often drawn as complete processes, with fixed inputs and outputs. In many quantum-information tasks, however, the natural object is only a fragment of such a circuit: an unknown source of non-Markovian noise to be probed, a subroutine to be inserted into a larger algorithm, or an agent implementing an adaptive strategy. In finite dimensions, the link product provides a systematic means to analyze how such circuit fragments interact and compose. Here, we develop the corresponding framework for continuous-variable systems. We introduce continuous-variable circuit fragments and associated link products that stitch such fragments together into larger processes. We show that the formalism simplifies substantially in the Gaussian regime, where link products can be evaluated efficiently using covariance-matrix representations. We use the formalism to construct non-Markovian processes and adaptive agent-environment interactions from modular components. This extends the quantum-comb toolkit to continuous variables, providing systematic methods for adaptive sensing, non-Markovian noise mitigation, and higher-order quantum circuit design.
Encoding classical data in a quantum state is a key prerequisite of many quantum algorithms. Recently, matrix product state (MPS) methods emerged as the most promising approach for constructing shallow quantum circuits approximating input functions, including probability distributions, with only linear number of gates. We derive rigorous asymptotic expansions for the decay of entanglement across bonds in the MPS representation depending on the smoothness of the input function, real or complex. We also consider the dependence of the entanglement on localization properties and function support. Based on these analytical results, we construct an improved MPS-based algorithm yielding shallow and accurate encoding quantum circuits. By using tensor cross interpolation, we are able to construct utility-scale quantum circuits in a compute- and memory-efficient way. We validate our methods by loading heavy-tailed distributions, including Lévy, important in finance, but they apply to any smooth function inputs. We test the performance of the resulting quantum circuits by executing and sampling from them on IBM quantum devices, for up to 156 qubits.
We consider Gaussian quantum circuits supplemented with non-Gaussian input states and derive sufficient conditions for efficient classical strong simulation of these circuits. In particular, we generalise the stellar representation of continuous-variable quantum states to the multimode setting and relate the stellar rank of the input non-Gaussian states, a recently introduced measure of non-Gaussianity, to the cost of evaluating classically the output probability densities of these circuits. Our results have consequences for the strong simulability of a large class of near-term continuous-variable quantum circuits.
We present \texttt{lcg\_plus}, an open-source Python library for the simulation of continuous-variable quantum circuits with both generaldyne and photon-number-resolving detector capabilities. Our framework merges the linear combination of Gaussians methodology with the coherent state decomposition of arbitrary non-Gaussian states, forming a bridge between the Gaussian and Fock basis representations. By tracking the Wigner function, we can simulate the action of Gaussian channels and measurements on multi-mode systems in a fast and accurate numerical framework. The calculation of the quality measures of quantum states is convenient in this formalism, and we derive expressions for the analytical gradients of these measures with respect to parameterized circuit elements. We demonstrate the utility of this methodology by optimizing the heralded preparation of a qunaught state, a crucial component for building a fault-tolerant photonic quantum computer, with a Gaussian Boson sampling circuit containing inefficient components.