Coarse-grained Bootstrap of Quantum Many-body Systems

• URL: http://arxiv.org/abs/2412.07837v3
• Date: Fri, 26 Sep 2025 11:15:26 GMT
• Title: Coarse-grained Bootstrap of Quantum Many-body Systems
• Abstract summary: We present a new computational framework combining coarse-graining techniques with bootstrap methods to study quantum many-body systems.<n>The method efficiently computes rigorous upper and lower bounds on both zero- and finite-temperature expectation values of any local observables of infinite quantum spin chains.
• Score: 1.5495593104596397
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We present a new computational framework combining coarse-graining techniques with bootstrap methods to study quantum many-body systems. The method efficiently computes rigorous upper and lower bounds on both zero- and finite-temperature expectation values of any local observables of infinite quantum spin chains. This is achieved by using tensor networks to coarse-grain bootstrap constraints, including positivity, translation invariance, equations of motion, and energy-entropy balance inequalities. Coarse-graining allows access to constraints from significantly larger subsystems than previously possible, yielding substantially tighter bounds compared to earlier methods.

Related papers

• Balancing Expressivity and Learnability in Quantum Kernel Bandit Optimization [50.880384999888044]
  We develop misspecified GP bandit algorithms and derive regret bounds that characterize the trade-off between approximation error and information gain.<n>Our methods outperform full quantum kernels in sample efficiency, while substantially reducing computational overhead.
  arXiv  Detail & Related papers  (2026-07-01T15:38:00Z)
• Toward bootstrapping tensor-network contractions [0.0]
  We introduce a numerical bootstrap framework which casts the problem of tensor-network contractions into a convex optimization problem.<n>We show that, assuming a canonical form, second-order relaxation-cone can provide tight bounds on the contraction result.
  arXiv  Detail & Related papers  (2026-03-18T15:44:19Z)
• Quartic quantum speedups for community detection [84.14713515477784]
  We develop a quantum algorithm for hypergraph community detection that achieves a quartic quantum speedup.<n>Our algorithm is based on the Kikuchi method, which we extend beyond previously considered problems such as PCA and $p$XORSAT.
  arXiv  Detail & Related papers  (2025-10-09T17:35:17Z)
• Quantum advantage without exponential concentration: Trainable kernels for symmetry-structured data [0.0]
  We analytically prove that covariant quantum kernels tailored to datasets with group symmetries avoid exponential concentration.<n>We show through numerical simulations that the kernel variance remains finite and robust, even under substantial noise.<n>These findings establish a family of quantum learning models that are simultaneously trainable, resilient to coherent noise, and linked to classically hard problems.
  arXiv  Detail & Related papers  (2025-09-17T18:06:17Z)
• Non-perturbative switching rates in bistable open quantum systems: from driven Kerr oscillators to dissipative cat qubits [72.41778531863143]
  We use path integral techniques to predict the switching rate in a single-mode bistable open quantum system.<n>Our results open new avenues for exploring switching phenomena in multistable single- and many-body open quantum systems.
  arXiv  Detail & Related papers  (2025-07-24T18:01:36Z)
• Excitation Amplitude Sampling for Low Variance Electronic Structure on Quantum Computers [0.0]
  We combine classicalenergetics with partial shadow tomography to enable efficient protocols for extracting information from correlated ab initio electronic systems encoded on quantum devices.<n>We can demonstrate an almost two order of magnitude of reduction in required number of shots for a given quantum state excitation amplitudes.<n>We find a high-degree of noise resilience of these estimators on real quantum devices, with up to an order of magnitude increase in the tolerated noise compared to traditional techniques.
  arXiv  Detail & Related papers  (2025-06-18T13:13:09Z)
• Certifying steady-state properties of open quantum systems [0.0]
  Estimating steady state properties of open quantum systems is a crucial problem in quantum technology. We show how to derive in a scalable way using semi-definite programming certified bounds on the expectation value of an arbitrary observable.
  arXiv  Detail & Related papers  (2024-10-17T15:13:12Z)
• An efficient finite-resource formulation of non-Abelian lattice gauge theories beyond one dimension [0.0]
  We propose a resource-efficient method to compute the running of the coupling in non-Abelian gauge theories beyond one spatial dimension. Our method enables computations at arbitrary values of the bare coupling and lattice spacing with current quantum computers, simulators and tensor-network calculations.
  arXiv  Detail & Related papers  (2024-09-06T17:59:24Z)
• Quantum Bayesian Optimization [64.58749619145908]
  We introduce the quantum-Gaussian process-upper confidence bound (Q-GP-UCB) algorithm. It is the first BO algorithm able to achieve a regret upper bound of O(polylog T), which is significantly smaller than its regret lower bound of Omega(sqrt(T)) in the classical setting. Thanks to our novel analysis of the confidence ellipsoid, our Q-GP-UCB with the linear kernel achieves a smaller regret than the quantum linear UCB algorithm.
  arXiv  Detail & Related papers  (2023-10-09T03:10:42Z)
• Near-Term Distributed Quantum Computation using Mean-Field Corrections and Auxiliary Qubits [77.04894470683776]
  We propose near-term distributed quantum computing that involve limited information transfer and conservative entanglement production. We build upon these concepts to produce an approximate circuit-cutting technique for the fragmented pre-training of variational quantum algorithms.
  arXiv  Detail & Related papers  (2023-09-11T18:00:00Z)
• Quantum Transport in Open Spin Chains using Neural-Network Quantum States [11.137438870686026]
  We study the treatment of asymmetric open quantum systems with neural networks based on the restricted Boltzmann machine. In particular, we are interested in the non-equilibrium steady state current in the boundary-driven (anisotropic) Heisenberg spin chain.
  arXiv  Detail & Related papers  (2022-12-27T11:30:47Z)
• A Dynamical System View of Langevin-Based Non-Convex Sampling [44.002384711340966]
  Non- sampling is a key challenge in machine learning, central to non-rate optimization in deep learning as well as to approximate its significance. Existing guarantees typically only hold for the averaged distances rather than the more desirable last-rate iterates. We develop a new framework that lifts the above issues by harnessing several tools from the theory systems.
  arXiv  Detail & Related papers  (2022-10-25T09:43:36Z)
• Decimation technique for open quantum systems: a case study with driven-dissipative bosonic chains [62.997667081978825]
  Unavoidable coupling of quantum systems to external degrees of freedom leads to dissipative (non-unitary) dynamics. We introduce a method to deal with these systems based on the calculation of (dissipative) lattice Green's function. We illustrate the power of this method with several examples of driven-dissipative bosonic chains of increasing complexity.
  arXiv  Detail & Related papers  (2022-02-15T19:00:09Z)
• Numerical estimation of reachable and controllability sets for a two-level open quantum system driven by coherent and incoherent controls [77.34726150561087]
  The article considers a two-level open quantum system governed by the Gorini--Kossakowski--Lindblad--Sudarshan master equation. The system is analyzed using Bloch parametrization of the system's density matrix.
  arXiv  Detail & Related papers  (2021-06-18T14:23:29Z)
• Accelerating the computation of quantum brachistochrone [7.899140236856746]
  An alternative set of differential equations are derived for an optimal quantum control of single or multiple qubits with or without interaction. A relaxation technique is designed for numerically detecting optimal paths involving entanglement. In the 'ground state' solution among the set of optimal paths, the time-reversal symmetry of the system shows up.
  arXiv  Detail & Related papers  (2020-11-25T10:39:53Z)
• The role of boundary conditions in quantum computations of scattering observables [58.720142291102135]
  Quantum computing may offer the opportunity to simulate strongly-interacting field theories, such as quantum chromodynamics, with physical time evolution. As with present-day calculations, quantum computation strategies still require the restriction to a finite system size. We quantify the volume effects for various $1+1$D Minkowski-signature quantities and show that these can be a significant source of systematic uncertainty.
  arXiv  Detail & Related papers  (2020-07-01T17:43:11Z)
• A resource efficient approach for quantum and classical simulations of gauge theories in particle physics [0.0]
  lattice gauge theory (LGT) calculations have been pivotal in our understanding of fundamental interactions. Hamiltonian-based formulations involve infinite-dimensional gauge degrees of freedom that can solely be handled by truncation. We provide a resource-efficient protocol to simulate LGTs with continuous gauge groups in the Hamiltonian formulation.
  arXiv  Detail & Related papers  (2020-06-25T04:10:11Z)
• Lagrangian Decomposition for Neural Network Verification [148.0448557991349]
  A fundamental component of neural network verification is the computation of bounds on the values their outputs can take. We propose a novel approach based on Lagrangian Decomposition. We show that we obtain bounds comparable with off-the-shelf solvers in a fraction of their running time.
  arXiv  Detail & Related papers  (2020-02-24T17:55:10Z)

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.