Related papers: On the relation between the subadditivity cone and…

Unitarity provides mathematical and physical constraints on quantum information systems. e.g., in entanglement swapping, unitarity requires the same von Neumann entanglement entropy generation for either a particle interaction or an act of…

All correlation measures, classical and quantum, must be monotonic under local operations. In this paper, we characterize monotonic formulas that are linear combinations of the von Neumann entropies associated with the quantum state of a…

Using the combination of a new effective Hamiltonian approach and hybrid Monte-Carlo simulations, we unveil a variety of partially magnetically ordered (PMO) phases in the Kondo lattice model. Our approximation is motivated by two crucial…

We show that the density-matrix states of noncomposite qudit systems satisfy entropic and information relations like the subadditivity condition, strong subadditivity condition, and Araki--Lieb inequality, which characterize hidden quantum…

The path integral of a quantum system with an exact symmetry can be written as a sum of functional integrals each giving the contribution from quantum states with definite symmetry properties. We propose a strategy to compute each of them,…

The Maximum Independent Set (MIS) problem is a fundamental combinatorial optimization task that can be naturally mapped onto the Ising Hamiltonian of neutral atom quantum processors. Given its connection to NP-hard problems and real-world…

We consider the meta-equilibrium state of a composite system made up of independent subsystems satisfying the additive form of external constraints, as recently discussed by Abe [Phys. Rev. E {\bf 63}, 061105 (2001)]. We derive the additive…

We present a necessary and sufficient condition for three qutrit density matrices to be the one-particle reduced density matrices of a pure three-qutrit quantum state. The condition consists of seven classes of inequalities satisfied by the…

We initiate the study of computational entropy in the quantum setting. We investigate to what extent the classical notions of computational entropy generalize to the quantum setting, and whether quantum analogues of classical theorems hold.…

In the paper a self-consistent theoretical description of the lattice and magnetic properties of a model system with magnetoelastic interaction is presented. The dependence of magnetic exchange integrals on the distance between interacting…

Quantum complexity measures the difficulty of realizing a quantum process, such as preparing a state or implementing a unitary. We present an approach to quantifying the thermodynamic resources required to implement a process if the…

There is a class of statistical problems that arises in several contexts, the Lattice QCD problem of particle physics being one that has attracted the most attention. In essence, the problem boils down to the estimation of an infinite…

We consider the entanglement marginal problem, which consists of deciding whether a number of reduced density matrices are compatible with an overall separable quantum state. To tackle this problem, we propose hierarchies of semidefinite…

In Coles-Piani's recent remarkable version of the entropic uncertainty principle, the entropic sum is controlled by the first and second maximum overlaps between the two projective measurements. We generalize the entropic uncertainty…

The idea of perturbation independent decay (PID) has appeared in the context of survival-probability studies, and lately has emerged in the context of quantum irreversibility studies. In both cases the PID reflects the Lyapunov instability…

Various versions of "independence" are actively inverstigated in quantum probability. In the context of relativistic QFT, we show here that the physical origin of "independence" can be sought in the asymptotic condition through which…

Quantum state preparation involving a uniform superposition over a non-empty subset of $n$-qubit computational basis states is an important and challenging step in many quantum computation algorithms and applications. In this work, we…

Let C be the set of all possible quantum states. We study the convex subsets of C with attention focused on the lattice theoretical structure of these convex subsets and, as a result, find a framework capable of unifying several aspects of…

Based on the form invariance of the structures given by Khinchin's axiomatic foundations of information theory and the pseudoadditivity of the Tsallis entropy indexed by q, the concept of conditional entropy is generalized to the case of…

The terms of topological and quantum stabilities of low-dimensional crystalline carbon lattices with multiple non-equivalent sublattices are coined using theoretical analysis, multilevel simulations, and available experimental structural…