SearcharxivSearch

arXiv subjects

Kedar S. Ranade

Publications and source records attributed to Kedar S. Ranade.

12 recordsLinked to original sources

Observables can be tailored to change the entanglement of any pure state

We show that for a finite-dimensional Hilbert space, there exist observables that induce a tensor product structure such that the entanglement properties of any pure state can be tailored. In particular, we provide an explicit, finite method for constructing observables in an unstructured d-dimensional system so that an arbitrary known pure state has any Schmidt decomposition with respect to an induced bipartite tensor product structure. In effect, this article demonstrates that in a finite-dimensional Hilbert space, entanglement properties can always be shifted from the state to the observables and all pure states are equivalent as entanglement resources in the ideal case of complete control of observables.

quant-ph

Evidence of entanglement, or: Is Schrödinger's cat really entangled?

Quantum effects and, in particular, entanglement are by now widely recognized in all areas of physics and related fields. However, we feel that the precise notion of entanglement---though mathematically well-defined---still generates confusion even in the academic environment. Our aim in this article is to point out and clarify some aspects of the notion of entanglement, in particular with respect to observable quantities. We do this by illustrating common misconceptions with Schrödinger's cat paradox, explain them in mathematical terms and provide examples where misunderstandings arise and how they can be solved.

quant-ph

Quantum phase space functions and relations of entropic localisation measures

The concept of quantum phase space offers a view on quantum mechanics, which is different from the standard Hilbert space approach, but which more closely resembles the classical phase space. Due to the properties of quantum mechanics there are several equivalent quantum phase space descriptions, and one cannot always prefer one or another as they all have certain merits and drawbacks. For example, the Husimi-Kano Q function is a probability distribution and thus gives rise to entropic quantities, namely the Renyi-Wehrl entropies, of which several properties are known. The Wigner function, on the other hand, has an easier physical explanation, but may take negative values. In this article, we investigate entropic measures of localisation for a state in quantum phase space by using the Beckner-Brascamp-Lieb inequality to relate different phase-space functions.

quant-ph

Cyclic mutually unbiased bases, Fibonacci polynomials and Wiedemann's conjecture

We relate the construction of a complete set of cyclic mutually unbiased bases, i. e., mutually unbiased bases generated by a single unitary operator, in power-of-two dimensions to the problem of finding a symmetric matrix over F_2 with an irreducible characteristic polynomial that has a given Fibonacci index. For dimensions of the form 2^(2^k) we present a solution that shows an analogy to an open conjecture of Wiedemann in finite field theory. Finally, we discuss the equivalence of mutually unbiased bases.

quant-ph

Construction of mutually unbiased bases with cyclic symmetry for qubit systems

For the complete estimation of arbitrary unknown quantum states by measurements, the use of mutually unbiased bases has been well-established in theory and experiment for the past 20 years. However, most constructions of these bases make heavy use of abstract algebra and the mathematical theory of finite rings and fields, and no simple and generally accessible construction is available. This is particularly true in the case of a system composed of several qubits, which is arguably the most important case in quantum information science and quantum computation. In this paper, we close this gap by providing a simple and straightforward method for the construction of mutually unbiased bases in the case of a qubit register. We show that our construction is also accessible to experiments, since only Hadamard and controlled-phase gates are needed, which are available in most practical realizations of a quantum computer. Moreover, our scheme possesses the optimal scaling possible, i.e., the number of gates scales only linearly in the number of qubits.

quant-ph

Complete sets of cyclic mutually unbiased bases in even prime power dimensions

We present a construction method for complete sets of cyclic mutually unbiased bases (MUBs) in Hilbert spaces of even prime power dimensions. In comparison to usual complete sets of MUBs, complete cyclic sets possess the additional property of being generated by a single unitary operator. The construction method is based on the idea of obtaining a partition of multi-qubit Pauli operators into maximal commuting sets of orthogonal operators with the help of a suitable element of the Clifford group. As a consequence, we explicitly obtain complete sets of cyclic MUBs generated by a single element of the Clifford group in dimensions $2^m$ for $m=1,2,...,24$.

quant-ph

Symmetric extendibility for a class of qudit states

The concept of symmetric extendibility has recently drawn attention in the context of tolerable error rates in quantum cryptography, where it can be used to decide whether quantum states shared between two parties can be purified by means of entanglement purification with one-way classical communication only. Unfortunately, at present there exists no simple general criterion to decide whether a state possesses a symmetric extension or not. In this article we derive criteria for symmetric extendibility within subclasses of all two-qudit states. Using these criteria, we can completely solve the problem for a two-parameter family of two-qudit states, which includes the isotropic states as a subclass.

quant-ph

Symmetric extendibility for qudits and tolerable error rates in quantum cryptography

Symmetric extendibility of quantum states has recently drawn attention in the context of quantum cryptography to judge whether quantum states shared between two distant parties can be purified by means of one-way error correction protocols. In this letter we study the symmetric extendibility in a specific class of two-qudit states, i. e. states composed of two d-level systems, in order to find upper bounds on tolerable error rates for a wide class of qudit-based quantum cryptographic protocols using two-way error correction. In important cases these bounds coincide with previously known lower bounds, thereby proving sharpness of these bounds in arbitrary finite-dimensional systems.

quant-ph

The Jamiołkowski isomorphism and a conceptionally simple proof for the correspondence between vectors having Schmidt number $k$ and $k$-positive maps

Positive maps which are not completely positive are used in quantum information theory as witnesses for convex sets of states, in particular as entanglement witnesses and more generally as witnesses for states having Schmidt number not greater than k. It is known that such witnesses are related to k-positive maps. In this article we propose a new proof for the correspondence between vectors having Schmidt number k and k-positive maps using Jamiolkowski's criterion for positivity of linear maps; to this aim, we also investigate the precise notion of the term "Jamiolkowski isomorphism". As consequences of our proof we get the Jamiolkowski criterion for complete positivity, and we find a special case of a result by Choi, namely that k-positivity implies complete positivity, if k is the dimension of the smaller one of the Hilbert spaces on which the operators act.

quant-ph

Asymptotic correctability of Bell-diagonal qudit states and lower bounds on tolerable error probabilities in quantum cryptography

The concept of asymptotic correctability of Bell-diagonal quantum states is generalised to elementary quantum systems of higher dimensions. Based on these results basic properties of quantum state purification protocols are investigated which are capable of purifying tensor products of Bell-diagonal states and which are based on $B$-steps of the Gottesman-Lo-type with the subsequent application of a Calderbank-Shor-Steane quantum code. Consequences for maximum tolerable error rates of quantum cryptographic protocols are discussed.

quant-ph

Error tolerance of two-basis quantum key-distribution protocols using qudits and two-way classical communication

We investigate the error tolerance of quantum cryptographic protocols using $d$-level systems. In particular, we focus on prepare-and-measure schemes that use two mutually unbiased bases and a key-distillation procedure with two-way classical communication. For arbitrary quantum channels, we obtain a sufficient condition for secret-key distillation which, in the case of isotropic quantum channels, yields an analytic expression for the maximally tolerable error rate of the cryptographic protocols under consideration. The difference between the tolerable error rate and its theoretical upper bound tends slowly to zero for sufficiently large dimensions of the information carriers.

quant-ph

Asymptotic correctability of Bell-diagonal quantum states and maximum tolerable bit error rates

The general conditions are discussed which quantum state purification protocols have to fulfill in order to be capable of purifying Bell-diagonal qubit-pair states, provided they consist of steps that map Bell-diagonal states to Bell-diagonal states and they finally apply a suitably chosen Calderbank-Shor-Steane code to the outcome of such steps. As a main result a necessary and a sufficient condition on asymptotic correctability are presented, which relate this problem to the magnitude of a characteristic exponent governing the relation between bit and phase errors under the purification steps. These conditions allow a straightforward determination of maximum tolerable bit error rates of quantum key distribution protocols whose security analysis can be reduced to the purification of Bell-diagonal states.

quant-ph