Searcharxiv⌕ Search

arXiv subjects

Adrian Kent

Publications and source records attributed to Adrian Kent.

At least 109 records · Page 6Linked to original sources

Cheat Sensitive Quantum Bit Commitment

We define cheat sensitive cryptographic protocols between mistrustful parties as protocols which guarantee that, if either cheats, the other has some nonzero probability of detecting the cheating. We give an example of an unconditionally secure cheat sensitive non-relativistic bit commitment protocol which uses quantum information to implement a task which is classically impossible; we also describe a simple relativistic protocol.

quant-ph↗

A proposal for founding mistrustful quantum cryptography on coin tossing

A significant branch of classical cryptography deals with the problems which arise when mistrustful parties need to generate, process or exchange information. As Kilian showed a while ago, mistrustful classical cryptography can be founded on a single protocol, oblivious transfer, from which general secure multi-party computations can be built. The scope of mistrustful quantum cryptography is limited by no-go theorems, which rule out, inter alia, unconditionally secure quantum protocols for oblivious transfer or general secure two-party computations. These theorems apply even to protocols which take relativistic signalling constraints into account. The best that can be hoped for, in general, are quantum protocols computationally secure against quantum attack. I describe here a method for building a classically certified bit commitment, and hence every other mistrustful cryptographic task, from a secure coin tossing protocol. No security proof is attempted, but I sketch reasons why these protocols might resist quantum computational attack.

quant-ph↗

Inferring superposition and entanglement from measurements in a single basis

We discuss what can be inferred from measurements on one- and two-qubit systems using a single measurement basis at various times. We show that, given reasonable physical assumptions, carrying out such measurements at quarter-period intervals is enough to demonstrate coherent oscillations of one or two qubits between the relevant measurement basis states. One can thus infer from such measurements alone that an approximately equal superposition of two measurement basis states has been created in a coherent oscillation experiment. Similarly, one can infer that a near maximally entangled state of two qubits has been created in an experiment involving a putative SWAP gate. These results apply even if the relevant quantum systems are only approximate qubits. We discuss applications to fundamental quantum physics experiments and quantum information processing investigations.

quant-ph↗

Quantum Bit String Commitment

A bit string commitment protocol securely commits $N$ classical bits in such a way that the recipient can extract only $M<N$ bits of information about the string. Classical reasoning might suggest that bit string commitment implies bit commitment and hence, given the Mayers-Lo-Chau theorem, that non-relativistic quantum bit string commitment is impossible. Not so: there exist non-relativistic quantum bit string commitment protocols, with security parameters $ε$ and $M$, that allow $A$ to commit $N = N(M, ε)$ bits to $B$ so that $A$'s probability of successfully cheating when revealing any bit and $B$'s probability of extracting more than $N'=N-M$ bits of information about the $N$ bit string before revelation are both less than $ε$. With a slightly weakened but still restrictive definition of security against $A$, $N$ can be taken to be $O(\exp (C N'))$ for a positive constant $C$. I briefly discuss possible applications.

quant-ph↗

Large N Quantum Cryptography

In quantum cryptography, the level of security attainable by a protocol which implements a particular task $N$ times bears no simple relation to the level of security attainable by a protocol implementing the task once. Useful partial security, and even near-perfect security in an appropriate sense, can be obtained for $N$ copies of a task which itself cannot be securely implemented. We illustrate this with protocols for quantum bit string commitment and quantum random number generation between mistrustful parties.

quant-ph↗

Locality and reality revisited

Bell gave the now standard definition of a local hidden variable theory and showed that such theories cannot reproduce the predictions of quantum mechanics without violating his ``free will'' criterion: experimenters' measurement choices can be assumed to be uncorrelated with properties of the measured system prior to measurement. An alternative is considered here: a probabilistic theory of hidden variables underlying quantum mechanics could be statistically local, in the sense that it supplies global configuration probabilities which are defined by expressions involving only local terms. This allows Bell correlations without relying on {\it either} a conspiracy theory in which prior common causes correlate the system state with experimenters' choices {\it or} a reverse causation principle in which experimenters' choices affect the earlier system states. In particular, there is no violation of the free will criterion. It gives a different perspective on Bell correlations, in which the puzzle is not that apparently non-local correlations should emerge from rules involving local quantities, but rather that we do not see more general non-local correlations that allow paradox-immune forms of superluminal signalling.

quant-ph↗

Quantum nonlocality, Bell inequalities and the memory loophole

In the analysis of experiments designed to reveal violation of Bell-type inequalities, it is usually assumed that any hidden variables associated with the nth particle pair would be independent of measurement choices and outcomes for the first $(n-1)$ pairs. Models which violate this assumption exploit what we call the {\it memory loophole}. We focus on the strongest type of violation, which uses the {\it 2-sided} memory loophole, in which the hidden variables for pair $n$ can depend on the previous measurement choices and outcomes in both wings of the experiment. We show that the 2-sided memory loophole allows a systematic violation of the CHSH inequality when the data are analysed in the standard way, but cannot produce a violation if a CHSH expression depending linearly on the data is used. In the first case, the maximal CHSH violation becomes small as the number of particle pairs tested becomes large. Hence, although in principle the memory loophole implies a slight flaw in existing analyses of Bell experiments, the data still strongly confirm quantum mechanics against local hidden variables. We consider also a related loophole, the {\it simultaneous measurement loophole}, which applies if all measurements on each side are carried out simultaneously. We show that this can increase the probability of violating the linearised CHSH inequality as well as other Bell-type inequalities.

quant-ph↗

A Comparison of Quantum Oracles

A standard quantum oracle $S_f$ for a general function $f: Z_N \to Z_N $ is defined to act on two input states and return two outputs, with inputs $\ket{i}$ and $\ket{j}$ ($i,j \in Z_N $) returning outputs $\ket{i}$ and $\ket{j \oplus f(i)}$. However, if $f$ is known to be a one-to-one function, a simpler oracle, $M_f$, which returns $\ket{f(i)}$ given $\ket{i}$, can also be defined. We consider the relative strengths of these oracles. We define a simple promise problem which minimal quantum oracles can solve exponentially faster than classical oracles, via an algorithm which cannot be naively adapted to standard quantum oracles. We show that $S_f$ can be constructed by invoking $M_f$ and $(M_f)^{-1}$ once each, while $Θ(\sqrt{N})$ invocations of $S_f$ and/or $(S_f)^{-1}$ are required to construct $M_f$.

quant-ph↗

Quantum Interrogation and the Safer X-ray

We investigate quantum interrogation techniques which allow imaging information about semi-transparent objects to be obtained with lower absorption rates than standard classical methods. We show that a gain proportional to log N can be obtained when searching for defects in an array of N pixels, if it is known that at most M of the pixels can have transparencies different from a predetermined theoretical value. A logarithmic gain can also be obtained when searching for infrequently occurring large structures in arrays.

quant-ph↗

Problems with empirical bounds for strangelet production at RHIC

Recent papers by Busza et al. and Dar et al. have considered empirical bounds on the risk of producing a hypothetical stable negatively charged strangelet at the Brookhaven relativistic heavy ion collider (RHIC) experiments, and thereby destroying the Earth. We examine here ways in which these bounds could, hypothetically, be evaded. We find several,some of which have not previously been considered. These possible flaws do not affect the theoretical arguments against the existence of negatively charged strangelets or the possibility of producing them at RHIC if they were to exist.

hep-ph↗

Simulating Quantum Mechanics by Non-Contextual Hidden Variables

No physical measurement can be performed with infinite precision. This leaves a loophole in the standard no-go arguments against non-contextual hidden variables. All such arguments rely on choosing special sets of quantum-mechanical observables with measurement outcomes that cannot be simulated non-contextually. As a consequence, these arguments do not exclude the hypothesis that the class of physical measurements in fact corresponds to a dense subset of all theoretically possible measurements with outcomes and quantum probabilities that \emph{can} be recovered from a non-contextual hidden variable model. We show here by explicit construction that there are indeed such non-contextual hidden variable models, both for projection valued and positive operator valued measurements.

quant-ph↗

Quantum Histories and Their Implications

Classical mechanics and standard Copenhagen quantum mechanics respect subspace implications. For example, if a particle is confined in a particular region $R$ of space, then in these theories we can deduce that it is confined in regions containing $R$. However, subspace implications are generally violated by versions of quantum theory that assign probabilities to histories, such as the consistent histories approach. I define here a new criterion, ordered consistency, which refines the criterion of consistency and has the property that inferences made by ordered consistent sets do not violate subspace relations. This raises the question: do the operators defining our observations form an ordered consistent history? If so, ordered consistency defines a version of quantum theory with greater predictive power than the consistent histories formalism. If not, and our observations are defined by a non-ordered consistent quantum history, then subspace implications are not generally valid.

gr-qc↗

Night Thoughts of a Quantum Physicist

The most dramatic developments in theoretical physics in the next millennium are likely to come when we make progress on so far unresolved foundational questions. In this essay I consider two of the deepest problems confronting us, the measurement problem in quantum theory and the problem of relating consciousness to the rest of physics. I survey some recent promising ideas on possible solutions to the measurement problem and explain what a proper physical understanding of consciousness would involve and why it would need new physics.

physics.pop-ph↗

Unconditionally Secure Commitment of a Certified Classical Bit is Impossible

In a secure bit commitment protocol involving only classical physics, A commits either a 0 or a 1 to B. If quantum information is used in the protocol, A may be able to commit a state of the form $α\ket{0} + β\ket{1}$. If so, she can also commit mixed states in which the committed bit is entangled with other quantum states under her control. We introduce here a quantum cryptographic primitive, {\it bit commitment with a certificate of classicality} (BCCC), which differs from standard bit commitment in that it guarantees that the committed state has a fixed classical value. We show that no unconditionally secure BCCC protocol based on special relativity and quantum theory exists. We also propose complete definitions of security for quantum and relativistic bit commitment.

quant-ph↗

Coin Tossing is Strictly Weaker Than Bit Commitment

We define cryptographic assumptions applicable to two mistrustful parties who each control two or more separate secure sites between which special relativity guarantees a time lapse in communication. We show that, under these assumptions, unconditionally secure coin tossing can be carried out by exchanges of classical information. We show also, following Mayers, Lo and Chau, that unconditionally secure bit commitment cannot be carried out by finitely many exchanges of classical or quantum information. Finally we show that, under standard cryptographic assumptions, coin tossing is strictly weaker than bit commitment. That is, no secure classical or quantum bit commitment protocol can be built from a finite number of invocations of a secure coin tossing black box together with finitely many additional information exchanges.

quant-ph↗

Non-Contextual Hidden Variables and Physical Measurements

For a hidden variable theory to be indistinguishable from quantum theory for finite precision measurements, it is enough that its predictions agree for some measurement within the range of precision. Meyer has recently pointed out that the Kochen-Specker theorem, which demonstrates the impossibility of a deterministic hidden variable description of ideal spin measurements on a spin 1 particle, can thus be effectively nullified if only finite precision measurements are considered. We generalise this result: it is possible to ascribe consistent outcomes to a dense subset of the set of projection valued measurements, or to a dense subset of the set of positive operator valued measurements, on any finite dimensional system. Hence no Kochen-Specker like contradiction can rule out hidden variable theories indistinguishable from quantum theory by finite precision measurements in either class.

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↗

Non-local Correlations are Generic in Infinite-Dimensional Bipartite Systems

It was recently shown that the nonseparable density operators for a bipartite system are trace norm dense if either factor space has infinite dimension. We show here that non-local states -- i.e., states whose correlations cannot be reproduced by any local hidden variable model -- are also dense. Our constructions distinguish between the cases where both factor spaces are infinite-dimensional, where we show that states violating the CHSH inequality are dense, and the case where only one factor space is infinite-dimensional, where we identify open neighborhoods of nonseparable states that do not violate the CHSH inequality but show that states with a subtler form of non-locality (often called "hidden" non-locality) remain dense.

quant-ph↗