Jacob Bringewatt

Jacob Bringewatt

Auto-generated profile, based on publicly available information

Jacob Bringewatt

Joint Center for Quantum Information and Computer Science, NIST/University of Maryland, College Park, Maryland 20742, USA

Research Focus & Metrics

Academic Career Length

9Years (2018-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
4 January 2021 in Physical Review D
Verified
Journal Article
Open access
PDF file
JBJ. Bringewatt
J. Bringewatt
NSN. Sato
N. Sato
WMW. Melnitchouk
W. Melnitchouk
JQJian-Wei Qiu
Jian-Wei Qiu
FSF. Steffens
F. Steffens
JCJefferson Lab Angular Momentum [JAM] Collaboration
Jefferson Lab Angular Momentum [JAM] Collaboration
We present the first Monte Carlo based global QCD analysis of spin-averaged and spin-dependent parton distribution functions (PDFs) that includes nucleon isovector matrix elements in coordinate space from lattice QCD. We investigate the degree of universality of the extracted PDFs when the lattice and experimental data are treated under the same conditions within the Bayesian likelihood analysis. For the unpolarized sector, we find rather weak constraints from the current lattice data on the phenomenological PDFs, and difficulties in describing the lattice matrix elements at large spatial distances. In contrast, for the polarized PDFs we find good agreement between experiment and lattice data, with the latter providing significant constraints on the spin-dependent isovector quark and antiquark distributions.

1 September 2018 in Nuclear Instruments and Methods in Physics Research Section A: Accelerators, Spectrometers, Detectors and Associated Equipment
Verified
Journal Article
Closed access
KPK. Pushkin
K. Pushkin
CAC. Akerlof
C. Akerlof
DAD. Anbajagane
D. Anbajagane
JAJ. Armstrong
J. Armstrong
MAM. Arthurs
M. Arthurs
WLW. Lorenzon
W. Lorenzon

2 July 2021 in Physical Review Research
Verified
Journal Article
Open access
PDF file
JBJacob Bringewatt
Jacob Bringewatt
IBIgor Boettcher
Igor Boettcher
PNPradeep Niroula
Pradeep Niroula
PBPrzemyslaw Bienias
Przemyslaw Bienias
AGAlexey V. Gorshkov
Alexey V. Gorshkov
We consider the problem of estimating multiple analytic functions of a set of local parameters via qubit sensors in a quantum sensor network. To address this problem, we highlight a generalization of the sensor symmetric performance bounds of Rubio et al., [ J. Phys. A 53, 344001 (2020)] and develop an optimized sequential protocol for measuring such functions. We compare the performance of both approaches to one another and to local protocols that do not utilize quantum entanglement, emphasizing the geometric significance of the coefficient vectors of the measured functions in determining the best choice of measurement protocol. We show that, in many cases, especially for a large number of sensors, the optimized sequential protocol results in more accurate measurements than the other strategies. In addition, in contrast to the sensor symmetric approach, the sequential protocol is known to always be explicitly implementable. The sequential protocol is very general and has a wide range of metrological applications.

29 March 2021 in Physical Review A
Verified
Journal Article
Closed access
PDF file
TQTimothy Qian
Timothy Qian
JBJacob Bringewatt
Jacob Bringewatt
IBIgor Boettcher
Igor Boettcher
PBPrzemyslaw Bienias
Przemyslaw Bienias
AGAlexey V. Gorshkov
Alexey V. Gorshkov
We consider a quantum sensor network of qubit sensors coupled to a field f(x;θ) analytically parameterized by the vector of parameters θ. The qubit sensors are fixed at positions x1,⋯,xd. While the functional form of f(x;θ) is known, the parameters θ are not. We derive saturable bounds on the precision of measuring an arbitrary analytic function q(θ) of these parameters and construct the optimal protocols that achieve these bounds. Our results are obtained from a combination of techniques from quantum information theory and duality theorems for linear programming. They can be applied to many problems, including optimal placement of quantum sensors, field interpolation, and the measurement of functionals of parametrized fields.

26 July 2024 in Physical Review Letters
Verified
Journal Article
Closed access
PDF file
LGLuis Pedro Garcia-Pintos
Luis Pedro Garcia-Pintos
KBKishor Bharti
Kishor Bharti
JBJacob Bringewatt
Jacob Bringewatt
HDHossein Dehghani
Hossein Dehghani
AEAdam Ehrenberg
Adam Ehrenberg
AGAlexey V. Gorshkov
Alexey V. Gorshkov
We upper bound and lower bound the optimal precision with which one can estimate an unknown Hamiltonian parameter via measurements of Gibbs thermal states with a known temperature. The bounds depend on the uncertainty in the Hamiltonian term that contains the parameter and on the term’s degree of noncommutativity with the full Hamiltonian: higher uncertainty and commuting operators lead to better precision. We apply the bounds to show that there exist entangled thermal states such that the parameter can be estimated with an error that decreases faster than 1/n, beating the standard quantum limit. This result governs Hamiltonians where an unknown scalar parameter (e.g., a component of a magnetic field) is coupled locally and identically to n qubit sensors. In the high-temperature regime, our bounds allow for pinpointing the optimal estimation error, up to a constant prefactor. Our bounds generalize to joint estimations of multiple parameters. In this setting, we recover the high-temperature sample scaling derived previously via techniques based on quantum state discrimination and coding theory. In an application, we show that noncommuting conserved quantities hinder the estimation of chemical potentials.

5 April 2023 in Physical Review Letters
Verified
Journal Article
Closed access
PDF file
LGLuis Pedro Garcia-Pintos
Luis Pedro Garcia-Pintos
LBLucas T. Brady
Lucas T. Brady
JBJacob Bringewatt
Jacob Bringewatt
YLYi-Kai Liu
Yi-Kai Liu
The adiabatic theorem provides sufficient conditions for the time needed to prepare a target ground state. While it is possible to prepare a target state much faster with more general quantum annealing protocols, rigorous results beyond the adiabatic regime are rare. Here, we provide such a result, deriving lower bounds on the time needed to successfully perform quantum annealing. The bounds are asymptotically saturated by three toy models where fast annealing schedules are known: the Roland and Cerf unstructured search model, the Hamming spike problem, and the ferromagnetic p-spin model. Our bounds demonstrate that these schedules have optimal scaling. Our results also show that rapid annealing requires coherent superpositions of energy eigenstates, singling out quantum coherence as a computational resource.