Reeshad Arian | Searcharxiv

arXiv2021

On Matrix Factorizations in Subspace Clustering

This article explores subspace clustering algorithms using CUR decompositions, and examines the effect of various hyperparameters in these algorithms on clustering performance on two real-world benchmark datasets, the Hopkins155 motion segmentation dataset and the Yale face dataset. Extensive experiments are done for a variety of sampling methods and oversampling parameters for these datasets, and some guidelines for parameter choices are given for practical applications.

cs.CV↗

arXiv2019

Wave Function Engineering for Spectrally-Uncorrelated Biphotons in the Telecommunication Band based on a Machine-Learning Framework

Indistinguishable single photons are key ingredient for a plethora of quantum information processing applications ranging from quantum communications to photonic quantum computing. A mainstream platform to produce indistinguishable single photons over a wide spectral range is based on biphoton generation through spontaneous parametric down-conversion (SPDC) in nonlinear crystals. The purity of the SPDC biphotons, however, is limited by their spectral correlations. Here, we present a design recipe, based on a machine-learning framework, for the engineering of biphoton joint spectrum amplitudes over a wide spectral range. By customizing the poling profile of the KTiOPO$_4$ (KTP) crystal, we show, numerically, that spectral purities of 99.22%, 99.99%, and 99.82% can be achieved, respectively, in the 1310-nm, 1550-nm, and 1600-nm bands after applying a moderate 8-nm filter. The machine-learning framework thus enables the generation of near-indistinguishable single photons over the entire telecommunication band without resorting to KTP crystal's group-velocity-matching wavelength window near 1582 nm.

quant-ph↗