Digitizing SU(2) Gauge Fields and What to Look Out for When Doing So

• URL: http://arxiv.org/abs/2212.09496v1
• Date: Mon, 19 Dec 2022 14:31:47 GMT
• Title: Digitizing SU(2) Gauge Fields and What to Look Out for When Doing So
• Authors: Tobias Hartung, Timo Jakobs, Karl Jansen, Johann Ostmeyer and Carsten Urbach
• Abstract summary: We present our results for a handful of discretization approaches for the non-trivial example of SU(2). A generalized version of the Fibonacci spiral appears to be particularly efficient and close to optimal.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: With the long term perspective of using quantum computers and tensor networks for lattice gauge theory simulations, an efficient method of digitizing gauge group elements is needed. We thus present our results for a handful of discretization approaches for the non-trivial example of SU(2), such as its finite subgroups, as well as different classes of finite subsets. We focus our attention on a freezing transition observed towards weak couplings. A generalized version of the Fibonacci spiral appears to be particularly efficient and close to optimal.

Related papers

• Shot-noise reduction for lattice Hamiltonians [0.7852714805965528]
  Efficiently estimating energy expectation values of lattice Hamiltonians on quantum computers is a serious challenge. We introduce geometric partitioning as a scalable alternative. We show how the sampling number improvement translates to imperfect eigenstate improvements.
  arXiv  Detail & Related papers  (2024-10-28T17:50:28Z)
• Quantum entanglement in the multicritical disordered Ising model [0.0]
  entanglement entropy is calculated at the quantum multicritical point of the random transverse-field Ising model. We find a universal logarithmic corner contribution to the area law b*ln(l) that is independent of the form of disorder.
  arXiv  Detail & Related papers  (2024-04-19T16:42:43Z)
• Quantization of Large Language Models with an Overdetermined Basis [73.79368761182998]
  We introduce an algorithm for data quantization based on the principles of Kashin representation. Our findings demonstrate that Kashin Quantization achieves competitive or superior quality in model performance.
  arXiv  Detail & Related papers  (2024-04-15T12:38:46Z)
• Gaussian Entanglement Measure: Applications to Multipartite Entanglement of Graph States and Bosonic Field Theory [50.24983453990065]
  An entanglement measure based on the Fubini-Study metric has been recently introduced by Cocchiarella and co-workers. We present the Gaussian Entanglement Measure (GEM), a generalization of geometric entanglement measure for multimode Gaussian states. By providing a computable multipartite entanglement measure for systems with a large number of degrees of freedom, we show that our definition can be used to obtain insights into a free bosonic field theory.
  arXiv  Detail & Related papers  (2024-01-31T15:50:50Z)
• One-step Bipartite Graph Cut: A Normalized Formulation and Its Application to Scalable Subspace Clustering [56.81492360414741]
  We show how to enforce a one-step normalized cut for bipartite graphs, especially with linear-time complexity. In this paper, we first characterize a novel one-step bipartite graph cut criterion with normalized constraints, and theoretically prove its equivalence to a trace problem. We extend this cut criterion to a scalable subspace clustering approach, where adaptive anchor learning, bipartite graph learning, and one-step normalized bipartite graph partitioning are simultaneously modeled.
  arXiv  Detail & Related papers  (2023-05-12T11:27:20Z)
• Binarizing Sparse Convolutional Networks for Efficient Point Cloud Analysis [93.55896765176414]
  We propose binary sparse convolutional networks called BSC-Net for efficient point cloud analysis. We employ the differentiable search strategies to discover the optimal opsitions for active site matching in the shifted sparse convolution. Our BSC-Net achieves significant improvement upon our srtong baseline and outperforms the state-of-the-art network binarization methods.
  arXiv  Detail & Related papers  (2023-03-27T13:47:06Z)
• Gluon Digitization via Character Expansion for Quantum Computers [0.0]
  Scheme based on discrete subgroups use a smaller, fixed number of qubits at the cost of systematic errors. We systematize this approach by deriving the single plaquette action through matching the continuous group action to that of a discrete one. We accompany this scheme by simulations of pure gauge over the largest discrete crystal-like subgroup of $SU(3)$ up to the fifth-order in the coupling constant.
  arXiv  Detail & Related papers  (2022-03-04T14:12:52Z)
• The Sample Complexity of One-Hidden-Layer Neural Networks [57.6421258363243]
  We study a class of scalar-valued one-hidden-layer networks, and inputs bounded in Euclidean norm. We prove that controlling the spectral norm of the hidden layer weight matrix is insufficient to get uniform convergence guarantees. We analyze two important settings where a mere spectral norm control turns out to be sufficient.
  arXiv  Detail & Related papers  (2022-02-13T07:12:02Z)
• Digitising SU(2) Gauge Fields and the Freezing Transition [0.0]
  For any Lie group other than U$(1)$, there is no class ofally dense discrete subgroups. Discretisations limited to subgroups are bound to lead to freezing of Monte Carlo simulations at weak couplings. A generalised version of the Fibonacci spiral appears to be particularly efficient and close to optimal.
  arXiv  Detail & Related papers  (2022-01-24T12:09:09Z)
• Two-dimensional $\mathbb{Z}_2$ lattice gauge theory on a near-term quantum simulator: variational quantum optimization, confinement, and topological order [0.0]
  We propose an implementation of a two-dimensional $mathbbZ$ lattice gauge theory model on a shallow quantum circuit. The ground state preparation is numerically analyzed on a small lattice with a variational quantum algorithm. Our work shows that variational quantum algorithms provide a useful technique to be added in the growing toolbox for digital simulations of lattice gauge theories.
  arXiv  Detail & Related papers  (2021-12-22T10:45:33Z)
• Efficient Semi-Implicit Variational Inference [65.07058307271329]
  We propose an efficient and scalable semi-implicit extrapolational (SIVI) Our method maps SIVI's evidence to a rigorous inference of lower gradient values.
  arXiv  Detail & Related papers  (2021-01-15T11:39:09Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.