Spin最新文献_第3页

Spin pumping in moderately perpendicular W/CoFeB/HfOx thin films 适度垂直W/CoFeB/HfOx薄膜中的自旋泵浦

IF 1.8 4区物理与天体物理

Spin Pub Date : 2023-08-23 DOI: 10.1142/s2010324723400222

Shiva Gaur, Nilamani Behera, J. Åkerman, A. Raghav

引用次数: 0

Superconducting Quantum Circuits Based on 2D Materials 基于二维材料的超导量子电路

IF 1.8 4区物理与天体物理

Spin Pub Date : 2023-08-17 DOI: 10.1142/s2010324723400210

Cheng-Han Lo, Yung-Hsiang Chen, Avishma J. Lasrado, Thomas Kuo, You-Yi Chang, Tao-Yi Hsu, Yen-Chih Chen, Guo-Ping Guo, K. Chiu

引用次数: 0

Monte Carlo Study on the Magnetic Properties of the Silicene-Germanene Junction-Like Nanostructure 二氧化硅-锗烯类结纳米结构磁性能的蒙特卡罗研究

IF 1.8 4区物理与天体物理

Spin Pub Date : 2023-07-27 DOI: 10.1142/s2010324723500261

H. Eraki, N. Saber, Z. Fadil, A. Mhirech, B. Kabouchi, L. Bahmad

引用次数: 0

Study of the Mixed Spin Ising Nanowire with Random and Dilute Crystal Field 随机稀晶场混合自旋Ising纳米线的研究

IF 1.8 4区物理与天体物理

Spin Pub Date : 2023-07-27 DOI: 10.1142/s201032472350025x

M. Mouhib, S. Bri, M. D. Belrhiti, H. Mounir

引用次数: 0

Implementation of quantum image encryption via reversible quantum logic gates computing 通过可逆量子逻辑门计算实现量子图像加密

IF 1.8 4区物理与天体物理

Spin Pub Date : 2023-07-27 DOI: 10.1142/s2010324723400209

Yi-Lin Cheng, Yu-Ping Liao, Chih Yu Cheng, Tsung Wei Huang

引用次数: 0

Tailoring spin to charge conversion efficiency via microwave frequency in La0.67Sr0.33MnO3/Pt bilayer system La0.67Sr0.33MnO3/Pt双分子层体系中微波频率对自旋电荷转换效率的影响

IF 1.8 4区物理与天体物理

Spin Pub Date : 2023-07-21 DOI: 10.1142/s2010324723400192

P. Gupta, B. Singh, A. Mishra, Aditya Kumar, A. Sarkar, M. Waschk, S. Bedanta

引用次数: 0

Magnetization switching in atom-thick Mo engineered Exchange bias-based SOT-MRAM 原子厚Mo工程交换偏压SOT-MRAM的磁化开关

IF 1.8 4区物理与天体物理

Spin Pub Date : 2023-07-21 DOI: 10.1142/s2010324723500236

Dongyan Zhao, Yanning Chen, Zanhong Chen, Cheng Pan, Jin Shao, A. Du, W. Cai, K. Cao, Z. Fu, Kewen Shi

引用次数: 0

Scalable Auction Algorithms for Bipartite Maximum Matching Problems 二部最大匹配问题的可扩展拍卖算法

IF 1.8 4区物理与天体物理

Spin Pub Date : 2023-07-18 DOI: 10.48550/arXiv.2307.08979

Quanquan C. Liu, Yiduo Ke, S. Khuller

{"title":"Scalable Auction Algorithms for Bipartite Maximum Matching Problems","authors":"Quanquan C. Liu, Yiduo Ke, S. Khuller","doi":"10.48550/arXiv.2307.08979","DOIUrl":"https://doi.org/10.48550/arXiv.2307.08979","url":null,"abstract":"In this paper, we give new auction algorithms for maximum weighted bipartite matching (MWM) and maximum cardinality bipartite $b$-matching (MCbM). Our algorithms run in $Oleft(log n/varepsilon^8right)$ and $Oleft(log n/varepsilon^2right)$ rounds, respectively, in the blackboard distributed setting. We show that our MWM algorithm can be implemented in the distributed, interactive setting using $O(log^2 n)$ and $O(log n)$ bit messages, respectively, directly answering the open question posed by Demange, Gale and Sotomayor [DNO14]. Furthermore, we implement our algorithms in a variety of other models including the the semi-streaming model, the shared-memory work-depth model, and the massively parallel computation model. Our semi-streaming MWM algorithm uses $O(1/varepsilon^8)$ passes in $O(n log n cdot log(1/varepsilon))$ space and our MCbM algorithm runs in $O(1/varepsilon^2)$ passes using $Oleft(left(sum_{i in L} b_i + |R|right)log(1/varepsilon)right)$ space (where parameters $b_i$ represent the degree constraints on the $b$-matching and $L$ and $R$ represent the left and right side of the bipartite graph, respectively). Both of these algorithms improves emph{exponentially} the dependence on $varepsilon$ in the space complexity in the semi-streaming model against the best-known algorithms for these problems, in addition to improvements in round complexity for MCbM. Finally, our algorithms eliminate the large polylogarithmic dependence on $n$ in depth and number of rounds in the work-depth and massively parallel computation models, respectively, improving on previous results which have large polylogarithmic dependence on $n$ (and exponential dependence on $varepsilon$ in the MPC model).","PeriodicalId":54319,"journal":{"name":"Spin","volume":"130 1","pages":"28:1-28:24"},"PeriodicalIF":1.8,"publicationDate":"2023-07-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76861549","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Optimal Mixing via Tensorization for Random Independent Sets on Arbitrary Trees 基于张张化的任意树上随机独立集的最优混合

IF 1.8 4区物理与天体物理

Spin Pub Date : 2023-07-15 DOI: 10.48550/arXiv.2307.07727

Charilaos Efthymiou, Thomas P. Hayes, Daniel Stefankovic, Eric Vigoda

{"title":"Optimal Mixing via Tensorization for Random Independent Sets on Arbitrary Trees","authors":"Charilaos Efthymiou, Thomas P. Hayes, Daniel Stefankovic, Eric Vigoda","doi":"10.48550/arXiv.2307.07727","DOIUrl":"https://doi.org/10.48550/arXiv.2307.07727","url":null,"abstract":"We study the mixing time of the single-site update Markov chain, known as the Glauber dynamics, for generating a random independent set of a tree. Our focus is obtaining optimal convergence results for arbitrary trees. We consider the more general problem of sampling from the Gibbs distribution in the hard-core model where independent sets are weighted by a parameter $lambda>0$. Previous work of Martinelli, Sinclair and Weitz (2004) obtained optimal mixing time bounds for the complete $Delta$-regular tree for all $lambda$. However, Restrepo et al. (2014) showed that for sufficiently large $lambda$ there are bounded-degree trees where optimal mixing does not hold. Recent work of Eppstein and Frishberg (2022) proved a polynomial mixing time bound for the Glauber dynamics for arbitrary trees, and more generally for graphs of bounded tree-width. We establish an optimal bound on the relaxation time (i.e., inverse spectral gap) of $O(n)$ for the Glauber dynamics for unweighted independent sets on arbitrary trees. Moreover, for $lambdaleq .44$ we prove an optimal mixing time bound of $O(nlog{n})$. We stress that our results hold for arbitrary trees and there is no dependence on the maximum degree $Delta$. Interestingly, our results extend (far) beyond the uniqueness threshold which is on the order $lambda=O(1/Delta)$. Our proof approach is inspired by recent work on spectral independence. In fact, we prove that spectral independence holds with a constant independent of the maximum degree for any tree, but this does not imply mixing for general trees as the optimal mixing results of Chen, Liu, and Vigoda (2021) only apply for bounded degree graphs. We instead utilize the combinatorial nature of independent sets to directly prove approximate tensorization of variance/entropy via a non-trivial inductive proof.","PeriodicalId":54319,"journal":{"name":"Spin","volume":"38 1","pages":"33:1-33:16"},"PeriodicalIF":1.8,"publicationDate":"2023-07-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74035066","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Quantum-inspired Vehicle Routing Scheme for Rebalancing in Bike Sharing Systems 基于量子的自行车共享系统再平衡车辆路径方案

IF 1.8 4区物理与天体物理

Spin Pub Date : 2023-07-13 DOI: 10.1142/s2010324723400180

Chia-Ho Ou, Chih-Yu Chen, Chu-Fu Wang, Ching-Ray Chang

引用次数: 0