Related papers: R\'enyi Entropy, Signed Probabilities, and the Qub…
Some quantum algorithms have "quantum speedups": improved time complexity as compared with the best-known classical algorithms for solving the same tasks. Can we understand what fuels these speedups from an entropic perspective? Information…
Entropic arguments are shown to play a central role in the foundations of quantum theory. We prove that probabilities are given by the modulus squared of wave functions, and that the time evolution of states is linear and also unitary.
In the present study we revisit the application of the $q$-information measures $R_q$ of R\'enyi's and $S_q$ of Tsallis' to the discussion of special features of two qubits systems. More specifically, we study the correlations between the…
In this paper, we review the concept of entropy in connection with the description of quantum unstable systems. We revise the conventional definition of entropy due to Boltzmann and extend it so as to include the presence of complex-energy…
Subentropy is an entropy-like quantity that arises in quantum information theory; for example, it provides a tight lower bound on the accessible information for pure state ensembles, dual to the von Neumann entropy upper bound in Holevo's…
Universal features in the scalings of Shannon-R\'enyi entropies of many-body groundstates are studied for interacting spin-$\frac{1}{2}$ systems across (2+1) dimensional $O(3)$ critical points, using quantum Monte Carlo simulations on…
Ubiquitous in quantum computing is the step to encode data into a quantum state. This process is called quantum state preparation, and its complexity for non-structured data is exponential on the number of qubits. Several works address this…
This paper is concerned with the phase estimation algorithm in quantum computing algorithms, especially the scenarios where (1) the input vector is not an eigenvector; (2) the unitary operator is not exactly implemented; (3) random…
Quantum systems with a finite number of states at all times have been a primary element of many physical models in nuclear and elementary particle physics, as well as in condensed matter physics. Today, however, due to a practical demand in…
We describe a quantum algorithm to prepare an arbitrary pure state of a register of a quantum computer with fidelity arbitrarily close to 1. Our algorithm is based on Grover's quantum search algorithm. For sequences of states with suitably…
While a bit is the fundamental unit of binary classical information, a qubit is the fundamental unit of quantum information. In quantum information processing (QIP), it is customary to call the qubits under study as system qubits, and the…
Relative entropy is a measure of distinguishability for quantum states, and plays a central role in quantum information theory. The family of Renyi entropies generalizes to Renyi relative entropies that include as special cases most entropy…
The random matrix ensembles (RME) of quantum statistical Hamiltonian operators, e.g. Gaussian random matrix ensembles (GRME) and Ginibre random matrix ensembles (Ginibre RME), are applied to following quantum statistical systems: nuclear…
We introduce a general method for the construction of quasiprobability representations for arbitrary notions of quantum coherence. Our technique yields a nonnegative probability distribution for the decomposition of any classical state.…
This paper and the results therein are geared towards building a basic toolbox for calculations in quantum information theory of quasi-free fermionic systems. Various entropy and relative entropy measures are discussed and the calculation…
We present a description of finite dimensional quantum entanglement, based on a study of the space of all convex decompositions of a given density matrix. On this space we construct a system of real polynomial equations describing separable…
A fundamental step of any quantum algorithm is the preparation of qubit registers in a suitable initial state. Often qubit registers represent a discretization of continuous variables and the initial state is defined by a multivariate…
The content of phase information of an arbitrary phase--sensitive measurement is evaluated using the maximum likelihood estimation. The phase distribution is characterized by the relative entropy--a nonlinear functional of input quantum…
A conception of virtual quantum information bit - virtual qubit - is introduced. It is shown by means of virtual qubit representation that four states of a single quantum particle is enough for implementation of full set of the gates, which…
We derive a new entropic quantum uncertainty relation involving min-entropy. The relation is tight and can be applied in various quantum-cryptographic settings. Protocols for quantum 1-out-of-2 Oblivious Transfer and quantum Bit Commitment…