Scholar iON
Academic Synthesis
The collection of scholarly works highlights diverse research areas within mathematical optimization and computational physics, emphasizing innovative methodologies and theoretical advancements. Leblanc et al. introduce a compressive sensing technique in radio-interferometry to manage data size challenges in large antenna arrays, proposing random beamforming to efficiently reconstruct sparse images. Biskup et al. provide a rigorous analysis of partition function zeros in lattice spin models, offering insights into phase transitions and extending the Lee-Yang Circle Theorem to complex systems. Krasulin explores the algebraic and differential properties of five-dimensional tangent vectors in space-time, contributing to the understanding of geometric structures in physics. Tilma and Sudarshan present a generalized Euler angle parameterization for SU(N), facilitating the computation of the Haar measure and its application in quantum systems. Collectively, these studies advance mathematical tools and theoretical frameworks applicable to physics and computational sciences, underscoring the interdisciplinary nature and potential for practical applications in these fields.
Radio-interferometry (RI) observes the sky at unprecedented angular resolutions, enabling the study of several far-away galactic objects such as galaxies and black holes. In RI, an array of antennas probes cosmic signals coming from the observed region of the sky. The covariance matrix of the vector gathering all these antenna measurements offers, by leveraging the Van Cittert-Zernike theorem, an incomplete and noisy Fourier sensing of the image of interest. The number of noisy Fourier measurements -- or visibilities -- scales as $\mathcal O(Q^2B)$ for $Q$ antennas and $B$ short-time integration (STI) intervals. We address the challenges posed by this vast volume of data, which is anticipated to increase significantly with the advent of large antenna arrays, by proposing a compressive sensing technique applied directly at the level of the antenna measurements. First, this paper shows that beamforming -- a common technique of dephasing antenna signals -- usually used to focus some region of the sky, is equivalent to sensing a rank-one projection (ROP) of the signal covariance matrix. We build upon our recent work arXiv:2306.12698v3 [eess.IV] to propose a compressive sensing scheme relying on random beamforming, trading the $Q^2$-dependence of the data size for a smaller number $P$ ROPs. We provide image recovery guarantees for sparse image reconstruction. Secondly, the data size is made independent of $B$ by applying $M$ Bernoulli modulations of the ROP vectors obtained for the STI. The resulting sample complexities, theoretically derived in a simpler case without modulations and numerically obtained in phase transition diagrams, are shown to scale as $\mathcal O(K)$ where $K$ is the image sparsity. This illustrates the potential of the approach.
We present a general, rigorous theory of partition function zeros for lattice spin models depending on one complex parameter. First, we formulate a set of natural assumptions which are verified for a large class of spin models in a companion paper [BBCKK2, math-ph/0304007]. Under these assumptions, we derive equations whose solutions give the location of the zeros of the partition function with periodic boundary conditions, up to an error which we prove is (generically) exponentially small in the linear size of the system. For asymptotically large systems, the zeros concentrate on phase boundaries which are simple curves ending in multiple points. For models with an Ising-like plus-minus symmetry, we also establish a local version of the Lee-Yang Circle Theorem. This result allows us to control situations when in one region of the complex plane the zeros lie precisely on the unit circle, while in the complement of this region the zeros concentrate on less symmetric curves.
In this part of the series five-dimensional tangent vectors are introduced first as equivalence classes of parametrized curves and then as differential-algebraic operators that act on scalar functions. I then examine their basic algebraic properties and their parallel transport in the particular case where space-time possesses a special local symmetry. After that I give definition to five-dimensional tangent vectors associated with dimensional curve parameters and show that they can be identified with the five-vectors introduced formally in part I (math-ph/9805004). In conclusion I speak about differential forms associated with five-vectors.
In a previous paper (math-ph/0202002) an Euler angle parameterization for SU(4) was given. Here we present the derivation of a generalized Euler angle parameterization for SU(N). The formula for the calculation of the Haar measure for SU(N) as well as its relation to Marinov's volume formula for SU(N) will also be derived. As an example of this parameterization's usefulness, the density matrix parameterization and invariant volume element for a qubit/qutrit, three qubit and two three-state systems, also known as two qutrit systems, will also be given.
This paper shows how C-numerical-range related new strucures may arise from practical problems in quantum control--and vice versa, how an understanding of these structures helps to tackle hot topics in quantum information.
We start out with an overview on the role of C-numerical ranges in current research problems in quantum theory: the quantum mechanical task of maximising the projection of a point on the unitary orbit of an initial state onto a target state C relates to the C-numerical radius of A via maximising the trace function |\tr \{C^\dagger UAU^\dagger\}|. In quantum control of n qubits one may be interested (i) in having U\in SU(2^n) for the entire dynamics, or (ii) in restricting the dynamics to {\em local} operations on each qubit, i.e. to the n-fold tensor product SU(2)\otimes SU(2)\otimes >...\otimes SU(2). Interestingly, the latter then leads to a novel entity, the {\em local} C-numerical range W_{\rm loc}(C,A), whose intricate geometry is neither star-shaped nor simply connected in contrast to the conventional C-numerical range. This is shown in the accompanying paper (math-ph/0702005).
We present novel applications of the C-numerical range in quantum control assisted by gradient flows on the local unitary group: (1) they serve as powerful tools for deciding whether a quantum interaction can be inverted in time (in a sense generalising Hahn's famous spin echo); (2) they allow for optimising witnesses of quantum entanglement. We conclude by relating the relative C-numerical range to problems of constrained quantum optimisation, for which we also give Lagrange-type gradient flow algorithms.
We continue our study of colligative properties of solutions initiated in math-ph/0407034. We focus on the situations where, in a system of linear size $L$, the concentration and the chemical potential scale like $c=ΞΎ/L$ and $h=b/L$, respectively. We find that there exists a critical value $\xit$ such that no phase separation occurs for $ΞΎ\le\xit$ while, for $ΞΎ>\xit$, the two phases of the solvent coexist for an interval of values of $b$. Moreover, phase separation begins abruptly in the sense that a macroscopic fraction of the system suddenly freezes (or melts) forming a crystal (or droplet) of the complementary phase when $b$ reaches a critical value. For certain values of system parameters, under ``frozen'' boundary conditions, phase separation also ends abruptly in the sense that the equilibrium droplet grows continuously with increasing $b$ and then suddenly jumps in size to subsume the entire system. Our findings indicate that the onset of freezing-point depression is in fact a surface phenomenon.
In our former study (J. Phys. A: Math. Theor. 43, (2010) 325210 or arXiv:1002.0999v1 [math-ph]) we introduced a modified Fourier-Cattaneo law and derived a non-autonomous telegraph-type heat conduction equation which has desirable self-similar solution. Now we present a detailed in-depth analysis of this model and discuss additional analytic solutions for different parameters. The solutions have a very rich and interesting mathematical structure due to various special functions.
Let H be a self-adjoint operator such that exp(-aH) is of trace class for some a<1. Let V be a symmetric operator, Kato bounded relative to H. We show that log Tr[exp(-H+xV)] is a real analytic function of x in a hood of x=0. We show that the Gibbs states of H+xV form a real analytic Banach manifold. This work has been extended in math-ph/9910031.
General reasoning represents a long-standing and formidable challenge in artificial intelligence (AI). Recent breakthroughs, exemplified by large language models (LLMs)1,2 and chain-of-thought (CoT) prompting3, have achieved considerable success on foundational reasoning tasks. However, this success is heavily contingent on extensive human-annotated demonstrations and the capabilities of models are still insufficient for more complex problems. Here we show that the reasoning abilities of LLMs can be incentivized through pure reinforcement learning (RL), obviating the need for human-labelled reasoning trajectories. The proposed RL framework facilitates the emergent development of advanced reasoning patterns, such as self-reflection, verification and dynamic strategy adaptation. Consequently, the trained model achieves superior performance on verifiable tasks such as mathematics, coding competitions and STEM fields, surpassing its counterparts trained through conventional supervised learning on human demonstrations. Moreover, the emergent reasoning patterns exhibited by these large-scale models can be systematically used to guide and enhance the reasoning capabilities of smaller models. A new artificial intelligence model, DeepSeek-R1, is introduced, demonstrating that the reasoning abilities of large language models can be incentivized through pure reinforcement learning, removing the need for human-annotated demonstrations.
In the quiet backwaters of cs.CV, cs.LG and stat.ML, a cornucopia of new learning systems is emerging from a primordial soup of mathematics-learning systems with no need for external supervision. To date, little thought has been given to how these self-supervised learners have sprung into being or the principles that govern their continuing diversification. After a period of deliberate study and dispassionate judgement during which each author set their Zoom virtual background to a separate Galapagos island, we now entertain no doubt that each of these learning machines are lineal descendants of some older and generally extinct species. We make five contributions: (1) We gather and catalogue row-major arrays of machine learning specimens, each exhibiting heritable discriminative features; (2) We document a mutation mechanism by which almost imperceptible changes are introduced to the genotype of new systems, but their phenotype (birdsong in the form of tweets and vestigial plumage such as press releases) communicates dramatic changes; (3) We propose a unifying theory of self-supervised machine evolution and compare to other unifying theories on standard unifying theory benchmarks, where we establish a new (and unifying) state of the art; (4) We discuss the importance of digital biodiversity, in light of the endearingly optimistic Paris Agreement.