SearcharxivSearch

arXiv subjects

Felix Mann

Publications and source records attributed to Felix Mann.

12 recordsLinked to original sources

Mid-IR hyperspectral imaging with undetected photons

Sensing with undetected photons has become a vibrant, application-driven research domain with a special focus on the mid-infrared (mid-IR) wavelength region. Since the mid-IR contains spectral bands with highly specific and strong molecular absorbance signatures, often referred to as fingerprints, a multitude of different samples and their compositions can be detected and quantified spectroscopically. Enhancing this inherently sample alteration-free spectroscopic method with imaging capabilities leads to a powerful technique for environmental monitoring and biomedical applications that enables automated diagnostics while omitting time-consuming and non-reversible labeling steps. To evade the shortcomings of state-of-the-art instruments for mid-IR hyperspectral microscopy related to cost, complexity, power-consumption, and performance, which are associated with technological challenges for mid-IR cameras and low-noise and broadband mid-IR sources, here, we construct a proof-of-concept nonlinear interferometer in a wide-field imaging arrangement combined with high-resolution spectral acquisition by pixelwise quantum Fourier transform infrared spectroscopy. For the broadband range of 2300-3100 cm$^{-1}$, covering the important CH-stretch band, we perform hyperspectral imaging that simultaneously resolves 3500 spatial modes, each with a spectral resolution of 10 cm$^{-1}$ leveraging in total around 10$^5$ spatio-spectrally entangled photon modes. Our image acquisition uses a commercial, megapixel sCMOS camera, while a medium-power and compact c.w. pump laser is the only necessary light source.

physics.optics

Hong-Ou-Mandel effect with two frequency-entangled photons of vastly different color

In the original formulation of the Hong-Ou-Mandel (HOM) experiment, when two otherwise indistinguishable photons are incident upon the two input ports of a balanced beam splitter, they coalesce, always leaving via the same output port. It is often interpreted that this interference arises due to the indistinguishability of the single photons at the beam splitter; the situation, however, is often more nuanced. Here, we demonstrate an analog of HOM interference between two photons of completely different color. To do so, we utilize a quantum frequency converter based on sum- and difference-frequency generation as an `active' beam splitter -- coupling frequency-entangled red and telecom single photons with an octave-spanning energy difference of 282 THz. We achieve an uncorrected two-photon interference visibility beyond 90%. This work presents the first demonstration of HOM interference between two single photons of distinctly different color, deepening our understanding of what underlies quantum interference. It also suggests a novel approach to interfacing photonic qubits in heterogeneous quantum systems where frequency conversion and quantum interference are unified.

quant-ph

Noise analysis of a quasi-phase-matched quantum frequency converter and higher-order counter-propagating SPDC

Quantum frequency conversion (QFC) will be an indispensable ingredient in future quantum technologies. For example, large-scale fibre-based quantum networks will require QFC to interconnect heterogeneous building blocks like emitters, channels, memories and detectors. The performance of existing QFC devices - typically realised in periodically-poled nonlinear crystals - is often severely limited by parasitic noise that arises when the pump wavelength lies between the inter-converted wavelengths. Here we comprehensively investigate the noise spectrum of a QFC device pumped by a CW 1064 nm laser. The converter was realised as a bulk periodically-poled potassium titanyl phosphate (ppKTP) crystal quasi-phase-matched for conversion between 637 nm and 1587 nm, which was also polished and coated to resonantly enhance the pump field by a factor of 50. While Raman scattering dominates the noise background from 1140 nm to 1330 nm, at larger energy shifts (beyond 60 THz), parasitic spontaneous parametric down-conversion (SPDC) is the strongest noise source. Further, the noise spectrum was contaminated by a regular succession of narrow-band peaks, which we attribute to a heretofore unidentified higher-order counter-propagating SPDC processes - with quasi-phase-matching orders up to 44 evident in our measurements. This work provides a comprehensive overview of the limiting noise sources in QFC devices that use quasi-phase-matched crystals and will prove an invaluable resource in guiding their future development.

quant-ph

Telecom-Band SPDC in AlGaAs-on-Insulator Waveguides

Widespread commercial adoption of telecom-band quantum-key-distribution (QKD) will require fully integrated, room-temperature transmitters. Implementing highly efficient spontaneous parametric down-conversion (SPDC) on a platform that offers co-integration of the pump laser has been an outstanding challenge. Here, using such a platform based on AlGaAs-on-insulator waveguides, we report telecom-band SPDC (and second harmonic generation) with exceedingly large efficiencies of 26 GHz generated pairs/mW over a 7 THz bandwidth, which would saturate the usable photon-flux for a 70-channel wavelength-multiplexed QKD-system at merely 1.6 mW of pump laser power.

quant-ph

Low-noise quantum frequency conversion in a monolithic cavity with bulk periodically poled potassium titanyl phosphate

Interfacing the different building blocks of a future large scale quantum network will demand efficient and noiseless frequency conversion of quantum light. Nitrogen-vacancy (NV) centers in diamond are a leading candidate to form the nodes of such a network. However, the performance of a suitable converter remains a bottleneck, with existing demonstrations severely limited by parasitic noise arising at the target telecom wavelength. Here, we demonstrate a new platform for efficient low-noise quantum frequency conversion based on a monolithic bulk ppKTP cavity and show its suitability for the conversion of 637 nm single photons from NV centers in diamond to telecommunication wavelengths. By resonantly enhancing the power of an off-the-shelf pump laser, we achieve an internal conversion efficiency of $(72.3\pm 0.4)\%$ while generating only $(110\pm 4) \mbox{ kHz/nm}$ noise at the target wavelength without the need for any active stabilization. This constitutes a 5-fold improvement in noise over existing state-of-the-art single-step converters at this wavelengths. We verify the almost ideal preservation of non-classical correlations by converting photons from a spontaneous parametric down-conversion source and moreover show the preservation of time-energy entanglement via Franson interferometry.

quant-ph

Reducing Graph Parameters by Contractions and Deletions

We consider the following problem: for a given graph $G$ and two integers $k$ and $d$, can we apply a fixed graph operation at most $k$ times in order to reduce a given graph parameter $\pi$ by at least $d$? We show that this problem is NP-hard when the parameter is the independence number and the graph operation is vertex deletion or edge contraction, even for fixed $d=1$ and when restricted to chordal graphs. We give a polynomial time algorithm for bipartite graphs when the operation is edge contraction, the parameter is the independence number and $d$ is fixed. Further, we complete the complexity dichotomy on $H$-free graphs when the parameter is the clique number and the operation is edge contraction by showing that this problem is NP-hard in $(C_3+P_1)$-free graphs even for fixed $d=1$. When the operation is edge deletion and the parameter is the chromatic number, we determine the computational complexity of the associated problem on cographs and complete multipartite graphs. Our results answer several open questions stated in [Diner et al., Theoretical Computer Science, 746, p. 49-72 (2012)].

math.CO

On $d$-stable locally checkable problems parameterized by mim-width

In this paper we continue the study of locally checkable problems under the framework introduced by Bonomo-Braberman and Gonzalez in 2020, by focusing on graphs of bounded mim-width. We study which restrictions on a locally checkable problem are necessary in order to be able to solve it efficiently on graphs of bounded mim-width. To this end, we introduce the concept of $d$-stability of a check function. The related locally checkable problems contain large classes of problems, among which we can mention, for example, LCVP problems. We give an algorithm showing that these problems are XP when parameterized by the mim-width of a given binary decomposition tree of the input graph, that is, that they can be solved in polynomial time given a binary decomposition tree of bounded mim-width. We explore the relation between $d$-stable locally checkable problems and the recently introduced DN logic (Bergougnoux, Dreier and Jaffke, 2022), and show that both frameworks model the same family of problems. We include a list of concrete examples of $d$-stable locally checkable problems whose complexity on graphs of bounded mim-width was open so far.

cs.DM

Using Edge Contractions and Vertex Deletions to Reduce the Independence Number and the Clique Number

We consider the following problem: for a given graph G and two integers k and d, can we apply a fixed graph operation at most k times in order to reduce a given graph parameter $\pi$ by at least d? We show that this problem is NP-hard when the parameter is the independence number and the graph operation is vertex deletion or edge contraction, even for fixed d=1 and when restricted to chordal graphs. We also give a polynomial time algorithm for bipartite graphs when the operation is edge contraction, the parameter is the independence number and d is fixed. Further, we complete the complexity dichotomy on H-free graphs when the parameter is the clique number and the operation is edge contraction by showing that this problem is NP-hard in ($C_3+P_1$)-free graphs even for fixed d=1. Our results answer several open questions stated in [Diner et al., Theoretical Computer Science, 746, p. 49-72 (2012)].

math.CO

Using edge contractions to reduce the semitotal domination number

In this paper, we consider the problem of reducing the semitotal domination number of a given graph by contracting $k$ edges, for some fixed $k \geq 1$. We show that this can always be done with at most 3 edge contractions and further characterise those graphs requiring 1, 2 or 3 edge contractions, respectively, to decrease their semitotal domination number. We then study the complexity of the problem for $k=1$ and obtain in particular a complete complexity dichotomy for monogenic classes.

math.CO

Low random duty-cycle errors in periodically-poled KTP revealed by sum-frequency generation

Low-noise quantum frequency conversion in periodically-poled nonlinear crystals has proved challenging when the pump wavelength is shorter than the target wavelength. This is - at least in large part - a consequence of the parasitic spontaneous parametric down-conversion of pump photons, whose efficiency is increased by fabrication errors in the periodic poling. Here we characterise the poling quality of commercial periodically-poled bulk potassium titanyl phosphate (ppKTP) by measuring the sum-frequency generation (SFG) efficiency over a large phase mismatch range from 0 to more than 400$\pi$. Over the probed range the SFG efficiency behaves nearly ideally and drops to a normalised efficiency of $10^{-6}$. Our results demonstrate that any background pedestal which would be formed by random duty cycle errors in ppKTP is substantially reduced when compared to periodically poled lithium niobate. The standard deviation of the random duty cycle errors can be estimated to be smaller than 2% of the domain length. From this, we expect a noise spectral density which is at least one order of magnitude smaller than that of current state-of-the-art single-step frequency converters.

quant-ph

Reducing the domination number of $P_3+kP_2$-free graphs via one edge contraction

In this note, we consider the following problem: given a connected graph $G$, can we reduce the domination number of $G$ by using only one edge contraction? We show that the problem is polynomial-time solvable on $P_3+kP_2$-free graphs for any $k \geq 0$ which combined with results of [1,2] leads to a complexity dichotomy of the problem on $H$-free graphs.

math.CO

Blocking total dominating sets via edge contractions

In this paper, we study the problem of deciding whether the total domination number of a given graph $G$ can be reduced using exactly one edge contraction (called 1-Edge Contraction($γ_t$)). We focus on several graph classes and determine the computational complexity of this problem. By putting together these results, we manage to obtain a complete dichotomy for $H$-free graphs.

cs.DM