Unclonability and Quantum Cryptanalysis: From Foundations to Applications

• URL: http://arxiv.org/abs/2210.17545v1
• Date: Mon, 31 Oct 2022 17:57:09 GMT
• Title: Unclonability and Quantum Cryptanalysis: From Foundations to Applications
• Authors: Mina Doosti
• Abstract summary: 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.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: The impossibility of creating perfect identical copies of unknown quantum systems is a fundamental concept in quantum theory and one of the main non-classical properties of quantum information. This limitation imposed by quantum mechanics, famously known as the no-cloning theorem, has played a central role in quantum cryptography as a key component in the security of quantum protocols. In this thesis, we look at Unclonability in a broader context in physics and computer science and more specifically through the lens of cryptography, learnability and hardware assumptions. We introduce new notions of unclonability in the quantum world, namely quantum physical unclonability, and study the relationship with cryptographic properties and assumptions such as unforgeability, and quantum pseudorandomness. The purpose of this study is to bring new insights into the field of quantum cryptanalysis and into the notion of unclonability itself. We also discuss several applications of this new type of unclonability as a cryptographic resource for designing provably secure quantum protocols. Furthermore, we present a new practical cryptanalysis technique concerning the problem of approximate cloning of quantum states. We design a quantum machine learning-based cryptanalysis algorithm to demonstrate the power of quantum learning tools as both attack strategies and powerful tools for the practical study of quantum unclonability.

Related papers

• Quantum Indistinguishable Obfuscation via Quantum Circuit Equivalence [6.769315201275599]
  Quantum computing solutions are increasingly deployed in commercial environments through delegated computing. One of the most critical issues is to guarantee the confidentiality and proprietary of quantum implementations. Since the proposal of general-purpose indistinguishability obfuscation (iO) and functional encryption schemes, iO has emerged as a seemingly versatile cryptography primitive.
  arXiv  Detail & Related papers  (2024-11-19T07:37:24Z)
• The curse of random quantum data [62.24825255497622]
  We quantify the performances of quantum machine learning in the landscape of quantum data. We find that the training efficiency and generalization capabilities in quantum machine learning will be exponentially suppressed with the increase in qubits. Our findings apply to both the quantum kernel method and the large-width limit of quantum neural networks.
  arXiv  Detail & Related papers  (2024-08-19T12:18:07Z)
• Separable Power of Classical and Quantum Learning Protocols Through the Lens of No-Free-Lunch Theorem [70.42372213666553]
  The No-Free-Lunch (NFL) theorem quantifies problem- and data-independent generalization errors regardless of the optimization process. We categorize a diverse array of quantum learning algorithms into three learning protocols designed for learning quantum dynamics under a specified observable. Our derived NFL theorems demonstrate quadratic reductions in sample complexity across CLC-LPs, ReQu-LPs, and Qu-LPs. We attribute this performance discrepancy to the unique capacity of quantum-related learning protocols to indirectly utilize information concerning the global phases of non-orthogonal quantum states.
  arXiv  Detail & Related papers  (2024-05-12T09:05:13Z)
• Learning Quantum Processes with Quantum Statistical Queries [0.0]
  This paper introduces the first learning framework for studying quantum process learning within the Quantum Statistical Query model. We propose an efficient QPSQ learner for arbitrary quantum processes accompanied by a provable performance guarantee. This work marks a significant step towards understanding the learnability of quantum processes and shedding light on their security implications.
  arXiv  Detail & Related papers  (2023-10-03T14:15:20Z)
• Quantum data learning for quantum simulations in high-energy physics [55.41644538483948]
  We explore the applicability of quantum-data learning to practical problems in high-energy physics. We make use of ansatz based on quantum convolutional neural networks and numerically show that it is capable of recognizing quantum phases of ground states. The observation of non-trivial learning properties demonstrated in these benchmarks will motivate further exploration of the quantum-data learning architecture in high-energy physics.
  arXiv  Detail & Related papers  (2023-06-29T18:00:01Z)
• Quantum Machine Learning: from physics to software engineering [58.720142291102135]
  We show how classical machine learning approach can help improve the facilities of quantum computers. We discuss how quantum algorithms and quantum computers may be useful for solving classical machine learning tasks.
  arXiv  Detail & Related papers  (2023-01-04T23:37:45Z)
• A prototype of quantum von Neumann architecture [0.0]
  We propose a model of universal quantum computer system, the quantum version of the von Neumann architecture. It uses ebits as elements of the quantum memory unit, and qubits as elements of the quantum control unit and processing unit. Our primary study demonstrates the manifold power of quantum information and paves the way for the creation of quantum computer systems.
  arXiv  Detail & Related papers  (2021-12-17T06:33:31Z)
• On exploring the potential of quantum auto-encoder for learning quantum systems [60.909817434753315]
  We devise three effective QAE-based learning protocols to address three classically computational hard learning problems. Our work sheds new light on developing advanced quantum learning algorithms to accomplish hard quantum physics and quantum information processing tasks.
  arXiv  Detail & Related papers  (2021-06-29T14:01:40Z)
• Quantum Data Compression and Quantum Cross Entropy [0.0]
  We show that quantum cross entropy acts as the compression rate for sub-optimal quantum source coding. This reveals that quantum cross entropy can effectively serve as a loss function in quantum machine learning algorithms.
  arXiv  Detail & Related papers  (2021-06-25T18:00:33Z)
• Quantum Candies and Quantum Cryptography [0.0]
  We investigate, extend, and much expand here "quantum candies" (invented by Jacobs), a pedagogical model for intuitively describing some basic concepts in quantum information. We explicitly demonstrate various additional quantum cryptography protocols using quantum candies in an approachable manner.
  arXiv  Detail & Related papers  (2020-11-03T21:01:08Z)
• 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)

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.