Search

Stabilizing $Z_2$ fluxes in Kitaev spin liquids (KSLs) is crucial for both characterizing candidate materials and identifying Ising anyons. In this study, we investigate the effects of spin-$S$ magnetic impurities embedded in the spin-1/2 KSL. Utilizing exact diagonalization and density matrix renormalization group methods, we examine the impurity magnetization and ground-state flux sector with varying impurity coupling and spin size. Our findings reveal that impurity magnetization exhibits an integer/half-integer spin dependence, which aligns with analytical predictions, and a flux-sector transition from bound-flux to zero-flux occurs at low coupling strengths, independent of the impurity spin. Notably, for spin-3/2 impurities, we observe a reentrant bound-flux sector, which remains stable under magnetic fields. By introducing a minimal model based on Majorana fermions, we provide phenomenological explanations for the transitions. Our results suggest a novel way of binding a flux in KSLs, beyond the proposals of vacancies or Kondo impurities., Comment: 11 pages, 4 figures, and Supplementary information

Nonreciprocal transport, characterized by its direction-selective nature, holds significant potential for applications in various devices. In this study, we investigate nonreciprocal heat transport in Majorana systems, specifically focusing on the Kitaev chiral spin liquid under external magnetic fields. Our theoretical examination focuses on effects of open boundaries in which the Majorana edge modes exist, and the inversion symmetry is broken, which leads to the Dzyaloshinskii-Moriya interaction (DMI). Through perturbation theory, we demonstrate that DMI induces asymmetric hopping, resulting in the asymmetry of the Majorana band. The results of nonreciprocal heat currents are presented for various directions of external magnetic fields, and we discuss the relation between the current and the field-directions. The potential exists to manipulate both of the directions and magnitude of the non-dissipative current by varying external magnetic fields and apply to non-dissipative heat transfer devices., Comment: 8 pages, 9 figures

This paper addresses the problem of predicting hazards that drivers may encounter while driving a car. We formulate it as a task of anticipating impending accidents using a single input image captured by car dashcams. Unlike existing approaches to driving hazard prediction that rely on computational simulations or anomaly detection from videos, this study focuses on high-level inference from static images. The problem needs predicting and reasoning about future events based on uncertain observations, which falls under visual abductive reasoning. To enable research in this understudied area, a new dataset named the DHPR (Driving Hazard Prediction and Reasoning) dataset is created. The dataset consists of 15K dashcam images of street scenes, and each image is associated with a tuple containing car speed, a hypothesized hazard description, and visual entities present in the scene. These are annotated by human annotators, who identify risky scenes and provide descriptions of potential accidents that could occur a few seconds later. We present several baseline methods and evaluate their performance on our dataset, identifying remaining issues and discussing future directions. This study contributes to the field by introducing a novel problem formulation and dataset, enabling researchers to explore the potential of multi-modal AI for driving hazard prediction., Comment: Main Paper: 11 pages, Supplementary Materials: 25 pages

The density matrix renormalization group (DMRG) is a celebrated tensor network algorithm, which computes the ground states of one-dimensional quantum many-body systems very efficiently. Here we propose an improved formulation of continuous tensor network algorithms, which we name a matrix product renormalization group (MPRG). MPRG is a universal quantum many-body solver, which potentially works at both zero and finite temperatures, in two and higher dimensions, and is even applicable to open quantum systems. Furthermore, MPRG does not rely on any variational principles and thus supports any kind of non-Hermitian systems in any dimension. As a demonstration, we present critical properties of the Yang-Lee edge singularity in one dimension as a representative non-Hermitian system., Comment: 5 pages, 3 figures, 2 tables

In the Kitaev chiral spin liquid, Ising anyons are realized as $Z_2$ fluxes binding Majorana zero modes, which, however, are thermal excitations with finite decay rates. On the other hand, a lattice vacancy traps a $Z_2$ flux even in the ground state, resulting in the stable realization of a Majorana zero mode in a vacancy. We demonstrate that spin-spin correlation functions between two vacancy sites exhibit long-range correlation arising from the fractionalized character of Majorana zero modes, in spite of the strong decay of bulk spin correlations. Remarkably, this non-local spin correlation does not decrease as the distance between two vacancy sites increases, signaling Majorana teleportation. Furthermore, we clarify that the non-local correlation can be detected electrically via the measurement of non-local conductance between two vacancy sites, which is straightforwardly utilized for the readout of Majorana qubits. These findings pave the way to the measurement-based quantum computation with Ising anyons trapped in vacancies of the Kitaev spin liquid., Comment: 6 pages + 4 figures, and Supplemental Material

\textsc{Directed Token Sliding} asks, given a directed graph and two sets of pairwise nonadjacent vertices, whether one can reach from one set to the other by repeatedly applying a local operation that exchanges a vertex in the current set with one of its out-neighbors, while keeping the nonadjacency. It can be seen as a reconfiguration process where a token is placed on each vertex in the current set, and the local operation slides a token along an arc respecting its direction. Previously, such a problem was extensively studied on undirected graphs, where the edges have no directions and thus the local operation is symmetric. \textsc{Directed Token Sliding} is a generalization of its undirected variant since an undirected edge can be simulated by two arcs of opposite directions. In this paper, we initiate the algorithmic study of \textsc{Directed Token Sliding}. We first observe that the problem is PSPACE-complete even if we forbid parallel arcs in opposite directions and that the problem on directed acyclic graphs is NP-complete and W[1]-hard parameterized by the size of the sets in consideration. We then show our main result: a linear-time algorithm for the problem on directed graphs whose underlying undirected graphs are trees, which are called polytrees. Such a result is also known for the undirected variant of the problem on trees~[Demaine et al.~TCS 2015], but the techniques used here are quite different because of the asymmetric nature of the directed problem. We present a characterization of yes-instances based on the existence of a certain set of directed paths, and then derive simple equivalent conditions from it by some observations, which admits an efficient algorithm. For the polytree case, we also present a quadratic-time algorithm that outputs, if the input is a yes-instance, one of the shortest reconfiguration sequences., Comment: 19 pages