Quantum Physics Commons^™

Generating Entanglement With The Dynamical Lamb Effect, Mirko Amico

Dissertations, Theses, and Capstone Projects

According to quantum field theory, the vacuum is filled with virtual particles which can be turned into real ones under the influence of external perturbations. Phenomena of this kind are commonly referred to as quantum vacuum phenomena. Several quantum vacuum phenomena related to the peculiar nature of the quantum vacuum have been predicted, some of which, such as the Lamb shift and the Casimir effect, have been experimentally found. Other examples of quantum vacuum phenomena include the Unruh effect, the dynamical Casimir effect and the dynamical Lamb effect. The dynamical Lamb effect was first predicted by considering the situation of …

At The Interface Of Algebra And Statistics, Tai-Danae Bradley

Dissertations, Theses, and Capstone Projects

This thesis takes inspiration from quantum physics to investigate mathematical structure that lies at the interface of algebra and statistics. The starting point is a passage from classical probability theory to quantum probability theory. The quantum version of a probability distribution is a density operator, the quantum version of marginalizing is an operation called the partial trace, and the quantum version of a marginal probability distribution is a reduced density operator. Every joint probability distribution on a finite set can be modeled as a rank one density operator. By applying the partial trace, we obtain reduced density operators whose diagonals …

Quantum Random Walk Search And Grover's Algorithm - An Introduction And Neutral-Atom Approach, Anna Maria Houk

Physics

In the sub-field of quantum algorithms, physicists and computer scientist take classical computing algorithms and principles and see if there is a more efficient or faster approach implementable on a quantum computer, i.e. a ”quantum advantage”. We take random walks, a widely applicable group of classical algorithms, and move them into the quantum computing paradigm. Additionally, an introduction to a popular quantum search algorithm called Grover’s search is included to guide the reader to the development of a quantum search algorithm using quantum random walks. To close the gap between algorithm and hardware, we will look at using neutral-atom (also …

Small-X Qcd Calculations With A Biased Ensemble, Gary Kapilevich

Dissertations, Theses, and Capstone Projects

In this dissertation, I will argue that we can study functional fluctuations in unintegrated gluon distributions, in the MV model as well as JIMWLK, using reweighting techniques, which will allow me to calculate QCD observables with "biased ensembles". This technique will enable me to study rare functional configurations of the gluon distributions, that might have been selected for in, for example, the centrality criteria used by the ATLAS and ALICE collaborations. After a review of these techniques, as well as a review of QCD physics at high energy in general, I will use biased ensembles to compute observables in two …

Density Functional Theory Calculations Of Al Doped Hafnia For Different Crystal Symmetry Configurations, Joshua Steier

Seton Hall University Dissertations and Theses (ETDs)

Dogan et al.[1], investigated the causes of ferroelectricity in doped hafnia using ab initio methods. Similarly, we investigated the stability of Al doped hafnia using quantum mechanical methods.

There are many different phases of Hafnia: monoclinic, tetragonal, cubic and orthorhombic. Starting with the monoclinic phase of Hafnia, Hafnia undergoes phase transitions which result in different space groups. The temperature at which the tetragonal phase is induced is 2000 K and cubic phase is induced at 2900 K[1]. Different dielectric constants vary from phase to phase. The average dielectric constants are highest for the cubic and tetragonal phases. In order to …

Simulating Quantum Systems Using The D-Wave Quantum Computer, Justin M. Copenhaver, Raunaq Kumaran, Birgit Kaufmann, Adam Wasserman

Discovery Undergraduate Interdisciplinary Research Internship

No abstract provided.

On Quantum Effects Of Vector Potentials And Generalizations Of Functional Analysis, Ismael L. Paiva

Computational and Data Sciences (PhD) Dissertations

This is a dissertation in two parts. In the first one, the Aharonov-Bohm effect is investigated. It is shown that solenoids (or flux lines) can be seen as barriers for quantum charges. In particular, a charge can be trapped in a sector of a long cavity by two flux lines. Also, grids of flux lines can approximate the force associated with continuous two-dimensional distributions of magnetic fields. More, if it is assumed that the lines can be as close to each other as desirable, it is explained how the classical magnetic force can emerge from the Aharonov-Bohm effect. Continuing, the …

A Study Of Optical Nonlinearities At The Single-Photon Level For Quantum Logic, Balakrishnan Viswanathan

Graduate Theses and Dissertations

In this dissertation, we shall focus on theoretically studying quantum nonlinear optical schemes to construct a conditional phase gate at the single-photon level. With an aim to develop analytical models, we shall carry out a rigorous quantized multimode field analysis of some of these schemes involving only the interacting field operators. More specifically, we shall first study the three-wave mixing process involving two single-photons in a second-order nonlinear medium (x(2)) under two different cases viz. when the photons are traveling with equal velocities and when they are traveling with different velocities, and explore the possibility of using them for building …

An Overview Of Lasers And Their Applications, Luis Cristian Giovanni Guerrero

Physics

This paper is an overview of lasers and their applications. The fundamentals of laser operation are covered as well as the various applications of advanced laser systems. The primary focus is to highlight some of the technological advancements made possible by lasers in the last half-century.

Quantum Computing And Quantum Algorithms, Daniel Serban

Senior Honors Theses

The field of quantum computing and quantum algorithms is studied from the ground up. Qubits and their quantum-mechanical properties are discussed, followed by how they are transformed by quantum gates. From there, quantum algorithms are explored as well as the use of high-level quantum programming languages to implement them. One quantum algorithm is selected to be implemented in the Qiskit quantum programming language. The validity and success of the resulting computation is proven with matrix multiplication of the qubits and quantum gates involved.

Magnetic Forces In The Absence Of A Classical Magnetic Field, Ismael L. Paiva, Yakir Aharonov, Jeff Tollaksen, Mordecai Waegell

Mathematics, Physics, and Computer Science Faculty Articles and Research

It is shown that, in some cases, the effect of discrete distributions of flux lines in quantum mechanics can be associated with the effect of continuous distributions of magnetic fields with special symmetries. In particular, flux lines with an arbitrary value of magnetic flux can be used to create energetic barriers, which can be used to confine quantum systems in specially designed configurations. This generalizes a previous work where such energy barriers arose from flux lines with half-integer fluxons. Furthermore, it is shown how the Landau levels can be obtained from a two-dimensional grid of flux lines. These results suggest …

On Characterizing Quantum Processes And Detectors, Kevin Valson Jacob

LSU Doctoral Dissertations

In 2009, physicists at the National Institute of Standards and Technology in Colorado, Boulder developed what could arguable be called the first rudimentary quantum computer [1]. The past decade has seen unprecedented improvements in quantum information science culminating in the demonstration of quantum supremacy --- that quantum computers can solve problems that are impractical to be solved on the best supercomputers [2]. This remarkable progress necessitates the development of techniques to characterize the quantum devices that are being developed. In my thesis, I will focus on such devices that manipulate and detect light.

In Chapter 1, I will introduce the …

Limitations On Protecting Information Against Quantum Adversaries, Eneet Kaur

LSU Doctoral Dissertations

The aim of this thesis is to understand the fundamental limitations on secret key distillation in various settings of quantum key distribution. We first consider quantum steering, which is a resource for one-sided device-independent quantum key distribution. We introduce a conditional mutual information based quantifier for quantum steering, which we call intrinsic steerability. Next, we consider quantum non-locality, which is a resource for device-independent quantum key distribution. In this context, we introduce a quantifier, intrinsic non-locality, which is a monotone in the resource theory of Bell non-locality. Both these quantities are inspired by intrinsic information and squashed entanglement and are …

On Negative Eigenvalues Of The Discrete Schrödinger Operator With Non-Local Potential, Zahriddin Muminov, Shukhrat Lakaev

Bulletin of National University of Uzbekistan: Mathematics and Natural Sciences

On the d-dimensional lattice 𝕋^d, d= 1, 2 the discrete Schrödinger operator H_λµ with non-local potential constructed via the Dirac delta function and shift operator is considered. The dependency of negative eigenvalues of the operator on the parameters is explicitly derived.

Footprints Of Quantum Pigeons, Gregory Reznick, Shrobona Bagchi, Justin Dressel, Lev Vaidman

Mathematics, Physics, and Computer Science Faculty Articles and Research

We show that in the mathematical framework of the quantum theory, the classical pigeonhole principle can be violated more directly than previously suggested, i.e., in a setting closer to the traditional statement of the principle. We describe how the counterfactual reasoning of the paradox may be operationally grounded in the analysis of the tiny footprints left in the environment by the pigeons. After identifying the drawbacks of recent experiments of the quantum pigeonhole effect, we argue that a definitive experimental violation of the pigeonhole principle is still needed and propose such an implementation using modern quantum computing hardware: a superconducting …

The Breakup Of A Helium Cluster After Removing Attractive Interaction Among A Significant Number Of Atoms In The Cluster, Tao Pang

Physics & Astronomy Faculty Research

The breakup of a quantum liquid droplet is examined through a 4He cluster by removing the attractive tail in the interaction between some of the atoms in the system with the diffusion quantum Monte Carlo simulation. The ground-state energy, kinetic energy, cluster size, and density profile of the cluster are evaluated against the percentage of the atoms without the attractive tail. The condition for the cluster to lose its ability to form a quantum liquid droplet at zero temperature is found and analyzed. The cluster is no longer able to form a quantum liquid droplet when about two-thirds of pairs …

Novel Photon-Detector Models For Enhanced Quantum Information Processing, Elisha Siddiqui

LSU Doctoral Dissertations

This work is devoted to the development of novel photon-detector models at room temperature using quantum optics elements. This work comprises of two photon-number-resolving detector (PNRD) models, and the application of PNRD in LIDAR. The first model is based on using a two-mode squeezing device to resolve photon number at room temperature. In this model we study the average intensity-intensity correlations signal at the output of a two-mode squeezing device with |N> and |α> as the two input modes. We show that the input photon-number can be resolved from the average intensity-intensity correlations. In particular, we show jumps in the …

On The Complexity Of Boson Sampling Using Atoms In Optical Lattices, Gopikrishnan Muraleedharan

Physics & Astronomy ETDs

The extended Church-Turing thesis says that any computation that can be done by a physically realizable model of computers can be efficiently computed by the simplest model of classical computer, a Turing machine. Since the introduction of the concept of quantum computers, a central goal has been to find instances where the extended Church- Turing thesis fails. In the current noisy intermediate-scale quantum devices era, one looks for such instances that can be simulated on modest devices of small scale in the presence of noise. In this thesis, we work with one such problem, namely the Boson Sampling problem. We …

Reformulating Bell's Theorem: The Search For A Truly Local Quantum Theory, Mordecai Waegell, Kelvin J. Mcqueen

Philosophy Faculty Articles and Research

The apparent nonlocality of quantum theory has been a persistent concern. Einstein et al. (1935) and Bell (1964) emphasized the apparent nonlocality arising from entanglement correlations. While some interpretations embrace this nonlocality, modern variations of the Everett-inspired many worlds interpretation try to circumvent it. In this paper, we review Bell's “no-go” theorem and explain how it rests on three axioms, local causality, no superdeterminism, and one world. Although Bell is often taken to have shown that local causality is ruled out by the experimentally confirmed entanglement correlations, we make clear that it is the conjunction of the …

Solving Combinatorial Optimization Problems Using The Quantum Approximation Optimization Algorithm, Nicholas J. Guerrero

Theses and Dissertations

The Quantum Approximation Optimization Algorithm (QAOA) is one of the most promising applications for noisy intermediate-scale quantum machines due to the low number of qubits required as well as the relatively low gate count. Much work has been done on QAOA regarding algorithm implementation and development; less has been done checking how these algorithms actually perform on a real quantum computer. Using the IBM Q Network, several instances of combinatorial optimization problems (the max cut problem and dominating set problem) were implemented into QAOA and analyzed. It was found that only the smallest toy max cut algorithms performed adequately: those …