arXiv subjects

Paul M. Alsing

Publications and source records attributed to Paul M. Alsing.

At least 91 records · Page 5Linked to original sources

arXiv2020

Information Geometry Aspects of Minimum Entropy Production Paths from Quantum Mechanical Evolutions

We present an information geometric analysis of entropic speeds and entropy production rates in geodesic evolution on manifolds of parametrized quantum states. These pure states emerge as outputs of suitable su(2; C) time-dependent Hamiltonian operators used to describe distinct types of analog quantum search schemes. The Riemannian metrization on the manifold is specified by the Fisher information evaluated along the parametrized squared probability amplitudes obtained from analysis of the temporal quantum mechanical evolution of a spin-1/2 particle in an external time-dependent magnetic field that specifies the su(2; C) Hamiltonian model. We employ a minimum action method to transfer a quantum system from an initial state to a final state on the manifold in a finite temporal interval. Furthermore, we demonstrate that the minimizing (optimum) path is the shortest (geodesic) path between the two states, and, in particular, minimizes also the total entropy production that occurs during the transfer. Finally, by evaluating the entropic speed and the total entropy production along the optimum transfer paths in a number of physical scenarios of interest in analog quantum search problems, we show in a clear quantitative manner that to a faster transfer there corresponds necessarily a higher entropy production rate. Thus, we conclude that lower entropic efficiency values appear to accompany higher entropic speed values in quantum transfer processes.

quant-ph↗

arXiv2019

Phase effects in coherently-stimulated down-conversion with a quantized pump field

We investigate the effect of the cumulative phase on the photon statistics of the three-mode state whose evolution is described by the trilinear Hamiltonian $\hat{H}_{I}=i\hbarκ\big(\hat{a}\hat{b}\hat{c}^{\dagger}-\hat{a}^{\dagger}\hat{b}^{\dagger}c\big)$, wherein the pump is taken to be quantized (and prepared in a coherent state) and the signal and idler modes are initially seeded with coherent states. We provide a brief review of the two-mode squeezed coherent states generated by non-degenerate coherently-stimulated parametric down-conversion, whereby the nonlinear crystal is driven by a strong classical field. The statistics of the resulting two mode state have been shown to depend greatly on the cumulative phase $Φ=θ_{s}+θ_{i}-2ϕ$ where $θ_{s\left(i\right)}$ are the signal(idler) coherent state phases and $2ϕ$ is the classical pump phase. Using perturbation theory, we analytically show for short times how the photon statistics and entanglement properties of the resultant state depends strictly on this phase combination. We also present numerical results of the relevant quantities to show the evolution of the three modes and provide a qualitative analysis of the steady state valid for long times.

quant-ph↗

arXiv2019

Continuous-time quantum search and time-dependent two-level quantum systems

It was recently emphasized by Byrnes, Forster, and Tessler [Phys. Rev. Lett. 120, 060501 (2018)] that the continuous-time formulation of Grover's quantum search algorithm can be intuitively understood in terms of Rabi oscillations between the source and the target subspaces. In this work, motivated by this insightful remark and starting from the consideration of a time-independent generalized quantum search Hamiltonian as originally introduced by Bae and Kwon [Phys. Rev. A 66, 012314 (2002)], we present a detailed investigation concerning the physical connection between quantum search Hamiltonians and exactly solvable time-dependent two-level quantum systems. Specifically, we compute in an exact analytical manner the transition probabilities from a source state to a target state in a number of physical scenarios specified by a spin-1/2 particle immersed in an external time-dependent magnetic field. In particular, we analyze both the periodic oscillatory as well as the monotonic temporal behaviors of such transition probabilities and, moreover, explore their analogy with characteristic features of Grover-like and fixed-point quantum search algorithms, respectively. Finally, we discuss from a physics standpoint the connection between the schedule of a search algorithm, in both adiabatic and nonadiabatic quantum mechanical evolutions, and the control fields in a time-dependent driving Hamiltonian.

quant-ph↗

arXiv2019

Theoretical analysis of a nearly optimal analog quantum search

We analyze the possibility of modifying the original Farhi-Gutmann Hamiltonian algorithm in order to speed up the procedure for producing a suitably distributed unknown normalized quantum mechanical state. Such a modification is feasible provided only a nearly optimal fidelity is sought. We propose to select the lower bounds of the nearly optimal fidelity values such that their deviations from unit fidelity are less than the minimum error probability characterizing the optimum ambiguous discrimination scheme between the two nonorthogonal quantum states yielding the chosen nearly optimal fidelity values. Departing from the working assumptions of perfect state overlap and uniform distribution of the target state on the unit sphere in N-dimensional complex Hilbert space, we determine that the modified algorithm can indeed outperform the original analog counterpart of a quantum search algorithm. This performance enhancement occurs in terms of speed for a convenient choice of both the ratio E'/E between the energy eigenvalues E' and E of the modified search Hamiltonian and the quantum mechanical overlap x between the source and the target states. Finally, we briefly discuss possible analytical improvements of our investigation together with its potential relevance in practical quantum engineering applications.

quant-ph↗

arXiv2019

Quantifying entanglement in a 68-billion dimensional quantum state space

Entanglement is the powerful and enigmatic resource central to quantum information processing, which promises capabilities in computing, simulation, secure communication, and metrology beyond what is possible for classical devices. Exactly quantifying the entanglement of an unknown system requires completely determining its quantum state, a task which demands an intractable number of measurements even for modestly-sized systems. Here we demonstrate a method for rigorously quantifying high-dimensional entanglement from extremely limited data. We improve an entropic, quantitative entanglement witness to operate directly on compressed experimental data acquired via an adaptive, multilevel sampling procedure. Only $6,456$ measurements are needed to certify an entanglement-of-formation of $7.11 \pm .04$ ebits shared by two spatially-entangled photons. With a Hilbert space exceeding 68 billion dimensions, we need $20$-million-times fewer measurements than the uncompressed approach and $10^{18}$-times fewer measurements than tomography. Our technique offers a universal method for quantifying entanglement in any large quantum system shared by two parties.

quant-ph↗

arXiv2019

The maximum advantage of quantum illumination

Discriminating between quantum states is a fundamental problem in quantum information protocols. The optimum approach saturates the Helstrom bound, which quantifies the unavoidable error probability of mistaking one state for another. Computing the error probability directly requires complete knowledge and diagonalization of the density matrices describing these states. Both of these fundamental requirements become impractically difficult to obtain as the dimension of the states grow large. In this article, we analyze quantum illumination as a quantum channel discrimination protocol and circumvent these issues by using the normalized Hilbert-Schmidt inner product as a measure of distinguishability. Using this measure, we show that the greatest advantage gained by quantum illumination over conventional illumination occurs when one uses a Bell state.

quant-ph↗

arXiv2019

Geometric Measures of Information for Quantum State Characterization

We analyze the geometry of a joint distribution over a set of discrete random variables. We briefly review Shannon's entropy, conditional entropy, mutual information and conditional mutual information. We review the entropic information distance formula of Rokhlin and Rajski. We then define an analogous information area. We motivate this definition and discuss its properties. We extend this definition to higher-dimensional volumes. We briefly discuss the potential utility for these geometric measures in quantum information processing.

quant-ph↗

arXiv2019

Properties of Quantum Reactivity for a Multipartite State

We discuss the properties of quantum state reactivity as a measure for quantum correlation. This information geometry-based definition is a generalization of the two qubit construction of Schumacher to multipartite quantum states. It requires a generalization of information distance to information areas as well as to higher-dimensional volumes. The reactivity is defined in the usual chemistry way as a ratio of surface area to volume. The reactivity is an average over all detector settings. We show that this measure posses the key features required for a measure of quantum correlation. We show that it is invariant under local unitary transformations, non-increasing under local operations and classical communication, and monotonic. Its maximum bound can't be obtained using only classical correlation. Furthermore, reactivity is an analytic function of measurement probabilities and easily extendable to higher multipartite states.

quant-ph↗

arXiv2019

Quantum Reactivity: A Measure of Quantum Correlation

Defining a robust measure of quantum correlation for multipartite states is an unresolved and challenging problem. Existing measures of quantum correlation are either not scalable or do not satisfy all the accepted properties of a measure of quantum correlation. We introduce a novel geometric measure of quantum correlation that we refer to as quantum reactivity. This measure is extendable to an arbitrary large number of qubits and satisfies the required properties of monotonicity and invariance under unitary operations. Our approach is based on generalization of Schumacher's singlet state triangle inequality that used an information geometry--based entropic distance. We define quantum reactivity as the familiar ratio of surface area to volume. To accomplish this, we use a generalization of information distance to area, volume and higher--dimensional volumes. We examine a spectrum of multipartite states (Werner, W, GHZ etc.) and demonstrate that the quantum reactivity measure is a monotonic function for quantum correlation which satisfies all the properties of a measure for quantum correlation, and provides an ordering of these quantum states as to their degree of correlation.

quant-ph↗

arXiv2019

A scalable Controlled NOT gate for linear optical computing using microring resonators

We propose a scalable version of a KLM CNOT gate based upon integrated waveguide microring resonators (MRR), vs the original KLM-approach using beam splitters (BS). The core element of our CNOT gate is a nonlinear phase-shift gate (NLPSG) using three MRRs, which we examine in detail. We find an expanded parameter space for the NLPSG over that of the conventional version. Whereas in all prior proposals for bulk optical realizations of the NLPSG the optimal operating point is precisely a single zero dimensional manifold within the parameter space of the device, we find conditions for effective transmission amplitudes which define a set of one dimensional manifolds in the parameters spaces of the MRRs. This allows for an unprecedented level flexibility in operation of the NLPSG that and allows for the fabrication of tunable MRR-based devices with high precision and low loss.

quant-ph↗

arXiv2019

Introduction to Coding Quantum Algorithms: A Tutorial Series Using Qiskit

As the field of Quantum Computing continues to grow, so too has the general public's interest in testing some of the publicly available quantum computers. However, many might find learning all of the supplementary information that goes into quantum algorithms to be a daunting task, and become discouraged. This tutorial is a series of lessons, aimed to teach the basics of quantum algorithms to those who may have little to no background in quantum physics and/or minimal knowledge of coding in python. Each lesson covers select physics/coding topics needed for writing quantum algorithms, eventually building up a toolset for tackling more and more challenging quantum algorithms. This tutorial series is designed to provide readers from any background with two services: 1) A concise and thorough understanding of some of the most popular/academically important quantum algorithms. 2) A fluent understanding of how to write code for quantum algorithms, using IBM's publicly available Qiskit.

quant-ph↗

arXiv2019

Introduction to Coding Quantum Algorithms: A Tutorial Series Using Pyquil

quant-ph↗

arXiv2018

Higher dimensional quantum communication in a curved spacetime: an efficient simulation of the propagation of the wavefront of a photon

A photon with a modulated wavefront can produce a quantum communication channel in a larger Hilbert space. For example, higher dimensional quantum key distribution (HD-QKD) can encode information in the transverse linear momentum (LM) or orbital angular momentum (OAM) modes of a photon. This is markedly different than using the intrinsic polarization of a photon. HD-QKD has advantages for free space QKD since it can increase the communication channelÕs tolerance to bit error rate (BER) while maintaining or increasing the channels bandwidth. We describe an efficient numerical simulation of the propagation photon with an arbitrary complex wavefront in a material with an isotropic but inhomogeneous index of refraction. We simulate the waveform propagation of an optical vortex in a volume holographic element in the paraxial approximation using an operator splitting method. We use this code to analyze an OAM volume-holographic sorter. Furthermore, there are analogue models of the evolution of a wavefront in the curved spacetime environs of the Earth that can be constructed using an optical medium with a given index of refraction. This can lead to a work-bench realization of a satellite HD-QKD system.

gr-qc↗

arXiv2018

Introduction to the Absolute Brightness and Number Statistics in Spontaneous Parametric Down-Conversion

As a tutorial, we examine the absolute brightness and number statistics of photon pairs generated in Spontaneous Parametric Down-Conversion (SPDC) from first principles. In doing so, we demonstrate how the diverse implementations of SPDC can be understood through a single common framework, and use this to derive straightforward formulas for the biphoton generation rate (pairs per second) in a variety of different circumstances. In particular, we consider the common cases of both collimated and focused gaussian pump beams in a bulk nonlinear crystal, as well as in nonlinear waveguides and micro-ring resonators. Furthermore, we examine the number statistics of down-converted light using a non-perturbative approximation (the multi-mode squeezed vacuum), to provide quantitative formulas for the relative likelihood of multi-pair production events, and explore how the quantum state of the pump affects the subsequent statistics of the downconverted light. Following this, we consider the limits of the undepleted pump approximation, and conclude by performing experiments to test the effectiveness of our theoretical predictions for the biphoton generation rate in a variety of different sources.

quant-ph↗

arXiv2018

Decrease of Fisher information and the information geometry of evolution equations for quantum mechanical probability amplitudes

The relevance of the concept of Fisher information is increasing in both statistical physics and quantum computing. From a statistical mechanical standpoint, the application of Fisher information in the kinetic theory of gases is characterized by its decrease along the solutions of the Boltzmann equation for Maxwellian molecules in the two-dimensional case. From a quantum mechanical standpoint, the output state in Grover's quantum search algorithm follows a geodesic path obtained from the Fubini-Study metric on the manifold of Hilbert-space rays. Additionally, Grover's algorithm is specified by constant Fisher information. In this paper, we present an information geometric characterization of the oscillatory or monotonic behavior of statistically parametrized squared probability amplitudes originating from special functional forms of the Fisher information function: constant, exponential decay, and power-law decay. Furthermore, for each case, we compute both the computational speed and the availability loss of the corresponding physical processes by exploiting a convenient Riemannian geometrization of useful thermodynamical concepts. Finally, we briefly comment on the possibility of using the proposed methods of information geometry to help identify a suitable trade-off between speed and thermodynamic efficiency in quantum search algorithms.

quant-ph↗

arXiv2017

Adiabatic Isometric Mapping Algorithm for Embedding 2-Surfaces in Euclidean 3-Space

Alexandrov proved that any simplicial complex homeomorphic to a sphere with strictly non-negative Gaussian curvature at each vertex can be isometrically embedded uniquely in $\mathbb{R}^3$ as a convex polyhedron. Due to the nonconstructive nature of his proof, there have yet to be any algorithms, that we know of, that realizes the Alexandrov embedding in polynomial time. Following his proof, we developed the adiabatic isometric mapping (AIM) algorithm. AIM uses a guided adiabatic pull-back procedure to produce "smooth" embeddings. Tests of AIM applied to two different polyhedral metrics suggests that its run time is sub cubic with respect to the number of vertices. Although Alexandrov's theorem specifically addresses the embedding of convex polyhedral metrics, we tested AIM on a broader class of polyhedral metrics that included regions of negative Gaussian curvature. One test was on a surface just outside the ergosphere of a Kerr black hole.

gr-qc↗

arXiv2017

A Realization of Thurstons Geometrization: Discrete Ricci Flow with Surgery

Hamilton's Ricci flow (RF) equations were recently expressed in terms of a sparsely-coupled system of autonomous first-order nonlinear differential equations for the edge lengths of a d-dimensional piecewise linear (PL) simplicial geometry. More recently, this system of discrete Ricci flow (DRF) equations was further simplified by explicitly constructing the Forman-Ricci tensor associated to each edge, thereby diagonalizing the first-order differential operator and avoiding the need to invert large sparse matrices at each time step. We recently showed analytically and numerically that these equations converge for axisymmetric 3-geometries to the corresponding continuum RF equations. We demonstrate here that these DRF equations yield an explicit numerical realization of Thurston's geometrization procedure for a discrete 3D axially-symmetric neckpinch geometry by using surgery to explicitly integrate through its Type-1 neck pinch singularity. A cubic-spline-based adaptive mesh was required to complete the evolution. Our numerically efficient simulations yield the expected Thurston decomposition of the sufficiently pinched axially symmetric geometry into its unique geometric structure -- a direct product of two lobes, each collapsing toward a 3-sphere geometry. The structure of our curvature may be used to better inform one of the vertex and edge weighting factors that appear in the Forman's expression of Ricci curvature on graphs.

math.DG↗

arXiv2017

Central Moment Analogues to Linear Optically Generated Cluster States

Two-mode squeezed states in the limit of small squeezing, Hong-Ou-Mandel interference and post selection on coincidence counts are some of the staples of linear quantum optics. We show that by using classical expectations on central moments of intensities, we can remove the requirement of small squeezing necessary for high fidelity coincidence detection. Utilizing existing techniques to probabilistically generate a cluster state, we construct a statistical analogue with deterministic generation at the cost of losing the ability to feed forward and requiring statistical averaging.

quant-ph↗