Related papers: Path optimization for $U(1)$ gauge theory with com…
We investigate the phase diagram of the compact $U(1)$ lattice gauge theory in four dimensions using a non-standard action which is invariant under continuous deformations of the plaquette angles. Just as for the Wilson action, we find a…
An important and difficult problem in optimization is the high-order unconstrained binary optimization, which can represent many optimization problems more efficient than quadratic unconstrained binary optimization, but how to quickly solve…
Theories that contain first class constraints possess gauge invariance which results in the necessity of altering the measure in the associated quantum mechanical path integral. If the path integral is derived from the canonical structure…
We propose an optimal algorithm for solving the longest path problem in undirected weighted graphs. By using graph partitioning and dynamic programming, we obtain an algorithm that is significantly faster than other state-of-the-art…
We use a self-guided random walk to solve the ground-state problem of Hamiltonian U(1) pure gauge theory in 2+1 dimensions in the string sector. By making use of the electric-field representation, we argue that the spatial distribution of…
Photon correlators in $~U(1)~$ pure gauge theory for different lattice actions are considered under the Lorentz gauge condition. They are shown to depend strongly on the gauge fixing ambiguity and on the corresponding existence of Dirac…
Path integral formulation based on the canonical method is discussed. Path integral for Yang-Mills theory is obtained by this procedure. It is shown that gauge fixing which is essential procedure to quantize singular systems by Faddeev's…
We investigate the phase structure of pure compact U(1) lattice gauge theory in 4 dimensions with the Wilson action supplemented by a monopole term. To overcome the suppression of transitions between the phases in the simulations we make…
We apply the path optimization method to a QCD effective model with the Polyakov loop at finite density to circumvent the model sign problem. The Polyakov-loop extended Nambu--Jona-Lasinio model is employed as the typical QCD effective…
A new approach for enhancing the process-variation tolerance of digital circuits is described. We extend recent advances in statistical timing analysis into an optimization framework. Our objective is to reduce the performance variance of a…
We investigate a proposal for the construction of models with chiral fermions on the lattice using staggered fermions. In this approach the gauge invariance is broken by the coupling of the staggered fermions to the gauge fields. Motivated…
We study graph ordering problems with a min-max objective. A classical problem of this type is cutwidth, where given a graph we want to order its vertices such that the number of edges crossing any point is minimized. We give a $…
Solving optimization problems leads to elegant and practical solutions in a wide variety of real-world applications. In many of those real-world applications, some of the information required to specify the relevant optimization problem is…
Pure {\it compact} $U(1)$ lattice gauge theory exhibits a phase transition at gauge coupling $g \sim {\cal{O}}(1)$ separating a familiar weak coupling Coulomb phase, having free massless photons, from a strong coupling phase. However, the…
We consider the problem of estimation of a covariance matrix for Gaussian data in a high dimensional setting. Existing approaches include maximum likelihood estimation under a pre-specified sparsity pattern, l_1-penalized loglikelihood…
The three dimensional U(1) Lattice Gauge, in the weak coupling limit, is dual to a Discrete Gaussian model. We investigate this dual model and use it to calculate properties of the U(1) theory. We find that, because of the nature of the…
We present a multi-phase design parameterization to obtain optimized heterogeneous lattice structures. The 3D domain is discretized into a cubical grid wherein each cube has eight distinct unit cell types or phases. When all phases are…
In this paper we present an algorithmic framework for solving a class of combinatorial optimization problems on graphs with bounded pathwidth. The problems are NP-hard in general, but solvable in linear time on this type of graphs. The…
We propose a convex-concave programming approach for the labeled weighted graph matching problem. The convex-concave programming formulation is obtained by rewriting the weighted graph matching problem as a least-square problem on the set…
In pure gauge SU(3) near beta = 6, weak and strong coupling expansions break down and the MC method seems to be the only practical alternative. We discuss the possibility of using a modified version of perturbation theory which relies on a…