Critical fixed points in class D superconductors
نویسندگان
چکیده
منابع مشابه
D-XY Critical Behavior in Cuprate Superconductors
We outline the universal and finite temperature critical properties of the 3D-XY model, extended to anisotropic extreme type-II superconductors, as well as the universal quantum critical properties in 2D. On this basis we review: (i) the mounting evidence for 3D-XY behavior in optimally doped cuprate superconductors and the 3D to 2D crossover in the underdoped regime; (ii) the finite size limit...
متن کاملRENORMALIZATION GROUP ANALYSIS OF QUANTUM CRITICAL POINTS IN d-WAVE SUPERCONDUCTORS
We describe a search for renormalization group fixed points which control a second-order quantum phase transition between a dx2−y2 superconductor and some other superconducting ground state. Only a few candidate fixed points are found. In the finite temperature (T ) quantum-critical region of some of these fixed points, the fermion quasiparticle lifetime is very short and the spectral function ...
متن کاملAnomalous scaling dimensions and critical points in type-II superconductors
The existence of a stable critical point, separate from the Gaussian and XY critical points, of the Ginzburg-Landau theory for superconductors, is demonstrated by direct extraction via Monte-Carlo simulations, of a negative anomalous dimension ηφ of a complex scalar field φ forming a dual description of a neutral superfluid. The dual of the neutral superfluid is isomorphic to a charged superflu...
متن کاملInfinite-randomness quantum Ising critical fixed points
We examine the ground state of the random quantum Ising model in a transverse field using a generalization of the Ma-Dasgupta-Hu renormalization group ~RG! scheme. For spatial dimensionality d52, we find that at strong randomness the RG flow for the quantum critical point is towards an infinite-randomness fixed point, as in one dimension. This is consistent with the results of a recent quantum ...
متن کاملMinimum d-dimensional arrangement with fixed points
In the Minimum d-Dimensional Arrangement Problem (d-dimAP) we are given a graph with edge weights, and the goal is to find a 1-1 map of the vertices into Z (for some fixed dimension d ≥ 1) minimizing the total weighted stretch of the edges. This problem arises in VLSI placement and chip design. Motivated by these applications, we consider a generalization of d-dimAP, where the positions of some...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review B
سال: 2010
ISSN: 1098-0121,1550-235X
DOI: 10.1103/physrevb.81.033406