A Cryptography Inspired Model for Non-local Correlations: Decrypting the Enigmas

• URL: http://arxiv.org/abs/2307.03395v1
• Date: Fri, 7 Jul 2023 05:35:04 GMT
• Title: A Cryptography Inspired Model for Non-local Correlations: Decrypting the Enigmas
• Authors: Govind Lal Sidhardh and Manik Banik
• Abstract summary: We propose a cryptography-inspired model for nonlocal correlations. We model nonlocal boxes as realistic systems with instantaneous signalling at the hidden variable level.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We propose a cryptography-inspired model for nonlocal correlations. Following the celebrated De Broglie-Bohm theory, we model nonlocal boxes as realistic systems with instantaneous signalling at the hidden variable level. By introducing randomness in the distribution of the hidden variable, the superluminal signalling model is made compatible with the operational no-signalling condition. As the design mimics the famous symmetric key encryption system called {\it One Time Pads} (OTP), we call this the OTP model for nonlocal boxes. We demonstrate utility of this model in several esoteric examples related to the nonclassicality of nonlocal boxes. In particular, the breakdown of communication complexity using nonlocal boxes can be better understood in this framework. Furthermore, we discuss the Van Dam protocol and show its connection to homomorphic encryption in cryptography. We also discuss possible ways of encapsulating quantum realizable nonlocal correlations within this framework and show that the principle of Information Causality imposes further constraints at the hidden variable level. Present work thus orchestrates the results in classical cryptography to improve our understanding of nonlocal correlations and welcomes further research to this connection.

Related papers

• Simultaneous Haar Indistinguishability with Applications to Unclonable Cryptography [5.360892674012226]
  We present a new approach to unclonable encryption via a reduction to a novel question about nonlocal quantum state discrimination. Our main technical result is showing that the players cannot distinguish between each player receiving independently-chosen Haar random states versus all players receiving the same Haar random state. We also show other implications to single-decryptor encryption and leakage-resilient secret sharing.
  arXiv  Detail & Related papers  (2024-05-16T17:30:55Z)
• Lazy Layers to Make Fine-Tuned Diffusion Models More Traceable [70.77600345240867]
  A novel arbitrary-in-arbitrary-out (AIAO) strategy makes watermarks resilient to fine-tuning-based removal. Unlike the existing methods of designing a backdoor for the input/output space of diffusion models, in our method, we propose to embed the backdoor into the feature space of sampled subpaths. Our empirical studies on the MS-COCO, AFHQ, LSUN, CUB-200, and DreamBooth datasets confirm the robustness of AIAO.
  arXiv  Detail & Related papers  (2024-05-01T12:03:39Z)
• A Sampling Theory Perspective on Activations for Implicit Neural Representations [73.6637608397055]
  Implicit Neural Representations (INRs) have gained popularity for encoding signals as compact, differentiable entities. We conduct a comprehensive analysis of these activations from a sampling theory perspective. Our investigation reveals that sinc activations, previously unused in conjunction with INRs, are theoretically optimal for signal encoding.
  arXiv  Detail & Related papers  (2024-02-08T05:52:45Z)
• Decrypting Nonlinearity: Koopman Interpretation and Analysis of Cryptosystems [0.05120567378386613]
  We introduce a novel perspective on cryptosystems by viewing the Diffie-Hellman key exchange and the Rivest-Shamir-Adleman cryptosystem as nonlinear dynamical systems. By applying Koopman theory, we transform these dynamical systems into higher-dimensional spaces and analytically derive equivalent purely linear systems.
  arXiv  Detail & Related papers  (2023-11-21T16:38:48Z)
• Approaching an unknown communication system by latent space exploration and causal inference [5.026037329977691]
  This paper proposes a methodology for discovering meaningful properties in data by exploring the latent space of unsupervised deep generative models. We combine manipulation of individual latent variables to extreme values with methods inspired by causal inference. We show that this method yields insights for model interpretability.
  arXiv  Detail & Related papers  (2023-03-20T08:09:13Z)
• Toward Certified Robustness Against Real-World Distribution Shifts [65.66374339500025]
  We train a generative model to learn perturbations from data and define specifications with respect to the output of the learned model. A unique challenge arising from this setting is that existing verifiers cannot tightly approximate sigmoid activations. We propose a general meta-algorithm for handling sigmoid activations which leverages classical notions of counter-example-guided abstraction refinement.
  arXiv  Detail & Related papers  (2022-06-08T04:09:13Z)
• Quantum Proofs of Deletion for Learning with Errors [91.3755431537592]
  We construct the first fully homomorphic encryption scheme with certified deletion. Our main technical ingredient is an interactive protocol by which a quantum prover can convince a classical verifier that a sample from the Learning with Errors distribution in the form of a quantum state was deleted.
  arXiv  Detail & Related papers  (2022-03-03T10:07:32Z)
• Impossibility of memory in hidden-signaling models for quantum correlations [0.0]
  We consider a toy model for non-local quantum correlations in which nature resorts to some form of hidden signaling to generate correlations. We show that if such a model also had memory, the parties would be able to exploit the hidden-signaling and use it to send a message.
  arXiv  Detail & Related papers  (2020-05-22T18:15:22Z)
• Learning Context-Based Non-local Entropy Modeling for Image Compression [140.64888994506313]
  In this paper, we propose a non-local operation for context modeling by employing the global similarity within the context. The entropy model is further adopted as the rate loss in a joint rate-distortion optimization. Considering that the width of the transforms is essential in training low distortion models, we finally produce a U-Net block in the transforms to increase the width with manageable memory consumption and time complexity.
  arXiv  Detail & Related papers  (2020-05-10T13:28:18Z)
• Multidimensional dark space and its underlying symmetries: towards dissipation-protected qubits [62.997667081978825]
  We show that a controlled interaction with the environment may help to create a state, dubbed as em dark'', which is immune to decoherence. To encode quantum information in the dark states, they need to span a space with a dimensionality larger than one, so different states act as a computational basis. This approach offers new possibilities for storing, protecting and manipulating quantum information in open systems.
  arXiv  Detail & Related papers  (2020-02-01T15:57:37Z)
• Bell non-locality using tensor networks and sparse recovery [0.0]
  Bell's theorem, stating that quantum predictions are incompatible with a local hidden variable description, is a cornerstone of quantum theory. We propose to analyse a Bell scenario as a tensor network, a perspective permitting to test and quantify non-locality. It allows to prove that non-signalling correlations can be described by hidden variable models governed by a quasi-probability.
  arXiv  Detail & Related papers  (2020-01-30T16:59:18Z)

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.