Search

In order to bypass the local measurement as an intermediate quantity in the proof of the eigenstate thermalization hypothesis (ETH), we have proposed a measurement-independent distinguishability measure. In this paper, we establish the connection between this measure and several other ETH measures in a more unified way. We first prove a universal trade-off relation for the diagonal and off-diagonal elements of the measure. Then we extend it to the discussion of eigenstate typicality and the average observable. In the trade-off relationship, the exponential increase of off-diagonal elements will directly suppress the value of off-diagonal elements, and the diagonal elements will also be suppressed indirectly. This relationship gives another perspective to understand the physical mechanism behind ETH. Finally, by numerically calculating one-dimensional Ising spin chain, we examine several trade-off relationships and strong and weak ETH., Comment: 10 pages, 6 figures

The eigenstate thermalization hypothesis for translation invariant quantum spin systems has been proved recently by using random matrices. In this paper, we study the subsystem version of eigenstate thermalization hypothesis for translation invariant quantum systems without referring to random matrices. We first find a relation between the quantum variance and the Belavkin-Staszewski relative entropy. Then, by showing the small upper bounds on the quantum variance and the Belavkin-Staszewski relative entropy, we prove the subsystem eigenstate thermalization hypothesis for translation invariant quantum systems with an algebraic speed of convergence in an elementary way. The proof holds for most of the translation invariant quantum lattice models with exponential or algebraic decays of correlations., Comment: 9 pages

The detailed fluctuation theorem implies symmetry in the generating function of entropy production probability. The integral fluctuation theorem directly follows from this symmetry and the normalization of the probability. In this paper, we rewrite the generating function by integrating measurements and evolution into a constructed mapping. This mapping is completely positive, and the original integral FT is determined by the trace-preserving property of these constructed maps. We illustrate the convenience of this method by discussing the eigenstate fluctuation theorem and heat exchange between two baths. This set of methods is also applicable to the generating functions of quasi-probability, where we observe the Petz recovery map arising naturally from this approach., Comment: 16 pages, 1 figures

Entropy production and the detailed fluctuation theorem are of fundamental importance for thermodynamic processes. In this paper, we study the multiple entropy production for multitime quantum processes in a unified framework. For closed quantum systems and Markovian open quantum systems, the given entropy productions all satisfy the detailed fluctuation relation. This also shows that the entropy production rate under these processes is non-negative. For non-Markovian open quantum systems, the memory effect can lead to a negative entropy production rate. Thus, in general, the entropy production of the marginal distribution does not satisfy the detailed FT relation. Our framework can be applied to a wide range of physical systems and dynamics. It provides a systematic tool for studying entropy production and its rate under arbitrary quantum processes., Comment: 16 pages, 5 figures

We study some aspects of the Leggett-Garg inequalities by using the operator-state formalism for multitime processes. The process tensor in its Choi-state form, which we call process state, is employed to investigate the Leggett-Garg inequalities and their violations. We find the sufficient conditions on process states for the Leggett-Garg inequalities to hold, based on which we find a new way of characterizing the influences on the violation of Leggett-Garg inequalities through the structure of process states.

There are strong evidences in the literature that quantum non-Markovianity would hinder the presence of Quantum Darwinism. In this Letter, we study the relation between quantum Darwinism and approximate quantum Markovianity for open quantum systems by exploiting the properties of quantum conditional mutual information. We show that for approximately Markovian quantum processes the conditional mutual information still has the scaling property for Quantum Darwinism. Then two general bounds on the backflow of information are obtained, with which we can show that the presence of Quantum Darwinism restricts the information backflow and the quantum non-Markovianity must be small., Comment: 8 pages, typos fixed

We study the classical, classical-quantum, and quantum parts of conditional mutual information in the ``system-environment-ancilla'' setting of open quantum systems. We perform the separation of conditional mutual information by generalizing the classification of correlations of quantum states. The condition for identifying the classical part of conditional mutual information is given by adapting the no-local-broadcasting theorem to this setting, while the condition for classical-quantum part of conditional mutual information is obtained by considering the multipartite quantum discord and the no-unilocal-broadcasting theorem. For the quantum part of conditional mutual information, we further generalize the characterization of entanglement by quantum discord of state extensions to the multipatite setting, so as to derive a generalized Koashi-Winter-type monogamy equality for conditional mutual information. Our results have explicit dependence on the extensions of environment, which are useful for studying different environmental contributions to the quantum non-Markovianity of open quantum systems., Comment: 24 pages, 1 figure

In this paper, we extend the fluctuation theorems used for quantum channels to multitime processes. The fluctuation theorems for quantum channels are less restrictive. We show that the given entropy production can be equal to the result of a closed system environment. The assumption that the system evolves under a completely positive and trace preserving map is quite general, but it is more specific for cases in which the system is initially correlated with the environment. System-environment correlations arise naturally in multitime processes, with which we can give clear and physical interpretations regarding the effects of correlations. Multitime processes can provide many-body channels. The Choi state of such a many-body channel is called a process tensor. One can derive channels by executing the process tensor on a set of operations. We establish a general quantum fluctuation theorem framework for a many-body channel and its derived channels. In this framework, the effects of correlations are reflected in a Markovian property. For Markovian processes, we can extend the two-point measurement to a three-point measurement and obtain that the fluctuation theorems contain complete information about the intermediate state. For non-Markovian processes, the complete measurement of the intermediate state leads to conflicts. Therefore, we use a general measurement, which only provides partial information, for the intermediate state. The corresponding fluctuation theorems show that memory effects can reduce these fluctuations. This is consistent with the fact that system states can be recovered under non-Markovian processes., Comment: 14 pages, 2 figures

In this paper, we study measures of quantum non-Markovianity based on the conditional mutual information. We obtain such measures by considering multiple parts of the total environment such that the conditional mutual information can be defined in this multipartite setup. The benefit of this approach is that the conditional mutual information is closely related to recovery maps and Markov chains; we also point out its relations with the change of distinguishability. We study along the way the properties of leaked information which is the conditional mutual information that can be back flowed, and we use this leaked information to show that the correlated environment is necessary for nonlocal memory effect., Comment: 10 pages, 3 figures

This paper focuses on developing efficient and robust evaluation metrics for RANSAC hypotheses to achieve accurate 3D rigid registration. Estimating six-degree-of-freedom (6-DoF) pose from feature correspondences remains a popular approach to 3D rigid registration, where random sample consensus (RANSAC) is a de-facto choice to this problem. However, existing metrics for RANSAC hypotheses are either time-consuming or sensitive to common nuisances, parameter variations, and different application scenarios, resulting in performance deterioration in overall registration accuracy and speed. We alleviate this problem by first analyzing the contributions of inliers and outliers, and then proposing several efficient and robust metrics with different designing motivations for RANSAC hypotheses. Comparative experiments on four standard datasets with different nuisances and application scenarios verify that the proposed metrics can significantly improve the registration performance and are more robust than several state-of-the-art competitors, making them good gifts to practical applications. This work also draws an interesting conclusion, i.e., not all inliers are equal while all outliers should be equal, which may shed new light on this research problem.

We present a simple yet effective method for 3D correspondence grouping. The objective is to accurately classify initial correspondences obtained by matching local geometric descriptors into inliers and outliers. Although the spatial distribution of correspondences is irregular, inliers are expected to be geometrically compatible with each other. Based on such observation, we propose a novel representation for 3D correspondences, dubbed compatibility feature (CF), to describe the consistencies within inliers and inconsistencies within outliers. CF consists of top-ranked compatibility scores of a candidate to other correspondences, which purely relies on robust and rotation-invariant geometric constraints. We then formulate the grouping problem as a classification problem for CF features, which is accomplished via a simple multilayer perceptron (MLP) network. Comparisons with nine state-of-the-art methods on four benchmarks demonstrate that: 1) CF is distinctive, robust, and rotation-invariant; 2) our CF-based method achieves the best overall performance and holds good generalization ability.