首页/论文/quant-ph/0409029

arXiv quant-ph/04090292004-09quant-phcs.CR

Why Classical Certification is Impossible in a Quantum World

Adrian Kent

备注：: Minor edit: typos fixed, refs updated. To appear in Quantum Information Processing
发表信息：: Quantum Information Processing, 11 (2), 493-499 (2012)
DOI：: 10.1007/s11128-011-0262-x

英文摘要：

We give a simple proof that it is impossible to guarantee the classicality of inputs into any mistrustful quantum cryptographic protocol. The argument illuminates the impossibility of unconditionally secure quantum implementations of essentially classical tasks such as bit commitment with a certified classical committed bit, classical oblivious transfer, and secure classical multi-party computations of secret classical data. It applies to both non-relativistic and relativistic protocols.

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

继续探索

相关论文

Increased Certification of Semi-device Independent Random Numbers using Many Inputs and More Postprocessing

Quantum communication with systems of dimension larger than two provides advantages in information processing tasks. Examples include higher rates of key distribution and random number generation. The main disadvantage of using such multi-dimensional quantum systems is the increased complexity of the experimental setup. Here, we analyze a not-so-obvious problem: the relation between randomness certification and computational requirements of the postprocessing of experimental data. In particular, we consider semi-device independent randomness certification from an experiment using a four dimens…

2016-06-22quant-ph

Robust and versatile black-box certification of quantum devices

Self-testing refers to the fact that, in some quantum devices, both states and measurements can be assessed in a black-box scenario, on the sole basis of the observed statistics, i.e. without reference to any prior device calibration. Only a few examples of self-testing are known, and they just provide non-trivial assessment for devices performing unrealistically close to the ideal case. We overcome these difficulties by approaching self-testing with the semi-definite programming hierarchy for the characterization of quantum correlations. This allows us to improve dramatically the robustness o…

2014-06-27quant-ph

Why quantum bit commitment and ideal quantum coin tossing are impossible

There had been well known claims of ``provably unbreakable'' quantum protocols for bit commitment and coin tossing. However, we, and independently Mayers, showed that all proposed quantum bit commitment (and therefore coin tossing) schemes are, in principle, insecure because the sender, Alice, can always cheat successfully by using an EPR-type of attack and delaying her measurements. One might wonder if secure quantum bit commitment and coin tossing protocols exist at all. Here we prove that an EPR-type of attack by Alice will, in principle, break {\em any} realistic quantum bit commitment and…

1996-08-22quant-ph

Secure certification of mixed quantum states with application to two-party randomness generation

We investigate sampling procedures that certify that an arbitrary quantum state on $n$ subsystems is close to an ideal mixed state $φ^{\otimes n}$ for a given reference state $φ$, up to errors on a few positions. This task makes no sense classically: it would correspond to certifying that a given bitstring was generated according to some desired probability distribution. However, in the quantum case, this is possible if one has access to a prover who can supply a purification of the mixed state. In this work, we introduce the concept of mixed-state certification, and we show that a natural sam…

2018-04-12quant-ph

Why Quantum Bit Commitment And Ideal Quantum Coin Tossing Are Impossible

There had been well known claims of unconditionally secure quantum protocols for bit commitment. However, we, and independently Mayers, showed that all proposed quantum bit commitment schemes are, in principle, insecure because the sender, Alice, can almost always cheat successfully by using an Einstein-Podolsky-Rosen (EPR) type of attack and delaying her measurements. One might wonder if secure quantum bit commitment protocols exist at all. We answer this question by showing that the same type of attack by Alice will, in principle, break any bit commitment scheme. The cheating strategy genera…

1997-11-26quant-ph

对“为什么干涉现象未能抓住量子理论本质”的评论

Comment on "Why interference phenomena do not capture the essence of quantum theory"

本文指出Catani等人试图用确定性经典模型重现量子干涉以证伪Feynman观点的论证存在若干问题。

2024-03-24physics.hist-phquant-ph

更多相关论文收起更多论文

General impossible operations in quantum information

We prove a general limitation in quantum information that unifies the impossibility principles such as no-cloning and no-anticloning. Further, we show that for an unknown qubit one cannot design a universal Hadamard gate for creating equal superposition of the original and its complement state. Surprisingly, we find that Hadamard transformations exist for an unknown qubit chosen either from the polar or equatorial great circles. Also, we show that for an unknown qubit one cannot design a universal unitary gate for creating unequal superpositions of the original and its complement state. We dis…

2002-09-17quant-ph

Trust-free verification of steering: why you can't cheat a quantum referee

It was believed until recently that the verification of quantum entanglement and quantum steering, between two parties, required trust in at least one of the parties and their devices, in contrast to the verification of Bell nonseparability. It has since been shown that this is not the case: the need for trust, in verifying two parties share a given quantum correlation resource, can be replaced by quantum refereeing, in which the referee sends quantum signals rather than classical signals to untrusted parties. The existence of such quantum-refereed games is discussed, with particular emphasis …

2016-06-01quant-ph

A limit on nonlocality in any world in which communication complexity is not trivial

Bell proved that quantum entanglement enables two space-like separated parties to exhibit classically impossible correlations. Even though these correlations are stronger than anything classically achievable, they cannot be harnessed to make instantaneous (faster than light) communication possible. Yet, Popescu and Rohrlich have shown that even stronger correlations can be defined, under which instantaneous communication remains impossible. This raises the question: Why are the correlations achievable by quantum mechanics not maximal among those that preserve causality? We give a partial answe…

2005-08-04quant-ph

An almost convincing scheme for discriminating the preparation basis of quantum ensemble and why it will not work

Mixed states of a quantum system, represented by density operators, can be decomposed as a statistical mixture of pure states in a number of ways where each decomposition can be viewed as a different preparation recipe. However the fact that the density matrix contains full information about the ensemble makes it impossible to estimate the preparation basis for the quantum system. Here we present a measurement scheme to (seemingly) improve the performance of unsharp measurements. We argue that in some situations this scheme is capable of providing statistics from a single copy of the quantum s…

2016-01-25quant-ph

无随机性非经典性检验：概念验证

Randomness-free Test of Non-classicality: a Proof of Concept

本文提出并实验验证了一种无需种子随机性的半设备无关认证技术，通过纠缠光子对产生关联硬币，证明其量子优势并认证非投影测量，为量子通信提供了经济有效的认证方案。

2023-09-06physics.opticsquant-ph

Why quantum dynamics is linear

Quantum dynamics is linear. How do we know? From theory or experiment? The history of this question is reviewed. Nonlinear generalizations of quantum mechanics have been proposed. They predict small but clear nonlinear effects, which very accurate experiments have not seen. Is there a reason in principle why nonlinearity is not found? Is it impossible? Does quantum dynamics have to be linear? Attempts to prove this have not been decisive, because either their assumptions are not compelling or their arguments are not conclusive. The question has been left unsettled. There is a simple answer, ba…

2007-02-16quant-ph

Shut up and let me think. Or why you should work on the foundations of quantum mechanics as much as you please

If you have a restless intellect, it is very likely that you have played at some point with the idea of investigating the meaning and conceptual foundations of quantum mechanics. It is also probable (albeit not certain) that your intentions have been stopped on their tracks by an encounter with some version of the "Shut up and calculate" command. You may have heard that everything is already understood. That understanding is not your job. Or, if it is, it is either impossible or very difficult. Maybe somebody explained to you that physics is concerned with "hows" and not with "whys"; that whys…

2013-09-29physics.hist-phquant-ph

A Quantum Paradox of Choice and Purported Classical Analogues

We recently considered the task of summoning an unknown quantum state and proved necessary and sufficient conditions for Alice to be able to guarantee to complete the task when there may be several possible calls, of which she need only respond to one. We showed that these are strictly stronger conditions than those previously established by Hayden and May for the case where Alice knows there will only be one call. We introduced the concept of a {\it quantum paradox of choice} to summarize the implications of these results: Alice is given more options to complete our version of the task, yet o…

2015-09-27quant-ph

可扩展光子平台上的量子学习优势

Quantum learning advantage on a scalable photonic platform

该研究在可扩展光子平台上实现连续变量量子增强学习协议，利用约5 dB不完美EPR纠缠学习100模玻色子位移过程，样本需求较传统方案减少11.8个数量级。

2025-02-16quant-ph