Observation of spin-tensor induced topological phase transitions of triply degenerate points with a trapped ion

Triply degenerate points (TDPs), which correspond to new types of topological semimetals, can support novel quasiparticles possessing effective integer spins while preserving Fermi statistics. Here by mapping the momentum space to the parameter space of a three-level system in a trapped ion, we experimentally explore the transitions between different types of TDPs driven by spin-tensor--momentum couplings. We observe the phase transitions between TDPs with different topological charges by measuring the Berry flux on a loop surrounding the gap-closing lines, and the jump of the Berry flux gives the jump of the topological charge (up to a $2\pi$ factor) across the transitions. For the Berry flux measurement, we employ a new method by examining the geometric rotations of both spin vectors and tensors, which lead to a generalized solid angle equal to the Berry flux. The controllability of multi-level ion offers a versatile platform to study high-spin physics and our work paves the way to explore novel topological phenomena therein.Comment: 9 pages, 10 figure

Heuristic Search for Planning with Different Forced Goal-Ordering Constraints

Planning with forced goal-ordering (FGO) constraints has been proposed many times over the years, but there are still major difficulties in realizing these FGOs in plan generation. In certain planning domains, all the FGOs exist in the initial state. No matter which approach is adopted to achieve a subgoal, all the subgoals should be achieved in a given sequence from the initial state. Otherwise, the planning may arrive at a deadlock. For some other planning domains, there is no FGO in the initial state. However, FGO may occur during the planning process if certain subgoal is achieved by an inappropriate approach. This paper contributes to illustrate that it is the excludable constraints among the goal achievement operations (GAO) of different subgoals that introduce the FGOs into the planning problem, and planning with FGO is still a challenge for the heuristic search based planners. Then, a novel multistep forward search algorithm is proposed which can solve the planning problem with different FGOs efficiently