SearcharxivSearch

arXiv subjects

R. D. Morozov

Publications and source records attributed to R. D. Morozov.

3 recordsLinked to original sources

Explicit Quantum Search Algorithm for the Densest k-Subgraph Problem

This paper addresses the problem of finding the densest $k$-vertex subgraph in an arbitrary graph. This problem is NP-hard and has important applications in social network analysis, fraud detection, recommendation systems, and bioinformatics. We propose two quantum approaches to solve this problem: reduction to Quadratic Unconstrained Binary Optimization (QUBO) and using Grover's quantum search algorithm. For the latter approach, we present an explicit gate-based oracle circuit utilizing Dicke states and Quantum Fourier Transform for edge counting. Numerical simulations demonstrate a quadratic speedup over classical Brute-force search.

quant-ph

Experimental loopback boson sampling

We present an experimental demonstration of boson sampling enhanced by optical feedback lines, a novel approach that introduces temporal correlations among photons to amplify computational complexity. We utilize a 25-mode femtosecond laser-written interferometer with five output channels connected to five input channels to create correlations between consecutive photon arrival events. We have reconstructed the unitary matrix of the chip and have conducted Bayesian analysis to validate the sampler and confirm that the system exhibits behavior distinct from standard boson sampling. We also built a theoretical description of the system based on the transformation of annihilation operators and, using it, delivered the structure of the transmission matrix and the complexity of our boson sampler in terms of a conventional boson sampler. This work advances photonic quantum computing by demonstrating a resource-efficient method to increase sampling complexity, paving the way for scalable demonstration of quantum advantage with single photons.

quant-ph

Noise-tolerant tomography of multimode linear optical interferometers with single photons

Linear optical networks are fundamental to the advancement of quantum technologies, including quantum computing, communication, and sensing. The accurate characterization of these networks, described by unitary matrices, is crucial to their effective utilization and scalability. In this work, we present the method for reconstructing the transfer matrix of a linear optical interferometer based on the analysis of cross-correlation functions of photon counts between pairs of output modes. Our approach accounts for losses and photon indistinguishability, making it robust to experimental imperfections. By minimizing the requirements for the input states, the method simplifies the experimental implementation. We demonstrate the effectiveness of our technique through theoretical modeling and experimental validation in a 4-mode programmable integrated optical interferometer. The results show high fidelity in matrix reconstruction and successful application in boson sampling experiments. In addition, we provide a comprehensive formalism for correlation functions and discuss the robustness of the method to measurement errors. This work offers a practical and efficient solution for characterizing linear-optical networks, paving the way for scaling up photonic quantum technologies.

quant-ph