Search

We consider an imaging system tasked with estimating the angular distance between two incoherently-emitting sub-Rayleigh-separated point sources, without any prior knowledge of the centroid or the constellation and with a fixed collected-photon budget. It was shown theoretically that splitting the optical recording time into two stages -- focal-plane direct imaging to obtain a pre-estimate of the centroid, and using that estimate to center a spatial-mode sorter followed by photon detection of the sorted modes -- can achieve 10 to 100 times lower mean squared error in estimating the separation. In this paper, we demonstrate this in proof-of-concept, using a programmable mode sorter we have built using multi-plane light conversion (MPLC) using a reflective spatial-light modulator (SLM) in an emulated experiment where we use a single coherent source to characterize the MPLC to electronically piece together the signature from two closely-separated quasi-monochromatic incoherent emitters., Comment: 7 pages, 7 figures in main paper, 3 pages, 8 figures in supplementary material

Quantum illumination (QI) is the task of querying a scene using a transmitter probe whose quantum state is entangled with a reference beam retained in ideal storage, followed by optimally detecting the target-returned light together with the stored reference, to make decisions on characteristics of targets at stand-off range, at precision that exceeds what is achievable with a classical transmitter of the same brightness and otherwise identical conditions. Using tools from perturbation theory, we show that in the limit of low transmitter brightness, high loss, and high thermal background, there is a factor of four improvement in the Chernoff exponent of the error probability in discriminating any number of apriori-known reflective targets when using a Gaussian-state entangled QI probe, over using classical coherent-state illumination (CI). While this advantage was known for detecting the presence or absence of a target, it had not been proven for the generalized task of discriminating between arbitrary target libraries. In proving our result, we derive simple general analytic expressions for the lowest-order asymptotic expansions of the quantum Chernoff exponents for QI and CI in terms of the signal brightness, loss, thermal noise, and the modal expansion coefficients of the target-reflected light's radiant exitance profiles when separated by a spatial mode sorter after entering the entrance pupil of the receiver's aperture., Comment: 6 pages, 2 figures, presented at ISIT 2024

Entanglement is essential for quantum information processing but is limited by noise. We address this by developing high-yield entanglement distillation protocols with several advancements. (1) We extend the 2-to-1 recurrence entanglement distillation protocol to higher-rate n-to-(n-1) protocols that can correct any single-qubit errors. These protocols are evaluated through numerical simulations focusing on fidelity and yield. We also outline a method to adapt any classical error-correcting code for entanglement distillation, where the code can correct both bit-flip and phase-flip errors by incorporating Hadamard gates. (2) We propose a constant-depth decoder for stabilizer codes that transforms logical states into physical ones using single-qubit measurements. This decoder is applied to entanglement distillation protocols, reducing circuit depth and enabling protocols derived from advanced quantum error-correcting codes. We demonstrate this by evaluating the circuit complexity for entanglement distillation protocols based on surface codes and quantum convolutional codes. (3) Our stabilizer entanglement distillation techniques advance quantum computing. We propose a fault-tolerant protocol for constant-depth encoding and decoding of arbitrary quantum states, applicable to quantum low-density parity-check (qLDPC) codes and surface codes. This protocol is feasible with state-of-the-art reconfigurable atom arrays and surpasses the limits of conventional logarithmic depth encoders. Overall, our study integrates stabilizer formalism, measurement-based quantum computing, and entanglement distillation, advancing both quantum communication and computing., Comment: 19 pages, 7 figures

One of the most promising applications of quantum networks is entanglement assisted sensing. The field of quantum metrology exploits quantum correlations to improve the precision bound for applications such as precision timekeeping, field sensing, and biological imaging. When measuring multiple spatially distributed parameters, current literature focuses on quantum entanglement in the discrete variable case, and quantum squeezing in the continuous variable case, distributed amongst all of the sensors in a given network. However, it can be difficult to ensure all sensors pre-share entanglement of sufficiently high fidelity. This work probes the space between fully entangled and fully classical sensing networks by modeling a star network with probabilistic entanglement generation that is attempting to estimate the average of local parameters. The quantum Fisher information is used to determine which protocols best utilize entanglement as a resource for different network conditions. It is shown that without entanglement distillation there is a threshold fidelity below which classical sensing is preferable. For a network with a given number of sensors and links characterized by a certain initial fidelity and probability of success, this work outlines when and how to use entanglement, when to store it, and when it needs to be distilled., Comment: 22 pages, 9 Figures

An ideal direct imaging coronagraph, which selectively rejects the fundamental mode of a telescope, has been shown to achieve the quantum information limits for exoplanet detection and localization. In this study, we experimentally implement this quantum-optimal coronagraph using spatial mode (de)multiplexing. Our benchtop system includes a forward and inverse pass through a free-space programmable spatial mode sorter, designed to isolate photons in a point spread function (PSF)-adapted basis. During the forward pass, the fundamental mode is rejected, effectively eliminating light from an on-axis point-like star. On the inverse pass, the remaining modes are coherently recombined, enabling direct imaging of a faint companion. We develop a probabilistic measurement model that accounts for combined effects of fundamental shot noise and experimental noise specific to our benchtop setup, such as modal cross-talk, dark noise, and ambient background illumination. We leverage this measurement model to formulate a maximum-likelihood estimator of the exoplanet position given an image captured with the coronagraph. Using this approach, we successfully localize an artificial exoplanet at sub-diffraction distances $(<\sigma)$ from its host star under a 1000:1 star-planet contrast ratio. Our system accurately localizes the exoplanet up to an absolute error $<0.03\sigma$ over the separation range $[0,\,0.6]\sigma$. Finally, we numerically evaluate the precision of our experimental coronagraph against state-of-the-art coronagraphs subject to comparable noise models., Comment: 11 pages, 10 figures

In active imaging protocols, information about a landscape is encoded into the spatial mode of a scattered photon. A common assumption is that the landscape is rigid; however, in principle it can be altered by radiation pressure, a concept that has found fruitful application in the field of quantum optomechanics. Here we explore active imaging of a mechanical resonator with an eye to generalizing the concept of radiation pressure backaction to spatially multimode light. As a thought experiment, we consider imaging the flexural modes of a membrane by sorting the spatial modes of a laser reflected from its surface. We show that backaction in this setting arises from spatial photon shot noise, an effect that cannot be observed in single-mode optomechanics. We also derive the imprecision-backaction product for coherent illumination in the limit of purely spatial backaction, revealing it to be equivalent to the standard quantum limit for purely dispersive, single-mode optomechanical coupling. Finally, we show that optomechanical correlations due to spatial backaction can give rise to two-mode entangled light. In conjunction with high-$Q$ nanomechanics, our findings point to new opportunities at the interface of quantum imaging and optomechanics, including sensors and networks enhanced by spatial mode entanglement., Comment: 10 pages, 5 figures

Microarcsecond resolutions afforded by an optical-NIR array with kilometer-baselines would enable breakthrough science. However significant technology barriers exist in transporting weakly coherent photon states over these distances: primarily photon loss and phase errors. Quantum telescopy, using entangled states to link spatially separated apertures, offers a possible solution to the loss of photons. We report on an initiative launched by NSF NOIRLab in collaboration with the Center for Quantum Networks and Arizona Quantum Initiative at the University of Arizona, Tucson, to explore these concepts further. A brief description of the quantum concepts and a possible technology roadmap towards a quantum-enhanced very long baseline optical-NIR interferometric array is presented. An on-sky demonstration of measuring spatial coherence of photons with apertures linked through the simplest Gottesman protocol over short baselines and with limited phase fluctuations is envisaged as the first step., Comment: Proceeding of SPIE Conference "Astronomical Telescopes + Instrumentation" (June 2024)

It has been shown that shared entanglement between two telescope sites can in principle be used to localize a point source by mimicking the standard phase-scanning interferometer, but without physically bringing the light from the distant telescopes together. In this paper, we show that a receiver that employs spatial-mode sorting at each telescope site, combined with pre-shared entanglement and local quantum operations can be used to mimic the most general multimode interferometer acting on light collected from the telescopes. As an example application to a quantitative passive-imaging problem, we show that the quantum-limited precision of estimating the angular separation between two stars can be attained by an instantiation of the aforesaid entanglement based receiver. We discuss how this entanglement assisted strategy can be used to achieve the quantum-limited precision of any complex quantitative imaging task involving any number of telescopes. We provide a blueprint of this general receiver that involves quantum transduction of starlight into quantum memory banks and spatial mode sorters deployed at each telescope site, and measurements that include optical detection as well as qubit gates and measurements on the quantum memories. We discuss the relative contributions of local mode sorting at telescope sites vis-a-vis distributed entanglement-assisted interferometry, to the overall quantum-limited information about the scene, based on the ratio of the baseline distance to the individual telescope diameter., Comment: 16 pages, 3 figures

Gottesman-Kitaev-Preskill (GKP) states have been demonstrated to pose significant advantages when utilized for fault-tolerant all optical continuous-variable quantum computing as well as for quantum communications links for entanglement distribution. However interfacing these systems to long-lived solid-state quantum memories has remained an open problem. Here we propose an interface between quantum memories and GKP qubit states based on a cavity-mediated controlled displacement gate. We characterize the quality of memory-GKP entanglement as a function of cavity parameters suggesting optimal regimes of operation for high-quality state transfer between either qubit states. We further extend this protocol to demonstrate the creation of GKP cluster states by avoiding the requirement of ancillary optical quadrature-squeezed light. Utilizing post-selected entanglement swapping operations for GKP qubits, we demonstrate the utility of our protocol for high-rate entanglement generation between quantum memories. Extensions and derivatives of our proposal could enable a wide variety of applications by utilizing the operational trade-offs for qubits encoded in memory and in the GKP basis., Comment: 17 pages; 8 figures; Comments are welcome!

Entangling quantum memories, mediated by optical-frequency or microwave channels, at high rates and fidelities is key for linking qubits across short and long ranges. All well-known protocols encode up to one qubit per optical mode, hence entangling one pair of memory qubits per transmitted mode over the channel, with probability $\eta$, the channel's transmissivity. The rate is proportional to $\eta$ ideal Bell states (ebits) per mode. The quantum capacity, $C(\eta) = -\log_2(1-{\eta})$ ebits per mode, which $\approx 1.44\eta$ for high loss, i.e., $\eta \ll 1$, thereby making these schemes near rate-optimal. However, $C(\eta) \to \infty$ as $\eta \to 1$, making the known schemes highly rate-suboptimal for shorter ranges. We show that a cavity-assisted memory-photon interface can be used to entangle matter memories with Gottesman-Kitaev-Preskill (GKP) photonic qudits, which along with dual-homodyne entanglement swaps that retain analog information, enables entangling memories at capacity-approaching rates at low loss. We benefit from loss resilience of GKP qudits, and their ability to encode multiple qubits in one mode. Our memory-photon interface further supports the preparation of needed ancilla GKP qudits. We expect our result to spur research in low-loss high-cooperativity cavity-coupled qubits with high-efficiency optical coupling, and demonstrations of high-rate short-range quantum links., Comment: 14 pages; 8 figures; Comments are welcome!

Stabilizer states are a prime resource for a number of applications in quantum information science, such as secret-sharing and measurement-based quantum computation. This motivates us to study the entanglement of noisy stabilizer states across a bipartition. We show that the spectra of the corresponding reduced states can be expressed in terms of properties of an associated stabilizer code. In particular, this allows us to show that the coherent information is related to the so-called syndrome entropy of the underlying code. We use this viewpoint to find stabilizer states that are resilient against noise, allowing for more robust entanglement distribution in near-term quantum networks. We specialize our results to the case of graph states, where the found connections with stabilizer codes reduces back to classical linear codes for dephasing noise. On our way we provide an alternative proof of the fact that every qubit stabilizer code is equivalent up to single-qubit Clifford gates to a graph code., Comment: 7 pages, 4 figures

All-photonic quantum repeaters use multi-qubit photonic graph states, called repeater graph states (RGS), instead of matter-based quantum memories, for protection against predominantly loss errors. The RGS comprises tree-graph-encoded logical qubits for error correction at the repeaters and physical {\em link} qubits to create entanglement between neighboring repeaters. The two methods to generate the RGS are probabilistic stitching -- using linear optical Bell state measurements (fusion) -- of small entangled states prepared via multiplexed-probabilistic linear optical circuits fed with single photons, and a direct deterministic preparation using a small number of quantum-logic-capable solid-state emitters. The resource overhead due to fusions and the circuit depth of the quantum emitter system both increase with the size of the RGS. Therefore engineering a resource-efficient RGS is crucial. We propose a new RGS design, which achieves a higher entanglement rate for all-photonic quantum repeaters using fewer qubits than the previously known RGS would. We accomplish this by boosting the probability of entangling neighboring repeaters with tree-encoded link qubits. We also propose a new adaptive scheme to perform logical BSM on the link qubits for loss-only errors. The adaptive BSM outperforms the previous schemes for logical BSM on tree codes when the qubit loss probability is uniform. It reduces the number of optical modes required to perform logical BSM on link qubits to improve the entanglement rate further.

Errors are the fundamental barrier to the development of quantum systems. Quantum networks are complex systems formed by the interconnection of multiple components and suffer from error accumulation. Characterizing errors introduced by quantum network components becomes a fundamental task to overcome their depleting effects in quantum communication. Quantum Network Tomography (QNT) addresses end-to-end characterization of link errors in quantum networks. It is a tool for building error-aware applications, network management, and system validation. We provide an overview of QNT and its initial results for characterizing quantum star networks. We apply a previously defined QNT protocol for estimating bit-flip channels to estimate depolarizing channels. We analyze the performance of our estimators numerically by assessing the Quantum Cram\`er-Rao Bound (QCRB) and the Mean Square Error (MSE) in the finite sample regime. Finally, we provide a discussion on current challenges in the field of QNT and elicit exciting research directions for future investigation., Comment: 11 pages, 5 figures, accepted for publication at IEEE Network

Bell-state measurement (BSM) on entangled states shared between quantum repeaters is the fundamental operation used to route entanglement in quantum networks. Performing BSMs on Werner states shared between repeaters leads to exponential decay in the fidelity of the end-to-end Werner state with the number of repeaters, necessitating entanglement distillation. Generally, entanglement routing protocols use \emph{probabilistic} distillation techniques based on local operations and classical communication. In this work, we use quantum error correcting codes (QECCs) for \emph{deterministic} entanglement distillation to route Werner states on a chain of repeaters. To maximize the end-to-end distillable entanglement, which depends on the number and fidelity of end-to-end Bell pairs, we utilize global link-state knowledge to determine the optimal policy for scheduling distillation and BSMs at the repeaters. We analyze the effect of the QECC's properties on the entanglement rate and the number of quantum memories. We observe that low-rate codes produce high-fidelity end-to-end states owing to their excellent error-correcting capability, whereas high-rate codes yield a larger number of end-to-end states but of lower fidelity. The number of quantum memories used at repeaters increases with the code rate as well as the classical computation time of the QECC's decoder.

Graph states are a key resource for a number of applications in quantum information theory. Due to the inherent noise in noisy intermediate-scale quantum (NISQ) era devices, it is important to understand the effects noise has on the usefulness of graph states. We consider a noise model where the initial qubits undergo depolarizing noise before the application of the CZ operations that generate edges between qubits situated at the nodes of the resulting graph state. For this model we develop a method for calculating the coherent information -- a lower bound on the rate at which entanglement can be distilled, across a bipartition of the graph state. We also identify some patterns on how adding more nodes or edges affects the bipartite distillable entanglement. As an application, we find a family of graph states that maintain a strictly positive coherent information for any amount of (non-maximal) depolarizing noise., Comment: 19 pages, 9 figures

Gaussian Boson Sampling (GBS) generate random samples of photon-click patterns from a class of probability distributions that are hard for a classical computer to sample from. Despite heroic demonstrations for quantum supremacy using GBS, Boson Sampling, and instantaneous quantum polynomial (IQP) algorithms, systematic evaluations of the power of these quantum-enhanced random samples when applied to provably hard problems, and performance comparisons with best-known classical algorithms have been lacking. We propose a hybrid quantum-classical algorithm using the GBS for the NP-complete problem of determining if two graphs are vertex minor of one another. The graphs are encoded in GBS and the generated random samples serve as feature vectors in the support vector machine (SVM) classifier. We find a graph embedding that allows trading between the one-shot classification accuracy and the amount of input squeezing, a hard-to-produce quantum resource, followed by repeated trials and majority vote to reach an overall desired accuracy. We introduce a new classical algorithm based on graph spectra, which we show outperforms various well-known graph-similarity algorithms. We compare the performance of our algorithm with this classical algorithm and analyze their time vs problem-size scaling, to yield a desired classification accuracy. Our simulation suggests that with a near-term realizable GBS device- $5$ dB pulsed squeezer, $12$-mode unitary, and reasonable assumptions on coupling efficiency, on-chip losses and detection efficiency of photon number resolving detectors-we can solve a $12$-node vertex minor instances with about $10^3$ fold lower time compared to a powerful desktop computer., Comment: 11 pages, 12 figures

Multi-qubit photonic graph states are necessary for quantum communication and computation. Preparing photonic graph states using probabilistic stitching of single photons using linear optics results in a formidable resource requirement due to the need of multiplexing. Quantum emitters present a viable solution to prepare photonic graph states, as they enable controlled production of photons entangled with the emitter qubit, and deterministic two-qubit interactions among emitters. A handful of emitters often suffice to generate useful photonic graph states that would otherwise require millions of single photon sources using the linear-optics method. But, photon loss poses an impediment to this method due to the large depth, i.e., age of the oldest photon, of the graph state, given the typically large number of slow and noisy two-qubit CNOT gates required on emitters. We propose an algorithm that can trade the number of emitters with the graph-state depth, while minimizing the number of emitter CNOTs. We apply our algorithm to generating a repeater graph state (RGS) for all-photonic repeaters. We find that our scheme achieves a far superior rate-vs.-distance performance than using the least number of emitters needed to generate the RGS. Yet, our scheme is able to get the same performance as the linear-optics method of generating the RGS where each emitter is used as a single-photon source, but with orders of magnitude fewer emitters., Comment: 17 pages, 14 figures

Beam displacement measurements are widely used in optical sensing and communications; however, their performance is affected by numerous intrinsic and extrinsic factors including beam profile, propagation loss, and receiver architecture. Here we present a framework for designing a classically optimal beam displacement transceiver, using quantum estimation theory. We consider the canonical task of estimating the position of a diffraction-limited laser beam after passing through an apertured volume characterized by Fresnel-number product DF. As a rule of thumb, higher-order Gaussian modes provide more information about beam displacement, but are more sensitive to loss. Applying quantum Fisher information, we design mode combinations that optimally leverage this trade-off, and show that a greater than 10-fold improvement in precision is possible, relative to the fundamental mode, for a practically relevant DF = 100. We also show that this improvement is realizable with a variety of practical receiver architectures. Our findings extend previous works on lossless transceivers, may have immediate impact on applications such as atomic force microscopy and near-field optical communication, and pave the way towards globally optimal transceivers using non-classical laser fields., Comment: 11 pages, 4 figures

We consider a quantum bosonic channel that couples the input mode via a beam splitter or two-mode squeezer to an environmental mode that is prepared in an arbitrary state. We investigate the classical capacity of this channel, which we call a non-Gaussian attenuator or amplifier channel. If the environment state is thermal, we of course recover a Gaussian phase-covariant channel whose classical capacity is well known. Otherwise, we derive both a lower and an upper bound to the classical capacity of the channel, drawing inspiration from the classical treatment of the capacity of non-Gaussian additive-noise channels. We show that the lower bound to the capacity is always achievable and give examples where the non-Gaussianity of the channel can be exploited so that the communication rate beats the capacity of the Gaussian-equivalent channel (i.e., the channel where the environment state is replaced by a Gaussian state with the same covariance matrix). Finally, our upper bound leads us to formulate and investigate conjectures on the input state that minimizes the output entropy of non-Gaussian attenuator or amplifier channels. Solving these conjectures would be a main step towards accessing the capacity of a large class of non-Gaussian bosonic channels., Comment: 17 pages + 1 page of Appendix, 9 figures

From the perspective of majorization theory, we study how to enhance the entanglement of a two-mode squeezed vacuum (TMSV) state by using local filtration operations. We present several schemes achieving entanglement enhancement with photon addition and subtraction, and then consider filtration as a general probabilistic procedure consisting in acting with local (non-unitary) operators on each mode. From this, we identify a sufficient set of two conditions on filtration operators for successfully enhancing the entanglement of a TMSV state, namely the operators must be Fock-orthogonal (i.e., preserving the orthogonality of Fock states) and Fock-amplifying (i.e., giving larger amplitudes to larger Fock states). Our results notably prove that ideal photon addition, subtraction, and any concatenation thereof always enhance the entanglement of a TMSV state in the sense of majorization theory. We further investigate the case of realistic photon addition (subtraction) and are able to upper bound the distance between a realistic photon-added (-subtracted) TMSV state and a nearby state that is provably more entangled than the TMSV, thus extending entanglement enhancement to practical schemes via the use of a notion of approximate majorization. Finally, we consider the state resulting from $k$-photon addition (on each of the two modes) on a TMSV state. We prove analytically that the state corresponding to $k=1$ majorizes any state corresponding to $2\leq k \leq 8$ and we conjecture the validity of the statement for all $k\geq 9$., Comment: 11 pages + 3 pages of Appendix, 7 figures

Stabilizer states along with Clifford manipulations (unitary transformations and measurements) thereof -- despite being efficiently simulable on a classical computer -- are an important tool in quantum information processing, with applications to quantum computing, error correction and networking. Cluster states, defined on a graph, are a special class of stabilizer states that are central to measurement based quantum computing, all-photonic quantum repeaters, distributed quantum computing, and entanglement distribution in a network. All cluster states are local-Clifford equivalent to a stabilizer state. In this paper, we review the stabilizer framework, and extend it, by: incorporating general stabilizer measurements such as multi-qubit fusions, and providing an explicit procedure -- using Karnaugh maps from Boolean algebra -- for converting arbitrary stabilizer gates into tableau operations of the CHP formalism for efficient stabilizer manipulations. Using these tools, we develop a graphical rule-book and a MATLAB simulator with a graphical user interface for arbitrary stabilizer manipulations of cluster states, a user of which, e.g., for research in quantum networks, will not require any background in quantum information or the stabilizer framework. We extend our graphical rule-book to include dual-rail photonic-qubit cluster state manipulations with probabilistically-heralded linear-optical circuits for various rotated Bell measurements, i.e., fusions (including new `Type-I' fusions we propose, where only one of the two fused qubits is destructively measured), by incorporating graphical rules for their success and failure modes. Finally, we show how stabilizer descriptions of multi-qubit fusions can be mapped to linear optical circuits.

Achieving the ultimate Holevo limit of optical communication capacity requires a joint-detection receiver which makes a collective quantum measurement over multiple modulated symbols. Such superadditivity -- a higher communication rate than that achievable by symbol-by-symbol optical detection -- is a special case of the well-known nonlocality without entanglement and has yet to be demonstrated. In this article, we propose and demonstrate a design of joint-detection receivers, the Green Machine, that can achieve superadditivity. We build this receiver and show that its capacity surpasses any symbol-by-symbol receivers in the photon-starved regime with binary-phase-shift-keying (BPSK). Our Green Machine receiver can also significantly reduce the transmitter peak power requirement compared with the pulse-position modulation (the conventional modulation format used for deep space laser communication). We further show that the self-referenced phase makes it immune to phase noise, e.g., atmospheric turbulence or platform vibrations., Comment: 23 pages, 9 figures

Quantum networks will be able to service consumers with long-distance entanglement by use of quantum repeaters that generate Bell pairs (or links) with their neighbors, iid with probability $p$ and perform Bell State Measurements (BSMs) on the links that succeed iid with probability $q$. While global link state knowledge is required to maximize the rate of entanglement generation between any two consumers, it increases the protocol latency due to the classical communication requirements and requires long quantum memory coherence times. We propose two entanglement routing protocols that require only local link state knowledge to relax the quantum memory coherence time requirements and reduce the protocol latency. These protocols utilize multi-path routing protocol and time multiplexed repeaters. The time multiplexed repeaters first generate links for $k$-time steps before performing BSMs on any pairs of links. Our two protocols differ in the decision rule used for performing BSMs at the repeater: the first being a static path based routing protocol and second a dynamic distance based routing protocol. The performance of these protocols depends on the quantum network topology and the consumers' location. We observe that the average entanglement rate and the latency increase with the time multiplexing block length, $k$, irrespective of the protocol. When a step function memory decoherence model is introduced such that qubits are held in the quantum memory for an exponentially distributed time with mean $\mu$, an optimal $k$ ($k_\text{opt}$) value appears, such that for increasing $k$ beyond $k_{\rm opt}$ hurts the entanglement rate. $k_{\rm opt}$ decreases with $p$ and increases with $\mu$. $k_{\rm opt}$ appears due to the tradeoff between benefits from time multiplexing and the increased likelihood of previously established Bell pairs decohering due to finite memory coherence times., Comment: 11 pages, 15 figures

Detecting if and when objects change is difficult in passive sub-diffraction imaging of dynamic scenes. We consider the best possible tradeoff between responsivity and accuracy for detecting a change from one arbitrary object model to another in the context of sub-diffraction incoherent imaging. We analytically evaluate the best possible average latency, for a fixed false alarm rate, optimizing over all physically allowed measurements of the optical field collected by a finite 2D aperture. We find that direct focal-plane detection of the incident optical intensity achieves sub-optimal detection latencies compared to the best possible average latency, but that a three-mode spatial-mode demultiplexing measurement in concert with on-line statistical processing using the well-known CUSUM algorithm achieves this quantum limit for sub-diffraction objects. We verify these results via Monte Carlo simulation of the change detection procedure and quantify a growing gap between the conventional and quantum-optimal receivers as the objects are more and more diffraction-limited., Comment: 4 pages, 3 figures

We consider the generic form of a two-mode bosonic state $|\Psi_n\rangle$ with finite Fock expansion and fixed mean photon number to an integer $n\geq1$. The upper and lower modes of the input state $|\Psi_n\rangle$ pick up a phase $\phi$ and $-\phi$ respectively and we study the form of the optimal input state, i.e., the form of the state's Fock coefficients, such that the mean square error (MSE) for estimating $\phi$ is minimized while the MSE is always attainable by a measurement. Our setting is Bayesian, meaning that we consider $\phi$ as a random variable that follows a prior probability distribution function (PDF). For the celebrated NOON state (equal superposition of $|n0\rangle$ and $|0n\rangle$), which is a special case of the input state we consider, and for a flat prior PDF we find that the Heisenberg scaling is lost and the attainable minimum mean square error (MMSE) is found to be $\pi^2/3-1/4n^2$, which is a manifestation of the fundamental difference between the Fisherian and Bayesian approaches. Then, our numerical analysis provides the optimal form of the generic input state for fixed values of $n$ and we provide evidence that a state $|\Psi_{\tau}\rangle$ produced by mixing a Fock state with vacuum in a beam-splitter of transmissivity $\tau$ (i.e. a special case of the state $|\Psi_n\rangle$), must correspond to $\tau=0.5$. Finally, we consider an example of an adaptive technique: We consider a state of the form of $|\Psi_n\rangle$ for $n=1$. We start with a flat prior PDF, and for each subsequent step we use as prior PDF the posterior probability of the previous step, while for each step we update the optimal state and optimal measurement. We show our analysis for up to five steps, but one can allow the algorithm to run further. Finally, we conjecture the form the of the prior PDF and the optimal state for the infinite step and we calculate the corresponding MMSE., Comment: Comments are welcome

Multiple low-Earth orbit satellite constellations, aimed at beaming broadband connectivity from space, are currently under active deployment. While such space-based Internet is set to augment, globally, today's terrestrial connectivity, and has managed to generate significant hype, it has been largely difficult for the community to measure, quantify, or understand the nuances of these offerings in the absence of a global measurement infrastructure -- the research community has mostly resorted to simulators, emulators, and limited measurements till now. In this paper, we identify an opportunity to use the social media `lens' to complement such measurements and mine user-centric insights on the evolving ecosystem at scale., Comment: 11 Pages

Quantum networks are complex systems formed by the interaction among quantum processors through quantum channels. Analogous to classical computer networks, quantum networks allow for the distribution of quantum operations among quantum processors. In this work, we describe a Quantum Walk Control Protocol (QWCP) to perform distributed quantum operations in a quantum network. We consider a generalization of the discrete-time coined quantum walk model that accounts for the interaction between quantum walks in the network graph with quantum registers inside the network nodes. QWCP allows for the implementation of networked quantum services, such as distributed quantum computing and entanglement distribution, abstracting hardware implementation and the transmission of quantum information through channels. Multiple interacting quantum walks can be used to propagate entangled control signals across the network in parallel. We demonstrate how to use QWCP to perform distributed multi-qubit controlled gates, which shows the universality of the protocol for distributed quantum computing. Furthermore, we apply the QWCP to the task of entanglement distribution in a quantum network., Comment: 27 pages; 2 figures. A preliminary version of this work was presented at IEEE International Conference on Quantum Computing and Engineering 2021 (QCE21). arXiv admin note: text overlap with arXiv:2106.09839

We consider the problem of multi-path entanglement distribution to a pair of nodes in a quantum network consisting of devices with non-deterministic entanglement swapping capabilities. Multi-path entanglement distribution enables a network to establish end-to-end entangled links across any number of available paths with pre-established link-level entanglement. Probabilistic entanglement swapping, on the other hand, limits the amount of entanglement that is shared between the nodes; this is especially the case when, due to architectural and other practical constraints, swaps must be performed in temporal proximity to each other. Limiting our focus to the case where only bipartite entangled states are generated across the network, we cast the problem as an instance of generalized flow maximization between two quantum end nodes wishing to communicate. We propose a mixed-integer quadratically constrained program (MIQCP) to solve this flow problem for networks with arbitrary topology. We then compute the overall network capacity, defined as the maximum number of EPR states distributed to users per time unit, by solving the flow problem for all possible network states generated by probabilistic entangled link presence and absence, and subsequently by averaging over all network state capacities. The MIQCP can also be applied to networks with multiplexed links. While our approach for computing the overall network capacity has the undesirable property that the total number of states grows exponentially with link multiplexing capability, it nevertheless yields an exact solution that serves as an upper bound comparison basis for the throughput performance of easily-implementable yet non-optimal entanglement routing algorithms. We apply our capacity computation method to several networks, including a topology based on SURFnet -- a backbone network used for research purposes in the Netherlands.

We study entanglement generation in a quantum network where repeater nodes can perform $n$-qubit Greenberger-Horne-Zeilinger(GHZ) swaps, i.e., projective measurements, to fuse $n$ imperfect-Fidelity entangled-state fragments. We show that the distance-independent entanglement distribution rate found previously for this protocol, assuming perfectly-entangled states at the link level, does not survive. This is true also in two modified protocols we study: one that incorporates $l \to 1$ link-level distillation and another that spatially constrains the repeater nodes involved in the swaps. We obtain analytical formulas for a GHZ swap of multiple Werner states, which might be of independent interest. Whether the distance-independent entanglement rate might re-emerge with a spatio-temporally-optimized scheduling of GHZ swaps and multi-site block-distillation codes remains open., Comment: 25 pages, 12 figures

Electron spin states of solid-state defects such as Nitrogen- and Silicon-vacancy {\em color centers} in diamond are a leading quantum-memory candidate for quantum communications and computing. Via open-quantum-systems modeling of spin-phonon coupling -- the major contributor of decoherence -- at a given temperature, we derive the time dynamics of the density operator of an electron-spin qubit. We use our model to corroborate experimentally-measured decoherence rates. We further derive the temporal decay of distillable entanglement in spin-spin entangled states heralded via photonic Bell-state measurements. Extensions of our model to include other decoherence mechanisms, e.g., undesired hyperfine couplings to the neighboring nuclear-spin environment, will pave the way to a rigorous predictive model for engineering artificial-atom qubits with desirable properties., Comment: Main text: 9 pages, Appendix: 7 pages, 11 figures. Comments and feedback are welcome!

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., Comment: 27 pages, 7 figures

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.

Long distance quantum communication will require the use of quantum repeaters to overcome the exponential attenuation of signal with distance. One class of such repeaters utilizes quantum error correction to overcome losses in the communication channel. Here we propose a novel strategy of using the bosonic Gottesman-Kitaev-Preskill (GKP) code in a two-way repeater architecture with multiplexing. The crucial feature of the GKP code that we make use of is the fact that GKP qubits easily admit deterministic two-qubit gates, hence allowing for multiplexing without the need for generating large cluster states as required in previous all-photonic architectures based on discrete-variable codes. Moreover, alleviating the need for such clique-clusters entails that we are no longer limited to extraction of at most one end-to-end entangled pair from a single protocol run. In fact, thanks to the availability of the analog information generated during the measurements of the GKP qubits, we can design better entanglement swapping procedures in which we connect links based on their estimated quality. This enables us to use all the multiplexed links so that large number of links from a single protocol run can contribute to the generation of the end-to-end entanglement. We find that our architecture allows for high-rate end-to-end entanglement generation and is resilient to imperfections arising from finite squeezing in the GKP state preparation and homodyne detection inefficiency. In particular we show that long-distance quantum communication over more than 1000 km is possible even with less than 13 dB of GKP squeezing. We also quantify the number of GKP qubits needed for the implementation of our scheme and find that for good hardware parameters our scheme requires around $10^3-10^4$ GKP qubits per repeater per protocol run., Comment: v3 as published, 34 + 24 pages, 40 figures, corrected typos in some equations in Appendix G

A common way to entangle quantum memories is via photonic entanglement swaps. Each of two memories, connected by an optical channel, emits a photonic qubit entangled with itself, and the photonic qubits undergo an entanglement swap on a beamsplitter in the middle of the channel. We compare two choices of encoding of the photonic qubit: single rail and dual rail. At low channel loss the dual-rail scheme outperforms the single rail scheme. However, as expected, the high-loss rate asymptote for the dual rail scheme scales quadratically worse with loss compared with single rail. Considering the following non-idealities: imperfect mode matching at the swap, carrier-phase mismatch across the interfered photonic qubits, and detector excess noise, we evaluate the density operator of the heralded two-qubit entangled state. We calculate a lower bound on its distillable entanglement per copy, and its Fidelity (with the ideal Bell state). For both schemes, imperfect swap-visibility results in a constant-factor decrease in the rate, while excess noise results in a dropoff of distillable entanglement beyond a certain total channel loss threshold, to zero. Despite the single-rail scheme's better rate-loss scaling, it is more severely affected by excess noise. The single-rail scheme is adversely affected by stochastic carrier-phase mismatch, which does not affect the dual-rail scheme. We study entanglement distillation on the heralded noisy entangled states for both methods, and outline a suite of quantum networking studies that our work could incite., Comment: 8 pages and 9 figures (main text); 4 appendices with 8 figures; Comments are welcome!

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.

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., Comment: Submitted at Scientific Document Understanding Workshop, AAAI 2023

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., Comment: 7 pages

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.

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., Comment: 23 pages excluding appendices, 35 pages including appendices and bibliography. 33 figures. Work extending arXiv:2001.03934

We consider the problem of estimating unknown transmittance $\theta$ 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\'{e}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., Comment: Minor revision, 17 pages, 11 figures. in IEEE J. Sel. Top. Signal Process

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., Comment: 18 pages, 9 figures

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.

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., Comment: Published at Accessibility, Vision, and Autonomy Meet, CVPR 2022 Workshop

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 %.

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 $\eta$ 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{\eta})$. 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.

The fragile nature of quantum information makes it practically impossible to completely isolate a quantum state from noise under quantum channel transmissions. Quantum networks are complex systems formed by the interconnection of quantum processing devices through quantum channels. In this context, characterizing how channels introduce noise in transmitted quantum states is of paramount importance. Precise descriptions of the error distributions introduced by non-unitary quantum channels can inform quantum error correction protocols to tailor operations for the particular error model. In addition, characterizing such errors by monitoring the network with end-to-end measurements enables end-nodes to infer the status of network links. In this work, we address the end-to-end characterization of quantum channels in a quantum network by introducing the problem of Quantum Network Tomography. The solution for this problem is an estimator for the probabilities that define a Kraus decomposition for all quantum channels in the network, using measurements performed exclusively in the end-nodes. We study this problem in detail for the case of arbitrary star quantum networks with quantum channels described by a single Pauli operator, like bit-flip quantum channels. We provide solutions for such networks with polynomial sample complexity. Our solutions provide evidence that pre-shared entanglement brings advantages for estimation in terms of the identifiability of parameters., Comment: 11 pages, 2 figures

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., Comment: 19 pages, 12 figures

Recent technological advancements in satellite based quantum communication has made it a promising technology for realizing global scale quantum networks. Due to better loss distance scaling compared to ground based fiber communication, satellite quantum communication can distribute high quality quantum entanglements among ground stations that are geographically separated at very long distances. This work focuses on optimal distribution of bipartite entanglements to a set of pair of ground stations using a constellation of orbiting satellites. In particular, we characterize the optimal satellite-to-ground station transmission scheduling policy with respect to the aggregate entanglement distribution rate subject to various resource constraints at the satellites and ground stations. We cast the optimal transmission scheduling problem as an integer linear programming problem and solve it efficiently for some specific scenarios. Our framework can also be used as a benchmark tool to measure the performance of other potential transmission scheduling policies.