Functional matrix product state simulation of continuous variable quantum circuits

2025/04/08 by Andreas Bock Michelsen, Michelsen, Andreas Bock, Frederik K. Marqversen +3 · 3 citations
Computer Science · #FOS: Physical sciences #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum Physics (quant-ph) #Quantum-Dot Cellular Automata

paper · pdf · doi:10.48550/arxiv.2504.05860

openalex publication_date 2025/04/08 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

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.

Cited by

• Fast simulations of continuous-variable circuits using the coherent state decomposition
• Impact of finite squeezing on near-term quantum computations using GKP qubits
• Gaussian-augmented bosonic matrix-product states: theory and applications

Related

• Circuit Knitting for Continuous-Variable Quantum States
• Low-rank tensor decompositions of quantum circuits
• Efficient Quantum Circuits for Accurate State Preparation of Smooth, Differentiable Functions
• Fast simulations of continuous-variable circuits using the coherent state decomposition
• An Implementation of the Quantum Verification of Matrix Products Algorithm