Compactifying linear optical unitaries using multiport beamsplitters

• URL: http://arxiv.org/abs/2505.11371v1
• Date: Fri, 16 May 2025 15:34:37 GMT
• Title: Compactifying linear optical unitaries using multiport beamsplitters
• Authors: P. A. Ameen Yasir, Peter van Loock,
• Abstract summary: We show that any $N$-dimensional unitary matrix can be realized using a finite sequence of identical multiport beamsplitters.<n>As an application, we present a reconfigurable linear optical circuit that implements a three-dimensional unitary emerging in the unambiguous discrimination of two nonorthogonal qubit states.
• Score: 0.0
• License: http://creativecommons.org/licenses/by-nc-sa/4.0/
• Abstract: We show that any $N$-dimensional unitary matrix can be realized using a finite sequence of concatenated identical multiport beamsplitters. Our construction is based on a Lie group theorem and is explicitly demonstrated for the two- and three-dimensional cases. We further establish that the widely used Clements decomposition naturally arises as a special case of this general framework. As an application, we present a reconfigurable linear optical circuit that implements a three-dimensional unitary emerging in the unambiguous discrimination of two nonorthogonal qubit states.

Related papers

• Geometric constructions of generalized dual-unitary circuits from biunitarity [0.0]
  We show that a network of biunitary connections on the Kagome lattice naturally defines a multi-unitary circuit.<n>We introduce multilayer circuits with monoclinic symmetry and higher level hierarchical dual-unitary solvability.<n>Our work demonstrates how different classes of solvable models can be understood as arising from different geometric structures in spacetime.
  arXiv  Detail & Related papers  (2024-11-12T13:31:38Z)
• 1D self-similar fractals with centro-symmetric Jacobians: asymptotics and modular data [0.0]
  We establishs of growing one dimensional self-similar fractal graphs, they are networks that allow multiple edges weighted between nodes. An additional structure is endowed with the repeating units of centro-symmetric Jacobians in the adjacency of a linear graph creating a self-similar fractal.
  arXiv  Detail & Related papers  (2024-01-27T22:07:58Z)
• Detecting multipartite entanglement via complete orthogonal basis [4.421825850868445]
  We derive useful and operational criteria to detect genuine tripartite entanglement and multipartite entanglement. We study multipartite entanglement in arbitrary dimensional multipartite systems.
  arXiv  Detail & Related papers  (2023-10-10T08:54:16Z)
• Infeasibility of constructing a special orthogonal matrix for the deterministic remote preparation of arbitrary n-qubit state [2.3455770974978933]
  We present a complex-complexity algorithm to construct a special orthogonal matrix for the remote deterministic state preparation (DRSP) of an arbitrary n-qubit state. We use the proposed algorithm to confirm that the unique form does not have any solution when n>3, which means it is infeasible to construct such a special orthogonal matrix for the DRSP of an arbitrary n-qubit state.
  arXiv  Detail & Related papers  (2023-09-23T11:06:34Z)
• Permutationally invariant processes in arbitrary multiqudit systems [0.0]
  We establish the theoretical framework for an exact description of the open system dynamics of permutationally invariant (PI) states in arbitrary $N$-qudit systems. Thanks to Schur-Weyl duality powerful formalism, we identify an orthonormal operator basis in the PI operator subspace of the Liouville space onto which the master equation can be projected.
  arXiv  Detail & Related papers  (2023-07-12T12:45:21Z)
• Normalizing flows for lattice gauge theory in arbitrary space-time dimension [135.04925500053622]
  Applications of normalizing flows to the sampling of field configurations in lattice gauge theory have so far been explored almost exclusively in two space-time dimensions. We discuss masked autoregressive with tractable and unbiased Jacobian determinants, a key ingredient for scalable and exact flow-based sampling algorithms. For concreteness, results from a proof-of-principle application to SU(3) gauge theory in four space-time dimensions are reported.
  arXiv  Detail & Related papers  (2023-05-03T19:54:04Z)
• Third quantization of open quantum systems: new dissipative symmetries and connections to phase-space and Keldysh field theory formulations [77.34726150561087]
  We reformulate the technique of third quantization in a way that explicitly connects all three methods. We first show that our formulation reveals a fundamental dissipative symmetry present in all quadratic bosonic or fermionic Lindbladians. For bosons, we then show that the Wigner function and the characteristic function can be thought of as ''wavefunctions'' of the density matrix.
  arXiv  Detail & Related papers  (2023-02-27T18:56:40Z)
• 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)
• Multipartite spatial entanglement generated by concurrent nonlinear processes [91.3755431537592]
  Continuous variables multipartite entanglement is a key resource for quantum technologies. This work considers the multipartite entanglement generated in separated spatial modes of the same light beam by three different parametric sources.
  arXiv  Detail & Related papers  (2021-11-09T17:15:13Z)
• Bilinear Classes: A Structural Framework for Provable Generalization in RL [119.42509700822484]
  Bilinear Classes is a new structural framework which permits generalization in reinforcement learning. The framework incorporates nearly all existing models in which a sample complexity is achievable. Our main result provides an RL algorithm which has sample complexity for Bilinear Classes.
  arXiv  Detail & Related papers  (2021-03-19T16:34:20Z)
• Eigendecomposition-Free Training of Deep Networks for Linear Least-Square Problems [107.3868459697569]
  We introduce an eigendecomposition-free approach to training a deep network. We show that our approach is much more robust than explicit differentiation of the eigendecomposition. Our method has better convergence properties and yields state-of-the-art results.
  arXiv  Detail & Related papers  (2020-04-15T04:29:34Z)
• Matrix product operator representation of polynomial interactions [0.0]
  We provide an exact construction of interaction Hamiltonians on a one-dimensional lattice which grow as an exponential with the lattice site separation as a matrix product operator (MPO) Our results provide new insight into the correlation structure of many-body quantum operators, and may also be practical in simulations of many-body systems whose interactions are exponentially screened at large.
  arXiv  Detail & Related papers  (2020-01-14T04:15:32Z)

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.