Searcharxiv⌕ Search

arXiv subjects

Serge Massar

Publications and source records attributed to Serge Massar.

89 records · Page 5Linked to original sources

Quantum coin tossing and bit-string generation in the presence of noise

We discuss the security implications of noise for quantum coin tossing protocols. We find that if quantum error correction can be used, so that noise levels can be made arbitrarily small, then reasonable security conditions for coin tossing can be framed so that results from the noiseless case will continue to hold. If, however, error correction is not available (as is the case with present day technology), and significant noise is present, then tossing a single coin becomes problematic. In this case, we are led to consider random n-bit string generation in the presence of noise, rather than single-shot coin tossing. We introduce precise security criteria for n-bit string generation and describe an explicit protocol that could be implemented with present day technology. In general, a cheater can exploit noise in order to bias coins to their advantage. We derive explicit upper bounds on the average bias achievable by a cheater for given noise levels.

quant-ph↗

Combinatorics and Quantum Nonlocality

We use techniques for lower bounds on communication to derive necessary conditions (in terms of detector efficiency or amount of super-luminal communication) for being able to reproduce the quantum correlations occurring in EPR-type experiments with classical local hidden-variable theories. As an application, we consider n parties sharing a GHZ-type state and show that the amount of super-luminal classical communication required to reproduce the correlations is at least n(log n - 3) bits and the maximum detector efficiency eta* for which the resulting correlations can still be reproduced by a local hidden-variable theory is upper bounded by eta* <= 8/n and thus decreases with n.

quant-ph↗

Quantum Fingerprinting with a Single Particle

We show that the two slit experiment in which a single quantum particle interferes with itself can be interpreted as a quantum fingerprinting protocol: the interference pattern exhibited by the particle contains information about the environment it encountered in the slits which would require much more communication to learn classically than is required quantum mechanically. An extension to the case where the particle has many internal degrees of freedom is suggested and its interpretation is discussed in detail. A possible experimental realization is proposed.

quant-ph↗

Violation of local realism vs detection efficiency

We put bounds on the minimum detection efficiency necessary to violate local realism in Bell experiments. These bounds depends of simple parameters like the number of measurement settings or the dimensionality of the entangled quantum state. We derive them by constructing explicit local-hidden variable models which reproduce the quantum correlations for sufficiently small detectors efficiency.

quant-ph↗

Continuous-Variable Quantum Games

We investigate the quantization of games in which the players can access to a continuous set of classical strategies, making use of continuous-variable quantum systems. For the particular case of the Cournot's Duopoly, we find that, even though the two players both act as "selfishly" in the quantum game as they do in the classical game, they are found to virtually cooperate due to the quantum entanglement between them. We also find that the original Einstein-Podolksy-Rosen state contributes to the best profits that the two firms could ever attain. Moreover, we propose a practical experimental setup for the implementation of such quantum games.

quant-ph↗

A Zoology of Bell inequalities resistant to detector inefficiency

We derive both numerically and analytically Bell inequalities and quantum measurements that present enhanced resistance to detector inefficiency. In particular we describe several Bell inequalities which appear to be optimal with respect to inefficient detectors for small dimensionality d=2,3,4 and 2 or more measurement settings at each side. We also generalize the family of Bell inequalities described in Collins et all (Phys. Rev. Lett. 88, 040404) to take into account the inefficiency of detectors. In addition we consider the possibility for pairs of entangled particles to be produced with probability less than one. We show that when the pair production probability is small, one must in general use different Bell inequalities than when the pair production probability is high.

quant-ph↗

Multipartite Greenberger-Horne-Zeilinger paradoxes for continuous variables

We show how to construct Greenberger-Horn-Zeilinger type paradoxes for continuous variable systems. We give two examples corresponding to 3 party and 5 party paradoxes. The paradoxes are revealed by carrying out position and momentum measurements. The structure of the quantum states which lead to these paradoxes is discussed.

quant-ph↗

Non locality, closing the detection loophole and communication complexity

It is shown that the detection loophole which arises when trying to rule out local realistic theories as alternatives for quantum mechanics can be closed if the detection efficiency $η$ is larger than $η\geq d^{1/2} 2^{-0.0035d}$ where $d$ is the dimension of the entangled system. Furthermore it is argued that this exponential decrease of the detector efficiency required to close the detection loophole is almost optimal. This argument is based on a close connection that exists between closing the detection loophole and the amount of classical communication required to simulate quantum correlation when the detectors are perfect.

quant-ph↗

Greenberger-Horne-Zeilinger paradoxes for many qudits

We construct GHZ contradictions for three or more parties sharing an entangled state, the dimension d of each subsystem being an even integer greater than 2. The simplest example that goes beyond the standard GHZ paradox (three qubits) involves five ququats (d=4). We then examine the criteria a GHZ paradox must satisfy in order to be genuinely M-partite and d-dimensional.

quant-ph↗

How many photons are needed to distinguish two transparencies?

We give a bound on the minimum number of photons that must be absorbed by any quantum protocol to distinguish between two transparencies. We show how a quantum Zeno method in which the angle of rotation is varied at each iteration can attain this bound in certain situations.

quant-ph↗

Greenberger-Horne-Zeilinger paradox for continuous variables

We show how to construct states for which a Greenberger-Horne-Zeilinger type paradox occurs if each party measures either the position or momentum of his particle. The paradox can be ascribed to the anticommutation of certain translation operators in phase space. We then rephrase the paradox in terms of modular and binary variables. The origin of the paradox is then due to the fact that the associativity of addition of modular variables is true only for c-numbers but does not hold for operators.

quant-ph↗

Minimal Absorption Measurements

We show that it is not possible to discriminate two close transparencies without a certain number of photons being absorbed. We extend this to the discrimination of patterns of transparency (images).

quant-ph↗

Optimality of the genetic code with respect to protein stability and amino acid frequencies

How robust is the natural genetic code with respect to mistranslation errors? It has long been known that the genetic code is very efficient in limiting the effect of point mutation. A misread codon will commonly code either for the same amino acid or for a similar one in terms of its biochemical properties, so the structure and function of the coded protein remain relatively unaltered. Previous studies have attempted to address this question more quantitatively, namely by statistically estimating the fraction of randomly generated codes that do better than the genetic code regarding its overall robustness. In this paper, we extend these results by investigating the role of amino acid frequencies in the optimality of the genetic code. When measuring the relative fitness of the natural code with respect to a random code, it is indeed natural to assume that a translation error affecting a frequent amino acid is less favorable than that of a rare one, at equal mutation cost. We find that taking the amino acid frequency into account accordingly decreases the fraction of random codes that beat the natural code, making the latter comparatively even more robust. This effect is particularly pronounced when more refined measures of the amino acid substitution cost are used than hydrophobicity. To show this, we devise a new cost function by evaluating with computer experiments the change in folding free energy caused by all possible single-site mutations in a set of known protein structures. With this cost function, we estimate that of the order of one random code out of 100 millions is more fit than the natural code when taking amino acid frequencies into account. The genetic code seems therefore structured so as to minimize the consequences of translation errors on the 3D structure and stability of proteins.

physics.bio-ph↗

"Interaction-free" discrimination between semi-transparent objects

Absorption-free (also known as ``interaction-free'') measurement aims to detect the presence of an opaque object using a test particle without that particle being absorbed by the object. Here we consider semi-transparent objects which have an amplitude $α$ of transmitting a particle while leaving the state of the object unchanged and an amplitude $β$ of absorbing the particle. The task is to devise a protocol that can decide which of two known transmission amplitudes is present while ensuring that no particle interacts with the object. We show that the probabilities of being able to achieve this are limited by an inequality. This inequality implies that absorption free distinction between complete transparency and any partial transparency is always possible with probabilities approaching 1, but that two partial transparencies can only be distinguished with probabilities less than 1.

quant-ph↗

Optimal cloning of coherent states with a linear amplifier and beam splitters

A transformation achieving the optimal symmetric N-to-M cloning of coherent states is presented. Its implementation only requires a phase-insensitive linear amplifier and a network of beam splitters. An experimental demonstration of this continuous-variable cloner should therefore be in the scope of current technology. The link between optimal quantum cloning and optimal amplification of quantum states is also pointed out.

quant-ph↗

Classical simulation of quantum entanglement without local hidden variables

Recent work has extended Bell's theorem by quantifying the amount of communication required to simulate entangled quantum systems with classical information. The general scenario is that a bipartite measurement is given from a set of possibilities and the goal is to find a classical scheme that reproduces exactly the correlations that arise when an actual quantum system is measured. Previous results have shown that, using local hidden variables, a finite amount of communication suffices to simulate the correlations for a Bell state. We extend this in a number of ways. First, we show that, when the communication is merely required to be finite {\em on average}, Bell states can be simulated {\em without} any local hidden variables. More generally, we show that arbitrary positive operator valued measurements on systems of $n$ Bell states can be simulated with $O(n 2^n)$ bits of communication on average (again, without local hidden variables). On the other hand, when the communication is required to be {\em absolutely bounded}, we show that a finite number of bits of local hidden variables is insufficent to simulate a Bell state. This latter result is based on an analysis of the non-deterministic communication complexity of the NOT-EQUAL function, which is constant in the quantum model and logarithmic in the classical model.

quant-ph↗

Optimal Entanglement Enhancement for Mixed States

We consider the actions of protocols involving local quantum operations and classical communication (LQCC) on a single system consisting of two separated qubits. We give a complete description of the orbits of the space of states under LQCC and characterise the representatives with maximal entanglement of formation. We thus obtain a LQCC entanglement concentration protocol for a single given state (pure or mixed) of two qubits which is optimal in the sense that the protocol produces, with non-zero probability, a state of maximal possible entanglement of formation. This defines a new entanglement measure, the maximum extractable entanglement.

quant-ph↗