Using quantum computers to accelerate classical mean-field dynamics
US-2024346360-A1 · Oct 17, 2024 · US
US2016239640A1 · US · A1
| Field | Value |
|---|---|
| Publication number | US-2016239640-A1 |
| Application number | US-201615012511-A |
| Country | US |
| Kind code | A1 |
| Filing date | Feb 1, 2016 |
| Priority date | Mar 14, 2008 |
| Publication date | Aug 18, 2016 |
| Grant date | — |
A practical reading order for non-experts. Skip the full description unless you need deep technical detail.
What the patent document calls the invention.
A short plain-language summary of the technical disclosure.
Who owns or filed the patent and who is credited as inventor.
Filing, priority, publication, and grant dates set the timeline.
The legal scope of protection — read this for what is actually claimed.
Technology tags used to group this patent with similar filings.
Prior art links and similar publications in this corpus.
Official abstract text for this publication.
Methods of identifying irreducible bundles and bond bundles of open systems (such as molecules) are described. Methods of determining chemical properties of the molecules, computer systems and computer readable media are also provided.
Opening claim text (preview).
1 - 25 . (canceled) 26 . A method of partitioning a first molecule into at least one functional region to determine a property between chemical bonds of the molecule in order to design a second molecule by constructing one or more special charge density gradient paths of the first molecule to identify an irreducible bundle of the first molecule, the method comprising: defining a constant charge isosurface in said first molecule based on charge density data for the first molecule, the isosurface forming one or more closed, two dimensional surfaces; determining a magnitude of at least one charge density gradient vector of the charge density data and mapping the magnitude of the vector onto the constant charge isosurface; identifying one or more minima, maxima, and/or saddle points of said charge density gradient vectors on said isosurface, wherein the minima, maxima and saddle points describe the charge density topologically and are defined in terms of an index which is the number of positive curvatures minus the number of negative curvatures; constructing a special charge density gradient path by connecting said one or more minima, maxima, and/or saddle points along a gradient path to a corresponding critical point, wherein each special charge density gradient path represents a path of least steep, steepest or saddle descent that corresponds to an edge of an irreducible bundle; combining said special charge density gradient paths to construct the irreducible bundle, the irreducible bundle comprising polyhedra formed from a bundle of gradient paths with a common origin and terminus, wherein a vertex of the irreducible bundle is a critical point, an edge of the irreducible bundle is a special gradient path connecting two critical points and a face of the irreducible bundle is a two dimensional ridge and is a minimum area surface of zero flux in the gradient of the charge density that is bounded by special gradient paths; partitioning the molecule into non-overlapping unions of irreducible bundles, which are space filling regions, each region containing a single bond point and producing a graphical representation of the union of irreducible bundles to visualize that region of the molecule and associate that region with a property of the molecule, wherein each property of the region represents a property of the bond; and producing the second molecule with desired properties by applying the information about the property of the first molecule and correlating the property with elements of molecular structure and bonding to design the second molecule. 27 . The method of claim 26 , wherein said critical point is a bond critical point, a ring critical point, a cage critical point or an atom critical point. 28 . The method of claim 26 , wherein the maximum and/or minimum is a local maximum and/or minimum. 29 . The method of claim 26 , further comprising the steps of combining a set of irreducible bundles sharing a same bond critical point to identify a bond bundle; producing a graphical representation of the bond bundle to visualize a region of the molecule and associate that region with a property of the molecule; and producing the second molecule with desired properties by applying the information about the property of the first molecule and correlating the property with elements of molecular structure and bonding to design the second molecule. 30 . The method of claim 26 , further comprising the step of calculating a property of the molecule. 31 . A system of partitioning a first molecule into at least one functional region to determine a property between chemical bonds of the molecule in order to design a second molecule by constructing one or more special charge density gradient paths of the first molecule to identify an irreducible bundle of the first molecule, the system comprising: a memory for storing computer readable code; and a processor operatively coupled to the memory, the processor configured to: define a constant charge isosurface in said first molecule based on charge density data for the first molecule, the isosurface forming one or more closed, two dimensional surfaces; determine a magnitude of at least one charge density gradient vector of the charge density data and mapping the magnitude of the vector onto the constant charge isosurface; identify one or more minima, maxima, and/or saddle points of said charge density gradient vectors on said isosurface, wherein the minima, maxima and saddle points describe the charge density topologically and are defined in terms of an index which is the number of positive curvatures minus the number of negative curvatures; construct a special charge density gradient path by connecting said one or more minima, maxima, and/or saddle points along a gradient path to a corresponding critical point, wherein each special charge density gradient path represents a path of least steep, steepest or saddle descent that corresponds to an edge of an irreducible bundle; combine said special charge density gradient paths to construct the irreducible bundle, the irreducible bundle comprising polyhedra formed from a bundle of gradient paths with a common origin and terminus, wherein a vertex of the irreducible bundle is a critical point, an edge of the irreducible bundle is a special gradient path connecting two critical points and a face of the irreducible bundle is a two dimensional ridge and is a minimum area surface of zero flux in the gradient of the charge density that is bounded by special gradient paths; partition the molecule into non-overlapping unions of irreducible bundles, which are space filling regions, each region containing a single bond point and producing a graphical representation of the union of irreducible bundles to visualize a region of the molecule and associate a region with a property of the molecule, wherein each property of the region represents a property of the bond; and produce the second molecule with desired properties by applying the information about the property of the first molecule and correlating the property with elements of molecular structure and bonding to design the second molecule. 32 . The system of claim 31 , wherein said critical point is a bond critical point, a ring critical point, a cage critical point or an atom critical point. 33 . The system of claim 31 , wherein the maximum and/or minimum is a local maximum and/or minimum. 34 . The system of claim 31 , wherein the processor is further configured to: combine a set of irreducible bundles sharing the same bond critical point to identify said bond bundle; produce a graphical representation of the bond bundle to visualize a region of the molecule and associate that region with a property of the molecule; and produce a second molecule with desired properties by applying the information about the property of the first molecule and correlating the property with elements of molecular structure and bonding to design the second molecule. 35 . The system of claim 34 , wherein the processor is further configured to calculate a property of the molecule. 36 . A method of partitioning a first molecule into at least one functional region to determine a property between chemical bonds of the molecule in order to design a second molecule by identifying an irreducible bundle of the first molecule, the method comprising: finding one or more minima, maxima or saddle points of a charge density associated with the first molecule wherein these points describe the charge density topologically and are defined in terms of an index which is the number of positive curvatures minus the number of negative curvatures; identifying one or more special charge de
Prediction of properties of chemical compounds, compositions or mixtures · CPC title
Computational theoretical chemistry, i.e. ICT specially adapted for theoretical aspects of quantum chemistry, molecular mechanics, molecular dynamics or the like · CPC title
Physics · mapped topic
Physics · mapped topic
Related publications grouped by family.
Answers are generated from the same data shown on this page.