Shor's algorithmShor's algorithm is a quantum algorithm for finding the prime factors of an integer. It was developed in 1994 by the American mathematician Peter Shor. It is one of the few known quantum algorithms with compelling potential applications and strong evidence of superpolynomial speedup compared to best known classical (that is, non-quantum) algorithms. On the other hand, factoring numbers of practical significance requires far more qubits than available in the near future.
GradientIn vector calculus, the gradient of a scalar-valued differentiable function of several variables is the vector field (or vector-valued function) whose value at a point is the "direction and rate of fastest increase". If the gradient of a function is non-zero at a point , the direction of the gradient is the direction in which the function increases most quickly from , and the magnitude of the gradient is the rate of increase in that direction, the greatest absolute directional derivative.
Four-gradientIn differential geometry, the four-gradient (or 4-gradient) is the four-vector analogue of the gradient from vector calculus. In special relativity and in quantum mechanics, the four-gradient is used to define the properties and relations between the various physical four-vectors and tensors. This article uses the (+ − − −) metric signature. SR and GR are abbreviations for special relativity and general relativity respectively. indicates the speed of light in vacuum. is the flat spacetime metric of SR.
PyTorchPyTorch is a machine learning framework based on the Torch library, used for applications such as computer vision and natural language processing, originally developed by Meta AI and now part of the Linux Foundation umbrella. It is free and open-source software released under the modified BSD license. Although the Python interface is more polished and the primary focus of development, PyTorch also has a C++ interface. A number of pieces of deep learning software are built on top of PyTorch, including Tesla Autopilot, Uber's Pyro, Hugging Face's Transformers, PyTorch Lightning, and Catalyst.
DFA minimizationIn automata theory (a branch of theoretical computer science), DFA minimization is the task of transforming a given deterministic finite automaton (DFA) into an equivalent DFA that has a minimum number of states. Here, two DFAs are called equivalent if they recognize the same regular language. Several different algorithms accomplishing this task are known and described in standard textbooks on automata theory.
Kondo effectIn physics, the Kondo effect describes the scattering of conduction electrons in a metal due to magnetic impurities, resulting in a characteristic change i.e. a minimum in electrical resistivity with temperature. The cause of the effect was first explained by Jun Kondo, who applied third-order perturbation theory to the problem to account for scattering of s-orbital conduction electrons off d-orbital electrons localized at impurities (Kondo model).
