Quantum Physics Commons^™

Machine Learning-Based Regression For Magnetic Field Prediction From Odmr Spectral Data, Jesse B. Hernandez

Electronic Theses, Projects, and Dissertations

Optically Detected Magnetic Resonance (ODMR) using nitrogen-vacancy (NV) centers in diamond enables sensitive, room-temperature magnetic field sensing, but real ODMR spectra are often noisy and difficult to analyze with traditional peak-fitting methods. This thesis investigates whether machine learning can reliably predict magnetic field strength directly from ODMR spectra, and compares four model families under a single regression task: a random forest, an artificial neural network (ANN), a one-dimensional convolutional neural network (1D-CNN), and a Transformer.

Training data were generated from an NV-ensemble simulation calibrated to real measurements provided by the Ulsan National Institute of Science and Technology (UNIST), spanning 0 …

Optimization Of Niobium Film For Particle Accelerators And Quantum Applications, Bektur Abdisatarov

Electrical & Computer Engineering Theses & Dissertations

Niobium (Nb) films play a central role in superconducting technologies used in particle accelerators and superconducting quantum circuits. Optimizing the physical properties of Nb films is therefore critical for improving both radiofrequency (RF) performance in superconducting radiofrequency (SRF) cavities and coherence in superconducting qubits. This thesis investigates the relationship between Nb film microstructure, impurity content, and electromagnetic response across these two application domains.

For particle accelerator applications, we studied Nb films deposited using high-power impulse magnetron sputtering (HiPIMS) with DC bias onto a 1.3 GHz elliptical SRF cavity. Nb film cavities exhibit a pronounced medium-field Q-slope, limiting their achievable accelerating …

Basis Design For Electronic Structure And Beyond, Weishi Wang

Dartmouth College Ph.D Dissertations

At the intersection of quantum physics, quantum chemistry, and materials science, electronic structure is the study of electrons in solid-state and molecular systems. Electronic-structure computation relies on discretizing the many-electron Hamiltonian with a finite single-particle basis set. However, basis-set construction is conventionally treated as an ad hoc preprocessing step. This thesis develops an expressive and flexible framework for active, system-oriented basis-set design and numerical modeling strategies that treat basis functions as tunable representations to encode electronic ground-state information.

We first introduce a multi-layered, differentiable basis-construction framework that embeds a set of primitive parameters into mixed-contracted Gaussian-type orbitals. We then develop …

Trigonometric Continuous-Variable Gates And Hybrid Quantum Simulations Of The Sine-Gordon Model, Tommaso Rainaldi, Victor Ale, Matt Grau, Dmitri Kharzeev, Enrique Rico, Felix Ringer, Pubasha Shome, George Siopsis

Physics Faculty Publications

Hybrid qubit-qumode quantum computing platforms provide a natural setting for simulating interacting bosonic quantum field theories. However, existing continuous-variable gate constructions rely predominantly on polynomial functions of canonical quadratures. In this work, we introduce a complementary universality paradigm based on trigonometric continuous-variable gates, which enable a Fourier-like representation of bosonic operators and are particularly well suited for periodic and non-perturbative interactions. We present an ancilla-based framework for implementing trigonometric gates with arguments given by arbitrary Hermitian functions of qumode quadratures. The protocol yields unitary gates deterministically, and non-unitary gates through probabilistic post-selection. As a concrete application, we develop a hybrid …

Establishing Convergence Thresholds For Pre-Trajectory Sampling With Batched Execution Across Random Quantum Circuits, Taylor L. Eskew, Jerome F. Gonthier, Taylor L. Patti, Andrew N. Jordan

Student Scholar Symposium Abstracts and Posters

A crucial aspect of validating quantum protocols is understanding the noise produced by quantum computing devices. Using simulations that can replicate this noise allows for a lower-cost alternative to hardware experiments. Stochastic, so-called "trajectory" methods are often used as a quadratically reduced approximation to density matrix simulations, but traditional implementations have limited sampling capacity and provide no error-based metadata. The Pre-Trajectory Sampling with Batched Execution (PTSBE) [Patti et al., 2025] algorithm provides a solution by combining fine-tuned, well-documented noise sampling with computational intermediate caching.

While the original work is effective on quantum error correction circuits, its performance on general circuits …

Simulating Chemiluminescence Spectra Of Oh Radical Using Quantum Dynamical Simulations, Triet M. Cao

Research from the Berry Summer Thesis Institute, 2025

Chemiluminescence is a phenomenon of light emission that occurs when molecules transition from an excited state to the ground state. This phenomenon is widely utilized in applications ranging from quantifying product yields in chemical reactions to biological imaging and atmospheric chemistry studies. It has also been used in many crucial applications in the scarce conditions of heat and electricity, such as light sources for astronomy discovery or deep-sea diving. A notable example of such reactions is combustion, where highly reactive hydroxyl radicals (OH) are products. These radicals exhibit a chemiluminescence spectrum because of the interaction between their ground state and …

Basic Theory And Implementations Of Quantum Error Correction, Derek Rodriguez

Undergraduate Theses, Capstones, and Recitals

The introduction of quantum computing has presented algorithmic solutions to computationally difficult challenges that are far more efficient than those of classical computers. These algorithms leverage the properties of quantum mechanics to manipulate the quantum properties of subatomic particles, requiring immense precision and stability. Current quantum hardware, however, is too noisy and introduces too many errors for these algorithms to be useful in practice, necessitating the use of error correction algorithms. This field survey seeks to introduce various principles of quantum mechanics relevant to quantum computing and quantum error correction (QEC), detail the implementation and motivations of a basic QEC …

Data Encoding, Compilation, And Algorithms For Quantum Machine Learning, Aviraj Sinha

Computer Science and Engineering Theses and Dissertations

Quantum computing enables new approaches to data processing, especially in quantum machine learning. Unlike classical systems, quantum data must be synthesized through operations and can exist in superposition. Encoding choices affect efficiency, noise resilience, and trainability—key factors in quantum machine learning models. This dissertation enhances quantum data encodings by extending quantum read-only memory (QROM) beyond binary representations, improving efficiency and parallelism. It introduces new compilation methods for quantum random number generators (QRNGs), supporting non-parametric distributions for post-quantum cryptography. Additionally, it explores Cayley graph-based encodings to extract spectral features for quantum machine learning.

Noise-Embedded Image Processing Based On Quantum Data Encodings, Yayu Mo

Multidisciplinary Studies Theses and Dissertations

Advancements in quantum information have significantly impacted the field of image processing, although challenges remain. Especially in the edge detection and image encoding area, distorted feature and noises would affect the further classification or super resolution tasks. In our work, we conduct researches on two stages to both evaluate the potential of Quantum-based Convolutional Structure in extracting distorted feature and further explore the effects of quantum noise channels on quantum image encodings.

In the first stage, we propose a method to extract distorted edge features by applying shallow layers in quantum convolutional neural networks (QCNN). By combining the advantages of …

32 - Nested Two Level Decomposition For Quantum Computing, Andrew Maciejunes, John Stenger, Dan Gunlycke, Nikos Chrisochoides

Undergraduate Research Symposium

Abstract—We present a two-level decomposition strategy for solving the Vehicle Routing Problem (VRP) using the Quantum Approximate Optimization Algorithm (QAOA). A Problem-Level Decomposition (PLD) partitions a 9-node (72-qubit) VRP into smaller Traveling Salesman Problem (TSP) instances. Each TSP is then further simplified via Circuit-Level Decomposition (CLD), enabling execution on near-term quantum devices. Our approach achieves up to 90% reductions in circuit depth and qubit count. These results demonstrate the feasibility of solving VRPs previously too complex for quantum simulators and provide early evidence of potential quantum utility.

Further Results On Learning Quantum Measurement Classes: Quantum Pac Model For Povm Hypothesis Classes, Arka Prabha Das

Electronic Theses & Dissertations (2024 - present)

This thesis investigates the problem of learning from quantum systems, where each example consists of a quantum state paired with a classical outcome. The task centers on choosing an effective measurement rule from a fixed set to enable accurate prediction of the classical outcome from the quantum state. A central focus lies in understanding whether joint measurement strategies that cannot be separated into local operations offer a real benefit in terms of the number of examples needed for successful learning. We examine conditions under which a non-separable measurement within a given hypothesis class achieves strictly better sample complexity bounds compared …

Predicting Chaotic Systems With Quantum Echo-State Networks, Erik Connerty, Ethan N. Evans, Gerasimos Angelatos, Vignesh Narayanan

Publications

Recent advancements in artificial neural networks have enabled impressive tasks on classical computers, but they demand significant computational resources. While quantum computing offers potential beyond classical systems, the advantages of quantum neural networks (QNNs) remain largely unexplored. In this work, we present and examine a quantum circuit (QC) that implements and aims to improve upon the classical echo-state network (ESN), a type of reservoir-based recurrent neural networks (RNNs), using quantum computers. Typically, ESNs consist of an extremely large reservoir that learns high-dimensional embeddings, enabling prediction of complex system trajectories. Quantum echo-state networks (QESNs) aim to reduce this need for prohibitively …

Quantum Visual Feature Encoding Revisited, Xuan-Bac Nguyen, Hoang-Quan Nguyen, Hugh Churchill, Samee U. Khan, Khoa Luu

Computer Science and Computer Engineering Faculty Publications and Presentations

Although quantum machine learning has been introduced for a while, its applications in computer vision are still limited. This paper, therefore, revisits the quantum visual encoding strategies, the initial step in quantum machine learning. Investigating the root cause, we uncover that the existing quantum encoding design fails to ensure information preservation of the visual features after the encoding process, thus complicating the learning process of the quantum machine learning models. In particular, the problem, termed the “Quantum Information Gap” (QIG), leads to an information gap between classical and corresponding quantum features. We provide theoretical proof and practical examples with visualization …

An Introduction To The Time-Independent Schrödinger Equation And Methods To Solve It, Vu Giang, Alex Gnech

OUR Journal: ODU Undergraduate Research Journal

The Time-Independent Schrödinger Equation is a linear elliptic PDE that describes quantum-mechanical systems. Its significance in the science of submicroscopic phenomena, particularly quantum mechanics, is as central as Newton’s laws of motion are to classical mechanics. This study uses various methods, including novel neural networks and finite difference schemes, to solve the one-dimensional two-body equation.

Design Of Long-Distance Entanglement Distribution Protocols For Quantum Networks, Stav Haldar

LSU Doctoral Dissertations

Future quantum technologies such as quantum communication, quantum sensing, and distributed quantum computation, will rely on networks of shared entanglement between spatially separated nodes. Distributing entanglement between these nodes, especially over long distances, currently remains a challenge, due to limitations resulting from the fragility of quantum systems, such as photon losses, non-ideal measurements, and quantum memories with short coherence times. In the absence of full-scale fault-tolerant quantum error correction, which can in principle overcome these limitations, we should understand the extent to which we can circumvent these limitations. In this work, we provide improved protocols and policies for entanglement distribution …

Learning, Optimizing, And Simulating Fermions With Quantum Computers, Andrew Zhao

Physics & Astronomy ETDs

Fermions are fundamental particles which obey seemingly bizarre quantum-mechanical principles, yet constitute all the ordinary matter that we inhabit. As such, their study is heavily motivated from both fundamental and practical incentives. In this dissertation, we will explore how the tools of quantum information and computation can assist us on both of these fronts. We primarily do so through the task of partial state learning: tomographic protocols for acquiring a reduced, but sufficient, classical description of a quantum system. Developing fast methods for partial tomography addresses a critical bottleneck in quantum simulation algorithms, which is a particularly pressing issue for …

Mechanistic Investigation Of C—C Bond Activation Of Phosphaalkynes With Pt(0) Complexes, Roberto M. Escobar, Abdurrahman C. Ateşin, Christian Müller, William D. Jones, Tülay Ateşin

Research Symposium

Carbon–carbon (C–C) bond activation has gained increased attention as a direct method for the synthesis of pharmaceuticals. Due to the thermodynamic stability and kinetic inaccessibility of the C–C bonds, however, activation of C–C bonds by homogeneous transition-metal catalysts under mild homogeneous conditions is still a challenge. Most of the systems in which the activation occurs either have aromatization or relief of ring strain as the primary driving force. The activation of unstrained C–C bonds of phosphaalkynes does not have this advantage. This study employs Density Functional Theory (DFT) calculations to elucidate Pt(0)-mediated C–CP bond activation mechanisms in phosphaalkynes. Investigating the …

Continuous-Variable Quantum Computation Of The O(3) Model In 1+1 Dimensions, Raghav G. Jha, Felix Ringer, George Siopsis, Shane Thompson

Physics Faculty Publications

We formulate the O(3) nonlinear sigma model in 1+1 dimensions as a limit of a three-component scalar field theory restricted to the unit sphere in the large squeezing limit. This allows us to describe the model in terms of the continuous-variable (CV) approach to quantum computing. We construct the ground state and excited states using the coupled-cluster Ansatz and find excellent agreement with the exact diagonalization results for a small number of lattice sites. We then present the simulation protocol for the time evolution of the model using CV gates and obtain numerical results using a photonic quantum simulator. We …

Human And Technical Factors In The Adoption Of Quantum Cryptographic Algorithms, Alyssa Pinkston

Mathematical Sciences Technical Reports (MSTR)

The purpose of this research is to understand what factors would cause users to choose quantum key distribution (QKD) over other methods of cryptography. An Advanced Encryption Standard (AES) key can be exchanged through communication using the Rivest, Shamir, Adleman (RSA) cryptographic algorithm, QKD, or post-quantum cryptography (PQC). QKD relies on quantum physics where RSA and PQC use complex mathematics to encrypt data. The BB84 quantum cryptographic protocol involves communication over a quantum channel and a public channel. The quantum channel can be technically attacked by beamsplitting or intercept/resend. QKD, like other forms of cryptography, is vulnerable to social attacks …

Making The Transition To Post-Quantum Cryptography, J. Simon Richard

The Downtown Review: An Interdisciplinary Journal Written and Peer-Reviewed by Mandel Honors College Students at Cleveland State University

Without intervention, quantum computing could threaten the security of a large portion of our internet in the near future. However, solutions exist. This paper, which is intended for a general audience, provides a wider context for our current state of quantum-preparedness amid the transition from classical cryptosystems to post-quantum cryptosystems—cryptographic algorithms that can resist the attacks of quantum computers. It will also submit a possible way forward inspired by the actions taken around the globe to prevent the millennium (or Y2K) bug.

Applying Hallgren’S Algorithm For Solving Pell’S Equation To Finding The Irrational Slope Of The Launch Of A Billiard Ball, Sangheon Choi

Mathematical Sciences Technical Reports (MSTR)

This thesis is an exploration of Quantum Computing applied to Pell’s equation in an attempt to find solutions to the Billiard Ball Problem. Pell’s equation is a Diophantine equation in the form of x² − ny² = 1, where n is a given positive nonsquare integer, and integer solutions are sought for x and y. We will be applying Hallgren’s algorithm for finding irrational periods in functions, in the context of billiard balls and their movement on a friction-less unit square billiard table. Our central research question has been the following: Given the cutting sequence of the billiard …

Evaluation Of Scalable Quantum And Classical Machine Learning For Particle Tracking Classification In Nuclear Physics, Polykarpos Thomadakis, Emmanuel Billias, Nikos Chrisochoides

The Graduate School Posters

Future particle accelerators will exceed by far the current data size (10¹⁵) per experiment, and high- luminosity program(s) will produce more than 300 times as much data. Classical Machine Learning (ML) likely will benefit from new tools based on quantum computing. Particle track reconstruction is the most computationally intensive process in nuclear physics experiments. A combinatorial approach exhaustively tests track measurements (“hits”), represented as images, to identify those that form an actual particle trajectory, which is then used to reconstruct track parameters necessary for the physics experiment. Quantum Machine Learning (QML) could improve this process in multiple ways, …

Ml-Based Surrogates And Emulators, Tareq Alghamdi, Yaohang Li, Nobuo Sato

College of Sciences Posters

No abstract provided.

Scalable Quantum Edge Detection Method For D-Nisq Imaging Simulations: Use Cases From Nuclear Physics And Medical Image Computing, Emmanuel Billias, Nikos Chrisochoides

The Graduate School Posters

Edge Detection is one of the computationally intensive modules in image analysis. It is used to find important landmarks by identifying a significant change (or “edge”) between pixels and voxels. We present a hybrid Quantum Edge Detection method by improving three aspects of an existing widely referenced implementation, which for our use cases generates incomprehensible results for the type and size of images we are required to process. Our contributions are in the pre- and post-processing (i.e., classical phase) and a quantum edge detection circuit: (1) we use space- filling curves to eliminate image artifacts introduced by the image decomposition, …

Quantum Computing For Nuclear Physics, Aikaterini Nikou

2023 REYES Proceedings

Nuclear physics can greatly advance by taking advantage of quantum computing. Quantum computing can play a pivotal role in advancing nuclear physics and can allow for the description of physical situations and problems that are prohibitive to solve using classical computing due to their complexity. Some of the problems whose complexity requires using quantum computing to describe are: interacting quantum many-body and Quantum Field Theory problems such as simulating strongly interacting fields such as Quantum Chromodynamics with physical time evolution, the determination of the shape/phase of a nucleus using the time evolution of an appropriated observable as well as identifying …

Establishing The Legal Framework To Regulate Quantum Computing Technology, Kaya Derose

Catholic University Journal of Law and Technology

No abstract provided.

Decoherence And Preferred Tensor Product Structures For Systems Of Qubits, Marissa M. Singh

Pitzer Senior Theses

In recent decades, the program of Decoherence has helped clarify how features of the classical world emerge from Quantum Mechanics. According to Decoherence, the interaction between a system and its environment dynamically selects certain system states — the pointer states — that exhibit predictable, classical behavior while their superpositions rapidly decohere. However, most Decoherence studies to date pre-suppose a preferred division of the world into “system” and “environment”, corresponding to a preferred choice of Tensor Product Structure (TPS) on the Hilbert Space of states. A few previous works have suggested that the existence of a well-defined pointer observable may be …

Machine Learning-Based Jet And Event Classification At The Electron-Ion Collider With Applications To Hadron Structure And Spin Physics, Kyle Lee, James Mulligan, Mateusz Płoskoń, Felix Ringer, Feng Yuan

Physics Faculty Publications

We explore machine learning-based jet and event identification at the future Electron-Ion Collider (EIC). We study the effectiveness of machine learning-based classifiers at relatively low EIC energies, focusing on (i) identifying the flavor of the jet and (ii) identifying the underlying hard process of the event. We propose applications of our machine learning-based jet identification in the key research areas at the future EIC and current Relativistic Heavy Ion Collider program, including enhancing constraints on (transverse momentum dependent) parton distribution functions, improving experimental access to transverse spin asymmetries, studying photon structure, and quantifying the modification of hadrons and jets in …

The Future Between Quantum Computing And Cybersecurity, Daniel Dorazio

Williams Honors College, Honors Research Projects

Quantum computing, a novel branch of technology based on quantum theory, processes information in ways beyond the capabilities of classical computers. Traditional computers use binary digits [bits], but quantum computers use quantum binary digits [qubits] that can exist in multiple states simultaneously. Since developing the first two-qubit quantum computer in 1998, the quantum computing field has experienced rapid growth.

Cryptographic algorithms such as RSA and ECC, essential for internet security, rely on the difficulty of complex math problems that classical computers can’t solve. However, the advancement of quantum technology threatens these encryption systems. Algorithms, such as Shor’s, leverage the power …

The Mceliece Cryptosystem As A Solution To The Post-Quantum Cryptographic Problem, Isaac Hanna

Senior Honors Theses

The ability to communicate securely across the internet is owing to the security of the RSA cryptosystem, among others. This cryptosystem relies on the difficulty of integer factorization to provide secure communication. Peter Shor’s quantum integer factorization algorithm threatens to upend this. A special case of the hidden subgroup problem, the algorithm provides an exponential speedup in the integer factorization problem, destroying RSA’s security. Robert McEliece’s cryptosystem has been proposed as an alternative. Based upon binary Goppa codes instead of integer factorization, his cryptosystem uses code scrambling and error introduction to hinder decrypting a message without the private key. This …