Network


Latest external collaboration on country level. Dive into details by clicking on the dots.

Hotspot


Dive into the research topics where Bryan K. Clark is active.

Publication


Featured researches published by Bryan K. Clark.


Physical Review Letters | 2013

Path-Integral Monte Carlo Simulation of the Warm Dense Homogeneous Electron Gas

Ethan Brown; Bryan K. Clark; Jonathan L. DuBois; David M. Ceperley

We perform calculations of the 3D finite-temperature homogeneous electron gas in the warm-dense regime (r(s) ≡ (3/4πn)(1/3)a(0)(-1) = 1.0-40.0 and Θ ≡ T/T(F) = 0.0625-8.0) using restricted path-integral Monte Carlo simulations. Precise energies, pair correlation functions, and structure factors are obtained. For all densities, we find a significant discrepancy between the ground state parametrized local density approximation and our results around T(F). These results can be used as a benchmark for developing finite-temperature density functionals, as well as input for orbital-free density function theory formulations.


Physical Review A | 2014

Gate-count estimates for performing quantum chemistry on small quantum computers

Dave Wecker; Bela Bauer; Bryan K. Clark; Matthew B. Hastings; Matthias Troyer

As quantum computing technology improves and quantum computers with a small but non-trivial number of N > 100 qubits appear feasible in the near future the question of possible applications of small quantum computers gains importance. One frequently mentioned application is Feynmans original proposal of simulating quantum systems, and in particular the electronic structure of molecules and materials. In this paper, we analyze the computational requirements for one of the standard algorithms to perform quantum chemistry on a quantum computer. We focus on the quantum resources required to find the ground state of a molecule twice as large as what current classical computers can solve exactly. We find that while such a problem requires about a ten-fold increase in the number of qubits over current technology, the required increase in the number of gates that can be coherently executed is many orders of magnitude larger. This suggests that for quantum computation to become useful for quantum chemistry problems, drastic algorithmic improvements will be needed.


Journal of Physics: Conference Series | 2012

Hybrid algorithms in quantum Monte Carlo

Jeongnim Kim; Kenneth Esler; Jeremy McMinis; Miguel Morales; Bryan K. Clark; Luke Shulenburger; David M. Ceperley

With advances in algorithms and growing computing powers, quantum Monte Carlo (QMC) methods have become a leading contender for high accuracy calculations for the electronic structure of realistic systems. The performance gain on recent HPC systems is largely driven by increasing parallelism: the number of compute cores of a SMP and the number of SMPs have been going up, as the Top500 list attests. However, the available memory as well as the communication and memory bandwidth per element has not kept pace with the increasing parallelism. This severely limits the applicability of QMC and the problem size it can handle. OpenMP/MPI hybrid programming provides applications with simple but effective solutions to overcome efficiency and scalability bottlenecks on large-scale clusters based on multi/many-core SMPs. We discuss the design and implementation of hybrid methods in QMCPACK and analyze its performance on current HPC platforms characterized by various memory and communication hierarchies.


Journal of Chemical Theory and Computation | 2012

Multideterminant Wave Functions in Quantum Monte Carlo

Miguel Morales; Jeremy McMinis; Bryan K. Clark; Jeongnim Kim; Gustavo E. Scuseria

Quantum Monte Carlo (QMC) methods have received considerable attention over past decades due to their great promise for providing a direct solution to the many-body Schrodinger equation in electronic systems. Thanks to their low scaling with the number of particles, QMC methods present a compelling competitive alternative for the accurate study of large molecular systems and solid state calculations. In spite of such promise, the method has not permeated the quantum chemistry community broadly, mainly because of the fixed-node error, which can be large and whose control is difficult. In this Perspective, we present a systematic application of large scale multideterminant expansions in QMC and report on its impressive performance with first row dimers and the 55 molecules of the G1 test set. We demonstrate the potential of this strategy for systematically reducing the fixed-node error in the wave function and for achieving chemical accuracy in energy predictions. When compared to traditional quantum chemistry methods like MP2, CCSD(T), and various DFT approximations, the QMC results show a marked improvement over all of them. In fact, only the explicitly correlated CCSD(T) method with a large basis set produces more accurate results. Further developments in trial wave functions and algorithmic improvements appear promising for rendering QMC as the benchmark standard in large electronic systems.


Physical Review Letters | 2006

Off-Diagonal Long-Range Order in Solid ^4He

Bryan K. Clark; David M. Ceperley

Measurements of the moment of inertia by Kim and Chan have found that solid (4)He acts like a supersolid at low temperatures. To understand the order in solid 4(He), we have used path integral Monte Carlo simulations to calculate the off-diagonal long-range order (ODLRO) [equivalent to Bose-Einstein condensation (BEC)]. We do not find ODLRO in a defect-free hcp crystal of (4)He at the melting density. We discuss these results in relation to proposed quantum solid trial functions. We conclude that the solid (4)He wave function has correlations which suppress both vacancies and BEC.


Journal of Chemical Physics | 2011

Computing the energy of a water molecule using multideterminants: A simple, efficient algorithm

Bryan K. Clark; Miguel Morales; Jeremy McMinis; Jeongnim Kim; Gustavo E. Scuseria

Quantum Monte Carlo (QMC) methods such as variational Monte Carlo and fixed node diffusion Monte Carlo depend heavily on the quality of the trial wave function. Although Slater-Jastrow wave functions are the most commonly used variational ansatz in electronic structure, more sophisticated wave functions are critical to ascertaining new physics. One such wave function is the multi-Slater-Jastrow wave function which consists of a Jastrow function multiplied by the sum of Slater determinants. In this paper we describe a method for working with these wave functions in QMC codes that is easy to implement, efficient both in computational speed as well as memory, and easily parallelized. The computational cost scales quadratically with particle number making this scaling no worse than the single determinant case and linear with the total number of excitations. Additionally, we implement this method and use it to compute the ground state energy of a water molecule.


SIAM Journal on Discrete Mathematics | 2006

The Complexity of Graph Pebbling

Kevin G. Milans; Bryan K. Clark

In a graph


Physical Review Letters | 2017

Finding Matrix Product State Representations of Highly Excited Eigenstates of Many-Body Localized Hamiltonians

Xiongjie Yu; David Pekker; Bryan K. Clark

G


Physical Review Letters | 2012

Nonequilibrium dynamic critical scaling of the quantum Ising chain.

Michael Kolodrubetz; Bryan K. Clark; David A. Huse

whose vertices contain pebbles, a pebbling move


Physical Review Letters | 2009

Hexatic and mesoscopic phases in a 2D quantum coulomb system.

Bryan K. Clark; Michele Casula; David M. Ceperley

uv

Collaboration


Dive into the Bryan K. Clark's collaboration.

Top Co-Authors

Avatar

David Pekker

University of Pittsburgh

View shared research outputs
Top Co-Authors

Avatar
Top Co-Authors

Avatar

Jeongnim Kim

Oak Ridge National Laboratory

View shared research outputs
Top Co-Authors

Avatar

Miguel Morales

Lawrence Livermore National Laboratory

View shared research outputs
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Researchain Logo
Decentralizing Knowledge