Your browser doesn't support javascript.
loading
Show: 20 | 50 | 100
Results 1 - 7 de 7
Filter
Add more filters










Database
Language
Publication year range
1.
Adv Sci (Weinh) ; 10(14): e2206523, 2023 May.
Article in English | MEDLINE | ID: mdl-36965030

ABSTRACT

Superconductivity remains one of most fascinating quantum phenomena existing on a macroscopic scale. Its rich phenomenology is usually described by the Ginzburg-Landau (GL) theory in terms of the order parameter, representing the macroscopic wave function of the superconducting condensate. The GL theory addresses one of the prime superconducting properties, screening of the electromagnetic field because it becomes massive within a superconductor, the famous Anderson-Higgs mechanism. Here the authors describe another widely-spread type of superconductivity where the Anderson-Higgs mechanism does not work and must be replaced by the Deser-Jackiw-Templeton topological mass generation and, correspondingly, the GL effective field theory must be replaced by an effective topological gauge theory. These superconductors are inherently inhomogeneous granular superconductors, where electronic granularity is either fundamental or emerging. It is shown that the corresponding superconducting transition is a 3D generalization of the 2D Berezinskii-Kosterlitz-Thouless vortex binding-unbinding transition. The binding-unbinding of the line-like vortices in 3D results in the Vogel-Fulcher-Tamman scaling of the resistance near the superconducting transition. The authors report experimental data fully confirming the VFT behavior of the resistance.

2.
Phys Rev E ; 94(5-1): 052305, 2016 Nov.
Article in English | MEDLINE | ID: mdl-27967156

ABSTRACT

I propose a random network model governed by a Gaussian weight corresponding to Ising link antiferromagnetism as a model for emergent quantum space-time. In this model, discrete space is fundamental, not a regularization; its spectral dimension d_{s} is not a model input but is, rather, completely determined by the antiferromagnetic coupling constant. Perturbative terms suppressing triangles and favoring squares lead to locally Euclidean ground states that are Ricci flat "large worlds" with power-law extension. I then consider the quenched graphs of lowest energy for d_{s}=2 and d_{s}=3, and I show how quenching leads to the spontaneous emergence of embedding spaces of Hausdorff dimension d_{H}=4 and d_{H}=5, respectively. One of the additional, spontaneous dimensions can be interpreted as time, causality being an emergent property that arises in the large N limit (with N the number of vertices). For d_{s}=2, the quenched graphs constitute a discrete version of a 5D-space-filling surface with a number of fundamental degrees of freedom scaling like N^{2/5}, a graph version of the holographic principle. These holographic degrees of freedom can be identified with the squares of the quenched graphs, which, being triangle-free, are the fundamental area (or loop) quanta.

3.
Phys Rev E ; 94(1-1): 012139, 2016 Jul.
Article in English | MEDLINE | ID: mdl-27575108

ABSTRACT

By establishing a relation between information erasure and continuous phase transitions we generalize the Landauer bound to analog computing systems. The entropy production per degree of freedom during erasure of an analog variable (reset to standard value) is given by the logarithm of the configurational volume measured in units of its minimal quantum. As a consequence, every computation has to be carried on with a finite number of bits and infinite precision is forbidden by the fundamental laws of physics, since it would require an infinite amount of energy.

4.
Article in English | MEDLINE | ID: mdl-26764755

ABSTRACT

Recently I proposed a simple dynamical network model for discrete space-time that self-organizes as a graph with Hausdorff dimension d(H)=4. The model has a geometric quantum phase transition with disorder parameter (d(H)-d(s)), where d(s) is the spectral dimension of the dynamical graph. Self-organization in this network model is based on a competition between a ferromagnetic Ising model for vertices and an antiferromagnetic Ising model for edges. In this paper I solve a toy version of this model defined on a bipartite graph in the mean-field approximation. I show that the geometric phase transition corresponds exactly to the antiferromagnetic transition for edges, the dimensional disorder parameter of the former being mapped to the staggered magnetization order parameter of the latter. The model has a critical point with long-range correlations between edges, where a continuum random geometry can be defined, exactly as in Kazakov's famed 2D random lattice Ising model but now in any number of dimensions.

5.
Article in English | MEDLINE | ID: mdl-25353770

ABSTRACT

The classic Landauer bound can be lowered when erasure errors are permitted. Here we point out that continuous phase transitions characterized by an order parameter can also be viewed as information erasure by resetting a certain number of bits to a standard value. The information-theoretic expression for the generalized Landauer bound in terms of error probability implies thus a universal form for the thermodynamic entropy in the partially ordered phase. We explicitly show that the thermodynamic entropy as a function of interaction parameters and temperature is identical to the information-theoretic expression in terms of error probability alone in the specific example of the Hopfield neural network model of associative memory, a distributed information-processing system of many interacting stochastic bits. In this framework the Landauer bound sets a lower limit for the work associated with "remembering" rather than "forgetting."

6.
BMC Bioinformatics ; 14: 51, 2013 Feb 13.
Article in English | MEDLINE | ID: mdl-23402646

ABSTRACT

BACKGROUND: Biomarkers and target-specific phenotypes are important to targeted drug design and individualized medicine, thus constituting an important aspect of modern pharmaceutical research and development. More and more, the discovery of relevant biomarkers is aided by in silico techniques based on applying data mining and computational chemistry on large molecular databases. However, there is an even larger source of valuable information available that can potentially be tapped for such discoveries: repositories constituted by research documents. RESULTS: This paper reports on a pilot experiment to discover potential novel biomarkers and phenotypes for diabetes and obesity by self-organized text mining of about 120,000 PubMed abstracts, public clinical trial summaries, and internal Merck research documents. These documents were directly analyzed by the InfoCodex semantic engine, without prior human manipulations such as parsing. Recall and precision against established, but different benchmarks lie in ranges up to 30% and 50% respectively. Retrieval of known entities missed by other traditional approaches could be demonstrated. Finally, the InfoCodex semantic engine was shown to discover new diabetes and obesity biomarkers and phenotypes. Amongst these were many interesting candidates with a high potential, although noticeable noise (uninteresting or obvious terms) was generated. CONCLUSIONS: The reported approach of employing autonomous self-organising semantic engines to aid biomarker discovery, supplemented by appropriate manual curation processes, shows promise and has potential to impact, conservatively, a faster alternative to vocabulary processes dependent on humans having to read and analyze all the texts. More optimistically, it could impact pharmaceutical research, for example to shorten time-to-market of novel drugs, or speed up early recognition of dead ends and adverse reactions.


Subject(s)
Biomarkers , Data Mining/methods , Phenotype , Diabetes Insipidus/diagnosis , Diabetes Mellitus/diagnosis , Humans , Obesity/diagnosis , PubMed , Semantics , Vocabulary, Controlled
7.
Phys Rev Lett ; 97(13): 130503, 2006 Sep 29.
Article in English | MEDLINE | ID: mdl-17026018

ABSTRACT

Qubit networks with long-range interactions inspired by the Hebb rule can be used as quantum associative memories. Starting from a uniform superposition, the unitary evolution generated by these interactions drives the network through a quantum phase transition at a critical computation time, after which ferromagnetic order guarantees that a measurement retrieves the stored pattern. The maximum memory capacity of these qubit networks is reached at a memory density alpha=p/n=1.

SELECTION OF CITATIONS
SEARCH DETAIL
...