Are quantum cryptographic security claims vacuous?

• URL: http://arxiv.org/abs/2010.11961v1
• Date: Thu, 22 Oct 2020 18:00:05 GMT
• Title: Are quantum cryptographic security claims vacuous?
• Authors: Joseph M. Renes and Renato Renner
• Abstract summary: We explain why Bernstein's reasoning is based on a too "classical" understanding of physics. It follows from known theorems about fault-tolerant quantum computation that quantum physics avoids his conclusion.
• Score: 12.970250708769708
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: A central claim in quantum cryptography is that secrecy can be proved rigorously, based on the assumption that the relevant information-processing systems obey the laws of quantum physics. This claim has recently been challenged by Bernstein (arXiv:1803.04520). He argues that the laws of physics may also entail an unavoidable leakage of any classical information encoded in physical carriers. The security claim of quantum key distribution would then be vacuous, as the computation of the final secret key would leak its value. However, as we explain in this short note, Bernstein's reasoning is based on a too "classical" understanding of physics. It follows from known theorems about fault-tolerant quantum computation that quantum physics avoids his conclusion.

Related papers

• Information acquisition, scrambling, and sensitivity to errors in quantum chaos [0.0]
  Signatures of chaos can be understood by studying quantum systems whose classical counterpart is chaotic. concepts of integrability, non-integrability and chaos extend to systems without a classical analogue.
  arXiv  Detail & Related papers  (2024-09-22T06:31:14Z)
• Simple Tests of Quantumness Also Certify Qubits [69.96668065491183]
  A test of quantumness is a protocol that allows a classical verifier to certify (only) that a prover is not classical. We show that tests of quantumness that follow a certain template, which captures recent proposals such as (Kalai et al., 2022) can in fact do much more. Namely, the same protocols can be used for certifying a qubit, a building-block that stands at the heart of applications such as certifiable randomness and classical delegation of quantum computation.
  arXiv  Detail & Related papers  (2023-03-02T14:18:17Z)
• Quantum Cryptography: Quantum Key Distribution, a Non-technical Approach [0.0]
  Quantum mechanics provides means to create an inherently secure communication channel that is protected by the laws of physics. This paper is a non-technical overview of quantum key distribution, a type of cryptography poised to exploit the laws of quantum mechanics directly.
  arXiv  Detail & Related papers  (2022-11-09T15:30:23Z)
• Algorithm and Circuit of Nesting Doubled Qubits [3.6296396308298795]
  Copying quantum states is contradictory to classical information processing. This paper investigates the naturally arising question of how well or under what conditions one can copy and measure an arbitrary quantum superposition of states.
  arXiv  Detail & Related papers  (2022-01-01T23:14:44Z)
• Depth-efficient proofs of quantumness [77.34726150561087]
  A proof of quantumness is a type of challenge-response protocol in which a classical verifier can efficiently certify quantum advantage of an untrusted prover. In this paper, we give two proof of quantumness constructions in which the prover need only perform constant-depth quantum circuits.
  arXiv  Detail & Related papers  (2021-07-05T17:45:41Z)
• Experimental study of quantum uncertainty from lack of information [3.901856932788151]
  The uncertainty in the classical domain comes from the lack of information about the exact state of the system. In this paper we investigate the issue experimentally by implementing the corresponding two-dimensional and three-dimensional guessing games. Our results confirm that within the guessing-game framework, the quantum uncertainty to a large extent relies on the fact that quantum information determining the key properties of the game is stored in the degrees of freedom that remain inaccessible to the guessing party.
  arXiv  Detail & Related papers  (2021-05-19T09:15:27Z)
• Towards understanding the power of quantum kernels in the NISQ era [79.8341515283403]
  We show that the advantage of quantum kernels is vanished for large size datasets, few number of measurements, and large system noise. Our work provides theoretical guidance of exploring advanced quantum kernels to attain quantum advantages on NISQ devices.
  arXiv  Detail & Related papers  (2021-03-31T02:41:36Z)
• Post-Quantum Succinct Arguments: Breaking the Quantum Rewinding Barrier [73.70426431502803]
  We prove that Kilian's four-message succinct argument system is post-quantum secure in the standard model. This yields the first post-quantum succinct argument system from any falsifiable assumption.
  arXiv  Detail & Related papers  (2021-03-15T05:09:17Z)
• Security in Quantum Cryptography [5.914028209673859]
  Quantum cryptography exploits principles of quantum physics for the secure processing of information. We review this physical notion of security, focusing on quantum key distribution and secure communication.
  arXiv  Detail & Related papers  (2021-01-29T19:00:54Z)
• Secure Two-Party Quantum Computation Over Classical Channels [63.97763079214294]
  We consider the setting where the two parties (a classical Alice and a quantum Bob) can communicate only via a classical channel. We show that it is in general impossible to realize a two-party quantum functionality with black-box simulation in the case of malicious quantum adversaries. We provide a compiler that takes as input a classical proof of quantum knowledge (PoQK) protocol for a QMA relation R and outputs a zero-knowledge PoQK for R that can be verified by classical parties.
  arXiv  Detail & Related papers  (2020-10-15T17:55:31Z)
• Quantum noise protects quantum classifiers against adversaries [120.08771960032033]
  Noise in quantum information processing is often viewed as a disruptive and difficult-to-avoid feature, especially in near-term quantum technologies. We show that by taking advantage of depolarisation noise in quantum circuits for classification, a robustness bound against adversaries can be derived. This is the first quantum protocol that can be used against the most general adversaries.
  arXiv  Detail & Related papers  (2020-03-20T17:56:14Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.