Related papers: Universal upper bound for the Holevo information i…
We present a new decoding protocol to realize transmission of classical information through a quantum channel at asymptotically maximum capacity, achieving the Holevo bound and thus the optimal communication rate. At variance with previous…
We study the performance of a partially correlated amplitude damping channel acting on two qubits. We derive lower bounds for the single-shot classical capacity by studying two kinds of quantum ensembles, one which allows to maximize the…
Recently, Zhang {\em et al.} [PRA, {\bf 75}, 062102 (2007)] extended Kieu's interesting work on the quantum Otto engine [PRL, {\bf 93}, 140403 (2004)] by considering as working substance a bipartite quantum system $AB$ composed of…
The projected ensemble -- an ensemble of pure states on a subsystem conditioned on projective measurement outcomes on its complement -- provides a finer probe of ergodicity and information structure than the reduced density matrix of the…
The property of superadditivity of the quantum relative entropy states that, in a bipartite system $\mathcal{H}_{AB}=\mathcal{H}_A \otimes \mathcal{H}_B$, for every density operator $\rho_{AB}$ one has $ D( \rho_{AB} || \sigma_A \otimes…
We consider symmetric hypothesis testing in quantum statistics, where the hypotheses are density operators on a finite-dimensional complex Hilbert space, representing states of a finite quantum system. We prove a lower bound on the…
We study the fully entangled fraction of a quantum state. An upper bound is obtained for arbitrary bipartite system. This upper bound only depends on the Frobenius norm of the state.
The sum of the Holevo quantity (that bounds the capacity of quantum channels to transmit classical information about an observable) and the quantum discord (a measure of the quantumness of correlations of that observable) yields an…
As an alternative to entanglement entropies, the capacity of entanglement becomes a promising candidate to probe and estimate the degree of entanglement of quantum bipartite systems. In this work, we study the typical behavior of…
We present a new decoding procedure to transmit classical information in a quantum channel which, saturating asymptotically the Holevo bound, achieves the optimal rate of the communication line. Differently from previous proposals, it is…
We study the amount of interference in random quantum algorithms using a recently derived quantitative measure of interference. To this end we introduce two random circuit ensembles composed of random sequences of quantum gates from a…
We prove a new version of the Holevo bound employing the Hilbert-Schmidt norm instead of the Kullback-Leibler divergence. Suppose Alice is sending classical information to Bob using a quantum channel, while Bob is performing some projective…
The irreducible unitary representations of the Banach Lie group $U_0(\H)$ (which is the norm-closure of the inductive limit $\cup_k U(k)$) of unitary operators on a separable Hilbert space $\H$, which were found by Kirillov and Ol'shanskii,…
As Fahmi and Golshani correctly point out, a protocol introduced in A. Cabello, Phys. Rev. Lett. 85, 5635 (2000), to show that a quantum key distribution protocol can have efficiency one (i.e., can achieve the Holevo limit), does indeed not…
The uncertainty principle sets a bound on our ability to predict the measurement outcomes of two incompatible observables which are measured on a quantum particle simultaneously. In quantum information theory, the uncertainty principle can…
This PhD thesis explores the potential of quantum computing to address computational challenges in high-energy physics (HEP). As the Standard Model (SM) leaves key questions unanswered and no signs of new physics have emerged since the…
Quantum information distribution in a tripartite state plays a fundamental role in quantum information processes. Here we investigate how a bipartite unitary transformation $U_{AB}$ redistributes the quantum mutual information with the…
In this paper, we propose a quantum algorithm that supports a real-valued higher-order unconstrained binary optimization (HUBO) problem. This algorithm is based on the Grover adaptive search that originally supported HUBO with integer…
Given a physical quantum system described by a Hilbert H, for any bounded quantum observable (a bounded self-adjoint operator) T it is possible to define several ''hidden observable'' functions f:H->R associated to T and for any quantum…
In quantum statistical mechanics, it is of fundamental interest to understand how close the bipartite entanglement entropy of eigenstates of quantum chaotic Hamiltonians is to maximal. For random pure states in the Hilbert space, the…