English

Native QR Factorization on Programmable Photonic Meshes

Optics 2026-04-07 v2

Abstract

We propose a photonic native procedure for computing the QR factorization of a matrix using a programmable unitary interferometer mesh. The method configures the mesh through a sequence of local power routing steps within tunable two mode interferometric elements, while reading out the resulting upper triangular factor directly from the optical outputs. The number of physical operations grows as O(Nlog2N) O(N\log_2N) with matrix size NN, reducing the runtime relative to standard digital QR routines, which scale cubically (O(N3)O(N^3)). Beyond single factorizations, the same architecture supports iterative spectral computations by reusing the configured interferometer in a mirrored arrangement that implements the core update step of the QR eigenvalue algorithm. We also describe related optical procedures for Hessenberg reduction and bidiagonalization, serving as compatible preprocessors for QR and SVD workflows. A comparison with the systolic array computational architecture is provided. Our approach exhibits comparable asymptotic complexity for blocked QR decomposition and is more efficient for Hessenberg reduction and bidiagonalization.

Cite

@article{arxiv.2602.20701,
  title  = {Native QR Factorization on Programmable Photonic Meshes},
  author = {S. A. Fldzhyan and S. S. Straupe and M. Yu. Saygin},
  journal= {arXiv preprint arXiv:2602.20701},
  year   = {2026}
}

Comments

We have made substantial revisions to the manuscript. The asymptotic complexity is now improved by using a logarithmic tree concentrator. The basic self-configuring 2x2 block is now described more explicitly. Another addition is a new section that discusses the comparison with systolic arrays and describes blocked decomposition

R2 v1 2026-07-01T10:49:35.953Z