Quantum ramp secret sharing from Haar scrambling

• URL: http://arxiv.org/abs/2512.00970v1
• Date: Sun, 30 Nov 2025 16:40:25 GMT
• Title: Quantum ramp secret sharing from Haar scrambling
• Authors: Kiran Adhikari,
• Abstract summary: Quantum information scrambling is a powerful tool for studying the dynamics of chaotic quantum many-body benchmarking systems.<n>We show that two protocols, Haar scrambling and quantum secret sharing, are indeed equivalent.<n>We explore potential applications, ranging from security implications for distributed quantum networks to cryptography in the Noisy Intermediate-Scale Quantum (NISQ) era.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Quantum information scrambling has emerged as a powerful tool for studying the dynamics of chaotic quantum many-body systems, assessing benchmarking protocols, and even investigating exotic black hole models. During quantum information scrambling, localized quantum information disperses across the entire system, hiding from the observers who can only access part of it. On the other side, we have a fundamental cryptographic primitive called secret-sharing schemes, where a dealer shares a quantum secret with a group of parties, such that any subset of parties above a specific threshold size can reconstruct it. In this paper, we demonstrate that two protocols, Haar scrambling, which serves as a baseline for other scrambling techniques, and quantum secret sharing, are indeed equivalent. The scheme one gets out of this is of a ramp secret-sharing nature rather than a threshold scheme. We expect this because of the inherent randomness present in Haar unitaries. Moreover, by varying the purity of the initial states, we demonstrate that it is possible to obtain all possible types of ramp secret-sharing schemes. Furthermore, utilizing complexity theoretic arguments, we argue that the protocol can be implemented efficiently, i.e., in polynomial time. Finally, we explore potential applications, ranging from security implications for distributed quantum networks to cryptography in the Noisy Intermediate-Scale Quantum (NISQ) era, and draw insights for fundamental physics, such as many-body physics and quantum black holes.

Related papers

• Quantum ($t$,$n$) Threshold Multi-Secret Sharing based on Cluster States [1.2932412290302255]
  The first quantum ($t,n$) threshold multi-secret sharing protocol based on Lagrangian and cluster states is proposed.<n>The protocol exploits the security properties of the cluster state to transmit shared information in two parts, quantum and classical.<n>It is proven to be theoretically secure against external and internal attacks by analyzing the protocol.
  arXiv  Detail & Related papers  (2025-05-14T12:14:16Z)
• The Hardness of Learning Quantum Circuits and its Cryptographic Applications [1.2116854758481395]
  We show that concrete hardness assumptions about learning or cloning the output state of a random quantum circuit can be used as the foundation for secure quantum cryptography.<n>We construct secure one-way state generators (OWSGs), digital signature schemes, quantum bit commitments, and private key encryption schemes.
  arXiv  Detail & Related papers  (2025-04-21T18:00:03Z)
• Security and Fairness in Multi-Party Quantum Secret Sharing Protocol [0.0]
  Quantum secret sharing (QSS) is a cryptographic protocol that leverages quantum mechanics to distribute a secret among multiple parties.<n>We introduce a new concept of QSS which leans on a generic distributed quantum-network, based on a threshold scheme.<n>We show the effectiveness and performance of the proposed protocol by testing it against the main classical and quantum attacks.
  arXiv  Detail & Related papers  (2024-12-16T11:18:52Z)
• Guarantees on the structure of experimental quantum networks [105.13377158844727]
  Quantum networks connect and supply a large number of nodes with multi-party quantum resources for secure communication, networked quantum computing and distributed sensing. As these networks grow in size, certification tools will be required to answer questions regarding their properties. We demonstrate a general method to guarantee that certain correlations cannot be generated in a given quantum network.
  arXiv  Detail & Related papers  (2024-03-04T19:00:00Z)
• Revocable Cryptography from Learning with Errors [61.470151825577034]
  We build on the no-cloning principle of quantum mechanics and design cryptographic schemes with key-revocation capabilities. We consider schemes where secret keys are represented as quantum states with the guarantee that, once the secret key is successfully revoked from a user, they no longer have the ability to perform the same functionality as before.
  arXiv  Detail & Related papers  (2023-02-28T18:58:11Z)
• Approximate reconstructability of quantum states and noisy quantum secret sharing schemes [19.170626575317907]
  We analyse approximate quantum secret sharing in a formal cryptographic setting. In particular, we show that approximate reconstructability of the quantum secret by these players is possible if and only if the information leakage is small.
  arXiv  Detail & Related papers  (2023-02-06T00:32:01Z)
• Unclonability and Quantum Cryptanalysis: From Foundations to Applications [0.0]
  Unclonability is a fundamental concept in quantum theory and one of the main non-classical properties of quantum information. We introduce new notions of unclonability in the quantum world, namely quantum physical unclonability. We discuss several applications of this new type of unclonability as a cryptographic resource for designing provably secure quantum protocols.
  arXiv  Detail & Related papers  (2022-10-31T17:57:09Z)
• Quantum information spreading in a disordered quantum walk [50.591267188664666]
  We design a quantum probing protocol using Quantum Walks to investigate the Quantum Information spreading pattern. We focus on the coherent static and dynamic disorder to investigate anomalous and classical transport. Our results show that a Quantum Walk can be considered as a readout device of information about defects and perturbations occurring in complex networks.
  arXiv  Detail & Related papers  (2020-10-20T20:03:19Z)
• Entanglement transfer, accumulation and retrieval via quantum-walk-based qubit-qudit dynamics [50.591267188664666]
  Generation and control of quantum correlations in high-dimensional systems is a major challenge in the present landscape of quantum technologies. We propose a protocol that is able to attain entangled states of $d$-dimensional systems through a quantum-walk-based it transfer & accumulate mechanism. In particular, we illustrate a possible photonic implementation where the information is encoded in the orbital angular momentum and polarization degrees of freedom of single photons.
  arXiv  Detail & Related papers  (2020-10-14T14:33:34Z)
• 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)
• Entanglement Classification via Neural Network Quantum States [58.720142291102135]
  In this paper we combine machine-learning tools and the theory of quantum entanglement to perform entanglement classification for multipartite qubit systems in pure states. We use a parameterisation of quantum systems using artificial neural networks in a restricted Boltzmann machine (RBM) architecture, known as Neural Network Quantum States (NNS)
  arXiv  Detail & Related papers  (2019-12-31T07:40:23Z)

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.