Searcharxiv⌕ Search

arXiv subjects

Jeffrey H. Shapiro

Publications and source records attributed to Jeffrey H. Shapiro.

At least 55 records · Page 3Linked to original sources
arXiv2017

Unity-Efficiency Parametric Down-Conversion via Amplitude Amplification

We propose an optical scheme, employing optical parametric down-converters interlaced with nonlinear sign gates (NSGs), that completely converts an $n$-photon Fock-state pump to $n$ signal-idler photon pairs when the down-converters' crystal lengths are chosen appropriately. The proof of this assertion relies on amplitude amplification, analogous to that employed in Grover search, applied to the full quantum dynamics of single-mode parametric down-conversion. When we require that all Grover iterations use the same crystal, and account for potential experimental limitations on crystal-length precision, our optimized conversion efficiencies reach unity for $1\le n \le 5$, after which they decrease monotonically for $n$ values up to 50, which is the upper limit of our numerical dynamics evaluations. Nevertheless, our conversion efficiencies remain higher than those for a conventional (no NSGs) down-converter.

quant-ph↗
arXiv2017

Efficient generation and spectral characterization of spectrally factorable biphotons

Spectrally unentangled biphotons with high single-spatiotemporal-mode purity are highly desirable for many quantum information processing tasks. We generate biphotons with an inferred heralded-state spectral purity of 99%, the highest to date without any spectral filtering, by pulsed spontaneous parametric downconversion in a custom-fabricated periodically-poled KTiOPO$_4$ crystal under extended Gaussian phase-matching conditions. To efficiently characterize the joint spectral intensity of the generated biphotons at high spectral resolution, we employ a commercially available dispersion compensation module (DCM) with a dispersion equivalent to 100 km of standard optical fiber and with an insertion loss of only 2.8 dB. Compared with the typical method of using two temperature-stabilized equal-length fibers that incurs an insertion loss of 20 dB per fiber, the DCM approach achieves high spectral resolution in a much shorter measurement time. Because the dispersion amount and center wavelengths of DCMs can be easily customized, spectral characterization in a wide range of quantum photonic applications should benefit significantly from this technique.

quant-ph↗
arXiv2017

Entanglement-enhanced Neyman-Pearson target detection using quantum illumination

Quantum illumination (QI) provides entanglement-based target detection---in an entanglement-breaking environment---whose performance is significantly better than that of optimum classical-illumination target detection. QI's performance advantage was established in a Bayesian setting with the target presumed equally likely to be absent or present and error probability employed as the performance metric. Radar theory, however, eschews that Bayesian approach, preferring the Neyman-Pearson performance criterion to avoid the difficulties of accurately assigning prior probabilities to target absence and presence and appropriate costs to false-alarm and miss errors. We have recently reported an architecture---based on sum-frequency generation (SFG) and feedforward (FF) processing---for minimum error-probability QI target detection with arbitrary prior probabilities for target absence and presence. In this paper, we use our results for FF-SFG reception to determine the receiver operating characteristic---detection probability versus false-alarm probability---for optimum QI target detection under the Neyman-Pearson criterion.

quant-ph↗
arXiv2016

Optimum mixed-state discrimination for noisy entanglement-enhanced sensing

Quantum metrology utilizes nonclassical resources, such as entanglement or squeezed light, to realize sensors whose performance exceeds that afforded by classical-state systems. Environmental loss and noise, however, easily destroy nonclassical resources, and thus nullify the performance advantages of most quantum-enhanced sensors. Quantum illumination (QI) is different. It is a robust entanglement-enhanced sensing scheme whose 6 dB performance advantage over a coherent-state sensor of the same average transmitted photon number survives the initial entanglement's eradication by loss and noise. Unfortunately, an implementation of the optimum quantum receiver that would reap QI's full performance advantage has remained elusive, owing to its having to deal with a huge number of very noisy optical modes. We show how sum-frequency generation (SFG) can be fruitfully applied to optimum multi-mode Gaussian-mixed-state discrimination. Applied to QI, our analysis and numerical evaluations demonstrate that our SFG receiver saturates QI's quantum Chernoff bound. Moreover, augmenting our SFG receiver with a feed-forward (FF) mechanism pushes its performance to the Helstrom bound in the limit of low signal brightness. The FF-SFG receiver thus opens the door to optimum quantum-enhanced imaging, radar detection, state and channel tomography, and communication in practical Gaussian-state situations.

quant-ph↗
arXiv2016

High-rate field demonstration of large-alphabet quantum key distribution

Quantum key distribution (QKD) exploits the quantum nature of light to share provably secure keys, allowing secure communication in the presence of an eavesdropper. The first QKD schemes used photons encoded in two states, such as polarization. Recently, much effort has turned to large-alphabet QKD schemes, which encode photons in high-dimensional basis states. Compared to binary-encoded QKD, large-alphabet schemes can encode more secure information per detected photon, boosting secure communication rates, and also provide increased resilience to noise and loss. High-dimensional encoding may also improve the efficiency of other quantum information processing tasks, such as performing Bell tests and implementing quantum gates. Here, we demonstrate a large-alphabet QKD protocol based on high-dimensional temporal encoding. We achieve record secret-key rates and perform the first field demonstration of large-alphabet QKD. This demonstrates a new, practical way to optimize secret-key rates and marks an important step towards transmission of high-dimensional quantum states in deployed networks.

quant-ph↗
arXiv2016

Finite-key analysis for time-energy high-dimensional quantum key distribution

Time-energy high-dimensional quantum key distribution (HD-QKD) leverages the high-dimensional nature of time-energy entangled biphotons and the loss tolerance of single-photon detection to achieve long-distance key distribution with high photon information efficiency. To date, the general-attack security of HD-QKD has only been proven in the asymptotic regime, while HD-QKD's finite-key security has only been established for a limited set of attacks. Here we fill this gap by providing a rigorous HD-QKD security proof for general attacks in the finite-key regime. Our proof relies on a novel entropic uncertainty relation that we derive for time and conjugate-time measurements using dispersive optics, and our analysis includes an efficient decoy-state protocol in its parameter estimation. We present numerically-evaluated secret-key rates illustrating the feasibility of secure and composable HD-QKD over metropolitan-area distances when the system is subjected to the most powerful eavesdropping attack.

quant-ph↗
arXiv2016

Floodlight Quantum Key Distribution: Demonstrating a New Framework for High-Rate Secure Communication

Floodlight quantum key distribution (FL-QKD) is a radically different QKD paradigm that can achieve Gbit/s secret-key rates over metropolitan area distances without multiplexing [Phys. Rev. A 94, 012322 (2016)]. It is a two-way protocol that transmits many photons per bit duration and employs a high-gain optical amplifier, neither of which can be utilized by existing QKD protocols to mitigate channel loss. FL-QKD uses an optical bandwidth that is substantially larger than the modulation rate and performs decoding with a unique broadband homodyne receiver. Essential to FL-QKD is Alice's injection of photons from a photon-pair source--in addition to the light used for key generation--into the light she sends to Bob. This injection enables Alice and Bob to quantify Eve's intrusion and thus secure FL-QKD against collective attacks. Our proof-of-concept experiment included 10 dB propagation loss--equivalent to 50 km of low-loss fiber--and achieved a 55 Mbit/s secret-key rate (SKR) for a 100 Mbit/s modulation rate, as compared to the state-of-the-art system's 1 Mbit/s SKR for a 1 Gbit/s modulation rate [Opt. Express 21, 24550-24565 (2013)], representing ~500-fold and ~50-fold improvements in secret-key efficiency (SKE) (bits per channel use) and SKR (bits per second), respectively.

quant-ph↗
arXiv2016

Quantum Key Distribution Using Multiple Gaussian Focused Beams

The secret key rate attained by a free-space QKD system in the {\em near-field} propagation regime (relevant for $1$-$10$ km range using $\approx 7$ cm radii transmit and receive apertures and $1.55~μ$m transmission center wavelenght) can benefit from the use of multiple spatial modes. A suite of theoretical research in recent years have suggested the use of orbital-angular-momentum (OAM) bearing spatial modes of light to obtain this improvement in rate. We show that most of the aforesaid rate improvement in the near field afforded by spatial-mode multiplexing can be realized by a simple-to-build overlapping Gaussian beam array (OGBA) and a pixelated detector array. With the current state-of-the-art in OAM-mode-sorting efficiencies, the key-rate performance of our OGBA architecture could come very close to, if not exceed, that of a system employing OAM modes, but at a fraction of the cost.

quant-ph↗
arXiv2016

Quantum-optimal detection of one-versus-two incoherent sources with arbitrary separation

We analyze the fundamental resolution of incoherent optical point sources from the perspective of a quantum detection problem: deciding whether the optical field on the image plane is generated by one source or two weaker sources with arbitrary separation. We investigate the detection performances of two measurement methods recently proposed by us to enhance the estimation of the separation. For the detection problem, we show that the method of binary spatial-mode demultiplexing is quantum-optimal for all values of separations, while the method of image-inversion interferometry is near-optimal for sub-Rayleigh separations. Unlike the proposal by Helstrom, our schemes do not require the separation to be given and can offer that information as a bonus in the event of a successful detection. For comparison, we also demonstrate the supremacy of our schemes over direct imaging for sub-Rayleigh separations. These results demonstrate that simple linear optical measurements can offer supremal performances for both detection and estimation.

quant-ph↗
arXiv2016

Attaining the quantum limit of passive imaging

We consider the problem, where a camera is tasked with determining one of two hypotheses: first with an incoherently-radiating quasi-monochromatic point source and the second with two identical closely spaced point sources. We are given that the total number of photons collected over an integration time is assumed to be the same under either hypothesis. For the one-source hypothesis, the source is taken to be on-axis along the line of sight and for the two-source hypothesis, we give ourselves the prior knowledge of the angular separation of the sources, and they are assumed to be identical and located symmetrically off-axis. This problem was studied by Helstrom in 1973, who evaluated the probability of error achievable using a sub-optimal optical measurement, with an unspecified structured realization. In this paper, we evaluate the quantum Chernoff bound, a lower bound on the minimum probability of error achievable by any physically-realizable receiver, which is exponentially tight in the regime that the integration time is high. We give an explicit structured receiver that separates three orthogonal spatial modes of the aperture field followed by quantum-noise-limited time-resolved photon measurement and show that this achieves the quantum Chernoff bound. In other words, the classical Chernoff bound of our mode-resolved detector exactly matches the quantum Chernoff bound for this problem. Finally, we evaluate the classical Chernoff bound on the error probability achievable using an ideal focal plane array---a signal shot-noise limited continuum photon-detection receiver with infinitely many infinitesimally-tiny pixels---and quantify its performance gap with the quantum limit.

quant-ph↗
arXiv2016

Experimental fast quantum random number generation using high-dimensional entanglement with entropy monitoring

A quantum random number generator (QRNG) generates genuine randomness from the intrinsic probabilistic nature of quantum mechanics. The central problems for most QRNGs are estimating the entropy of the genuine randomness and producing such randomness at high rates. Here we propose and demonstrate a proof-of-concept QRNG that operates at a high rate of 24 Mbit/s by means of a high-dimensional entanglement system, in which the user monitors the entropy in real time via the observation of a nonlocal quantum interference, without a detailed characterization of the devices. Our work provides an important approach to a robust QRNG with trusted but error-prone devices.

quant-ph↗
arXiv2016

Floodlight Quantum Key Distribution: A Practical Route to Gbps Secret-Key Rates

The channel loss incurred in long-distance transmission places a significant burden on quantum key distribution (QKD) systems: they must defeat a passive eavesdropper who detects all the light lost in the quantum channel and does so without disturbing the light that reaches the intended destination. The current QKD implementation with the highest long-distance secret-key rate meets this challenge by transmitting no more than one photon per bit [Opt. Express 21, 24550-24565 (2013)]. As a result, it cannot achieve the Gbps secret-key rate needed for one-time pad encryption of large data files unless an impractically large amount of multiplexing is employed. We introduce floodlight QKD (FL-QKD), which floods the quantum channel with a high number of photons per bit distributed over a much greater number of optical modes. FL-QKD offers security against the optimum frequency-domain collective attack by transmitting less than one photon per mode and using photon-coincidence channel monitoring, and it is completely immune to passive eavesdropping. More importantly, FL-QKD is capable of a 2 Gbps secret-key rate over a 50 km fiber link, without any multiplexing, using available equipment, i.e., no new technology need be developed. FL-QKD achieves this extraordinary secret-key rate by virtue of its unprecedented secret-key efficiency, in bits per channel use, which exceeds those of state-of-the-art systems by two orders of magnitude.

quant-ph↗
arXiv2016

Thinning, photonic beamsplitting, and a general discrete entropy power inequality

Many partially-successful attempts have been made to find the most natural discrete-variable version of Shannon's entropy power inequality (EPI). We develop an axiomatic framework from which we deduce the natural form of a discrete-variable EPI and an associated entropic monotonicity in a discrete-variable central limit theorem. In this discrete EPI, the geometric distribution, which has the maximum entropy among all discrete distributions with a given mean, assumes a role analogous to the Gaussian distribution in Shannon's EPI. The entropy power of $X$ is defined as the mean of a geometric random variable with entropy $H(X)$. The crux of our construction is a discrete-variable version of Lieb's scaled addition $X \boxplus_ηY$ of two discrete random variables $X$ and $Y$ with $η\in (0, 1)$. We discuss the relationship of our discrete EPI with recent work of Yu and Johnson who developed an EPI for a restricted class of random variables that have ultra-log-concave (ULC) distributions. Even though we leave open the proof of the aforesaid natural form of the discrete EPI, we show that this discrete EPI holds true for variables with arbitrary discrete distributions when the entropy power is redefined as $e^{H(X)}$ in analogy with the continuous version. Finally, we show that our conjectured discrete EPI is a special case of the yet-unproven Entropy Photon-number Inequality (EPnI), which assumes a role analogous to Shannon's EPI in capacity proofs for Gaussian bosonic (quantum) channels.

cs.IT↗
arXiv2016

Ultimate Capacity of a Linear Time-Invariant Bosonic Channel

We determine the ultimate classical information capacity of a linear time-invariant bosonic channel with additive phase-insensitive Gaussian noise. This channel can model fiber-optic communication at power levels below the threshold for significant nonlinear effects. We provide a general continuous-time result that gives the ultimate capacity for such a channel operating in the quasimonochromatic regime under an average power constraint. This ultimate capacity is compared with corresponding results for heterodyne and homodyne detection over the same channel.

quant-ph↗
arXiv2015

Ultrabroadband Quantum-Secured Communication

We propose a two-way secure-communication protocol in which Alice uses an amplified spontaneous emission source while Bob employs binary phase-shift keying and an optical amplifier. Against an eavesdropper who captures all the light lost in fibers linking Alice and Bob, this protocol is capable of 3.5 Gbps quantum-secured direct communication at 50 km range. If Alice augments her terminal with a spontaneous parametric downconverter and both Alice and Bob add channel monitors, they can realize 2 Gbps quantum key distribution at that range against an eavesdropper who injects her own light into Bob's terminal. Compared with prevailing quantum key distribution methods, this protocol has the potential to significantly increase secure key rates at long distances by employing many ultrabroadband photons per key bit to mitigate channel loss.

quant-ph↗
arXiv2015

Photon-efficient quantum cryptography with pulse-position modulation

The binary (one-bit-per-photon) encoding that most existing quantum key distribution (QKD) protocols employ puts a fundamental limit on their achievable key rates, especially under high channel loss conditions associated with long-distance fiber-optic or satellite-to-ground links. Inspired by the pulse-position-modulation (PPM) approach to photon-starved classical communications, we design and demonstrate the first PPM-QKD, whose security against collective attacks is established through continuous-variable entanglement measurements that also enable a novel decoy-state protocol performed conveniently in post processing. We achieve a throughput of 8.0 Mbit/s (2.5 Mbit/s for loss equivalent to 25 km of fiber) and secret-key capacity up to 4.0 bits per detected photon, thus demonstrating the significant enhancement afforded by high-dimensional encoding. These results point to a new avenue for realizing high-throughput satellite-based or long-haul fiber-optic quantum communications beyond their photon-reception-rate limits.

quant-ph↗
arXiv2015

Single-Photon Depth Imaging Using a Union-of-Subspaces Model

Light detection and ranging systems reconstruct scene depth from time-of-flight measurements. For low light-level depth imaging applications, such as remote sensing and robot vision, these systems use single-photon detectors that resolve individual photon arrivals. Even so, they must detect a large number of photons to mitigate Poisson shot noise and reject anomalous photon detections from background light. We introduce a novel framework for accurate depth imaging using a small number of detected photons in the presence of an unknown amount of background light that may vary spatially. It employs a Poisson observation model for the photon detections plus a union-of-subspaces constraint on the discrete-time flux from the scene at any single pixel. Together, they enable a greedy signal-pursuit algorithm to rapidly and simultaneously converge on accurate estimates of scene depth and background flux, without any assumptions on spatial correlations of the depth or background flux. Using experimental single-photon data, we demonstrate that our proposed framework recovers depth features with 1.7 cm absolute error, using 15 photons per image pixel and an illumination pulse with 6.7-cm scaled root-mean-square length. We also show that our framework outperforms the conventional pixelwise log-matched filtering, which is a computationally-efficient approximation to the maximum-likelihood solution, by a factor of 6.1 in absolute depth error.

stat.AP↗