Operator-basis Matrix Product State formalism for optical circuits

• URL: http://arxiv.org/abs/2502.01737v1
• Date: Mon, 03 Feb 2025 19:00:02 GMT
• Title: Operator-basis Matrix Product State formalism for optical circuits
• Authors: Dario Cilluffo, Matthias Kost, Nicola Lorenzoni, Martin B. Plenio,
• Abstract summary: We present an alternative tensor network framework, the operator-basis Matrix Product State (MPS) MPS exploits the input-output relations of quantum optical circuits encoded in the unitary interferometer matrix. We exploit the flexibility of tensor networks to extend our formalism to incorporate partial distinguishability and photon loss.
• Score: 0.7499722271664147
• License:
• 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, the operator-basis Matrix Product State (MPS), which 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 MPS 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.

Related papers

• Efficient Learning for Linear Properties of Bounded-Gate Quantum Circuits [63.733312560668274]
  Given a quantum circuit containing d tunable RZ gates and G-d Clifford gates, can a learner perform purely classical inference to efficiently predict its linear properties? We prove that the sample complexity scaling linearly in d is necessary and sufficient to achieve a small prediction error, while the corresponding computational complexity may scale exponentially in d. We devise a kernel-based learning model capable of trading off prediction error and computational complexity, transitioning from exponential to scaling in many practical settings.
  arXiv  Detail & Related papers  (2024-08-22T08:21:28Z)
• Emulating quantum computing with optical matrix multiplication [0.0]
  Optical computing harnesses the speed of light to perform vector-matrix operations efficiently. We formulate the process of photonic matrix multiplication using quantum mechanical principles. We demonstrate a well known algorithm, namely the Deutsch-Jozsa's algorithm.
  arXiv  Detail & Related papers  (2024-07-19T10:11:06Z)
• Unified framework for efficiently computable quantum circuits [0.0]
  Quantum circuits consisting of Clifford and matchgates are two classes of circuits that are known to be efficiently simulatable on a classical computer. We introduce a unified framework that shows in a transparent way the special structure that allows these circuits can be efficiently simulatable.
  arXiv  Detail & Related papers  (2024-01-16T08:04:28Z)
• Quantum tensor network algorithms for evaluation of spectral functions on quantum computers [0.0]
  We investigate quantum algorithms derived from tensor networks to simulate the static and dynamic properties of quantum many-body systems. We demonstrate algorithms to prepare ground and excited states on a quantum computer and apply them to molecular nanomagnets (MNMs) as a paradigmatic example.
  arXiv  Detail & Related papers  (2023-09-26T18:01:42Z)
• A hybrid quantum-classical algorithm for multichannel quantum scattering of atoms and molecules [62.997667081978825]
  We propose a hybrid quantum-classical algorithm for solving the Schr"odinger equation for atomic and molecular collisions. The algorithm is based on the $S$-matrix version of the Kohn variational principle, which computes the fundamental scattering $S$-matrix. We show how the algorithm could be scaled up to simulate collisions of large polyatomic molecules.
  arXiv  Detail & Related papers  (2023-04-12T18:10:47Z)
• Order-invariant two-photon quantum correlations in PT-symmetric interferometers [62.997667081978825]
  Multiphoton correlations in linear photonic quantum networks are governed by matrix permanents. We show that the overall multiphoton behavior of a network from its individual building blocks typically defies intuition. Our results underline new ways in which quantum correlations may be preserved in counterintuitive ways even in small-scale non-Hermitian networks.
  arXiv  Detail & Related papers  (2023-02-23T09:43:49Z)
• Tensor-network-assisted variational quantum algorithm [3.5995214208007944]
  We present a framework for tensor-network-assisted variational quantum algorithms. We show that our approach consistently outperforms conventional methods using shallow quantum circuits.
  arXiv  Detail & Related papers  (2022-12-20T16:59:54Z)
• Low-rank tensor decompositions of quantum circuits [14.531461873576449]
  We show how MPOs can be used to express certain quantum states, quantum gates, and entire quantum circuits as low-rank tensors. This enables the analysis and simulation of complex quantum circuits on classical computers.
  arXiv  Detail & Related papers  (2022-05-19T22:09:15Z)
• Numerical Simulations of Noisy Quantum Circuits for Computational Chemistry [51.827942608832025]
  Near-term quantum computers can calculate the ground-state properties of small molecules. We show how the structure of the computational ansatz as well as the errors induced by device noise affect the calculation.
  arXiv  Detail & Related papers  (2021-12-31T16:33:10Z)
• Quantum-Classical Hybrid Algorithm for the Simulation of All-Electron Correlation [58.720142291102135]
  We present a novel hybrid-classical algorithm that computes a molecule's all-electron energy and properties on the classical computer. We demonstrate the ability of the quantum-classical hybrid algorithms to achieve chemically relevant results and accuracy on currently available quantum computers.
  arXiv  Detail & Related papers  (2021-06-22T18:00:00Z)
• Rapid characterisation of linear-optical networks via PhaseLift [51.03305009278831]
  Integrated photonics offers great phase-stability and can rely on the large scale manufacturability provided by the semiconductor industry. New devices, based on such optical circuits, hold the promise of faster and energy-efficient computations in machine learning applications. We present a novel technique to reconstruct the transfer matrix of linear optical networks.
  arXiv  Detail & Related papers  (2020-10-01T16:04:22Z)

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.