arXiv subjects

Bernhard G. Bodmann

Publications and source records attributed to Bernhard G. Bodmann.

32 records · Page 2Linked to original sources

arXiv2014

Frame potentials and the geometry of frames

This paper concerns the geometric structure of optimizers for frame potentials. We consider finite, real or complex frames and rotation or unitarily invariant potentials, and mostly specialize to Parseval frames, meaning the frame potential to be optimized is a function on the manifold of Gram matrices belonging to finite Parseval frames. Next to the known classes of equal-norm and equiangular Parseval frames, we introduce equidistributed Parseval frames, which are more general than the equiangular type but have more structure than equal-norm ones. We also provide examples where this class coincides with that of Grassmannian frames, the minimizers for the maximal magnitude among inner products between frame vectors. These different types of frames are characterized in relation to the optimization of frame potentials. Based on results by Lojasiewicz, we show that the gradient descent for a real analytic frame potential on the manifold of Gram matrices belonging to Parseval frames always converges to a critical point. We then derive geometric structures associated with the critical points of different choices of frame potentials. The optimal frames for families of such potentials are thus shown to be equal-norm, or additionally equipartitioned, or even equidistributed.

math.FA↗

arXiv2013

Gabor Shearlets

In this paper, we introduce Gabor shearlets, a variant of shearlet systems, which are based on a different group representation than previous shearlet constructions: they combine elements from Gabor and wavelet frames in their construction. As a consequence, they can be implemented with standard filters from wavelet theory in combination with standard Gabor windows. Unlike the usual shearlets, the new construction can achieve a redundancy as close to one as desired. Our construction follows the general strategy for shearlets. First we define group-based Gabor shearlets and then modify them to a cone-adapted version. In combination with Meyer filters, the cone-adapted Gabor shearlets constitute a tight frame and provide low-redundancy sparse approximations of the common model class of anisotropic features which are cartoon-like functions.

math.FA↗

arXiv2013

Random fusion frames are nearly equiangular and tight

This paper demonstrates that random, independently chosen equi-dimensional subspaces with a unitarily invariant distribution in a real Hilbert space provide nearly tight, nearly equiangular fusion frames. The angle between a pair of subspaces is measured in terms of the Hilbert-Schmidt inner product of the corresponding orthogonal projections. If the subspaces are selected at random, then a measure concentration argument shows that these inner products concentrate near an average value. Overwhelming success probability for near tightness and equiangularity is guaranteed if the dimension of the subspaces is sufficiently small compared to that of the Hilbert space and if the dimension of the Hilbert space is small compared to the sum of all subspace dimensions.

math.FA↗

arXiv2013

Stable phase retrieval with low-redundancy frames

We investigate the recovery of vectors from magnitudes of frame coefficients when the frames have a low redundancy, meaning a small number of frame vectors compared to the dimension of the Hilbert space. We first show that for vectors in d dimensions, 4d-4 suitably chosen frame vectors are sufficient to uniquely determine each signal, up to an overall unimodular constant, from the magnitudes of its frame coefficients. Then we discuss the effect of noise and show that 8d-4 frame vectors provide a stable recovery if part of the frame coefficients is bounded away from zero. In this regime, perturbing the magnitudes of the frame coefficients by noise that is sufficiently small results in a recovery error that is at most proportional to the noise level.

math.FA↗

arXiv2010

Spanning and independence properties of frame partitions

We answer a number of open problems in frame theory concerning the decomposition of frames into linearly independent and/or spanning sets. We prove that in finite dimensional Hilbert spaces, Parseval frames with norms bounded away from 1 can be decomposed into a number of sets whose complements are spanning, where the number of these sets only depends on the norm bound. We also prove, assuming the Kadison-Singer conjecture is true, that this holds for infinite dimensional Hilbert spaces. Further, we prove a stronger result for Parseval frames whose norms are uniformly small, which shows that in addition to the spanning property, the sets can be chosen to be independent, and the complement of each set to contain a number of disjoint, spanning sets.

math.FA↗

arXiv2009

A quantitative notion of redundancy for finite frames

The objective of this paper is to improve the customary definition of redundancy by providing quantitative measures in its place, which we coin upper and lower redundancies, that match better with an intuitive understanding of redundancy for finite frames in a Hilbert space. This motivates a carefully chosen list of desired properties for upper and lower redundancies. The means to achieve these properties is to consider the maximum and minimum of a redundancy function, which is interesting in itself. The redundancy function is defined on the sphere of the Hilbert space and measures the concentration of frame vectors around each point. A complete characterization of functions on the sphere which coincide with a redundancy function for some frame is given. The upper and lower redundancies obtained from this function are shown to satisfy all of the intuitively desirable properties. In addition, the range of values they assume is characterized.

math.FA↗

arXiv2009

Frame theory for binary vector spaces

We develop the theory of frames and Parseval frames for finite-dimensional vector spaces over the binary numbers. This includes characterizations which are similar to frames and Parseval frames for real or complex Hilbert spaces, and the discussion of conceptual differences caused by the lack of a proper inner product on binary vector spaces. We also define switching equivalence for binary frames, and list all equivalence classes of binary Parseval frames in lowest dimensions, excluding cases of trivial redundancy.

math.FA↗

arXiv2008

Equiangular tight frames from complex Seidel matrices containing cube roots of unity

We derive easily verifiable conditions which characterize when complex Seidel matrices containing cube roots of unity have exactly two eigenvalues. The existence of such matrices is equivalent to the existence of equiangular tight frames for which the inner product between any two frame vectors is always a common multiple of the cube roots of unity. We also exhibit a relationship between these equiangular tight frames, complex Seidel matrices, and highly regular, directed graphs. We construct examples of such frames with arbitrarily many vectors.

math.FA↗

arXiv2006

Decoherence-Insensitive Quantum Communication by Optimal C^*-Encoding

The central issue in this article is to transmit a quantum state in such a way that after some decoherence occurs, most of the information can be restored by a suitable decoding operation. For this purpose, we incorporate redundancy by mapping a given initial quantum state to a messenger state on a larger-dimensional Hilbert space via a $C^*$-algebra embedding. Our noise model for the transmission is a phase damping channel which admits a noiseless or decoherence-free subspace or subsystem. More precisely, the transmission channel is obtained from convex combinations of a set of lowest rank yes/no measurements that leave a component of the messenger state unchanged. The objective of our encoding is to distribute quantum information optimally across the noise-susceptible component of the transmission when the noiseless component is not large enough to contain all the quantum information to be transmitted. We derive simple geometric conditions for optimal encoding and construct examples.

quant-ph↗

arXiv2005

Frames, Graphs and Erasures

Two-uniform frames and their use for the coding of vectors are the main subject of this paper. These frames are known to be optimal for handling up to two erasures, in the sense that they minimize the largest possible error when up to two frame coefficients are set to zero. Here, we consider various numerical measures for the reconstruction error associated with a frame when an arbitrary number of the frame coefficients of a vector are lost. We derive general error bounds for two-uniform frames when more than two erasures occur and apply these to concrete examples. We show that among the 227 known equivalence classes of two-uniform (36,15)-frames arising from Hadamard matrices, there are 5 that give smallest error bounds for up to 8 erasures.

math.FA↗

arXiv2003

A lower bound for the Wehrl entropy of quantum spin with sharp high-spin asymptotics

A lower bound for the Wehrl entropy of a single quantum spin is derived. The high-spin asymptotics of this bound coincides with Lieb's conjecture up to, but not including, terms of first and higher order in the inverse spin quantum number. The result presented here may be seen as complementary to the verification of the conjecture in cases of lowest spin by Schupp [Commun. Math. Phys. 207 (1999), 481]. The present result for the Wehrl-entropy is obtained from interpolating a sharp norm bound that also implies a sharp lower bound for the so-called Rényi-Wehrl entropy with certain indices that are evenly spaced by half of the inverse spin quantum number.

math-ph↗

arXiv2002

A transformation formula relating resolvents of Berezin-Toeplitz operators by an invariance property of Brownian motion

Using a stochastic representation provided by Wiener-regularized path integrals for the semigroups generated by certain Berezin-Toeplitz operators, a transformation formula for their resolvents is derived. The key property used in the transformation of the stochastic representation is that, up to a time change, Brownian motion is invariant under harmonic morphisms. This result for Berezin-Toeplitz operators is obtained in analogy with a well-known technique generating relations among Schrödinger operators that was recently generalized to Riemannian manifolds [Wittich, J. Math. Phys. {\bf 41} (2000), 244].

math-ph↗

arXiv2002

Construction of Self-Adjoint Berezin-Toeplitz Operators on Kahler Manifolds and a Probabilistic Representation of the Associated Semigroups

We investigate a class of operators resulting from a quantization scheme attributed to Berezin. These so-called Berezin-Toeplitz operators are defined on a Hilbert space of square-integrable holomorphic sections in a line bundle over the classical phase space. As a first goal we develop self-adjointness criteria for Berezin-Toeplitz operators defined via quadratic forms. Then, following a concept of Daubechies and Klauder, the semigroups generated by these operators may under certain conditions be represented in the form of Wiener-regularized path integrals. More explicitly, the integration is taken over Brownian-motion paths in phase space in the ultra-diffusive limit. All results are the consequence of a relation between Berezin-Toeplitz operators and Schrodinger operators defined via certain quadratic forms. The probabilistic representation is derived in conjunction with a version of the Feynman-Kac formula.

math-ph↗

arXiv1999

Path Integral Quantization for a Toroidal Phase Space

A Wiener-regularized path integral is presented as an alternative way to formulate Berezin-Toeplitz quantization on a toroidal phase space. Essential to the result is that this quantization prescription for the torus can be constructed as an induced representation from anti-Wick quantization on its covering space, the plane. When this construction is expressed in the form of a Wiener-regularized path integral, symmetrization prescriptions for the propagator emerge similar to earlier path-integral formulas on multiply-connected configuration spaces.

quant-ph↗