arXiv subjects
Publications and source records attributed to Christopher King.
On-demand vehicle access is a method that can be used to reduce types of range anxiety problems related to planned travel for electric vehicle owners. Using ideas from elementary queueing theory, basic QoS metrics are defined to dimension a shared fleet to ensure high levels of vehicle access. Using mobility data from Ireland, it is argued that the potential cost of such a system is very low.
It is known that the minimal output entropy is additive for any product of entanglement breaking (EB) channels. The same is true for the Renyi entropy, where additivity is equivalent to multiplicativity of the $1 \rightarrow q$ norm for all $q \ge 1$. In this paper we consider the related question of multiplicativity of the $2 \rightarrow q$ norm for entanglement breaking channels. We prove that multiplicativity holds in this case for certain classes of EB channels, including both the CQ and QC channels.
Hypercontractivity is proved for products of qubit channels that belong to self-adjoint semigroups. The hypercontractive bound gives necessary and sufficient conditions for a product of the form e^{- t_1 H_1} \ot ... \ot e^{- t_n H_n} to be a contraction from L^p to L^q, where L^p is the algebra of 2^n-dimensional matrices equipped with the normalized Schatten norm, and each generator H_j is a self-adjoint positive semidefinite operator on the algebra of 2-dimensional matrices. As a particular case the result establishes the hypercontractive bound for a product of qubit depolarizing channels.
We study the regularized average Renyi output entropy $\bar{S}_{r}^{\reg}$ of quantum channels. This quantity gives information about the average noisiness of the channel output arising from a typical, highly entangled input state in the limit of infinite dimensions. We find a closed expression for $β_{r}^{\reg}$, a quantity which we conjecture to be equal to $\Srreg$. We find an explicit form for $β_{r}^{\reg}$ for some entanglement-breaking channels, and also for the qubit depolarizing channel $Δ_λ$ as a function of the parameter $λ$. We prove equality of the two quantities in some cases, in particular we conclude that for $Δ_λ$ both are non-analytic functions of the variable $λ$.
Recently Hastings proved the existence of random unitary channels which violate the additivity conjecture. In this paper we use Hastings' method to derive new bounds for the entanglement of random subspaces of bipartite systems. As an application we use these bounds to prove the existence of non-unital channels which violate additivity of minimal output entropy.
Hastings recently provided a proof of the existence of channels which violate the additivity conjecture for minimal output entropy. In this paper we present an expanded version of Hastings' proof. In addition to a careful elucidation of the details of the proof, we also present bounds for the minimal dimensions needed to obtain a counterexample.
Two non-commutative versions of the classical L^q(L^p) norm on the algebra of (mn)x(mn) matrices are compared. The first norm was defined recently by Carlen and Lieb, as a byproduct of their analysis of certain convex functions on matrix spaces. The second norm was defined by Pisier and others using results from the theory of operator spaces. It is shown that the second norm is upper bounded by a constant multiple of the first for all 1 <= p <= 2, q >= 1. In one case (2 = p < q) it is also shown that there is no such lower bound, and hence that the norms are inequivalent. It is conjectured that the norms are inequivalent in all cases.
Quantum channels can be described via a unitary coupling of system and environment, followed by a trace over the environment state space. Taking the trace instead over the system state space produces a different mapping which we call the conjugate channel. We explore the properties of conjugate channels and describe several different methods of construction. In general, conjugate channels map M_d to M_d' with d < d', and different constructions may differ by conjugation with a partial isometry. We show that a channel and its conjugate have the same minimal output entropy and maximal output p-norm. It then follows that the additivity and multiplicativity conjectures for these measures of optimal output purity hold for a product of channels if and only if they also hold for the product of their conjugates. This allows us to reduce these conjectures to the special case of maps taking M_d to M_d' with a minimal representation of dimension at most d. We find explicit expressions for the conjugates for a number of well-known examples, including entanglement-breaking channels, unital qubit channels, the depolarizing channel, and a subclass of random unitary channels. For the entanglement-breaking channels, channels this yields a new class of channels for which additivity and multiplicativity of optimal output purity can be established. For random unitary channels using the generalized Pauli matrices, we obtain a new formulation of the multiplicativity conjecture. The conjugate of the completely noisy channel plays a special role and suggests a mechanism for using noise to transmit information.
Let $Φ$ be a trace-preserving, positivity-preserving (but not necessarily completely positive) linear map on the algebra of complex $2 \times 2$ matrices, and let $Ω$ be any finite-dimensional completely positive map. For $p=2$ and $p \geq 4$, we prove that the maximal $p$-norm of the product map $Φ\ot Ω$ is the product of the maximal $p$-norms of $Φ$ and $Ω$. Restricting $Φ$ to the class of completely positive maps, this settles the multiplicativity question for all qubit channels in the range of values $p \geq 4$.
We prove additivity of the minimal conditional entropy associated with a quantum channel Phi, represented by a completely positive (CP), trace-preserving map, when the infimum of S(gamma_{12}) - S(gamma_1) is restricted to states of the form gamma_{12} = (I \ot Phi)(| psi >< psi |). We show that this follows from multiplicativity of the completely bounded norm of Phi considered as a map from L_1 -> L_p for L_p spaces defined by the Schatten p-norm on matrices; we also give an independent proof based on entropy inequalities. Several related multiplicativity results are discussed and proved. In particular, we show that both the usual L_1 -> L_p norm of a CP map and the corresponding completely bounded norm are achieved for positive semi-definite matrices. Physical interpretations are considered, and a new proof of strong subadditivity is presented.
We present numerical evidence showing that any three-dimensional subspace of C^3 \otimes C^n has an orthonormal basis which can be reliably distinguished using one-way LOCC, where a measurement is made first on the 3-dimensional part and the result used to select an optimal measurement on the n-dimensional part. This conjecture has implications for the LOCC-assisted capacity of certain quantum channels, where coordinated measurements are made on the system and environment. By measuring first in the environment, the conjecture would imply that the environment-assisted classical capacity of any rank three channel is at least log 3. Similarly by measuring first on the system side, the conjecture would imply that the environment-assisting classical capacity of any qutrit channel is log 3. We also show that one-way LOCC is not symmetric, by providing an example of a qutrit channel whose environment-assisted classical capacity is less than log 3.
Multiplicativity of certain maximal p -> q norms of a tensor product of linear maps on matrix algebras is proved in situations in which the condition of complete positivity (CP) is either augmented by, or replaced by, the requirement that the entries of a matrix representative of the map are non-negative (EP). In particular, for integer t, multiplicativity holds for the maximal 2 -> 2t norm of a product of two maps, whenever one of the pair is EP; for the maximal 1 -> t norm for pairs of CP maps when one of them is also EP; and for the maximal 1 -> 2t norm for the product of an EP and a 2-positive map. Similar results are shown in the infinite-dimensional setting of convolution operators on L^2(R), with the pointwise positivity of an integral kernel replacing entrywise positivity of a matrix. These results apply in particular to Gaussian bosonic channels.
The corrected capacity of a quantum channel is defined as the best one-shot capacity that can be obtained by measuring the environment and using the result to correct the output of the channel. It is shown that (i) all qubit channels have corrected capacity log 2, (ii) a product of N qubit channels has corrected capacity N log 2, and (iii) all channels have corrected capacity at least log 2. The question is posed of finding the channel with smallest corrected capacity in any dimension d.
Suppose that A and B are real stable matrices, and that their difference A-B is rank one. Then A and B have a common quadratic Lyapunov function if and only if the product AB has no real negative eigenvalue. This result is due to Shorten and Narendra, who showed that it follows as a consequence of the Kalman-Yacubovich-Popov solution of the Lur'e problem. Here we present a new and independent proof based on results from convex analysis and the theory of moments.
We consider the maximal p-norm associated with a completely positive map and the question of its multiplicativity under tensor products. We give a condition under which this multiplicativity holds when p = 2, and we describe some maps which satisfy our condition. This class includes maps for which multiplicativity is known to fail for large p. Our work raises some questions of independent interest in matrix theory; these are discussed in two appendices.
Several new trace norm inequalities are established for 2n x 2n block matrices, in the special case where the four n x n blocks are diagonal. Some of the inequalities are non-commutative analogs of Hanner's inequality, others describe the behavior of the trace norm under re-ordering of diagonal entries of the blocks.
We give examples of qubit channels that require three input states in order to achieve the Holevo capacity.
We define a large class of quantum sources and prove a quantum analog of the asymptotic equipartition property. Our proof relies on using local measurements on the quantum source to obtain an associated classical source. The classical source provides an upper bound for the dimension of the relevant subspace of the quantum source, via the Shannon-McMillan noiseless coding theorem. Along the way we derive a bound for the von Neumann entropy of the quantum source in terms of the Shannon entropy of the classical source, and we provide a definition of ergodicity of the quantum source. Several explicit models of quantum sources are also presented.