Quantum Physics Commons^™

Compilation Optimizations To Enhance Resilience Of Big Data Programs And Quantum Processors, Travis D. Lecompte

LSU Doctoral Dissertations

Modern computers can experience a variety of transient errors due to the surrounding environment, known as soft faults. Although the frequency of these faults is low enough to not be noticeable on personal computers, they become a considerable concern during large-scale distributed computations or systems in more vulnerable environments like satellites. These faults occur as a bit flip of some value in a register, operation, or memory during execution. They surface as either program crashes, hangs, or silent data corruption (SDC), each of which can waste time, money, and resources. Hardware methods, such as shielding or error correcting memory (ECM), …

Quantum Key Distribution Simulation Using Entangled Bell States, Nayana Tiwari

Physics

To communicate information securely, the sender and recipient of the information need to have a shared, secret key. Quantum key distribution (QKD) is a proposed method for this and takes advantage of the laws of quantum mechanics. The users, Alice and Bob, exchange quantum information in the form of entangled qubits over a quantum channel as well as exchanging measurement information over a classical channel. A successful QKD algorithm will ensure that when an eavesdropper has access to both the quantum and classical information channels, they cannot deduce the key, and they will be detected by the key generators. This …

Towards A Cross-Layer Coupled Design Framework For Big Data Workflows, Qianwen Ye

Dissertations

The processing and analysis of big data increasingly rely on workflow technologies for knowledge discovery and scientific innovation. The execution of such workflows goes far beyond the capability and capacity of single computers and is now commonly supported on reliable and scalable data storage and analysis platforms in distributed environments, such as the Hadoop ecosystem. Workflow performance largely depends on how big data systems are configured and used. For example, the makespan of a big data workflow is affected by multiple layers of big data systems, including the parallel computing engine it runs on, the resource manager that orchestrates various …

Hhl Algorithm On The Honeywell H1 Quantum Computer, Adrik B. Herbert, Eric A. F. Reinhardt

Discovery Undergraduate Interdisciplinary Research Internship

The quantum algorithm for linear systems of equations (HHL algorithm) provides an efficient tool for finding solutions to systems of functions with a large number of variables and low sensitivity to changes in inputs (i.e. low error rates). For complex problems, such as matrix inversion, HHL requires exponentially less computational time as compared with classical computation methods. HHL can be adapted to current quantum computing systems with limited numbers of qubits (quantum computation bits) but a high reusability rate such as the Honeywell H1 quantum computer. Some methods for improving HHL have been proposed through the combination of quantum and …

Point Cloud-Based Mapper For Qcd Analysis, Tareq Alghamdi, Yasir Alanazi, Manal Almaeen, Nobuo Sato, Yaohang Li

The Graduate School Posters

In many scientific applications, Inverse problems are challenging. An inverse problem is the process of inferring unknown parameters from observable ones. In this poster, we present our prototype using Point Cloud-based Variational Autoencoder mapping. Data that connects parameters to detector level events is used to train the proposed model. A point cloud is used to describe a series of events that keeps the permutation invariant property and geometric correlations of the events while being flexible with the number of events in the input. The trained Point Cloud-based Variational Autoencoder functions as an effective inverse function from detector level events to …

Attempts To Measure Nanosecond Resolved Electronic Dynamics Of Charge Density Wave Phase Transition In 1t-Tas2, Ben Campbell

Honors Theses and Capstones

Scanning tunneling microscopes allow for atomic spatial resolution but the resulting images are necessarily time-averaged and fast dynamics are lost. Pump-probe spectroscopy is a common optical technique used to measure ultrafast electronic dynamics but the integration of optical pump-probe spectroscopy into an STM requires specialized knowledge and equipment. Alternatively, an all-electronic pump-probe spectroscopy technique has recently been developed for use with an STM that replaces the laser pulses of optical pump-probe with voltage pulses. In this paper, I implemented an all-electronic pump-probe scheme into an existing scanning tunneling microscope using an arbitrary waveform generator and a lock-in amplifier. I developed …

Coupled Dynamics Of Spin Qubits In Optical Dipole Microtraps: Application To The Error Analysis Of A Rydberg-Blockade Gate, L. V. Gerasimov, R. R. Yusupov, A. D. Moiseevsky, I. Vybornyi, K. S. Tikhonov, S. P. Kulik, S. S. Straupe, Charles I. Sukenik, D. V. Kupriyanov

Physics Faculty Publications

Single atoms in dipole microtraps or optical tweezers have recently become a promising platform for quantum computing and simulation. Here we report a detailed theoretical analysis of the physics underlying an implementation of a Rydberg two-qubit gate in such a system—a cornerstone protocol in quantum computing with single atoms. We focus on a blockade-type entangling gate and consider various decoherence processes limiting its performance in a real system. We provide numerical estimates for the limits on fidelity of the maximally entangled states and predict the full process matrix corresponding to the noisy two-qubit gate. We consider different excitation geometries and …

Computer Program Simulation Of A Quantum Turing Machine With Circuit Model, Shixin Wu

Mathematical Sciences Technical Reports (MSTR)

Molina and Watrous present a variation of the method to simulate a quantum Turing machine employed in Yao’s 1995 publication “Quantum Circuit Complexity”. We use a computer program to implement their method with linear algebra and an additional unitary operator defined to complete the details. Their method is verified to be correct on a quantum Turing machine.

Modeling Of Argon Bombardment And Densification Of Low Temperature Organic Precursors Using Reactive Md Simulations And Machine Learning, Kwabena Asante-Boahen

Graduate Theses/Dissertations

In this study, an important aspect of the synthesis process for a-BxC:Hy was systematically modeled by utilizing the Reactive Molecular Dynamics (MD) in modeling the argon bombardment from the orthocarborane molecules as the precursor. The MD simulations are used to assess the dynamics associated with the free radicals that result from the ion bombardment. By applying the Data Mining/Machine Learning analysis into the datasets generated from the large reactive MD simulations, I was able to identify and quality the kinetics of these radicals. Overall, this approach allows for a better understanding of the overall mechanism at the atomistic level of …

Characterizing The Vibrational Spectra Of Hydrogen Bonded Systems With Molecular Dynamics Simulations And Quantum Chemical Methods, Dalton Boutwell

Master of Science in Chemical Sciences Theses

We apply and assess the utility of DMD for the purpose of investigating complex spectral features in N₂H⁺···OC, N₂D⁺···OC, C₂O₄H^-, C₂O₄D^- and (HCOOH)₂. The proton transfer as a vibrational motion consists of diffuse qualities that can be accounted for with classical and quantum chemical analyses. Classical approaches yield a wealth of information about vibrational spectra at a reduced cost, as in the case of previously investigated N₄H⁺. The isoelectronic N₂H⁺···OC has …

Solving Chromatic Number With Quantum Search And Quantum Counting, David Lutze

Master's Theses

This thesis presents a novel quantum algorithm that solves the Chromatic Number problem. Complexity analysis of this algorithm revealed a run time of O(2^n/2n²(log2n)²). This is an improvement over the best known algorithm, with a run time of 2ⁿn^O(1) [1]. This algorithm uses the Quantum Search algorithm (often called Grover's Algorithm), and the Quantum Counting algorithm. Chromatic Number is an example of an NP-Hard problem, which suggests that other NP-Hard problems can also benefit from a speed-up provided by quantum technology. This has wide implications as many real world problems can …

Implications Of The Quantum Dna Model For Information Sciences, F. Matthew Mihelic

Faculty Publications

The DNA molecule can be modeled as a quantum logic processor, and this model has been supported by pilot research that experimentally demonstrated non-local communication between cells in separated cell cultures. This modeling and pilot research have important implications for information sciences, providing a potential architecture for quantum computing that operates at room temperature and is scalable to millions of qubits, and including the potential for an entanglement communication system based upon the quantum DNA architecture. Such a system could be used to provide non-local quantum key distribution that could not be blocked by any shielding or water depth, would …

Quantum Simulation Of Schrödinger's Equation, Mohamed Eltohfa

Capstone and Graduation Projects

Quantum computing is one of the promising active areas in physics research. This is because of the potential of quantum algorithms to outperform their classical counterparts. Grover’s search algorithm has a quadratic speed-up compared to the classical linear search. The quantum simulation of Schrödinger’s equation has an exponential memory save-up compared to the classical simulation. In this thesis, the ideas and tools of quantum computing are reviewed. Grover’s algorithm is studied and simulated as an example. Using the Qiskit quantum computing library, a code to simulate Schrödinger’s equation for a particle in one dimension is developed, simulated locally, and run …

Quantum Computing For The Quantum Curious, Ciaran Hughes, Joshua Isaacson, Anastasia Perry, Ranbel F. Sun, Jessica Turner

Open Access Books and Manuals

This open access book makes quantum computing more accessible than ever before. A fast-growing field at the intersection of physics and computer science, quantum computing promises to have revolutionary capabilities far surpassing “classical” computation. Getting a grip on the science behind the hype can be tough: at its heart lies quantum mechanics, whose enigmatic concepts can be imposing for the novice.

This classroom-tested textbook uses simple language, minimal math, and plenty of examples to explain the three key principles behind quantum computers: superposition, quantum measurement, and entanglement. It then goes on to explain how this quantum world opens up a …

Understanding The Research And Applications Of Quantum Computing, Joshua Foss

Williams Honors College, Honors Research Projects

In-Depth research of current quantum computing understanding and practices. Presentation of possible new and creative applications of quantum computing.

Equations Of State For Warm Dense Carbon From Quantum Espresso, Derek J. Schauss

Theses and Dissertations

Warm dense plasma is the matter that exists, roughly, in the range of 10,000 to 10,000,000 Kelvin and has solid-like densities, typically between 0.1 and 10 grams per centimeter. Warm dense fluids like hydrogen, helium, and carbon are believed to make up the interiors of many planets, white dwarfs, and other stars in our universe. The existence of warm dense matter (WDM) on Earth, however, is very rare, as it can only be created with high-energy sources like a nuclear explosion. In such an event, theoretical and computational models that accurately predict the response of certain materials are thus very …

Exploring Information For Quantum Machine Learning Models, Michael Telahun

Electronic Theses and Dissertations

Quantum computing performs calculations by using physical phenomena and quantum mechanics principles to solve problems. This form of computation theoretically has been shown to provide speed ups to some problems of modern-day processing. With much anticipation the utilization of quantum phenomena in the field of Machine Learning has become apparent. The work here develops models from two software frameworks: TensorFlow Quantum (TFQ) and PennyLane for machine learning purposes. Both developed models utilize an information encoding technique amplitude encoding for preparation of states in a quantum learning model. This thesis explores both the capacity for amplitude encoding to provide enriched state …

An Update On The Computational Theory Of Hamiltonian Period Functions, Bradley Joseph Klee

Graduate Theses and Dissertations

Lately, state-of-the-art calculation in both physics and mathematics has expanded to include the field of symbolic computing. The technical content of this dissertation centers on a few Creative Telescoping algorithms of our own design (Mathematica implementations are given as a supplement). These algorithms automate analysis of integral period functions at a level of difficulty and detail far beyond what is possible using only pencil and paper (unless, perhaps, you happen to have savant-level mental acuity). We can then optimize analysis in classical physics by using the algorithms to calculate Hamiltonian period functions as solutions to ordinary differential equations. The simple …

Machine Learning Corrected Quantum Dynamics Calculations, A. Jasinski, J. Montaner, R. C. Forrey, B. H. Yang, P. C. Stancil, Naduvalath Balakrishnan, J. Dai, A. Vargas-Hernandez, R. V. Krems

Chemistry and Biochemistry Faculty Research

Quantum scattering calculations for all but low-dimensional systems at low energies must rely on approximations. All approximations introduce errors. The impact of these errors is often difficult to assess because they depend on the Hamiltonian parameters and the particular observable under study. Here, we illustrate a general, system- and approximation-independent, approach to improve the accuracy of quantum dynamics approximations. The method is based on a Bayesian machine learning (BML) algorithm that is trained by a small number of exact results and a large number of approximate calculations, resulting in ML models that can generalize exact quantum results to different dynamical …

Qwasi: The Quantum Walk Simulator, Warren V. Wilson

Theses and Dissertations

As quantum computing continues to evolve, the ability to design and analyze novel quantum algorithms becomes a necessary focus for research. In many instances, the virtues of quantum algorithms only become evident when compared to their classical counterparts, so a study of the former often begins with a consideration of the latter. This is very much the case with quantum walk algorithms, as the success of random walks and their many, varied applications have inspired much interest in quantum correlates. Unfortunately, finding purely algebraic solutions for quantum walks is an elusive endeavor. At best, and when solvable, they require simple …

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 …

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.

Sparsity And Weak Supervision In Quantum Machine Learning, Seyran Saeedi

Theses and Dissertations

Quantum computing is an interdisciplinary field at the intersection of computer science, mathematics, and physics that studies information processing tasks on a quantum computer. A quantum computer is a device whose operations are governed by the laws of quantum mechanics. As building quantum computers is nearing the era of commercialization and quantum supremacy, it is essential to think of potential applications that we might benefit from. Among many applications of quantum computation, one of the emerging fields is quantum machine learning. We focus on predictive models for binary classification and variants of Support Vector Machines that we expect to be …

Quantum Algorithms With Applications To Simulating Physical Systems, Anirban Ch Narayan Chowdhury

Physics & Astronomy ETDs

The simulation of quantum physical systems is expected to be an important application for quantum computers. The work presented in this dissertation aims to improve the resource requirements of quantum computers for solving simulation problems, by providing both novel quantum algorithms and improved implementations of existing ones. I present three main results that cover diverse aspects of simulation including equilibrium physics, the preparation of useful quantum states, and simulations based on classical stochastic processes. The results rely on established quantum algorithms and other recent techniques which I review. My first original contribution is a new quantum algorithm to sample from …

Comparisons Of Performance Between Quantum And Classical Machine Learning, Christopher Havenstein, Damarcus Thomas, Swami Chandrasekaran

SMU Data Science Review

In this paper, we present a performance comparison of machine learning algorithms executed on traditional and quantum computers. Quantum computing has potential of achieving incredible results for certain types of problems, and we explore if it can be applied to machine learning. First, we identified quantum machine learning algorithms with reproducible code and had classical machine learning counterparts. Then, we found relevant data sets with which we tested the comparable quantum and classical machine learning algorithm's performance. We evaluated performance with algorithm execution time and accuracy. We found that quantum variational support vector machines in some cases had higher accuracy …

Sampling Complexity Of Bosonic Random Walkers On A One-Dimensional Lattice, Gopikrishnan Muraleedharan, Akimasa Miyake, Ivan Deutsch

Shared Knowledge Conference

Computers based quantum logic are believed to solve problems faster and more efficiently than computers based on classical boolean logic. However, a large-scale universal quantum computer with error correction may not be realized in near future. But we can ask the question: can we devise a specific problem that a quantum device can solve faster than current state of the art super computers? One such problem is the so called "Boson Sampling" problem introduced by Aaronson and Arkhipov. The problem is to generate random numbers according to same distribution as the output number configurations of photons in linear optics. It …

Bipartite Quantum Interactions: Entangling And Information Processing Abilities, Siddhartha Das

LSU Doctoral Dissertations

The aim of this thesis is to advance the theory behind quantum information processing tasks, by deriving fundamental limits on bipartite quantum interactions and dynamics. A bipartite quantum interaction corresponds to an underlying Hamiltonian that governs the physical transformation of a two-body open quantum system. Under such an interaction, the physical transformation of a bipartite quantum system is considered in the presence of a bath, which may be inaccessible to an observer. The goal is to determine entangling abilities of such arbitrary bipartite quantum interactions. Doing so provides fundamental limitations on information processing tasks, including entanglement distillation and secret key …

Entropic Bounds On Two-Way Assisted Secret-Key Agreement Capacities Of Quantum Channels, Noah Anthony Davis

LSU Doctoral Dissertations

In order to efficiently put quantum technologies into action, we must know the characteristics of the underlying quantum systems and effects. An interesting example is the use of the secret-key-agreement capacity of a quantum channel as a guide and measure for the implementation of quantum key distribution (QKD) and distributed quantum computation. We define the communication task of establishing a secret key over a quantum channel subject to an energy constraint on the input state and while allowing for unlimited local operations and classical communication (LOCC) between a sender and receiver. We then use the energy-constrained squashed entanglement to bound …

Combinatorial Algorithms For Perturbation Theory And Application On Quantum Computing, Yudong Cao

Open Access Dissertations

Quantum computing is an emerging area between computer science and physics. Numerous problems in quantum computing involve quantum many-body interactions. This dissertation concerns the problem of simulating arbitrary quantum many-body interactions using realistic two-body interactions. To address this issue, a general class of techniques called perturbative reductions (or perturbative gadgets) is adopted from quantum complexity theory and in this dissertation these techniques are improved for experimental considerations. The idea of perturbative reduction is based on the mathematical machinery of perturbation theory in quantum physics. A central theme of this dissertation is then to analyze the combinatorial structure of the perturbation …

Computational Progress Towards Maximum Distinguishability Of Bell States By Linear Evolution And Local Measurement, Victor Shang

HMC Senior Theses

Many quantum information protocols rely on the ability to distinguish between entangled quantum states known as Bell states. However, theoretical limits exist on the maximal distinguishability of these entangled states using linear evolution and local measurement (LELM) devices. In the case of two particles entangled in multiple qubit variables, the maximum number of distinguishable Bell states is known. However, in the more general case of two particles entangled in multiple qudit variables, only an upper bound is known under additional assumptions. I have written software in Matlab and Mathematica to explore computationally the maximum number of Bell states that can …