Patrick Dreher

ORCID: 0000-0002-4226-5184
Publications
Citations
Views
---
Saved
---
About
Contact & Profiles
Research Areas
  • Quantum Computing Algorithms and Architecture
  • Quantum Information and Cryptography
  • Distributed and Parallel Computing Systems
  • Quantum Chromodynamics and Particle Interactions
  • Cloud Computing and Resource Management
  • Particle physics theoretical and experimental studies
  • Scientific Computing and Data Management
  • High-Energy Particle Collisions Research
  • Advanced Data Storage Technologies
  • Quantum and electron transport phenomena
  • Parallel Computing and Optimization Techniques
  • Physics of Superconductivity and Magnetism
  • Computational Physics and Python Applications
  • Theoretical and Computational Physics
  • Experimental Learning in Engineering
  • Quantum many-body systems
  • Spectroscopy and Quantum Chemical Studies
  • Stochastic processes and statistical mechanics
  • Scheduling and Timetabling Solutions
  • Experimental and Theoretical Physics Studies
  • Metabolomics and Mass Spectrometry Studies
  • Graph Theory and Algorithms
  • Cloud Data Security Solutions
  • Complexity and Algorithms in Graphs
  • Nutrition and Health in Aging

North Carolina State University
2013-2024

Mitre (United States)
2022

Physical Sciences (United States)
2022

University of Iowa
2022

Oak Ridge National Laboratory
2022

Fermi National Accelerator Laboratory
2022

Joint Quantum Institute
2022

University of Maryland, College Park
2022

Helmholtz Zentrum München
2020

Michigan State University
2019

Moments of the quark density, helicity, and transversity distributions are calculated in unquenched lattice QCD. Calculations proton matrix elements operators corresponding to these moments through operator product expansion have been performed on ${16}^{3}\ifmmode\times\else\texttimes\fi{}32$ lattices for Wilson fermions at $\ensuremath{\beta}=5.6$ using configurations from SESAM Collaboration $\ensuremath{\beta}=5.5$ SCRI. One-loop perturbative renormalization corrections included. At...

10.1103/physrevd.66.034506 article EN Physical review. D. Particles, fields, gravitation, and cosmology/Physical review. D. Particles and fields 2002-08-26

Quantum phase estimation (QPE) is one of the core algorithms for quantum computing. It has been extensively studied and applied in a variety applications such as Shor's factoring algorithm, sampling calculation eigenvalues unitary matrices. The QPE algorithm combined with Kitaev's inverse Fourier transform (IQFT) which are utilized fundamental component algorithms. In this paper, we explore computational challenges implementing on noisy intermediate-scale (NISQ) machines using IBM Q...

10.1109/icrc.2019.8914702 article EN 2019-11-01

Today's quantum computers offer the possibility of performing real-time calculations for field theory scattering processes motivated by high energy physics. In order to follow successful roadmap which has been established calculation static properties at Euclidean time, it is crucial develop new algorithmic methods deal with limitations current noisy intermediate-scale (NISQ) devices and establish quantitative measures progress made different devices. this paper, we report recent in these...

10.1088/2058-9565/ac1dff article EN Quantum Science and Technology 2021-08-16

We present a method to extract the phase shift of scattering process using real-time evolution in early and intermediate stages collision order estimate time delay wave packet. This procedure is convenient when noisy quantum computers for which asymptotic out-state behavior unreachable. demonstrate that challenging Fourier transforms involved state preparation measurements can be implemented $1+1$ dimensions with current trapped ion devices IBM computers. compare computations delays obtained...

10.1103/physrevd.104.054507 article EN cc-by Physical review. D/Physical review. D. 2021-09-16

This tutorial provides a hands-on introduction to quantum computing. It will feature the three pillars, architectures, programming, and algorithms/applications of Its focus is on applicability problems computing from practical point, with only necessary foundational coverage physics theoretical aspects understand Simulation software be utilized complemented by access actual computers prototype problem solutions. should develop better understanding how are transformed into algorithms what...

10.1145/3293883.3302578 article EN 2019-02-05

The rise of big data systems has created a need for benchmarks to measure and compare the capabilities these systems. Big present unique scalability challenges. supercomputing community wrestled with challenges decades developed methodologies creating rigorous scalable (e.g., HPC Challenge). proposed PageRank pipeline benchmark employs benchmarking create that is reflective many real-world processing builds on existing prior (Graph500, Sort, PageRank) holistic multiple integrated kernels can...

10.1109/ipdpsw.2016.89 preprint EN 2022 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW) 2016-05-01

Mitigation and calibration schemes are central to maximize the computational reach of today's Noisy Intermediate Scale Quantum (NISQ) hardware, but these often specialized exclusively address either coherent or decoherent error sources. Quantifying two types errors hence constitutes a desirable feature when it comes benchmarking suppression tools. In this paper, we present scalable cycle-centric methodology for obtaining detailed estimate contribution profile hard computing cycle. The...

10.22331/q-2024-06-13-1367 article EN cc-by Quantum 2024-06-13

The design of a good algorithm to solve NP-hard combinatorial approximation problems requires specific domain knowledge about the and often needs trial-and-error problem solving approach. Graph coloring is one essential fields provide an efficient solution for applications such as flight scheduling, frequency allocation in networking, register allocation. In particular, some optimization algorithms have been proposed multi-coloring graph but most cases simple searching method would be best...

10.48550/arxiv.1911.00595 preprint EN other-oa arXiv (Cornell University) 2019-01-01

Quantum computers open the possibility of performing real-time calculations for quantum field theory scattering processes. We propose to use an index averaging absolute value difference between accurately calculated Trotter evolution site occupations and their actual measurements on NISQ machines. The average is over all qubits a certain number steps. this metric quantify progress made in successive state-of-the-art machines error-mitigation techniques. illustrate concept with transverse...

10.48550/arxiv.1910.09478 preprint EN other-oa arXiv (Cornell University) 2019-01-01

This paper investigates the application of quantum computing technology to airline gate-scheduling quadratic assignment problems (QAP). We explore hardware architecture and software environment required for porting classical versions these type computers. discuss variational eigensolver inclusion space-efficient graph coloring Quadratic Unconstrained Binary Optimization (QUBO). These enhanced algorithms are tested with an 8 gate 24 flight test case using both IBM simulator a 27 qubit...

10.48550/arxiv.2111.09472 preprint EN cc-by arXiv (Cornell University) 2021-01-01

Recent advances in the development of first generation quantum computing devices have provided researchers with computational platforms to explore new ideas and reformulate conventional codes suitable for a computer. Developers can now implement these reformulations on both simulators hardware through cloud software environment. For example, IBM Q Experience provides direct access their platforms. However current options may not be an optimal environment developers needing download modify...

10.1109/hpec.2019.8916430 article EN 2019-09-01

Some of the most problematic issues that limit implementation applications on Noisy Intermediate Scale Quantum (NISQ) machines are adverse impacts both incoherent and coherent errors. We conducted an in-depth study errors a quantum hardware platform using transverse field Ising model Hamiltonian as sample user application. report here results from these computations several error mitigation protocols profile provide indication qubit stability. Through detailed set measurements we identify...

10.48550/arxiv.2201.02899 preprint EN cc-by arXiv (Cornell University) 2022-01-01

Conventional cloud computing architectures may seriously constrain computational throughput for high performance (HPC) and high-performance data (HPD) applications. The traditional approach to circumvent such problems has been map these applications onto other specialized hardware coprocessor architectures. This is both time resource expensive, poses a challenge rapidly rising demands computation analytics. In this paper we report on progress develop an alternative experimental software...

10.1109/ic2e.2014.57 article EN IEEE International Conference on Cloud Engineering 2014-03-01

We introduce a new method to calculate phase shifts on noisy intermediate scale quantum (NISQ) hardware platforms using wave packet edge time delay. The uses the early and stages of collision because standard based asymptotic out-state behavior is unreachable today’s NISQ platforms. calculation was implemented 4-site transverse Ising model in one spatial dimension with without potential interaction. A evolution operator describing progression system constructed transmission reflection...

10.22323/1.396.0464 article EN cc-by-nc-nd Proceedings of The 39th International Symposium on Lattice Field Theory — PoS(LATTICE2022) 2022-05-16
Coming Soon ...