Searcharxiv⌕ Search

arXiv subjects

Saikat Guha

Publications and source records attributed to Saikat Guha.

At least 91 records · Page 5Linked to original sources

Quantum limits of parameter estimation in long-baseline imaging

Distributed aperture telescopes are a well-established approach for boosting resolution in astronomical imaging. However, theoretical limits on quantitative imaging precision, and the fundamentally best possible beam-combining and detection schemes to use with such arrays, remain largely unexplored. Using mathematical tools of the quantum and classical Cramer-Rao bounds, we perform analyses showing the fundamental origins of the enhancement provided by distributed imaging systems, over and above a single monolithic telescope, and consider the precision with which one can estimate any desired parameter embedded in a scene's incoherent radiation with a multi-aperture imaging system. We show how quantum-optimal measurements can be realized via beam-combination strategies of two classes: (1) multi-axial: where light from different apertures is directed to a common focal plane, e.g., of a segmented-aperture telescope; and (2) co-axial: where light collected at each aperture, e.g., telescope sites of a long-baseline array, is routed to an optical interferometer. As an example, we show an explicit calculation of the quantum Fisher information (QFI) for estimating the angular separation between two-point emitters using two identical apertures separated by a baseline distance. We show that this QFI splits instructively into additive contributions from the single apertures and from the baseline. We quantify the relative benefits of intra-telescope (e.g., spatial-mode) optical processing and inter-telescope beam combination. We show how both receiver designs can capture both sources of information and discuss how similar methods could be extended to more general imaging tasks. We discuss translating QFI-attaining measurements to explicit receiver designs, and the use of pre-shared entanglement to achieve the QFI when it is impractical to co-locate and combine light collected by the apertures.

quant-ph↗

Zero-Added-Loss Entangled Photon Multiplexing for Ground- and Space-Based Quantum Networks

We propose a scheme for optical entanglement distribution in quantum networks based on a quasi-deterministic entangled photon pair source. By combining heralded photonic Bell pair generation with spectral mode conversion to interface with quantum memories, the scheme eliminates switching losses due to multiplexing. We analyze this `zero-added-loss multiplexing' (ZALM) Bell pair source for the particularly challenging problem of long-baseline entanglement distribution via satellites and ground-based memories, where it unlocks additional advantages: (i) the substantially higher channel efficiency $η$ of \textit{downlinks} vs.\ \textit{uplinks} with realistic adaptive optics, and (ii) photon loss occurring \textit{before} interaction with the quantum memory -- i.e., Alice and Bob receiving rather than transmitting -- improve entanglement generation rate scaling by $\mathcal{O}(\sqrtη)$. Based on numerical analyses, we estimate our protocol to achieve $>$10$~$ebits/s at memory multiplexing of $10^2$ spin qubits for ground distance $>$10$^2~$km, with the spin-spin Bell state fidelity exceeding 99$\%$. Our architecture presents a blueprint for realizing global-scale quantum networks in the near-term.

quant-ph↗

Bayesian minimum mean square error for transmissivity sensing

We address the problem of estimating the transmissivity of the pure-loss channel from the Bayesian point of view, i.e., we consider that some prior probability distribution function (PDF) on the unknown variable is available and we employ methods to compute the Bayesian minimum mean square error (MMSE). Specifically, we consider two prior PDFs: the two-point and the beta distributions. By fixing the input mean photon number to an integer, for the two-point PDF we prove analytically that the optimal state is the Fock state and the optimal measurement is photon-counting, while for the beta PDF our numerical investigation provides evidence on the optimality of the Fock state and photon-counting. Moreover, we investigate the situation where the input mean photon number is any (non-negative) real number. For said case, we conjecture the form of the optimal input states and we study the performance of photon-counting, which is a sub-optimal yet practical measurement. Our methods can be applied for any prior PDF. We emphasize that we compute the MMSE instead of Bayesian lower bounds on the mean square error based on the Fisherian approach.

quant-ph↗

Perturbation Theory for Quantum Information

We report lowest-order series expansions for primary matrix functions of quantum states based on a perturbation theory for functions of linear operators. Our theory enables efficient computation of functions of perturbed quantum states that assume only knowledge of the eigenspectrum of the zeroth order state and the density matrix elements of a zero-trace, Hermitian perturbation operator, not requiring analysis of the full state or the perturbation term. We develop theories for two classes of quantum state perturbations, perturbations that preserve the vector support of the original state and perturbations that extend the support beyond the support of the original state. We highlight relevant features of the two situations, in particular the fact that functions and measures of perturbed quantum states with preserved support can be elegantly and efficiently represented using Fréchet derivatives. We apply our perturbation theories to find simple expressions for four of the most important quantities in quantum information theory that are commonly computed from density matrices: the Von Neumann entropy, the quantum relative entropy, the quantum Chernoff bound, and the quantum fidelity.

quant-ph↗

On the Analysis of a Multipartite Entanglement Distribution Switch

We study a quantum switch that distributes maximally entangled multipartite states to sets of users. The entanglement switching process requires two steps: first, each user attempts to generate bipartite entanglement between itself and the switch; and second, the switch performs local operations and a measurement to create multipartite entanglement for a set of users. In this work, we study a simple variant of this system, wherein the switch has infinite memory and the links that connect the users to the switch are identical. Further, we assume that all quantum states, if generated successfully, have perfect fidelity and that decoherence is negligible. This problem formulation is of interest to several distributed quantum applications, while the technical aspects of this work result in new contributions within queueing theory. Via extensive use of Lyapunov functions, we derive necessary and sufficient conditions for the stability of the system and closed-form expressions for the switch capacity and the expected number of qubits in memory.

quant-ph↗

ChartParser: Automatic Chart Parsing for Print-Impaired

Infographics are often an integral component of scientific documents for reporting qualitative or quantitative findings as they make it much simpler to comprehend the underlying complex information. However, their interpretation continues to be a challenge for the blind, low-vision, and other print-impaired (BLV) individuals. In this paper, we propose ChartParser, a fully automated pipeline that leverages deep learning, OCR, and image processing techniques to extract all figures from a research paper, classify them into various chart categories (bar chart, line chart, etc.) and obtain relevant information from them, specifically bar charts (including horizontal, vertical, stacked horizontal and stacked vertical charts) which already have several exciting challenges. Finally, we present the retrieved content in a tabular format that is screen-reader friendly and accessible to the BLV users. We present a thorough evaluation of our approach by applying our pipeline to sample real-world annotated bar charts from research papers.

cs.CV↗

Towards Zero-Shot and Few-Shot Table Question Answering using GPT-3

We present very early results on using GPT-3 to perform question answering on tabular data. We find that stock pre-trained GPT-3 is able to zero-shot learn the table structure from a serialized JSON array-of-arrays representation, and able to answer lookup queries and simple comparison questions in natural language without any fine-tuning. We further find that simple prompt engineering to include few-shot static Q&A examples significantly improves accuracy. Lastly, we find that intermixing passage text improves accuracy even further on heterogeneous data. We apply our approach on a novel dataset of simple tables in newspaper infographics with promising results. Overall, we find much cause for optimism in this basic approach.

cs.LG↗

Quantum-Enhanced Transmittance Sensing

We consider the problem of estimating unknown transmittance $θ$ of a target bathed in thermal background light. As quantum estimation theory yields the fundamental limits, we employ the lossy thermal-noise bosonic channel model, which describes sensor-target interaction quantum mechanically in many practical active-illumination systems (e.g., using emissions at optical, microwave, or radio frequencies). We prove that quantum illumination using two-mode squeezed vacuum (TMSV) states asymptotically achieves minimal quantum Cramér-Rao bound (CRB) over all quantum states (not necessarily Gaussian) in the limit of low transmitted power. We characterize the optimal receiver structure for TMSV input, and show its advantage over other receivers using both analysis and Monte Carlo simulation.

quant-ph↗

Measurement-based Quantum Computation as a Tangram Puzzle

Measurement-Based Quantum Computing (MBQC), proposed in 2001 is a model of quantum computing that achieves quantum computation by performing a series of adaptive single-qubit measurements on an entangled cluster state. Our project is aimed at introducing MBQC to a wide audience ranging from high school students to quantum computing researchers through a Tangram puzzle with a modified set of rules, played on an applet. The rules can be understood without any background in quantum computing. The player is provided a quantum circuit, shown using gates from a universal gate set, which the player must map correctly to a playing board using polyominos. Polyominos or 'puzzle blocks' are the building blocks of our game. They consist of square tiles joined edge-to-edge to form different colored shapes. Each tile represents a single-qubit measurement basis, differentiated by its color. Polyominos rest on a square-grid playing board, which signifies a cluster state. We show that mapping a quantum circuit to MBQC is equivalent to arranging a set of polyominos, each corresponding to a gate in the circuit on the playing board, subject to certain rules, which involve rotating and deforming polyominos. We state the rules in simple terms with no reference to quantum computing. The player has to place polyominos on the playing board conforming to the rules. Any correct solution creates a valid realization of the quantum circuit in MBQC. A higher-scoring correct solution fills up less space on the board, resulting in a lower-overhead embedding of the circuit in MBQC, an open and challenging research problem.

quant-ph↗

Supporting multiple entanglement flows through a continuous-variable quantum repeater

Quantum repeaters are critical to the development of quantum networks, enabling rates of entanglement distribution beyond those attainable by direct transmission. We consider multiple continuous-variable, squeezed light-based entanglement flows through a repeater involving noiseless linear amplification and dual homodyne detection. By analyzing a single-repeater-enhanced channel model with asymmetric losses across the repeater, we determine optimal placements of the central repeater hub in a 4-user hub-and-spoke network such that the rate of each entanglement flow through the hub is enhanced.

quant-ph↗

Transceiver designs to attain the entanglement assisted communications capacity

Pre-shared entanglement can significantly boost communication rates in the high thermal noise and low-brightness transmitter regime. In this regime, for a lossy-bosonic channel with additive thermal noise, the ratio between the entanglement-assisted capacity and the Holevo capacity - the maximum reliable-communications rate permitted by quantum mechanics without any pre-shared entanglement - scales as $\log(1/{\bar N}_{\rm S})$, where the mean transmitted photon number per mode, ${\bar N}_{\rm S} \ll 1$. Thus, pre-shared entanglement, e.g., distributed by the quantum internet or a satellite-assisted quantum link, promises to significantly improve low-power radio-frequency communications. In this paper, we propose a pair of structured quantum transceiver designs that leverage continuous-variable pre-shared entanglement generated, e.g., from a down-conversion source, binary phase modulation, and non-Gaussian joint detection over a code word block, to achieve this scaling law of capacity enhancement. Further, we describe a modification to the aforesaid receiver using a front-end that uses sum-frequency generation sandwiched with dynamically-programmable in-line two-mode squeezers, and a receiver back-end that takes full advantage of the output of the receiver's front-end by employing a non-destructive multimode vacuum-or-not measurement to achieve the entanglement-assisted classical communications capacity.

quant-ph↗

Entanglement-assisted multi-aperture pulse-compression radar for angle resolving detection

Entanglement has been known to boost target detection, despite it being destroyed by lossy-noisy propagation. Recently, [Phys. Rev. Lett. 128, 010501 (2022)] proposed a quantum pulse-compression radar to extend entanglement's benefit to target range estimation. In a radar application, many other aspects of the target are of interest, including angle, velocity and cross section. In this study, we propose a dual-receiver radar scheme that employs a high time-bandwidth product microwave pulse entangled with a pre-shared reference signal available at the receiver, to investigate the direction of a distant object and show that the direction-resolving capability is significantly improved by entanglement, compared to its classical counterpart under the same parameter settings. We identify the applicable scenario of this quantum radar to be short-range and high-frequency, which enables entanglement's benefit in a reasonable integration time.

quant-ph↗

Demonstration of Entanglement-Enhanced Covert Sensing

The laws of quantum physics endow superior performance and security for information processing: quantum sensing harnesses nonclassical resources to enable measurement precision unmatched by classical sensing, whereas quantum cryptography aims to unconditionally protect the secrecy of the processed information. Here, we present the theory and experiment for entanglement-enhanced covert sensing, a paradigm that simultaneously offers high measurement precision and data integrity by concealing the probe signal in an ambient noise background so that the execution of the protocol is undetectable with a high probability. We show that entanglement offers a performance boost in estimating the imparted phase by a probed object, as compared to a classical protocol at the same covertness level. The implemented entanglement-enhanced covert sensing protocol operates close to the fundamental quantum limit by virtue of its near-optimum entanglement source and quantum receiver. Our work is expected to create ample opportunities for quantum information processing at unprecedented security and performance levels.

quant-ph↗

Towards Optimizing OCR for Accessibility

Visual cues such as structure, emphasis, and icons play an important role in efficient information foraging by sighted individuals and make for a pleasurable reading experience. Blind, low-vision and other print-disabled individuals miss out on these cues since current OCR and text-to-speech software ignore them, resulting in a tedious reading experience. We identify four semantic goals for an enjoyable listening experience, and identify syntactic visual cues that help make progress towards these goals. Empirically, we find that preserving even one or two visual cues in aural form significantly enhances the experience for listening to print content.

cs.CV↗

Broken News: Making Newspapers Accessible to Print-Impaired

Accessing daily news content still remains a big challenge for people with print-impairment including blind and low-vision due to opacity of printed content and hindrance from online sources. In this paper, we present our approach for digitization of print newspaper into an accessible file format such as HTML. We use an ensemble of instance segmentation and detection framework for newspaper layout analysis and then OCR to recognize text elements such as headline and article text. Additionally, we propose EdgeMask loss function for Mask-RCNN framework to improve segmentation mask boundary and hence accuracy of downstream OCR task. Empirically, we show that our proposed loss function reduces the Word Error Rate (WER) of news article text by 32.5 %.

cs.CV↗

On the Capacity Region of Bipartite and Tripartite Entanglement Switching

We study a quantum entanglement distribution switch serving a set of users in a star topology with equal-length links. The quantum switch, much like a quantum repeater, can perform entanglement swapping to extend entanglement across longer distances. Additionally, the switch is equipped with entanglement switching logic, enabling it to implement switching policies to better serve the needs of the network. In this work, the function of the switch is to create bipartite or tripartite entangled states among users at the highest possible rates at a fixed ratio. Using Markov chains, we model a set of randomized switching policies. Discovering that some are better than others, we present analytical results for the case where the switch stores one qubit per user, and find that the best policies outperform a time division multiplexing (TDM) policy for sharing the switch between bipartite and tripartite state generation. This performance improvement decreases as the number of users grows. The model is easily augmented to study the capacity region in the presence of quantum state decoherence and associated cut-off times for qubit storage, obtaining similar results. Moreover, decoherence-associated quantum storage cut-off times appear to have little effect on capacity in our identical-link system. We also study a smaller class of policies when the switch stores two qubits per user.

cs.NI↗

Document Navigability: A Need for Print-Impaired

Printed documents continue to be a challenge for blind, low-vision, and other print-disabled (BLV) individuals. In this paper, we focus on the specific problem of (in-)accessibility of internal references to citations, footnotes, figures, tables and equations. While sighted users can flip to the referenced content and flip back in seconds, linear audio narration that BLV individuals rely on makes following these references extremely hard. We propose a vision based technique to locate the referenced content and extract metadata needed to (in subsequent work) inline a content summary into the audio narration. We apply our technique to citations in scientific documents and find it works well both on born-digital as well as scanned documents.

cs.CV↗

Quantum Multi-Parameter Adaptive Bayesian Estimation and Application to Super-Resolution Imaging

In Bayesian estimation theory, the estimator ${\hat θ} = E[θ|l]$ attains the minimum mean squared error (MMSE) for estimating a scalar parameter of interest $θ$ from the observation of $l$ through a noisy channel $P_{l|θ}$, given a prior $P_θ$ on $θ$. In quantum sensing tasks, the user gets $ρ_θ$, the quantum state that encodes $θ$. They choose a measurement, a positive-operator valued measure (POVM) $Π_l$, which induces the channel $P_{l|θ} = {\rm Tr}(ρ_θΠ_l)$ to the measurement outcome $l$, on which the aforesaid classical MMSE estimator is employed. Personick found the optimum POVM $Π_l$ that minimizes the MMSE over all possible measurements, and that MMSE. This result from 1971 is less-widely known than the quantum Fisher information (QFI), which lower bounds the variance of an unbiased estimator over all measurements, when $P_θ$ is unavailable. For multi-parameter estimation, i.e., when $θ$ is a vector, in Fisher quantum estimation theory, the inverse of the QFI matrix provides an operator lower bound to the covariance of an unbiased estimator. However, there has been little work on quantifying quantum limits and measurement designs, for multi-parameter quantum estimation in the {\em Bayesian} setting. In this paper, we build upon Personick's result to construct a Bayesian adaptive measurement scheme for multi-parameter estimation when $N$ copies of $ρ_θ$ are available. We illustrate an application to localizing a cluster of point emitters in a highly sub-Rayleigh angular field-of-view, an important problem in fluorescence microscopy and astronomy. Our algorithm translates to a multi-spatial-mode transformation prior to a photon-detection array, with electro-optic feedback to adapt the mode sorter. We show that this receiver performs far superior to quantum-noise-limited focal-plane direct imaging.

physics.data-an↗