Related papers: Quantum algorithm for estimating Renyi entropies o…
It is known that the variance and entropy of quantum observables decompose into intrinsically quantum and classical contributions. Here a general method of constructing quantum-classical decompositions of resources such as uncertainty is…
This paper introduces a numerical framework for establishing lower bounds on the conditional von-Neumann entropy in device-independent quantum cryptography and randomness extraction scenarios. Leveraging a hierarchy of semidefinite programs…
The entanglement entropy of a subsystem $A$ of a quantum system is expressed, in the replica method, through analytic continuation with respect to n of the trace of the n-th power of the reduced density matrix $\tr\rho_A^n$. We study the…
Information-theoretically provable unique true random numbers, which cannot be correlated or controlled by an attacker, can be generated based on quantum measurement of vacuum state and universal-hashing randomness extraction. Quantum…
Quantum state preparation is an important subroutine in many quantum algorithms. The goal is to encode classical information directly to the quantum state so that it is possible to leverage quantum algorithms for data processing. However,…
For a closed-loop control system with a digital channel between the sensor and the controller, the notion of invariance entropy quantifies the smallest average rate of information above which a given compact subset of the state space can be…
We present a quantum algorithm for systems of (possibly inhomogeneous) linear ordinary differential equations with constant coefficients. The algorithm produces a quantum state that is proportional to the solution at a desired final time.…
The fact that the quantum relative entropy is non-increasing with respect to quantum physical evolutions lies at the core of many optimality theorems in quantum information theory and has applications in other areas of physics. In this…
We compute analytically the statistics of the Renyi and von Neumann entropies (standard measures of entanglement), for a random pure state in a large bipartite quantum system. The full probability distribution is computed by first mapping…
This manuscript introduces a computationally efficient method to calculate the nonlinearity of a quantum feature map, as well as a method for determining whether a quantum feature map will have a high concentration of quantum states. The…
The eigenvalue density of a matrix plays an important role in various types of scientific computing such as electronic-structure calculations. In this paper, we propose a quantum algorithm for computing the eigenvalue density in a given…
This thesis consolidates, improves and extends the smooth entropy framework for non-asymptotic information theory and cryptography. We investigate the conditional min- and max-entropy for quantum states, generalizations of classical R\'enyi…
We introduce a method that allows one to infer many properties of a quantum state -- including nonlinear functions such as R\'enyi entropies -- using only global control over the constituent degrees of freedom. In this protocol, the state…
Using arguments built on ergodicity, we derive an analytical expression for the Renyi entanglement entropies corresponding to the finite-energy density eigenstates of chaotic many-body Hamiltonians. The expression is a universal function of…
Artificial agents can achieve strong task performance while remaining opaque with respect to internal regulation, uncertainty management, and stability under stochastic perturbation. We present IRAM-Omega-Q, a computational architecture…
The entropy of probability distribution defined by Shannon has several extensions. R\'enyi entropy is one of the general extensions of Shannon entropy and is widely used in engineering, physics, and so on. On the other hand, the quantum…
Reconstruction of density matrices is important in NMR quantum computing. An analysis is made for a 2-qubit system by using the error matrix method. It is found that the state tomography method determines well the parameters that are…
We revisit the well-studied problem of estimating the Shannon entropy of a probability distribution, now given access to a probability-revealing conditional sampling oracle. In this model, the oracle takes as input the representation of a…
We propose a quantum algorithm that emulates the action of an unknown unitary transformation on a given input state, using multiple copies of some unknown sample input states of the unitary and their corresponding output states. The…
An algebraic approach to the study of entanglement entropy of quantum systems is reviewed. Starting with a state on a $C^*$-algebra, one can construct a density operator describing the state in the GNS representation state. Applications of…