arXiv subjects

Niklas Galke

Publications and source records attributed to Niklas Galke.

9 recordsLinked to original sources

arXiv2025

Formal Framework for Quantum Advantage

Motivated by notions of quantum heuristics and by average-case rather than worst-case algorithmic analysis, we define quantum computational advantage in terms of individual problem instances. Inspired by the classical notions of Kolmogorov complexity and instance complexity, we define their quantum versions. This allows us to define queasy instances of computational problems, like e.g. Satisfiability and Factoring, as those whose quantum instance complexity is significantly smaller than their classical instance complexity. These instances indicate quantum advantage: they are easy to solve on a quantum computer, but classical algorithms struggle (they feel queasy). Via a reduction from Factoring, we prove the existence of queasy Satisfiability instances; specifically, these instances are maximally queasy (under reasonable complexity-theoretic assumptions). Further, we show that there is exponential algorithmic utility in the queasiness of a quantum algorithm. This formal framework serves as a beacon that guides the hunt for quantum advantage in practice, and moreover, because its focus lies on single instances, it can lead to new ways of designing quantum algorithms.

quant-ph↗

arXiv2025

Soft inductive limits of operator systems and a noncommutative Lazar-Lindenstrauss theorem

We establish a flexible generalization of inductive systems of operator systems, which relaxes the usual transitivity (or coherence) condition to an asymptotic version thereof and allows for systems indexed over arbitrary nets. To illustrate the utility of this generalization, we highlight how such systems arise naturally from completely positive approximations of nuclear operator systems. Going further, we utilize an argument of Ding and Peterson to show that a separable operator system is nuclear if and only if it is an inductive limit of matrix algebras, generalizing a classic Theorem of Lazar and Lindenstrauss to the setting of noncommutative Choquet theory.

math.OA↗

arXiv2025

Unification of observational entropy with maximum entropy principles

We introduce a definition of coarse-grained entropy that unifies measurement-based (observational entropy) and max-entropy-based (Jaynes) approaches to coarse-graining, by identifying physical constraints with information theoretic priors. The definition is shown to include as special cases most other entropies of interest in physics. We then consider second laws, showing that the definition admits new entropy increase theorems and connections to thermodynamics. We survey mathematical properties of the definition, and show it resolves some pathologies of the traditional observational entropy in infinite dimensions. Finally, we study the dynamics of this entropy in a quantum random matrix model and a classical hard sphere gas. Together the results suggest that this generalized observational entropy can form the basis of a highly general approach to statistical mechanics.

quant-ph↗

arXiv2024

Convergence Rates for the Trotter Splitting for Unbounded Operators

We study convergence rates of the Trotter splitting $e^{A+L} = \lim_{n \to \infty} (e^{L/n} e^{A/n})^n$ in the strong operator topology. In the first part, we use complex interpolation theory to treat generators $L$ and $A$ of contraction semigroups on Banach spaces, with $L$ relatively $A$-bounded. In the second part, we study unitary dynamics on Hilbert spaces and develop a new technique based on the concept of energy constraints. Our results provide a complete picture of the convergence rates for the Trotter splitting for all common types of Schr\"odinger and Dirac operators, including singular, confining and magnetic vector potentials, as well as molecular many-body Hamiltonians in dimension $d=3$. Using the Brezis-Mironescu inequality, we derive convergence rates for the Schr\"odinger operator with $V(x)=\pm |x|^{-a}$ potential. In each case, our conditions are fully explicit.

math-ph↗

arXiv2024

State-dependent Trotter Limits and their approximations

The Trotter product formula is a key instrument in numerical simulations of quantum systems. However, computers cannot deal with continuous degrees of freedom, such as the position of particles in molecules, or the amplitude of electromagnetic fields. It is therefore necessary to discretize these variables to make them amenable to digital simulations. Here, we give sufficient conditions to conclude the validity of this approximate discretized physics. Essentially, it depends on the state-dependent Trotter error, for which we establish explicit bounds that are also of independent interest.

quant-ph↗

arXiv2024

Error bounds for Lie Group representations in quantum mechanics

We provide state-dependent error bounds for strongly continuous unitary representations of connected Lie groups. That is, we bound the difference of two unitaries applied to a state in terms of the energy with respect to a reference Hamiltonian associated to the representation and a left-invariant metric distance on the group. Our method works for any connected Lie group and the metric is independent of the chosen representation. The approach also applies to projective representations and allows us to provide bounds on the energy constrained diamond norm distance of any suitably continuous channel representation of the group.

quant-ph↗

arXiv2023

Learning finitely correlated states: stability of the spectral reconstruction

Matrix product operators allow efficient descriptions (or realizations) of states on a 1D lattice. We consider the task of learning a realization of minimal dimension from copies of an unknown state, such that the resulting operator is close to the density matrix in trace norm. For finitely correlated translation-invariant states on an infinite chain, a realization of minimal dimension can be exactly reconstructed via linear algebra operations from the marginals of a size depending on the representation dimension. We establish a bound on the trace norm error for an algorithm that estimates a candidate realization from estimates of these marginals and outputs a matrix product operator, estimating the state of a chain of arbitrary length $t$. This bound allows us to establish an $O(t^2)$ upper bound on the sample complexity of the learning task, with an explicit dependence on the site dimension, realization dimension and spectral properties of a certain map constructed from the state. A refined error bound can be proven for $C^*$-finitely correlated states, which have an operational interpretation in terms of sequential quantum channels applied to the memory system. We can also obtain an analogous error bound for a class of matrix product density operators on a finite chain reconstructible by local marginals. In this case, a linear number of marginals must be estimated, obtaining a sample complexity of $\tilde{O}(t^3)$. The learning algorithm also works for states that are sufficiently close to a finitely correlated state, with the potential of providing competitive algorithms for other interesting families of states.

quant-ph↗

arXiv2023

Quantum Harmonic Analysis on locally compact abelian groups

We extend the notions of quantum harmonic analysis, as introduced in R. Werner's paper from 1984 (J. Math. Phys. 25(5)), to abelian phase spaces, by which we mean a locally compact abelian group endowed with a Heisenberg multiplier. In this way, we obtain a joint harmonic analysis of functions and operators for each such phase space. For all this, we spend significant extra effort to include also phase spaces which are not second countable. We obtain most results from Werner's paper for these general phase spaces, up to Wiener's approximation theorem for operators. As an addition, we extend certain of those results (most notably Wiener's approximation theorem) to operators acting on certain coorbit spaces affiliated with the phase space.

math.FA↗

arXiv2023

Sufficiency of R\'enyi divergences

A set of classical or quantum states is equivalent to another one if there exists a pair of classical or quantum channels mapping either set to the other one. For dichotomies (pairs of states), this is closely connected to (classical or quantum) R\'enyi divergences (RD) and the data-processing inequality: If a RD remains unchanged when a channel is applied to the dichotomy, then there is a recovery channel mapping the image back to the initial dichotomy. Here, we prove for classical dichotomies that equality of the RDs alone is already sufficient for the existence of a channel in any of the two directions and discuss some applications. In the quantum case, all families of quantum RDs are seen to be insufficient because they cannot detect anti-unitary transformations. Thus, including anti-unitaries, we pose the problem of finding a sufficient family. It is shown that the Petz and maximal quantum RD are still insufficient in this more general sense and we provide evidence for sufficiency of the minimal quantum RD. As a side result of our techniques, we obtain an infinite list of inequalities fulfilled by the classical, the Petz quantum, and the maximal quantum RDs. These inequalities are not true for the minimal quantum RDs. Our results further imply that any sufficient set of conditions for state transitions in the resource theory of athermality must be able to detect time-reversal.

quant-ph↗