Functional matrix product state simulation of continuous variable quantum circuits

• URL: http://arxiv.org/abs/2504.05860v1
• Date: Tue, 08 Apr 2025 09:37:19 GMT
• Title: Functional matrix product state simulation of continuous variable quantum circuits
• Authors: Andreas Bock Michelsen, Frederik K. Marqversen, Michael Kastoryano,
• Abstract summary: We introduce a functional matrix product state (FMPS) based method for simulating the real-space representation of continuous-variable (CV) quantum computation.<n>This approach efficiently simulates non-Gaussian CV systems by leveraging their functional form.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• 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.

Related papers

• PolyQROM: Orthogonal-Polynomial-Based Quantum Reduced-Order Model for Flow Field Analysis [5.588958112139646]
  Quantum computing promises exponential acceleration for fluid flow simulations. measurement overhead required to extract flow features from quantum-encoded flow field data undermines this advantage.
  arXiv  Detail & Related papers  (2025-04-30T12:14:08Z)
• Practical Application of the Quantum Carleman Lattice Boltzmann Method in Industrial CFD Simulations [44.99833362998488]
  This work presents a practical numerical assessment of a hybrid quantum-classical approach to CFD based on the Lattice Boltzmann Method (LBM) We evaluate this method on three benchmark cases featuring different boundary conditions, periodic, bounceback, and moving wall. Our results confirm the validity of the approach, achieving median error fidelities on the order of $10-3$ and success probabilities sufficient for practical quantum state sampling.
  arXiv  Detail & Related papers  (2025-04-17T15:41:48Z)
• Efficient Transformed Gaussian Process State-Space Models for Non-Stationary High-Dimensional Dynamical Systems [49.819436680336786]
  Gaussian process state-space models (GPSSMs) have emerged as a powerful framework for modeling dynamical systems.<n>We propose an efficient transformed Gaussian process state-space model (ETGPSSM) to address these limitations.<n>Our approach leverages a single shared Gaussian process (GP) combined with normalizing flows and Bayesian neural networks, enabling efficient modeling of complex, high-dimensional state transitions.
  arXiv  Detail & Related papers  (2025-03-24T03:19:45Z)
• Entanglement scaling in matrix product state representation of smooth functions and their shallow quantum circuit approximations [0.28917933888634956]
  matrix product state (MPS) methods emerged as the most promising approach for constructing shallow quantum circuits. We derive rigorous expansions for the decay of entanglement across bonds in the MPS representation depending on the smoothness of the input function. We construct an improved MPS-based algorithm yielding shallow and accurate encoding quantum circuits.
  arXiv  Detail & Related papers  (2024-12-06T17:31:35Z)
• Quantum noise modeling through Reinforcement Learning [38.47830254923108]
  We introduce a machine learning approach to characterize the noise impacting a quantum chip and emulate it during simulations.<n>Our algorithm leverages reinforcement learning, offering increased flexibility in reproducing various noise models.<n>The effectiveness of the RL agent has been validated through simulations and testing on real superconducting qubits.
  arXiv  Detail & Related papers  (2024-08-02T18:05:21Z)
• Evaluation of phase shifts for non-relativistic elastic scattering using quantum computers [39.58317527488534]
  This work reports the development of an algorithm that makes it possible to obtain phase shifts for generic non-relativistic elastic scattering processes on a quantum computer.
  arXiv  Detail & Related papers  (2024-07-04T21:11:05Z)
• Compact quantum algorithms for time-dependent differential equations [0.0]
  We build on an idea based on linear combination of unitaries to simulate non-unitary, non-Hermitian quantum systems.<n>We generate hybrid quantum-classical algorithms that efficiently perform matrix-vector multiplication and matrix inversion operations.
  arXiv  Detail & Related papers  (2024-05-16T02:14:58Z)
• Improved real-space parallelizable matrix-product state compression and its application to unitary quantum dynamics simulation [0.0]
  We introduce an improved real-space parallelizable matrix-product state (MPS) compression method. We apply this method to simulate unitary quantum dynamics and introduce an improved parallel time-evolving block-decimation algorithm. The obtained numerical results unequivocally demonstrate that the improved pTEBD algorithm achieves the same level of simulation precision as the current state-of-the-art MPS algorithm.
  arXiv  Detail & Related papers  (2023-12-05T11:14:48Z)
• Real-time error mitigation for variational optimization on quantum hardware [45.935798913942904]
  We define a Real Time Quantum Error Mitigation (RTQEM) algorithm to assist in fitting functions on quantum chips with VQCs. Our RTQEM routine can enhance VQCs' trainability by reducing the corruption of the loss function.
  arXiv  Detail & Related papers  (2023-11-09T19:00:01Z)
• Importance sampling for stochastic quantum simulations [68.8204255655161]
  We introduce the qDrift protocol, which builds random product formulas by sampling from the Hamiltonian according to the coefficients. We show that the simulation cost can be reduced while achieving the same accuracy, by considering the individual simulation cost during the sampling stage. Results are confirmed by numerical simulations performed on a lattice nuclear effective field theory.
  arXiv  Detail & Related papers  (2022-12-12T15:06:32Z)
• Continuous-time dynamics and error scaling of noisy highly-entangling quantum circuits [58.720142291102135]
  We simulate a noisy quantum Fourier transform processor with up to 21 qubits. We take into account microscopic dissipative processes rather than relying on digital error models. We show that depending on the dissipative mechanisms at play, the choice of input state has a strong impact on the performance of the quantum algorithm.
  arXiv  Detail & Related papers  (2021-02-08T14:55:44Z)
• Randomizing multi-product formulas for Hamiltonian simulation [2.2049183478692584]
  We introduce a scheme for quantum simulation that unites the advantages of randomized compiling on the one hand and higher-order multi-product formulas on the other. Our framework reduces the circuit depth by circumventing the need for oblivious amplitude amplification. Our algorithms achieve a simulation error that shrinks exponentially with the circuit depth.
  arXiv  Detail & Related papers  (2021-01-19T19:00:23Z)
• Efficient classical simulation of random shallow 2D quantum circuits [104.50546079040298]
  Random quantum circuits are commonly viewed as hard to simulate classically. We show that approximate simulation of typical instances is almost as hard as exact simulation. We also conjecture that sufficiently shallow random circuits are efficiently simulable more generally.
  arXiv  Detail & Related papers  (2019-12-31T19:00:00Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.