arXiv subjects

K. K. Sabapathy

Publications and source records attributed to K. K. Sabapathy.

3 recordsLinked to original sources

arXiv2021

Quantum circuits with many photons on a programmable nanophotonic chip

Growing interest in quantum computing for practical applications has led to a surge in the availability of programmable machines for executing quantum algorithms. Present day photonic quantum computers have been limited either to non-deterministic operation, low photon numbers and rates, or fixed random gate sequences. Here we introduce a full-stack hardware-software system for executing many-photon quantum circuits using integrated nanophotonics: a programmable chip, operating at room temperature and interfaced with a fully automated control system. It enables remote users to execute quantum algorithms requiring up to eight modes of strongly squeezed vacuum initialized as two-mode squeezed states in single temporal modes, a fully general and programmable four-mode interferometer, and genuine photon number-resolving readout on all outputs. Multi-photon detection events with photon numbers and rates exceeding any previous quantum optical demonstration on a programmable device are made possible by strong squeezing and high sampling rates. We verify the non-classicality of the device output, and use the platform to carry out proof-of-principle demonstrations of three quantum algorithms: Gaussian boson sampling, molecular vibronic spectra, and graph similarity.

quant-ph↗

arXiv2019

Simulating realistic non-Gaussian state preparation

We consider conditional photonic non-Gaussian state preparation using multimode Gaussian states and photon-number-resolving detectors in the presence of photon loss. While simulation of such state preparation is often computationally challenging, we show that obtaining the required multimode Gaussian state Fock matrix elements can be reduced to the computation of matrix functions known as loop hafnians, and develop a tailored algorithm for their calculation that is faster than previously known methods. As an example of its utility, we use our algorithm to explore the loss parameter space for three specific non-Gaussian state preparation schemes: Fock state heralding, cat state heralding, and weak cubic-phase state heralding. We confirm that these schemes are fragile with respect to photon loss, yet find that there are regions in the loss parameter space that are potentially accessible in an experimental setting which correspond to heralded states with non-zero non-Gaussianity.

quant-ph↗

arXiv2018

Divergence-free approach for obtaining decompositions of quantum-optical processes

Operator-sum representations of quantum channels can be obtained by applying the channel to one subsystem of a maximally entangled state and deploying the channel-state isomorphism. However, for continuous-variable systems, such schemes contain natural divergences since the maximally entangled state is ill-defined. We introduce a method that avoids such divergences by utilizing finitely entangled (squeezed) states and then taking the limit of arbitrary large squeezing. Using this method we derive an operator-sum representation for all single-mode bosonic Gaussian channels where a unique feature is that both quantum-limited and noisy channels are treated on an equal footing. This technique facilitates a proof that the rank-one Kraus decomposition for Gaussian channels at its respective entanglement-breaking thresholds, obtained in the overcomplete coherent state basis, is unique. The methods could have applications to simulation of continuous-variable channels.

quant-ph↗