Self-concordant Schrödinger operators: spectral gaps and optimization without condition numbers

• URL: http://arxiv.org/abs/2510.06115v1
• Date: Tue, 07 Oct 2025 16:50:42 GMT
• Title: Self-concordant Schrödinger operators: spectral gaps and optimization without condition numbers
• Authors: Sander Gribling, Simon Apers, Harold Nieuwboer, Michael Walter,
• Abstract summary: We study Schr"odinger operators associated with self-concordant barriers over convex domains.<n>We find that the spectral gap does not display any condition-number dependence when the usual Laplacian is replaced by the Laplace--Beltrami operator.
• Score: 2.027398351960778
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Spectral gaps play a fundamental role in many areas of mathematics, computer science, and physics. In quantum mechanics, the spectral gap of Schr\"odinger operators has a long history of study due to its physical relevance, while in quantum computing spectral gaps are an important proxy for efficiency, such as in the quantum adiabatic algorithm. Motivated by convex optimization, we study Schr\"odinger operators associated with self-concordant barriers over convex domains and prove non-asymptotic lower bounds on the spectral gap for this class of operators. Significantly, we find that the spectral gap does not display any condition-number dependence when the usual Laplacian is replaced by the Laplace--Beltrami operator, which uses second-order information of the barrier and hence can take the curvature of the barrier into account. As an algorithmic application, we construct a novel quantum interior point method that applies to arbitrary self-concordant barriers and shows no condition-number dependence. To achieve this we combine techniques from semiclassical analysis, convex optimization, and quantum annealing.

Related papers

• Identifying quantum coherence in quantum annealers [37.067444579637076]
  We use many-body coherent oscillations (MBCO) as a diagnostic for the identification of system-wide coherence in analog quantum simulators.<n>This work gives a general roadmap for the search for quantum coherence in noisy, large-scale quantum platforms.
  arXiv  Detail & Related papers  (2026-02-24T20:39:41Z)
• Mechanisms for Quantum Advantage in Global Optimization of Nonconvex Functions [6.135587835061064]
  We show new theoretical mechanisms for quantum speedup in the global optimization of non-asymotic functions.<n>We formalize these ideas by proving that a real-space quantum algorithm (RsAA) achieves provably on-time runtimes.
  arXiv  Detail & Related papers  (2025-10-03T17:40:31Z)
• Acquisition of Delocalized Information via Classical and Quantum Carriers [0.0]
  We investigate the information-theoretic power of spatial superposition by analyzing tasks in which information is encoded at multiple distant sites.<n>We compare the statistical correlations that can be generated in such tasks using classical particles, quantum particles in spatial superposition, and hypothetical "second-order interference" resources.
  arXiv  Detail & Related papers  (2025-06-12T19:55:04Z)
• Avoided-crossings, degeneracies and Berry phases in the spectrum of quantum noise through analytic Bloch-Messiah decomposition [49.1574468325115]
  "analytic Bloch-Messiah decomposition" provides approach for characterizing dynamics of quantum optical systems.<n>We show that avoided crossings arise naturally when a single parameter is varied, leading to hypersensitivity of the singular vectors.<n>We highlight the possibility of programming the spectral response of photonic systems through the deliberate design of avoided crossings.
  arXiv  Detail & Related papers  (2025-04-29T13:14:15Z)
• QAMA: Scalable Quantum Annealing Multi-Head Attention Operator for Deep Learning [48.12231190677108]
  Quantum Annealing Multi-Head Attention (QAMA) is proposed, a novel drop-in operator that reformulates attention as an energy-based Hamiltonian optimization problem.<n>In this framework, token interactions are encoded into binary quadratic terms, and quantum annealing is employed to search for low-energy configurations.<n> Empirically, evaluation on both natural language and vision benchmarks shows that, across tasks, accuracy deviates by at most 2.7 points from standard multi-head attention.
  arXiv  Detail & Related papers  (2025-04-15T11:29:09Z)
• Schrödingerization based Quantum Circuits for Maxwell's Equation with time-dependent source terms [24.890270804373824]
  This paper explicitly constructs a quantum circuit for Maxwell's equations with perfect electric conductor (PEC) boundary conditions. We show that quantum algorithms constructed using Schr"odingerisation exhibit acceleration in computational complexity compared to the classical Finite Difference Time Domain (FDTD) format.
  arXiv  Detail & Related papers  (2024-11-17T08:15:37Z)
• Exact spectral gaps of random one-dimensional quantum circuits [0.3774866290142281]
  spectral gap of local random quantum circuits is a fundamental property that determines how close the moments of the circuit's unitaries match those of a Haar random distribution. We show that one can exactly compute the associated spectral gaps. We verify our results by numerically computing the spectral gap for systems of up to 70 qubits, as well as comparing them to gaps of random and symplectic circuits.
  arXiv  Detail & Related papers  (2024-08-20T21:23:42Z)
• Universal Euler-Cartan Circuits for Quantum Field Theories [0.0]
  A hybrid quantum-classical algorithm is presented for the computation of non-perturbative characteristics of quantum field theories. The algorithm relies on a universal parametrized quantum circuit ansatz based on Euler and Cartan's decompositions of single and two-qubit operators.
  arXiv  Detail & Related papers  (2024-07-31T01:59:09Z)
• Dilation theorem via Schr\"odingerisation, with applications to the quantum simulation of differential equations [29.171574903651283]
  Nagy's unitary dilation theorem in operator theory asserts the possibility of dilating a contraction into a unitary operator. In this study, we demonstrate the viability of the recently devised Schr"odingerisation approach.
  arXiv  Detail & Related papers  (2023-09-28T08:55:43Z)
• A Lie Algebraic Theory of Barren Plateaus for Deep Parameterized Quantum Circuits [37.84307089310829]
  Variational quantum computing schemes train a loss function by sending an initial state through a parametrized quantum circuit. Despite their promise, the trainability of these algorithms is hindered by barren plateaus. We present a general Lie algebra that provides an exact expression for the variance of the loss function of sufficiently deep parametrized quantum circuits.
  arXiv  Detail & Related papers  (2023-09-17T18:14:10Z)
• Design of optimization tools for quantum information theory [0.0]
  We introduce an algorithm for quantum estate estimation and a technique for certifying quantum non-locality. To study the quantum marginal problem, we develop an algorithm, which takes as inputs a set of quantum marginals and eigenvalues, and outputs a density matrix.
  arXiv  Detail & Related papers  (2022-04-15T19:37:21Z)
• Experimental violations of Leggett-Garg's inequalities on a quantum computer [77.34726150561087]
  We experimentally observe the violations of Leggett-Garg-Bell's inequalities on single and multi-qubit systems. Our analysis highlights the limits of nowadays quantum platforms, showing that the above-mentioned correlation functions deviate from theoretical prediction as the number of qubits and the depth of the circuit grow.
  arXiv  Detail & Related papers  (2021-09-06T14:35:15Z)
• Models of zero-range interaction for the bosonic trimer at unitarity [91.3755431537592]
  We present the construction of quantum Hamiltonians for a three-body system consisting of identical bosons mutually coupled by a two-body interaction of zero range. For a large part of the presentation, infinite scattering length will be considered.
  arXiv  Detail & Related papers  (2020-06-03T17:54: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.