arXiv subjects

Paul M. Alsing

Publications and source records attributed to Paul M. Alsing.

At least 55 records · Page 3Linked to original sources

arXiv2023

Grover Search Inspired Alternating Operator Ansatz of Quantum Approximate Optimization Algorithm for Search Problems

We use the mapping between two computation frameworks , Adiabatic Grover Search (AGS) and Adiabatic Quantum Computing (AQC), to translate the Grover search algorithm into the AQC regime. We then apply Trotterization on the schedule-dependent Hamiltonian of AGS to obtain the values of variational parameters in the Quantum Approximate Optimization Algorithm (QAOA) framework. The goal is to carry the optimal behavior of Grover search algorithm into the QAOA framework without the iterative machine learning processes.

quant-ph↗

arXiv2023

Enhanced Hong-Ou-Mandel Manifolds and figures of merit for linear chains of identical micro-ring resonators

We present an exact analytic expression for the Hong-Ou-Mandel (HOM) curve for any number of identical Micro-Ring Resonators (MRRs) in a linear chain. We investigate the extreme stability of this HOM curve, showing that the HOM effect in linear arrays of MRRs is highly robust. We further use this expression to derive three figures of merit for the HOM curve of linear chains of MRRs: the minimum tau value ($τ_{c}$), the curvature ($\barξ_N$), and the $5\%$ tolerance in tau ($δτ_{N}$). We promote these metrics to characterize the pros and cons of various linear chains of MRRs and inform design and fabrication.

physics.optics↗

arXiv2023

Quantum Walk Inspired Dynamic Adiabatic Local Search

We investigate the irreconcilability issue that raises in translating the search algorithm from the Continuous-Time Quantum Walk (CTQW) framework to the Adiabatic Quantum Computing (AQC) framework. For the AQC formulation to evolve along the same path as the CTQW requires a constant energy gap in the former Hamiltonian throughout the AQC schedule. To resolve the issue, we modify the CTQW-inspired AQC catalyst Hamiltonian with a $Z$ oracle operator. Through simulation we demonstrate that the total running time for the proposed approach remains optimal. Inspired by this solution, we further investigate adaptive scheduling for the catalyst Hamiltonian and its coefficient function in the adiabatic path to improve the adiabatic local search.

quant-ph↗

arXiv2023

Bures and Sjoqvist Metrics over Thermal State Manifolds for Spin Qubits and Superconducting Flux Qubits

The interplay among differential geometry, statistical physics, and quantum information science has been increasingly gaining theoretical interest in recent years. In this paper, we present an explicit analysis of the Bures and Sjoqvist metrics over the manifolds of thermal states for specific spin qubit and the superconducting flux qubit Hamiltonian models. While the two metrics equally reduce to the Fubini-Study metric in the asymptotic limiting case of the inverse temperature approaching infinity for both Hamiltonian models, we observe that the two metrics are generally different when departing from the zero-temperature limit. In particular, we discuss this discrepancy in the case of the superconducting flux Hamiltonian model. We conclude the two metrics differ in the presence of a nonclassical behavior specified by the noncommutativity of neighboring mixed quantum states. Such a noncommutativity, in turn, is quantified by the two metrics in different manners. Finally, we briefly discuss possible observable consequences of this discrepancy between the two metrics when using them to predict critical and/or complex behavior of physical systems of interest in quantum information science.

quant-ph↗

arXiv2023

Physics Simulation Via Quantum Graph Neural Network

We develop and implement two realizations of quantum graph neural networks (QGNN), applied to the task of particle interaction simulation. The first QGNN is a speculative quantum-classical hybrid learning model that relies on the ability to directly utilize superposition states as classical information to propagate information between particles. The second is an implementable quantum-classical hybrid learning model that propagates particle information directly through the parameters of $RX$ rotation gates. A classical graph neural network (CGNN) is also trained in the same task. Both the Speculative QGNN and CGNN act as controls against the Implementable QGNN. Comparison between classical and quantum models is based on the loss value and accuracy of each model. Overall, each model had a high learning efficiency, in which the loss value rapidly approached zero during training; however, each model was moderately inaccurate. Comparing performances, our results show that the Implementable QGNN has a potential advantage over the CGNN. Additionally, we show that a slight alteration in hyperparameters in the CGNN notably improves accuracy, suggesting that further fine tuning could mitigate the issue of moderate inaccuracy in each model.

quant-ph↗

arXiv2023

Variational Amplitude Amplification for Solving QUBO Problems

We investigate the use of amplitude amplification on the gate-based model of quantum computing as a means for solving combinatorial optimization problems. This study focuses primarily on QUBO (quadratic unconstrained binary optimization) problems, which are well-suited for qubit superposition states. Specifically, we demonstrate circuit designs which encode QUBOs as `cost oracle' operations $U_{\textrm{C}}$, which when combined with the standard Grover diffusion operator $U_{\textrm{s}}$ lead to high probabilities of measurement for states corresponding to the optimal and near optimal solutions. In order to achieve these probabilities, a single scalar parameter $p_{\textrm{s}}$ is required, which we show can be found through a variational quantum-classical hybrid approach.

quant-ph↗

arXiv2022

Complexity of Pure and Mixed Qubit Geodesic Paths on Curved Manifolds

It is known that mixed quantum states are highly entropic states of imperfect knowledge (i.e., incomplete information) about a quantum system, while pure quantum states are states of perfect knowledge (i.e., complete information) with vanishing von Neumann entropy. In this paper, we propose an information geometric theoretical construct to describe and, to a certain extent, understand the complex behavior of evolutions of quantum systems in pure and mixed states. The comparative analysis is probabilistic in nature, it uses a complexity measure that relies on a temporal averaging procedure along with a long-time limit, and is limited to analyzing expected geodesic evolutions on the underlying manifolds. More specifically, we study the complexity of geodesic paths on the manifolds of single-qubit pure and mixed quantum states equipped with the Fubini-Study metric and the Sjoqvist metric, respectively. We analytically show that the evolution of mixed quantum states in the Bloch ball is more complex than the evolution of pure states on the Bloch sphere. We also verify that the ranking based on our proposed measure of complexity, a quantity that represents the asymptotic temporal behavior of an averaged volume of the region explored on the manifold during the evolution of the systems, agrees with the geodesic length-based ranking. Finally, focusing on geodesic lengths and curvature properties in manifolds of mixed quantum states, we observed a softening of the complexity on the Bures manifold compared to the Sjoqvist manifold.

quant-ph↗

arXiv2022

Resolution of 100 photons and quantum generation of unbiased random numbers

Macroscopic quantum phenomena, such as observed in superfluids and superconductors, have led to promising technological advancements and some of the most important tests of fundamental physics. At present, quantum detection of light is mostly relegated to the microscale, where avalanche photodiodes are very sensitive to distinguishing single-photon events from vacuum but cannot differentiate between larger photon-number events. Beyond this, the ability to perform measurements to resolve photon numbers is highly desirable for a variety of quantum information applications including computation, sensing, and cryptography. True photon-number resolving detectors do exist, but they are currently limited to the ability to resolve on the order of 10 photons, which is too small for several quantum state generation methods based on heralded detection. In this work, we extend photon measurement into the mesoscopic regime by implementing a detection scheme based on multiplexing highly quantum-efficient transition-edge sensors to accurately resolve photon numbers between zero and 100. We then demonstrate the use of our system by implementing a quantum random number generator with no inherent bias. This method is based on sampling a coherent state in the photon-number basis and is robust against environmental noise, phase and amplitude fluctuations in the laser, loss and detector inefficiency as well as eavesdropping. Beyond true random number generation, our detection scheme serves as a means to implement quantum measurement and engineering techniques valuable for photonic quantum information processing.

quant-ph↗

arXiv2022

Unconditional remote entanglement using second-harmonic generation and twin two-mode squeezed vacuum states

We propose a photonics-based, continuous-variable (CV) form of remote entanglement utilizing strictly second-order nonlinear optical interactions that does not require the implementation of a state-projective measurement (i.e. remote entanglement without conditioning). This scheme makes use of two separate down-converters, wherein the corresponding nonlinear crystals are driven by strong classical fields as prescribed by the parametric approximation, as well as a fully quantum mechanical model of nondegenerate second harmonic generation (SHG) whose evolution is described by the trilinear Hamiltonian of the form $\hat{H}_{\text{shg}} = i\hbarκ\big(\hat{a}\hat{b}\hat{c}^{\dagger} - \hat{a}^{\dagger}\hat{b}^{\dagger}\hat{c}\big)$. By driving the SHG process with the signal modes of the two down-converters, we show entanglement formation between the generated second-harmonic mode (SH-mode) and the non-interacting joint-idler subsystem without the need for any state-reductive measurements on the interacting modes.

quant-ph↗

arXiv2022

Negativity vs. Purity and Entropy in Witnessing Entanglement

In this work, we show that while all measures of mixedness may be used to witness entanglement, all such entangled states must have a negative partial transpose (NPT). Though computing the negativity of the partial transpose scales well at high dimension, it relies on knowing the complete quantum state, which does not. To address this, we compare different measures of mixedness over uniform ensembles of joint quantum states at varying dimension to gauge their relative success in witnessing entanglement. In doing so, we find that comparing joint and marginal purities is overwhelmingly more successful at high dimension at identifying entanglement than comparing joint and marginal von Neumann entropies, in spite of requiring fewer resources. We conclude by showing how our results impact the fundamental relationship between correlation and entanglement and related witnesses.

quant-ph↗

arXiv2022

Quantifying Tripartite Spatial and Energy-Time Entanglement in Nonlinear Optics

In this work, we provide a means to quantify genuine tripartite entanglement in arbitrary (pure and mixed) continuous-variable states as measured by the Tripartite Entanglement of formation -- a resource-based measure quantifying genuine multi-partite entanglement in units of elementary Greenberger-Horne-Zeilinger (GHZ) states called gebits. Furthermore, we predict its effectiveness in quantifying the tripartite spatial and energy-time entanglement in photon triplets generated in cascaded spontaneous parametric down-conversion (SPDC), and find that ordinary nonlinear optics can be a substantial resource of tripartite entanglement.

quant-ph↗

arXiv2022

Gaussian Amplitude Amplification for Quantum Pathfinding

We study an oracle operation, along with its circuit design, which combined with the Grover diffusion operator boosts the probability of finding minimum or maximum solutions on a weighted directed graph. We focus on a geometry of sequentially connected bipartite graphs, which naturally gives rise to solution spaces describable by gaussian distributions. We then demonstrate how an oracle which encodes these distributions can be used to solve for the optimal path via amplitude amplification. And finally, we explore the degree to which this algorithm is capable of solving cases which are generated using randomized weights, as well as a theoretical application for solving the Traveling Salesman problem.

quant-ph↗

arXiv2022

Optimal-speed unitary quantum time evolutions and propagation of light with maximal degree of coherence

It is recognized that Grover arrived at his original quantum search algorithm inspired by his comprehension of the interference of classical waves originating from an array of antennas. It is also known that quantum-mechanical characterization of electromagnetic radiation is isomorphic to the treatment of the orientation of a spin-1/2 particle. In this paper, motivated by Grover's original intuition and starting from this mathematical equivalence, we present a quantitative link between the geometry of time-independent optimal-speed Hamiltonian evolutions on the Bloch sphere and the geometry of intensity-preserving propagation of light with maximal degree of coherence on the Poincaré sphere. Finally, identifying interference as the fundamental physical ingredient underlying both physical phenomena, we propose that our work can provide in retrospect a quantitative geometric background underlying Grover's powerful intuition.

quant-ph↗

arXiv2022

The distribution of density matrices at fixed purity for arbitrary dimensions

We present marginal cumulative distribution functions (CDF) for density matrices $ρ$ of fixed purity $\tfrac{1}{N}\leμ_N(ρ)=\textrm{Tr}[ρ^2]\le 1$ for arbitrary dimension $N$. We give closed form analytic formulas for the cases $N=2$ (trivial), $N=3$ and $N=4$, and present a prescription for CDFs of higher arbitrary dimensions. These formulas allows one to uniformly sample density matrices at a user selected, fixed constant purity, and also detail how these density matrices are distributed nonlinearly in the range $μ_N(ρ)\in[\tfrac{1}{N}, 1]$. As an illustration of these formulas, we compare the logarithmic negativity and quantum discord to the (Wootter's) concurrence spanning a range of fixed purity values in $μ_4(ρ)\in[\tfrac{1}{4}, 1]$ for the case of $N=4$ (two qubits). We also investigate the distribution of eigenvalues of a reduced $N$-dimensional obtained by tracing out the reservoir of its higher-dimensional purification. Lastly, we numerically investigate a recently proposed complementary-quantum correlation conjecture which lower bounds the quantum mutual information of a bipartite system by the sum of classical mutual informations obtained from two pairs of mutually unbiased measurements. Finally, numerical implementation issues for the computation of the CDFs and inverse CDFs necessary for uniform sampling $ρ$ for fixed purity at very high dimension are briefly discussed.

quant-ph↗

arXiv2022

Quantum Computing Approaches for Mission Covering Optimization

We study quantum computing algorithms for solving certain constrained resource allocation problems we coin as Mission Covering Optimization (MCO). We compare formulations of constrained optimization problems using Quantum Annealing techniques and the Quantum Alternating Operator Ansatz (Hadfield et al. arXiv:1709.03489v2, a generalized algorithm of the Quantum Approximate Optimization Algorithm, Farhi et al. arXiv:1411.4028v1) on D-Wave and IBM machines respectively using the following metrics: cost, timing, constraints held, and qubits used. We provide results from two different MCO scenarios and analyze results.

quant-ph↗

arXiv2022

Complexity and efficiency of minimum entropy production probability paths from quantum dynamical evolutions

We present an information geometric characterization of quantum driving schemes specified by su(2;C) time-dependent Hamiltonians in terms of both complexity and efficiency concepts. By employing a minimum action principle, the optimum path connecting initial and final states on the manifold in finite-time is the geodesic path between the two states. In particular, the total entropy production that occurs during the transfer is minimized along these optimum paths. For each optimum path that emerges from the given quantum driving scheme, we evaluate the so-called information geometric complexity (IGC) and our newly proposed measure of entropic efficiency constructed in terms of the constant entropy production rates that specify the entropy minimizing paths being compared. From our analytical estimates of complexity and efficiency, we provide a relative ranking among the driving schemes being investigated. Finally, we conclude by commenting on the fact that an higher entropic speed in quantum transfer processes seems to necessarily go along with a lower entropic efficiency together with a higher information geometric complexity.

quant-ph↗

arXiv2022

Proposal for a quantum random number generator using coherent light an a non-classical observable

The prototype quantum random number (random bit) generators (QRNG) consists of one photon at a time falling on a $50:50$ beam splitter followed by random detection in one or the other other output beams due to the irreducible probabilistic nature of quantum mechanics. Due to the difficulties in producing single photons on demand, in practice, pulses of weak coherent (laser) light are used. In this paper we take a different approach, one that uses moderate coherent light. It is shown that a QRNG can be implemented by performing photon-number parity measurements. For moderate coherent light, the probabilities for obtaining even or odd parity in photon counts are $0.5$ each. Photon counting with single-photon resolution can be performed through use of a cascade of beam splitters and single-photon detectors as was done recently in a photon-number parity-based interferometry experiment involving coherent light.

quant-ph↗

arXiv2022

Extending the Hong-Ou-Mandel Effect: the power of nonclassicality

We show that the parity (evenness or oddness) of a nonclassical state of light has a dominant influence on the interference effects at a balanced beam splitter, irrespective of the state initially occupying the other input mode. Specifically, the parity of the nonclassical state gives rise to destructive interference effects that result in deep valleys in the output joint number distribution of which the Hong-Ou-Mandel (HOM) effect is a limiting case. The counter-intuitive influence of even a single photon to control the output of a beam splitter illuminated by any field, be it a coherent or even a noisy thermal field, demonstrates the extraordinary power of non-classicality. The canonical example of total destructive interference of quantum amplitudes leading to the absence of coincidence counts from a 50/50 beam splitter is the celebrated HOM effect, characterized by the vanishing of the joint probability of detecting singe photons in each of the output beams. We show that this is a limiting case of more general input states upon which a 50/50 BS can create total, or near total, destructive interference of quantum amplitudes. For odd photon number input Fock states of arbitrary value n>0 we show that the joint photon number probabilities vanish when detecting identical photon numbers in each output beams. We examine the mixing of photon number states of n = 1, 2, and 3 with a CV state, such as a coherent state of arbitrary amplitude, and a thermal state. These vanishing joint probabilities form what we call a central nodal line -- a contiguous set of zeros representing complete destructive interference of quantum amplitudes. For odd or even photon number Fock states with n>1 there will be additional off-diagonal pseudo-nodal curves along which the joint photon number probabilities are either zero, or near zero, which constitute a near, but not complete, destructive interference.

quant-ph↗