Machine learning phases of matter
TL;DR: It is shown that modern machine learning architectures, such as fully connected and convolutional neural networks, can identify phases and phase transitions in a variety of condensed-matter Hamiltonians.
read more
Abstract: The success of machine learning techniques in handling big data sets proves ideal for classifying condensed-matter phases and phase transitions. The technique is even amenable to detecting non-trivial states lacking in conventional order. Condensed-matter physics is the study of the collective behaviour of infinitely complex assemblies of electrons, nuclei, magnetic moments, atoms or qubits1. This complexity is reflected in the size of the state space, which grows exponentially with the number of particles, reminiscent of the ‘curse of dimensionality’ commonly encountered in machine learning2. Despite this curse, the machine learning community has developed techniques with remarkable abilities to recognize, classify, and characterize complex sets of data. Here, we show that modern machine learning architectures, such as fully connected and convolutional neural networks3, can identify phases and phase transitions in a variety of condensed-matter Hamiltonians. Readily programmable through modern software libraries4,5, neural networks can be trained to detect multiple types of order parameter, as well as highly non-trivial states with no conventional order, directly from raw state configurations sampled with Monte Carlo6,7.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Quantum Phase Recognition via Quantum Kernel Methods
TL;DR: In this article , the power of quantum learning algorithms in solving an important class of Quantum Phase Recognition (QPR) problems, which are crucially important in understanding many-particle quantum systems, was explored.
Nanolaminate Plasmonic Substrates for High-Throughput Living Cell SERS Measurements and Artificial Neural Network Classification of Cellular Drug Responses
TL;DR: In this paper , the authors exploit cell-interfaced nanolaminate SERS substrates to demonstrate reliable high-throughput SERS measurements using well-studied living cancer cells with four drug dosages.
19
•Posted Content
Parsimonious neural networks learn interpretable physical laws
Saaketh Desai,Alejandro Strachan +1 more
TL;DR: P parsimonious neural networks (PNNs) that combine neural networks with evolutionary optimization to find models that balance accuracy with parsimony are proposed and demonstrated by developing models for classical mechanics and to predict the melting temperature of materials from fundamental properties.
19
Machine learning approach to constructing tight binding models for solids with application to BiTeCl
TL;DR: This work successfully used a method based on the LCAO method in combination with Slater–Koster integrals to find a TB model for BiTeCl, where spin–orbit coupling plays an essential role in its topological behavior.
19
Supervised and unsupervised learning of directed percolation.
TL;DR: In this paper, the authors show that using some simple techniques of ML, non-steady-state configurations of directed percolation (DP) suffice to capture its essential critical behaviors in both ($1+1$) and ($2+ 1$) dimensions.
19
References
Gradient-based learning applied to document recognition
Yann LeCun,Léon Bottou,Léon Bottou,Yoshua Bengio,Yoshua Bengio,Yoshua Bengio,Patrick Haffner +6 more
- 01 Jan 1998
TL;DR: In this article, a graph transformer network (GTN) is proposed for handwritten character recognition, which can be used to synthesize a complex decision surface that can classify high-dimensional patterns, such as handwritten characters.
53.5K
Crystal statistics. I. A two-dimensional model with an order-disorder transition
TL;DR: In this article, the eigenwert problem involved in the corresponding computation for a long strip crystal of finite width, joined straight to itself around a cylinder, is solved by direct product decomposition; in the special case $n=\ensuremath{\infty}$ an integral replaces a sum.
6.7K
Fault tolerant quantum computation by anyons
TL;DR: A two-dimensional quantum system with anyonic excitations can be considered as a quantum computer Unitary transformations can be performed by moving the excitations around each other Unitary transformation can be done by joining excitations in pairs and observing the result of fusion.
5.5K
Topological entanglement entropy
TL;DR: The von Neumann entropy of rho, a measure of the entanglement of the interior and exterior variables, has the form S(rho) = alphaL - gamma + ..., where the ellipsis represents terms that vanish in the limit L --> infinity.
Detecting Topological Order in a Ground State Wave Function
Michael Levin,Xiao-Gang Wen +1 more
TL;DR: A way to detect a kind of topological order using only the ground state wave function which directly measures the total quantum dimension D= Sum(id2i).
2.5K
Related Papers (5)
[...]