Related papers: On the complexity of finding the maximum entropy c…
We derive necessary and sufficient conditions for local unitary (LU) operators to leave invariant the set of 1-qubit reduced density matrices of a multi-qubit state. LU operators with this property are tensor products of {\it cyclic local}…
A major bottleneck in the quest for scalable many-body quantum technologies is the difficulty in benchmarking their preparations, which suffer from an exponential `curse of dimensionality' inherent to their quantum states. We present an…
Finding the minimal relative entropy of two quantum states under semidefinite constraints is a pivotal problem located at the mathematical core of various applications in quantum information theory. An efficient method for providing…
Gate model quantum computers promise to solve currently intractable computational problems if they can be operated at scale with long coherence times and high fidelity logic. Neutral atom hyperfine qubits provide inherent scalability due to…
We develop a rigorous framework for quantifying quantum coherence in finite-dimensional systems by applying the Schur-Horn majorization theorem to relate eigenvalue distributions and diagonal entries of density matrices. Building on this…
As a characteristic property of all quantum systems, entanglement participates in many important quantum phenomena. In this proceeding, we employ it in the study of quantum field theories at finite density. We incorporate evaluations of…
In this work, the definition of the density operator on quantum states in Hilbert spaces and some of its aspects relevant in thermodynamics and information-theoretical entropy calculations are given. In this framework, a physical model…
The problem of quantum state estimation is crucial in the development of quantum technologies. In particular, the use of symmetric quantum states is useful in many relevant applications. In this work, we analyze the task of reconstructing…
I formulate an entropy-rate maximization problem at the observable level for stochastic processes observed through an information-reducing observation map. For a visible stationary law, the map determines an observational fiber of hidden…
Counting problems such as determining how many bit strings satisfy a given Boolean logic formula are notoriously hard. In many cases, even getting an approximate count is difficult. Here we propose that entanglement, a common concept in…
We study maximum-entropy inference for finite-dimensional quantum states under linear moment constraints. Given expectation values of finitely many observables, the feasible set of states is convex but typically non-unique. The…
Entanglement patterns reveal essential information on many-body states and provide a way to classify quantum phases of matter. However, experimental studies of many-body entanglement remain scarce due to their unscalable nature. The present…
For every possible spectrum of $2^N$-dimensional density operators, we construct an $N$-qubit X-state of same spectrum and maximal genuine multipartite (GM-) concurrence, hence characterizing a global unitary transformation that ---…
In this paper, we investigate and compare two well-developed definitions of entropy relevant for describing the dynamics of isolated quantum systems: bipartite entanglement entropy and observational entropy. In a model system of interacting…
We investigate fully self-consistent multiscale quantum-classical algorithms on current generation superconducting quantum computers, in a unified approach to tackle the correlated electronic structure of large systems in both quantum…
We construct a set of criteria detecting genuine multipartite entanglement in arbitrary dimensional multipartite systems. These criteria are optimally suited for detecting multipartite entanglement in n-qubit Dicke states with…
We explore some basic entanglement features of multiqubit systems that are relevant for the development of algorithms for searching highly entangled states. In particular, we compare the behaviours of multiqubit entanglement measures based…
We present a quantum algorithm to compute the entanglement spectrum of arbitrary quantum states. The interesting universal part of the entanglement spectrum is typically contained in the largest eigenvalues of the density matrix which can…
We address the problem of the best uniform approximation by linear combinations of a finite system of functions. If the system is Chebyshev and the problem is unconstrained, then the classical Remez algorithm provides a fast and precise…
We propose the study of quantum games from the point of view of quantum information theory and statistical mechanics. Every game can be described by a density operator, the von Neumann entropy and the quantum replicator dynamics. There…