SearcharxivSearch

arXiv subjects

Chunyu Tan

Publications and source records attributed to Chunyu Tan.

5 recordsLinked to original sources

Entanglement flow in the Kane-Fisher quantum impurity problem

The problem of a local impurity in a Luttinger liquid, just like the anisotropic Kondo problem (of which it is technically a cousin), describes many different physical systems. As shown by Kane and Fisher, the presence of interactions profoundly modifies the physics familiar from Fermi liquid theory, and leads to non-intuitive features, best described in the Renormalization Group language (RG), such as flows towards healed or split fixed points. While this problem has been studied for many years using more traditional condensed matter approaches, it remains somewhat mysterious from the point of view of entanglement, both for technical and conceptual reasons. We propose and explore in this paper a new way to think of this important aspect. We use the realization of the Kane Fisher universality class provided by an XXZ spin chain with a modified bond strength between two sites and explore the difference of (Von Neumann) entanglement entropies of a region of length $\ell$ with the rest of the system - to which it relates to a modified bond - in the cases when $\ell$ is even and odd. Surprisingly, we find out that this difference $\delta S\equiv S^e-S^o$ remains of $O(1)$ in the thermodynamic limit, and gives rise now, depending on the sign of the interactions, to "resonance" curves, interpolating between $-\ln 2$ and $0$, and depending on the product $\ell T_B$, where $1/T_B$ is a characteristic length scale akin to the Kondo length in Kondo problems. $\delta S$ can be interpreted as a measure of the hybridization of the left-over spin in odd length subsystems with the "bath" constituted by the rest of the chain. The problem is studied both numerically using DMRG and analytically near the healed and split fixed points. Interestingly - and in contrast with what happens in other impurity problems - $\delta S$ can, at least to lowest order, be tackled by conformal perturbation theory.

cond-mat.str-el

Parity effects and universal terms of O(1) in the entanglement near a boundary

In the presence of boundaries, the entanglement entropy in lattice models is known to exhibit oscillations with the (parity of the) length of the subsystem, which however decay to zero with increasing distance from the edge. We point out in this article that, when the subsystem starts at the boundary and ends at an impurity, oscillations of the entanglement (as well as of charge fluctuations) appear which do not decay with distance, and which exhibit universal features. We study these oscillations in detail for the case of the XX chain with one modified link (a conformal defect) or two successive modified links (a relevant defect), both numerically and analytically. We then generalize our analysis to the case of extended (conformal) impurities, which we interpret as SSH models coupled to metallic leads. In this context, the parity effects can be interpreted in terms of the existence of non-trivial topological phases.

quant-ph

Detection of Topology via Entanglement Oscillations

We introduce a characterization of topological order based on bulk oscillations of the entanglement entropy and the definition of an `entanglement gap', showing that it is generally applicable to pure and disordered quantum systems. Using exact diagonalization and the strong disorder renormalization group method, we demonstrate that this approach gives results in agreement with the use of traditional topological invariants, especially in cases where topological order is known to persist in the presence of off-diagonal bond disorder. The entanglement gap is then used to analyze classes of quantum systems with alternating bond types, allowing us to construct their topological phase diagrams. The validity of these phase diagrams is verified in limiting cases of dominant bond types, where the solution is known.

cond-mat.str-el

A Novel Feature Representation for Single-Channel Heartbeat Classification based on Adaptive Fourier Decomposition

This paper proposes a novel approach for heartbeat classification from single-lead electrocardiogram (ECG) signals based on the novel adaptive Fourier decomposition (AFD). AFD is a recently developed signal processing tool that provides useful morphological features, referred to as AFD-derived instantaneous frequency (IF) features, that are different from those provided by traditional tools. A support vector machine (SVM) classifier is trained with the AFD-derived IF features, ECG landmark features, and RR interval features. To evaluate the performance of the trained classifier, the Association for the Advancement of Medical Instrumentation (AAMI) standard is applied to the publicly available benchmark databases, including MIT-BIH arrhythmia database and MIT-BIH supraventricular arrhythmia database, to classify heartbeats from single-lead ECG. The overall performance in terms of sensitivities and positive predictive values is comparable to the state-of-the-art automatic heartbeat classification algorithms based on two-leads ECG.

eess.SP

A Novel Blaschke Unwinding Adaptive Fourier Decomposition based Signal Compression Algorithm with Application on ECG Signals

This paper presents a novel signal compression algorithm based on the Blaschke unwinding adaptive Fourier decomposition (AFD). The Blaschke unwinding AFD is a newly developed signal decomposition theory. It utilizes the Nevanlinna factorization and the maximal selection principle in each decomposition step, and achieves a faster convergence rate with higher fidelity. The proposed compression algorithm is applied to the electrocardiogram signal. To assess the performance of the proposed compression algorithm, in addition to the generic assessment criteria, we consider the less discussed criteria related to the clinical needs -- for the heart rate variability analysis purpose, how accurate the R peak information is preserved is evaluated. The experiments are conducted on the MIT-BIH arrhythmia benchmark database. The results show that the proposed algorithm performs better than other state-of-the-art approaches. Meanwhile, it also well preserves the R peak information.

eess.SP