Elizabeth Behrman

Dr. Elizabeth Behrman

orcid

Research Focus & Metrics

Academic Career Length

44Years (1983-Present)

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

Representative Publications

View All Publications
1 October 2000 in Information Sciences
Verified
Journal Article
Closed access
EBElizabeth Behrman
Elizabeth Behrman
LNL.R. Nash
L.R. Nash
JAMES E STECKJAMES E STECK
JAMES E STECK
VCV.G. Chandrashekar
V.G. Chandrashekar
SSS.R. Skinner
S.R. Skinner

15 December 1983 in The Journal of Chemical Physics
Verified
Journal Article
Closed access
EBElizabeth Behrman
Elizabeth Behrman
GJGary A. Jongeward
Gary A. Jongeward
PWPeter G. Wolynes
Peter G. Wolynes
A Monte Carlo method for evaluating real time path integrals is proposed. We study two-level tunneling systems coupled to many body environments. A dynamical correlation function for a model of quantum coherence shows a plateau indicative of the localization effects of damping.

1 March 1994 in Physical Review A
Verified
Journal Article
Closed access
PDF file
EBElizabeth Behrman
Elizabeth Behrman
RFR. K. Foehrweiser
R. K. Foehrweiser
JMJ. R. Myers
J. R. Myers
BFB. R. French
B. R. French
MZM. E. Zandler
M. E. Zandler
We present results of molecular-dynamics simulations of ZnO clusters. At certain magic numbers of atoms, the clusters spontaneously form into spheroids reminiscent of fullerenes. Molecular-orbital calculations confirm that the spheroids are stable. We suggest some experiments that might be profitable.

31 January 2020 in Quantum Machine Intelligence
Verified
Journal Article
Closed access
PDF file
NNNam H. Nguyen
Nam H. Nguyen
EBElizabeth Behrman
Elizabeth Behrman
JAMES E STECKJAMES E STECK
JAMES E STECK

1 December 1985 in The Journal of Chemical Physics
Verified
Journal Article
Closed access
EBElizabeth Behrman
Elizabeth Behrman
PWP. G. Wolynes
P. G. Wolynes
We apply the quantum dynamical Monte Carlo technique to the calculation of the complex time correlation function of the flux through a SQUID, and compare the results with those of three representative theories: a random phase approximation (RPA), an effective adiabatic approximation (EA), and an optimized random phase approximation (ORPA). The RPA quickly becomes unreliable as the damping is increased beyond a negligible amount. For small coupling, the variational information contained in the EA theory results in superior predictions of initial decay rates, but for moderate coupling the inherent nonergodicity of the theory leads to incorrect results for the long time behavior of the correlation function. The ORPA fails to renormalize the initial frequency properly, but succeeds in predicting the correct qualitative behavior even at moderately large values of the damping. This illustrates the power of the QDMC as a benchmark against which to test approximations, and as a bridge between their regions of applicability.

2 September 2019 in IEEE Transactions on Neural Networks and Learning Systems
Verified
Journal Article
Closed access
NNNam H. Nguyen
Nam H. Nguyen
EBElizabeth Behrman
Elizabeth Behrman
MMMohamed A. Moustafa
Mohamed A. Moustafa
JAMES E STECKJAMES E STECK
JAMES E STECK
The power of quantum computers is still somewhat speculative. Although they are certainly faster than classical ones at some tasks, the class of problems they can efficiently solve has not been mapped definitively onto known classical complexity theory. This means that we do not know for which calculations there will be a ``quantum advantage,'' once an algorithm is found. One way to answer the question is to find those algorithms, but finding truly quantum algorithms turns out to be very difficult. In previous work, over the past three decades, we have pursued the idea of using techniques of machine learning to develop algorithms for quantum computing. Here, we compare the performance of standard real- and complex-valued classical neural networks with that of one of our models for a quantum neural network, on both classical problems and on an archetypal quantum problem: the computation of an entanglement witness. The quantum network is shown to need far fewer epochs and a much smaller network to achieve comparable or better results.