检索结果-内蒙古大学图书馆

Lattice investigation of the general Two Higgs Doublet Model with SU(2) gauge fields

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Catumba, Guilherme Hiraguchi, Atsuki Hou, George W.-S. Jansen, Karl Kao, Ying-Jer Lin, C.-J. David Ramos, Alberto Sarkar, Mugdha CSIC - Universitat de Valencia Valencia46071 Spain Institute of Physics National Yang Ming Chiao Tung University 1001 Ta-Hsueh Road Hsinchu30010 Taiwan Department of Physics National Taiwan University Taipei10617 Taiwan Deutsches Elektronen-Synchrotron DESY Platanenallee 6 Zeuthen15738 Germany Center for Theoretical Physics Center for Quantum science and technology National Taiwan University Taipei10607 Taiwan Center for High Energy Physics Chung-Yuan Christian University Chung-Li32023 Taiwan Centre for Theoretical and Computational Physics National Yang Ming Chiao Tung University 1001 Ta-Hsueh Road Hsinchu30010 Taiwan CCSE Japan Atomic Energy Agency 178-4-4 Wakashiba Chiba Kashiwa277-0871 Japan

We study the most general Two Higgs Doublet Model with SU(2) gauge fields on the lattice. The phase space is probed through the computation of gauge-invariant global observables serving as proxies for order parameters. In each phase, the spectrum of the theory is analysed for different combinations of bare couplings and different symmetry breaking patterns. The scale setting and determination of the running gauge coupling are performed through the Wilson flow computation of the action density. © 2023, CC BY-NC-ND.

关键词： computation theory

Analysis of how a consciousness-lacking mechanistic observer perceives real events and those simulated by a computer

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Sisini, Francesco Department of Applied Research Tekamed Ltd Via Bellaria 6 Ferrara44121 Italy

Physical theories must stem from observation. The possibility that perceived events are simulated, not real, raises a crucial dilemma about the credibility of known physics, known as the simulation hypothesis. To analyze this hypothesis in deterministic and mechanistic terms, an observer is conceptually developed, whose internal state depends on external events. It is demonstrated that the observer cannot distinguish between simulated and real events. It is argued that if the observer could observe its entire dynamics, it could formulate the necessary principles of relativity to distinguish real from non-real physical motions. Finally, an attempt is made to apply the same considerations developed for the mechanistic observer to the human being. © 2023, CC BY.

关键词： computation theory

Evidence of Transport Degradation in 22 Nm Fd-Soi Charge Trapping Transistors for Neural Network Applications

学校读者我要写书评

暂无评论

SSRN

SSRN 2023年

作者： Al Mamun, Fahad Vrudhula, Sarma Vasileska, Dragica Barnaby, Hugh Esqueda, Ivan Sanchez Arizona State University School of Electrical Computer and Energy Engineering TempeAZ85281 United States Arizona State University School of Computing and Augmented Intelligence TempeAZ85281 United States

This article reports on the characterization and analysis of 22 nm FD-SOI CMOS technology-based charge trap transistors (CTT) and their application in neural networks. The working principle of CTT as non-volatile memory depends on trapping and de-trapping of charge in the high-k gate dielectric with the application of voltage pulses on the drain and gate terminals. This programming condition leads to the generation of interfacial traps that can drastically impact device performance. We report degradation in CTT through extractions of subthreshold swing, ON-state current, and mobility. We elucidate transport degradation by correlating effective mobility to interface trap density using a quasi-ballistic transport theory essential for the nanoscale devices under test in this work. Importantly, the trap-induced degradation in CTT transport is not recovered with voltage pulsing at room temperature as our experiments show. We demonstrate the implications of these findings based on analog computation of dot products, an operation of utmost importance to the implementation of artificial neural networks. © 2023, The Authors. All rights reserved.

关键词： computation theory

Linking Network- and Neuron-Level Correlations by Renormalized Field theory

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Dick, Michael van Meegen, Alexander Helias, Moritz Jülich Research Centre Jülich Germany Department of Computer Science 3 - Software Engineering RWTH Aachen University Aachen Germany Jülich Research Centre Jülich Germany Institute of Zoology University of Cologne Cologne50674 Germany Department of Physics Faculty 1 RWTH Aachen University Aachen Germany

It is frequently hypothesized that cortical networks operate close to a critical point. Advantages of criticality include rich dynamics well-suited for computation and critical slowing down, which may offer a mechanism for dynamic memory. However, mean-field approximations, while versatile and popular, inherently neglect the fluctuations responsible for such critical dynamics. Thus, a renormalized theory is necessary. We consider the Sompolinsky-Crisanti-Sommers model which displays a well studied chaotic as well as a magnetic transition. Based on the analogue of a quantum effective action, we derive self-consistency equations for the first two renormalized Greens functions. Their self-consistent solution reveals a coupling between the population level activity and single neuron heterogeneity. The quantitative theory explains the population autocorrelation function, the single-unit autocorrelation function with its multiple temporal scales, and cross correlations. Copyright © 2023, The Authors. All rights reserved.

关键词： computation theory

学校读者我要写书评

暂无评论

What is a theory ?

arXiv 2023年

作者： Dowek, Gilles INRIA-Rocquencourt BP 105 Le Chesnay78153 Cedex France

Deduction modulo is a way to express a theory using computation rules instead of axioms. We present in this paper an extension of deduction modulo, called Polarized deduction modulo, where some rules can only be used at positive occurrences, while others can only be used at negative ones. We show that all theories in propositional calculus can be expressed in this framework and that cuts can always be eliminated with such theories. Copyright © 2023, The Authors. All rights reserved.

关键词： computation theory

A General theory of Liquidity Provisioning for Automated Market Makers

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Bhaskara, Adithya Frongillo, Rafael Papireddygari, Maneesha

In decentralized finance, it is common for automated market makers to provision liquidity from external parties. The market maker rewards these liquidity providers with a cut of the trading fees, in exchange for the risk they take on. A handful of protocols for liquidity provisioning have been proposed, such as Uniswap V2 and V3, with specific and sometimes complex rules for collecting liquidity deposits, executing trades, and dividing up fees. Beyond these examples, and a broader understanding of liquidity provisioning, and particularly the design space from which one could choose a different protocols, has been out of reach. In this work, we show that one can view liquidity provisioning very broadly as the practice of running several market makers "in parallel": each market maker provides its own liquidity, yet the combined group can operate as a single coherent market. We prove that this general protocol, when restricted to specific forms of the constituent market makers, recovers Uniswap V2 and V3 as special cases. We then go on to propose a new restriction which may have advantages over Uniswap V3. In the context of prediction markets, where computation costs are less constrained, our general protocol gives a maximally flexible way to provision liquidity. We conclude with remarks about the nature of liquidity and fees in markets with more than 2 assets, and several open questions. Copyright © 2023, The Authors. All rights reserved.

关键词： computation theory

Weyl operators, Tomita-Takesaki theory, and Bell-Clauser-Horne-Shimony-Holt inequality violations

学校读者我要写书评

暂无评论

arXiv 2023年

作者： De Fabritiis, P. Guedes, F.M. Guimaraes, M.S. Peruzzo, G. Roditi, I. Sorella, S.P. CBPF Centro Brasileiro de Pesquisas Físicas Rua Dr. Xavier Sigaud 150 Rio de Janeiro22290-180 Brazil UERJ Universidade do Estado do Rio de Janeiro Instituto de Física Departamento de Física Teórica Rua São Francisco Xavier 524 Maracanã Rio de Janeiro20550-013 Brazil UFF − Instituto de Física Universidade Federal Fluminense Campus da Praia Vermelha Av. Litorânea s/n RJ Niterói24210-346 Brazil

The violation of the Bell-CHSH inequality in the vacuum state of a relativistic free real scalar field is established by means of the Tomita-Takesaki construction and of the direct computation of the correlation funct... 详细信息

关键词： computation theory

computation of Nash Equilibria of Attack and Defense Games on Networks

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Kaźmierowski, Stanislaw Dziubiński, Marcin University of Warsaw Faculty of Mathematics Informatics and Mechanics Banacha 2 Warsaw02-097 Poland

We consider the computation of a Nash equilibrium in attack and defense games on networks (Bloch et al. [1]). We prove that a Nash Equilibrium of the game can be computed in polynomial time with respect to the number of nodes in the network. We propose an algorithm that runs in O(n4) time with respect to the number of nodes of the network, *** Codes ACM-class: J.4 © 2023, CC BY.

关键词： computation theory

Can We Find Nash Equilibria at a Linear Rate in Markov Games?

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Song, Zhuoqing Lee, Jason D. Yang, Zhuoran Fudan University China Princeton University United States Yale University United States

We study decentralized learning in two-player zero-sum discounted Markov games where the goal is to design a policy optimization algorithm for either agent satisfying two properties. First, the player does not need to know the policy of the opponent to update its policy. Second, when both players adopt the algorithm, their joint policy converges to a Nash equilibrium of the game. To this end, we construct a meta algorithm, dubbed as Homotopy-PO, which provably finds a Nash equilibrium at a global linear rate. In particular, Homotopy-PO interweaves two base algorithms Local-Fast and Global-Slow via homotopy continuation. Local-Fast is an algorithm that enjoys local linear convergence while Global-Slow is an algorithm that converges globally but at a slower sublinear rate. By switching between these two base algorithms, Global-Slow essentially serves as a "guide" which identifies a benign neighborhood where Local-Fast enjoys fast convergence. However, since the exact size of such a neighborhood is unknown, we apply a doubling trick to switch between these two base algorithms. The switching scheme is delicately designed so that the aggregated performance of the algorithm is driven by Local-Fast. Furthermore, we prove that Local-Fast and Global-Slow can both be instantiated by variants of optimistic gradient descent/ascent (OGDA) method, which is of independent interest. Copyright © 2023, The Authors. All rights reserved.

关键词： computation theory