arXiv subjects

Jan-Åke Larsson

Publications and source records attributed to Jan-Åke Larsson.

At least 55 records · Page 3Linked to original sources

arXiv2013

Direct Proof of Security of Wegman-Carter Authentication with Partially Known Key

Information-theoretically secure (ITS) authentication is needed in Quantum Key Distribution (QKD). In this paper, we study security of an ITS authentication scheme proposed by Wegman & Carter, in the case of partially known authentication key. This scheme uses a new authentication key in each authentication attempt, to select a hash function from an Almost Strongly Universal$_2$ hash function family. The partial knowledge of the attacker is measured as the trace distance between the authentication key distribution and the uniform distribution; this is the usual measure in QKD. We provide direct proofs of security of the scheme, when using partially known key, first in the information-theoretic setting and then in terms of witness indistinguishability as used in the Universal Composability (UC) framework. We find that if the authentication procedure has a failure probability $ε$ and the authentication key has an $ε'$ trace distance to the uniform, then under ITS, the adversary's success probability conditioned on an authentic message-tag pair is only bounded by $ε+|\mT|ε'$, where $|\mT|$ is the size of the set of tags. Furthermore, the trace distance between the authentication key distribution and the uniform increases to $|\mT|ε'$ after having seen an authentic message-tag pair. Despite this, we are able to prove directly that the authenticated channel is indistinguishable from an (ideal) authentic channel (the desired functionality), except with probability less than $ε+ε'$. This proves that the scheme is ($ε+ε'$)-UC-secure, without using the composability theorem.

cs.CR↗

arXiv2012

Optimal inequalities for state-independent contextuality

Contextuality is a natural generalization of nonlocality which does not need composite systems or spacelike separation and offers a wider spectrum of interesting phenomena. Most notably, in quantum mechanics there exist scenarios where the contextual behavior is independent of the quantum state. We show that the quest for an optimal inequality separating quantum from classical noncontextual correlations in an state-independent manner admits an exact solution, as it can be formulated as a linear program. We introduce the noncontextuality polytope as a generalization of the locality polytope, and apply our method to identify two different tight optimal inequalities for the most fundamental quantum scenario with state-independent contextuality.

quant-ph↗

arXiv2012

Systems of Imprimitivity for the Clifford Group

It is known that if the dimension is a perfect square the Clifford group can be represented by monomial matrices. Another way of expressing this result is to say that when the dimension is a perfect square the standard representation of the Clifford group has a system of imprimitivity consisting of one dimensional subspaces. We generalize this result to the case of an arbitrary dimension. Let k be the square-free part of the dimension. Then we show that the standard representation of the Clifford group has a system of imprimitivity consisting of k-dimensional subspaces. To illustrate the use of this result we apply it to the calculation of SIC-POVMs (symmetric informationally complete positive operator valued measures), constructing exact solutions in dimensions 8 (hand-calculation) as well as 12 and 28 (machine-calculation).

quant-ph↗

arXiv2011

Revealing Bell's Nonlocality for Unstable Systems in High Energy Physics

Entanglement and its consequences - in particular the violation of Bell inequalities, which defies our concepts of realism and locality - have been proven to play key roles in Nature by many experiments for various quantum systems. Entanglement can also be found in systems not consisting of ordinary matter and light, i.e. in massive meson--antimeson systems. Bell inequalities have been discussed for these systems, but up to date no direct experimental test to conclusively exclude local realism was found. This mainly stems from the fact that one only has access to a restricted class of observables and that these systems are also decaying. In this Letter we put forward a Bell inequality for unstable systems which can be tested at accelerator facilities with current technology. Herewith, the long awaited proof that such systems at different energy scales can reveal the sophisticated "dynamical" nonlocal feature of Nature in a direct experiment gets feasible. Moreover, the role of entanglement and CP violation, an asymmetry between matter and antimatter, is explored, a special feature offered only by these meson-antimeson systems.

quant-ph↗

arXiv2011

A contextual extension of Spekkens' toy model

Quantum systems show contextuality. More precisely, it is impossible to reproduce the quantum-mechanical predictions using a non-contextual realist model, i.e., a model where the outcome of one measurement is independent of the choice of compatible measurements performed in the measurement context. There has been several attempts to quantify the amount of contextuality for specific quantum systems, for example, in the number of rays needed in a KS proof, or the number of terms in certain inequalities, or in the violation, noise sensitivity, and other measures. This paper is about another approach: to use a simple contextual model that reproduces the quantum-mechanical contextual behaviour, but not necessarily all quantum predictions. The amount of contextuality can then be quantified in terms of additional resources needed as compared with a similar model without contextuality. In this case the contextual model needs to keep track of the context used, so the appropriate measure would be memory. Another way to view this is as a memory requirement to be able to reproduce quantum contextuality in a realist model. The model we will use can be viewed as an extension of Spekkens' toy model [Phys. Rev. A 75, 032110 (2007)], and the relation is studied in some detail. To reproduce the quantum predictions for the Peres-Mermin square, the memory requirement is more than one bit in addition to the memory used for the individual outcomes in the corresponding noncontextual model.

quant-ph↗

arXiv2011

Memory cost of quantum contextuality

The simulation of quantum effects requires certain classical resources, and quantifying them is an important step in order to characterize the difference between quantum and classical physics. For a simulation of the phenomenon of state-independent quantum contextuality, we show that the minimal amount of memory used by the simulation is the critical resource. We derive optimal simulation strategies for important cases and prove that reproducing the results of sequential measurements on a two-qubit system requires more memory than the information carrying capacity of the system.

quant-ph↗

arXiv2011

Security of Authentication with a Fixed Key in Quantum Key Distribution

We study the security of a specific authentication procedure of interest in the context of Quantum Key Distribution (QKD). It works as follows: use a secret but fixed Strongly Universal$_2$ (SU$_2$) hash function and encrypt the output tag with a one-time pad (OTP). If the OTP is completely secret, the expected time for an adversary to create a tag for a chosen message is exponential in the tag length. If, however, the OTP is partially known in each authentication round, as is the case in practical QKD protocols, then the picture is different; the adversary's partial knowledge of the OTP in each authentication round gives partial information on the secret hash function, and this weakens the authentication in later rounds. The effect of this is that the lifetime of the system is linear in the length of the fixed key. This is supported by the composability theorem for QKD, that in this setting provides an upper bound to the security loss on the secret hash function, which is exponential in the number of authentication rounds. This needs to be taken into account when using the protocol, since the authentication gets weakened at each subsequent round and thus the QKD generated is key is not as strong as when the authentication is strong. Some countermeasures are discussed at the end of this paper.

quant-ph↗

arXiv2011

The monomial representations of the Clifford group

We show that the Clifford group - the normaliser of the Weyl-Heisenberg group - can be represented by monomial phase-permutation matrices if and only if the dimension is a square number. This simplifies expressions for SIC vectors, and has other applications to SICs and to Mutually Unbiased Bases. Exact solutions for SICs in dimension 16 are presented for the first time.

quant-ph↗

arXiv2011

Quantum contextuality for rational vectors

The Kochen-Specker theorem states that noncontextual hidden variable models are inconsistent with the quantum predictions for every yes-no question on a qutrit, corresponding to every projector in three dimensions. It has been suggested [D. A. Meyer, Phys. Rev. Lett. 83, 3751 (1999)] that the inconsistency would disappear when we are restricted to projectors on unit vectors with rational components; that noncontextual hidden variables could reproduce the quantum predictions for rational vectors. Here we show that a qutrit state with rational components violates an inequality valid for noncontextual hidden-variable models [A. A. Klyachko et al., Phys. Rev. Lett. 101, 020403 (2008)] using rational projectors. This shows that the inconsistency remains even when using only rational vectors.

quant-ph↗

arXiv2009

Hidden variable models for quantum mechanics can have local parts

We criticize Colbeck and Renner's (CR's) statement that "any hidden variable model can only be compatible with quantum mechanics if its local part is trivial" [Phys. Rev. Lett. 101, 050403 (2008)]. We note that CR's attempt to divide a nonlocal hidden variable model into a "local part" and a "nonlocal part" contains a restriction on the latter. This restriction implies that the division is really into a "local part" and a "nonsignaling nonlocal part." CR's nonsignaling requirement on the "nonlocal part" cannot be physically motivated, since the hidden variables cannot be accessed by experimenters. Nor is it a natural mathematical generalization from the local hidden variable case, since it is simple to make a generalization without CR's requirement. We give an explicit nonlocal hidden variable model that, in the case the restriction is not enforced, contains nontrivial local hidden variables.

quant-ph↗

arXiv2009

Comment on "New Results on Frame-Proof Codes and Traceability Schemes"

In the paper "New Results on Frame-Proof Codes and Traceability Schemes" by Reihaneh Safavi-Naini and Yejing Wang [IEEE Trans. Inform. Theory, vol. 47, no. 7, pp. 3029-3033, Nov. 2001], there are lower bounds for the maximal number of codewords in binary frame-proof codes and decoders in traceability schemes. There are also existence proofs using a construction of binary frame-proof codes and traceability schemes. Here it is found that the main results in the referenced paper do not hold.

cs.IT↗

arXiv2009

Pentagrams and paradoxes

Klyachko and coworkers consider an orthogonality graph in the form of a pentagram, and in this way derive a Kochen-Specker inequality for spin 1 systems. In some low-dimensional situations Hilbert spaces are naturally organised, by a magical choice of basis, into SO(N) orbits. Combining these ideas some very elegant results emerge. We give a careful discussion of the pentagram operator, and then show how the pentagram underlies a number of other quantum "paradoxes", such as that of Hardy.

quant-ph↗

arXiv2009

Minimum detection efficiency for a loophole-free violation of the Braunstein-Caves chained Bell inequalities

The chained Bell inequalities of Braunstein and Caves involving N settings per observer have some interesting applications. Here we obtain the minimum detection efficiency required for a loophole-free violation of the Braunstein-Caves inequalities for any N > 2. We discuss both the case in which both particles are detected with the same efficiency and the case in which the particles are detected with different efficiencies.

quant-ph↗

arXiv2009

Vulnerability of "A novel protocol-authentication algorithm ruling out a man-in-the-middle attack in Quantum Cryptography"

In this paper we review and comment on "A novel protocol-authentication algorithm ruling out a man-in-the-middle attack in quantum cryptography", [M. Peev et al., Int. J. Quant. Inform., 3, 225, (2005)]. In particular, we point out that the proposed primitive is not secure when used in a generic protocol, and needs additional authenticating properties of the surrounding quantum-cryptographic protocol.

quant-ph↗

arXiv2008

Security aspects of the Authentication used in Quantum Cryptography

Unconditionally secure message authentication is an important part of quantum cryptography (QC). In this correspondence, we analyze security effects of using a key obtained from QC for authentication purposes in later rounds of QC. In particular, the eavesdropper gains partial knowledge on the key in QC that may have an effect on the security of the authentication in the later round. Our initial analysis indicates that this partial knowledge has little effect on the authentication part of the system, in agreement with previous results on the issue. However, when taking the full QC protocol into account, the picture is different. By accessing the quantum channel used in QC, the attacker can change the message to be authenticated. This, together with partial knowledge of the key, does incur a security weakness of the authentication. The underlying reason for this is that the authentication used, which is insensitive to such message changes when the key is unknown, becomes sensitive when used with a partially known key. We suggest a simple solution to this problem, and stress usage of this or an equivalent extra security measure in QC.

quant-ph↗

arXiv2007

Mubs and Hadamards of Order Six

We report on a search for mutually unbiased bases (MUBs) in 6 dimensions. We find only triplets of MUBs, and thus do not come close to the theoretical upper bound 7. However, we point out that the natural habitat for sets of MUBs is the set of all complex Hadamard matrices of the given order, and we introduce a natural notion of distance between bases in Hilbert space. This allows us to draw a detailed map of where in the landscape the MUB triplets are situated. We use available tools, such as the theory of the discrete Fourier transform, to organise our results. Finally we present some evidence for the conjecture that there exists a four dimensional family of complex Hadamard matrices of order 6. If this conjecture is true the landscape in which one may search for MUBs is much larger than previously thought.

quant-ph↗

arXiv2007

Minimum detection efficiency for a loophole-free atom-photon Bell experiment

In Bell experiments, one problem is to achieve high enough photodetection to ensure that there is no possibility of describing the results via a local hidden-variable model. Using the Clauser-Horne inequality and a two-photon non-maximally entangled state, a photodetection efficiency higher than 0.67 is necessary. Here we discuss atom-photon Bell experiments. We show that, assuming perfect detection efficiency of the atom, it is possible to perform a loophole-free atom-photon Bell experiment whenever the photodetection efficiency exceeds 0.50.

quant-ph↗

arXiv2007

Comment on "A local realist model for correlations of the singlet state'' (De Raedt et al., Eur. Phys. J. B 53: 139-142, 2006)

De Raedt et al. (Eur. Phys. J. B 53: 139-142, 2006) have claimed to provide a local realist model for correlations of the singlet state in the familiar Einstein-Podolsky-Rosen-Bohm (EPRB) experiment when time-coincidence is used to decide which detection events should count in the analysis, and furthermore that this suggests that it is possible to construct local realistic models that can reproduce the quantum mechanical expectation values. In this letter we show that these conclusions cannot be upheld since their model exploits the so-called coincidence-time loophole. When this is properly taken into account no startling conclusions can be drawn about local realist modelling of quantum mechanics.

quant-ph↗