No Arabic abstract
We introduce an algebraic system which can be used as a model for spaces with geodesic paths between any two of their points. This new algebraic structure is based on the notion of mobility algebra which has recently been introduced as a model for the unit interval of real numbers. Mobility algebras consist on a set $A$ together with three constants and a ternary operation. In the case of the closed unit interval $A=[0,1]$, the three constants are 0, 1 and 1/2 while the ternary operation is $p(x,y,z)=x-yx+yz$. A mobility space is a set $X$ together with a map $qcolon{Xtimes Atimes Xto X}$ with the meaning that $q(x,t,y)$ indicates the position of a particle moving from point $x$ to point $y$ at the instant $tin A$, along a geodesic path within the space $X$. A mobility space is thus defined with respect to a mobility algebra, in the same way as a module is defined over a ring. We introduce the axioms for mobility spaces, investigate the main properties and give examples. We also establish the connection between the algebraic context and the one of spaces with geodesic paths. The connection with affine spaces is briefly mentioned.
We introduce the concept of a consistency space. The idea of the consistency space is motivated by the question, Given only the collection of sets of sentences which are logically consistent, is it possible to reconstruct their lattice structure?
We propose a method to obtain optimal protocols for adiabatic ground-state preparation near the adiabatic limit, extending earlier ideas from [D. A. Sivak and G. E. Crooks, Phys. Rev. Lett. 108, 190602 (2012)] to quantum non-dissipative systems. The space of controllable parameters of isolated quantum many-body systems is endowed with a Riemannian quantum metric structure, which can be exploited when such systems are driven adiabatically. Here, we use this metric structure to construct optimal protocols in order to accomplish the task of adiabatic ground-state preparation in a fixed amount of time. Such optimal protocols are shown to be geodesics on the parameter manifold, maximizing the local fidelity. Physically, such protocols minimize the average energy fluctuations along the path. Our findings are illustrated on the Landau-Zener model and the anisotropic XY spin chain. In both cases we show that geodesic protocols drastically improve the final fidelity. Moreover, this happens even if one crosses a critical point, where the adiabatic perturbation theory fails.
We present a unifying variational calculus derivation of Groverian geodesics for both quantum state vectors and quantum probability amplitudes. In the first case, we show that horizontal affinely parametrized geodesic paths on the Hilbert space of normalized vectors emerge from the minimization of the length specified by the Fubini-Study metric on the manifold of Hilbert space rays. In the second case, we demonstrate that geodesic paths for probability amplitudes arise by minimizing the length expressed in terms of the Fisher information. In both derivations, we find that geodesic equations are described by simple harmonic oscillators (SHOs). However, while in the first derivation the frequency of oscillations is proportional to the (constant) energy dispersion of the Hamiltonian system, in the second derivation the frequency of oscillations is proportional to the square-root of the (constant) Fisher information. Interestingly, by setting these two frequencies equal to each other, we recover the well-known Anandan-Aharonov relation linking the squared speed of evolution of an Hamiltonian system with its energy dispersion. Finally, upon transitioning away from the quantum setting, we discuss the universality of the emergence of geodesic motion of SHO type in the presence of conserved quantities by analyzing two specific phenomena of gravitational and thermodynamical origin, respectively.
Numerical computation of shortest paths or geodesics on curved domains, as well as the associated geodesic distance, arises in a broad range of applications across digital geometry processing, scientific computing, computer graphics, and computer vision. Relative to Euclidean distance computation, these tasks are complicated by the influence of curvature on the behavior of shortest paths, as well as the fact that the representation of the domain may itself be approximate. In spite of the difficulty of this problem, recent literature has developed a wide variety of sophisticated methods that enable rapid queries of geodesic information, even on relatively large models. This survey reviews the major categories of approaches to the computation of geodesic paths and distances, highlighting common themes and opportunities for future improvement.
In this paper, a new concept, the fuzzy rate of an operator in linear spaces is proposed for the very first time. Some properties and basic principles of it are studied. Fuzzy rate of an operator $B$ which is specific in a plane is discussed. As its application, a new fixed point existence theorem is proved.