Open Access. Powered by Scholars. Published by Universities.®
- Institution
- Keyword
-
- Algebra (1)
- Algorithm (1)
- Benchmarking (1)
- Black hole (1)
- Cosmology (1)
-
- Cryptography (1)
- Diagnosis (1)
- Error reduction (1)
- Fields (1)
- Fraud detection (1)
- Healthcare (1)
- High-performance computing (1)
- Loop Quantum Gravity (1)
- Machine Learning (1)
- Machine learning (1)
- McEliece (1)
- Monte Carlo (1)
- Optimization (1)
- Post-Quantum (1)
- Precision medicine (1)
- Quantum (1)
- Quantum Computing (1)
- Quantum Generative Adversarial Networks (1)
- Quantum Machine Learning (1)
- Quantum computing (1)
- Simulation (1)
- Spinfoam (1)
- Supply chain (1)
- Publication
- Publication Type
Articles 1 - 5 of 5
Full-Text Articles in Quantum Physics
High-Performance Computing In Covariant Loop Quantum Gravity, Pietropaolo Frisoni
High-Performance Computing In Covariant Loop Quantum Gravity, Pietropaolo Frisoni
Electronic Thesis and Dissertation Repository
This Ph.D. thesis presents a compilation of the scientific papers I published over the last three years during my Ph.D. in loop quantum gravity (LQG). First, we comprehensively introduce spinfoam calculations with a practical pedagogical paper. We highlight LQG's unique features and mathematical formalism and emphasize the computational complexities associated with its calculations. The subsequent articles delve into specific aspects of employing high-performance computing (HPC) in LQG research. We discuss the results obtained by applying numerical methods to studying spinfoams' infrared divergences, or ``bubbles''. This research direction is crucial to define the continuum limit of LQG properly. We investigate the …
Generative Adversarial Game With Tailored Quantum Feature Maps For Enhanced Classification, Anais Sandra Nguemto Guiawa
Generative Adversarial Game With Tailored Quantum Feature Maps For Enhanced Classification, Anais Sandra Nguemto Guiawa
Doctoral Dissertations
In the burgeoning field of quantum machine learning, the fusion of quantum computing and machine learning methodologies has sparked immense interest, particularly with the emergence of noisy intermediate-scale quantum (NISQ) devices. These devices hold the promise of achieving quantum advantage, but they grapple with limitations like constrained qubit counts, limited connectivity, operational noise, and a restricted set of operations. These challenges necessitate a strategic and deliberate approach to crafting effective quantum machine learning algorithms.
This dissertation revolves around an exploration of these challenges, presenting innovative strategies that tailor quantum algorithms and processes to seamlessly integrate with commercial quantum platforms. A …
Quantum Computing And Its Applications In Healthcare, Vu Giang
Quantum Computing And Its Applications In Healthcare, Vu Giang
OUR Journal: ODU Undergraduate Research Journal
This paper serves as a review of the state of quantum computing and its application in healthcare. The various avenues for how quantum computing can be applied to healthcare is discussed here along with the conversation about the limitations of the technology. With more and more efforts put into the development of these computers, its future is promising with the endeavors of furthering healthcare and various other industries.
Solitons And Their Applications In Physics, B. A. Yount
Solitons And Their Applications In Physics, B. A. Yount
EWU Masters Thesis Collection
No abstract provided.
The Mceliece Cryptosystem As A Solution To The Post-Quantum Cryptographic Problem, Isaac Hanna
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 …