Efficient Algorithms for Weakly-Interacting Quantum Spin Systems

• URL: http://arxiv.org/abs/2601.21140v1
• Date: Thu, 29 Jan 2026 00:49:31 GMT
• Title: Efficient Algorithms for Weakly-Interacting Quantum Spin Systems
• Authors: Ryan L. Mann, Gabriel Waite,
• Abstract summary: We find efficient algorithms for weakly-interacting quantum spin systems at arbitrary temperature.<n>In particular, we obtain a fully establish-time approximation scheme for the partition function.<n>Our approach is based on the cluster expansion method and a standard reduction from approximate sampling to approximate counting.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We establish efficient algorithms for weakly-interacting quantum spin systems at arbitrary temperature. In particular, we obtain a fully polynomial-time approximation scheme for the partition function and an efficient approximate sampling scheme for the thermal distribution over a classical spin space. Our approach is based on the cluster expansion method and a standard reduction from approximate sampling to approximate counting.

Related papers

• Efficient computation of quantum time-optimal control [0.0]
  We present an approach to compute time-optimal control of a quantum system which combines quantum brachistochrone and Lax pair techniques.<n>We illustrate our method by finding the fastest way to transfer a single-particle excitation in a nearest-neighbor-coupled infinitely large qubit lattice with the fixed sum of squares of the couplings.
  arXiv  Detail & Related papers  (2025-11-14T17:29:16Z)
• Connection between single-layer Quantum Approximate Optimization Algorithm interferometry and thermal distributions sampling [0.0]
  We extend the theoretical derivation of the amplitudes of the eigenstates, and the Boltzmann distributions generated by single-layer QAOA. We also review the implications that this behavior has from both a practical and fundamental perspective.
  arXiv  Detail & Related papers  (2023-10-13T15:06:58Z)
• GRAPE optimization for open quantum systems with time-dependent decoherence rates driven by coherent and incoherent controls [77.34726150561087]
  The GRadient Ascent Pulse Engineering (GRAPE) method is widely used for optimization in quantum control. We adopt GRAPE method for optimizing objective functionals for open quantum systems driven by both coherent and incoherent controls. The efficiency of the algorithm is demonstrated through numerical simulations for the state-to-state transition problem.
  arXiv  Detail & Related papers  (2023-07-17T13:37:18Z)
• Sample Complexity for Quadratic Bandits: Hessian Dependent Bounds and Optimal Algorithms [64.10576998630981]
  We show the first tight characterization of the optimal Hessian-dependent sample complexity. A Hessian-independent algorithm universally achieves the optimal sample complexities for all Hessian instances. The optimal sample complexities achieved by our algorithm remain valid for heavy-tailed noise distributions.
  arXiv  Detail & Related papers  (2023-06-21T17:03:22Z)
• Algorithmic Cluster Expansions for Quantum Problems [0.0]
  We establish a general framework for developing approximation algorithms for a class of counting problems. We apply our framework to approximating probability amplitudes of a class of quantum circuits close to the identity. We show that our algorithmic condition is almost optimal for expectation values and optimal for thermal expectation values in the sense of zero freeness.
  arXiv  Detail & Related papers  (2023-06-15T09:11:48Z)
• Fast Computation of Optimal Transport via Entropy-Regularized Extragradient Methods [75.34939761152587]
  Efficient computation of the optimal transport distance between two distributions serves as an algorithm that empowers various applications. This paper develops a scalable first-order optimization-based method that computes optimal transport to within $varepsilon$ additive accuracy.
  arXiv  Detail & Related papers  (2023-01-30T15:46:39Z)
• Automatic and effective discovery of quantum kernels [41.61572387137452]
  Quantum computing can empower machine learning models by enabling kernel machines to leverage quantum kernels for representing similarity measures between data.<n>We present an approach to this problem, which employs optimization techniques, similar to those used in neural architecture search and AutoML.<n>The results obtained by testing our approach on a high-energy physics problem demonstrate that, in the best-case scenario, we can either match or improve testing accuracy with respect to the manual design approach.
  arXiv  Detail & Related papers  (2022-09-22T16:42:14Z)
• Efficient Algorithms for Approximating Quantum Partition Functions at Low Temperature [0.0]
  We establish an efficient approximation algorithm for the partition functions of a class of quantum spin systems at low temperature. Our algorithm is based on combining the contour representation of quantum spin systems of this type due to Borgs, Koteck'y, and Ueltschi.
  arXiv  Detail & Related papers  (2022-01-17T17:27:13Z)
• A Stochastic Newton Algorithm for Distributed Convex Optimization [62.20732134991661]
  We analyze a Newton algorithm for homogeneous distributed convex optimization, where each machine can calculate gradients of the same population objective. We show that our method can reduce the number, and frequency, of required communication rounds compared to existing methods without hurting performance.
  arXiv  Detail & Related papers  (2021-10-07T17:51:10Z)
• Sequential Subspace Search for Functional Bayesian Optimization Incorporating Experimenter Intuition [63.011641517977644]
  Our algorithm generates a sequence of finite-dimensional random subspaces of functional space spanned by a set of draws from the experimenter's Gaussian Process. Standard Bayesian optimisation is applied on each subspace, and the best solution found used as a starting point (origin) for the next subspace. We test our algorithm in simulated and real-world experiments, namely blind function matching, finding the optimal precipitation-strengthening function for an aluminium alloy, and learning rate schedule optimisation for deep networks.
  arXiv  Detail & Related papers  (2020-09-08T06:54:11Z)
• IDEAL: Inexact DEcentralized Accelerated Augmented Lagrangian Method [64.15649345392822]
  We introduce a framework for designing primal methods under the decentralized optimization setting where local functions are smooth and strongly convex. Our approach consists of approximately solving a sequence of sub-problems induced by the accelerated augmented Lagrangian method. When coupled with accelerated gradient descent, our framework yields a novel primal algorithm whose convergence rate is optimal and matched by recently derived lower bounds.
  arXiv  Detail & Related papers  (2020-06-11T18:49:06Z)
• Efficient Algorithms for Approximating Quantum Partition Functions [0.0]
  We establish a time approximation algorithm for partition functions of quantum spin models at high temperature. Our main contribution is a simple and slightly sharper analysis for the case of pairwise interactions on bounded-degree graphs.
  arXiv  Detail & Related papers  (2020-04-24T07:21:43Z)

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.