Christian F. A. Negre
Los Alamos National Laboratory
Network
Latest external collaboration on country level. Dive into details by clicking on the dots.
Publication
Featured researches published by Christian F. A. Negre.
Journal of Chemical Theory and Computation | 2015
Wendu Ding; Matthieu Koepf; Christopher Koenigsmann; Arunabh Batra; Latha Venkataraman; Christian F. A. Negre; Gary W. Brudvig; Robert H. Crabtree; Charles A. Schmuttenmaer; Victor S. Batista
We report a systematic computational search of molecular frameworks for intrinsic rectification of electron transport. The screening of molecular rectifiers includes 52 molecules and conformers spanning over 9 series of structural motifs. N-Phenylbenzamide is found to be a promising framework with both suitable conductance and rectification properties. A targeted screening performed on 30 additional derivatives and conformers of N-phenylbenzamide yielded enhanced rectification based on asymmetric functionalization. We demonstrate that electron-donating substituent groups that maintain an asymmetric distribution of charge in the dominant transport channel (e.g., HOMO) enhance rectification by raising the channel closer to the Fermi level. These findings are particularly valuable for the design of molecular assemblies that could ensure directionality of electron transport in a wide range of applications, from molecular electronics to catalytic reactions.
Journal of Chemical Physics | 2016
Anders M. N. Niklasson; Susan M. Mniszewski; Christian F. A. Negre; Marc Cawkwell; Pieter J. Swart; Jamal Mohd-Yusof; Timothy C. Germann; Michael E. Wall; Nicolas Bock; Emanuel H. Rubensson; Hristo Djidjev
We show how graph theory can be combined with quantum theory to calculate the electronic structure of large complex systems. The graph formalism is general and applicable to a broad range of electronic structure methods and materials, including challenging systems such as biomolecules. The methodology combines well-controlled accuracy, low computational cost, and natural low-communication parallelism. This combination addresses substantial shortcomings of linear scaling electronic structure theory, in particular with respect to quantum-based molecular dynamics simulations.
Nanoscale | 2016
Matthieu Koepf; Christopher Koenigsmann; Wendu Ding; Arunbah Batra; Christian F. A. Negre; Latha Venkataraman; Gary W. Brudvig; Victor S. Batista; Charles A. Schmuttenmaer; Robert H. Crabtree
The development of molecular components functioning as switches, rectifiers or amplifiers is a great challenge in molecular electronics. A desirable property of such components is functional robustness, meaning that the intrinsic functionality of components must be preserved regardless of the strategy used to integrate them into the final assemblies. Here, this issue is investigated for molecular diodes based on N-phenylbenzamide (NPBA) backbones. The transport properties of molecular junctions derived from NPBA are characterized while varying the nature of the functional groups interfacing the backbone and the gold electrodes required for break-junction measurements. Combining experimental and theoretical methods, it is shown that at low bias (<0.85 V) transport is determined by the same frontier molecular orbital originating from the NPBA core, regardless of the anchoring group employed. The magnitude of rectification, however, is strongly dependent on the strength of the electronic coupling at the gold-NPBA interface and on the spatial distribution of the local density of states of the dominant transport channel of the molecular junction.
conference on scientific computing | 2016
Hristo Djidjev; Georg Hahn; Susan M. Mniszewski; Christian F. A. Negre; Anders M. N. Niklasson; Vivek Sardeshmukh
We study a graph partitioning problem motivated by the simulation of the physical movement of multi-body systems on an atomistic level, where the forces are calculated from a quantum mechanical description of the electrons. Several advanced algorithms have been published in the literature for such simulations that are based on evaluations of matrix polynomials. We aim at efficiently parallelizing these computations by using a special type of graph partitioning. For this, we represent the zero-nonzero structure of a thresholded matrix as a graph and partition that graph into several components. The matrix polynomial is then evaluated for each separate submatrix corresponding to the subgraphs and the evaluated submatrix polynomials are used to assemble the final result for the full matrix polynomial. The paper provides a rigorous definition as well as a mathematical justification of this partitioning problem. We use several algorithms to compute graph partitions and experimentally evaluate their performance with respect to the quality of the partition obtained with each method and the time needed to produce it.
arXiv: Quantum Physics | 2017
Hayato Ushijima-Mwesigwa; Christian F. A. Negre; Susan M. Mniszewski
Graph partitioning (GP) applications are ubiquitous throughout mathematics, computer science, chemistry, physics, bio-science, machine learning, and complex systems. Post Moores era supercomputing has provided us an opportunity to explore new approaches for traditional graph algorithms on quantum computing architectures. In this work, we explore graph partitioning using quantum annealing on the D-Wave 2X machine. Motivated by a recently proposed graph-based electronic structure theory applied to quantum molecular dynamics (QMD) simulations, graph partitioning is used for reducing the calculation of the density matrix into smaller subsystems rendering the calculation more computationally efficient. Unconstrained graph partitioning as community clustering based on the modularity metric can be naturally mapped into the Hamiltonian of the quantum annealer. On the other hand, when constraints are imposed for partitioning into equal parts and minimizing the number of cut edges between parts, a quadratic unconstrained binary optimization (QUBO) reformulation is required. This reformulation may employ the graph complement to fit the problem in the Chimera graph of the quantum annealer. Partitioning into 2 parts and k parts concurrently for arbitrary k are demonstrated with benchmark graphs, random graphs, and small material system density matrix based graphs. Results for graph partitioning using quantum and hybrid classical-quantum approaches are shown to be comparable to current state of the art methods and sometimes better.
The Journal of Supercomputing | 2018
Nicolas Bock; Christian F. A. Negre; Susan M. Mniszewski; Jamaludin Mohd-Yusof; Bálint Aradi; Jean-Luc Fattebert; Daniel Osei-Kuffuor; Timothy C. Germann; Anders M. N. Niklasson
The basic matrix library package (BML) provides a common application programming interface (API) for linear algebra and matrix functions in C and Fortran for quantum chemistry codes. The BML API is matrix format independent. Currently the dense, compressed sparse row, and ELLPACK-R sparse matrix data types are available, each with different implementations. We show how the second-order spectral projection (SP2) algorithm used to compute the electronic structure of a molecular system represented with a tight-binding Hamiltonian can be successfully implemented with the aid of this library.
Archive | 2018
Christian F. A. Negre; Marc Cawkwell; Christoph Junghans; Nestor F. Aguirre; Axel Kohlmeyer; Rperriot; Aditi Krishnapriyan
Changes in latte_lib to incorporate the possibility of reseting the calculation when a new nstructure is passed from the hosting code
SIAM Journal on Scientific Computing | 2017
Purnima Ghale; Matthew P. Kroonblawd; Susan M. Mniszewski; Christian F. A. Negre; Robert Pavel; Sergio Pino; Vivek Sardeshmukh; Guangjie Shi; Georg Hahn
Quantum-based molecular dynamics (QMD) is a highly accurate and transferable method for material science simulations. However, the time scales and system sizes accessible to QMD are typically limited to picoseconds and a few hundred atoms. These constraints arise due to expensive self-consistent ground-state electronic structure calculations that can often scale cubically with the number of atoms. Linearly scaling methods depend on computing the density matrix
Archive | 2018
Christian F. A. Negre; Shawn McGrane; Marc Cawkwell
mathbf{P}
Archive | 2018
Kevin Gordon Kleiner; Aparna Nair-Kanneganti; Ivana Gonzales; Christian F. A. Negre; Anders M. N. Niklasson
from the Hamiltonian matrix