Cryptography without Long-Term Quantum Memory and Global Entanglement

• URL: http://arxiv.org/abs/2504.21842v1
• Date: Wed, 30 Apr 2025 17:51:25 GMT
• Title: Cryptography without Long-Term Quantum Memory and Global Entanglement
• Authors: Lev Stambler,
• Abstract summary: We show how oracles which only allow for classical query access can be used to construct quantum cryptographic primitives.<n> Importantly, the RAM obfuscation scheme does not require long-term quantum memory or global entanglement.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We show how oracles which only allow for classical query access can be used to construct a variety of quantum cryptographic primitives which do not require long-term quantum memory or global entanglement. Specifically, if a quantum party can execute a semi-quantum token scheme (Shmueli 2022) with probability of success $1/2 + \delta$, we can build powerful cryptographic primitives with a multiplicative logarithmic overhead for the desired correctness error. Our scheme makes no assumptions about the quantum party's noise model except for a simple independence requirement: noise on two sets of non-entangled hardware must be independent. Using semi-quantum tokens and oracles which can only be queried classically, we first show how to construct a "short-lived" semi-quantum one-time program (OTP) which allows a classical sending party to prepare a one-time program on the receiving party's quantum computer. We then show how to use this semi-quantum OTP to construct a semi-quantum "stateful obfuscation" scheme (which we term "RAM obfuscation"). Importantly, the RAM obfuscation scheme does not require long-term quantum memory or global entanglement. Finally, we show how RAM obfuscation can be used to build long-lived one-time programs and copy-protection schemes.

Related papers

• Quantum One-Time Protection of any Randomized Algorithm [0.03320194947871346]
  A quantum one-time token is a quantum state that permits a certain program to be evaluated exactly once. We propose a scheme for building quantum one-time tokens for any randomized classical program, which include generative AI models.
  arXiv  Detail & Related papers  (2024-11-05T18:00:29Z)
• Hard Quantum Extrapolations in Quantum Cryptography [9.214658764451348]
  We study the quantum analogues of the universal extrapolation task. We show that it is hard if quantum commitments exist, and it is easy for quantum space.
  arXiv  Detail & Related papers  (2024-09-25T00:09:42Z)
• Quantum State Obfuscation from Classical Oracles [18.878095837031292]
  A major unresolved question in quantum cryptography is whether it is possible to obfuscate arbitrary quantum computation. We develop a new array of techniques that we use to construct a quantum state obfuscator.
  arXiv  Detail & Related papers  (2024-01-18T18:42:28Z)
• Commitments from Quantum One-Wayness [0.0]
  This work studies one-way state generators, a natural quantum relaxation of one-way functions. A fundamental question is whether this type of quantum one-wayness suffices to realize quantum cryptography. We prove that one-way state generators with pure state outputs imply quantum bit commitments and secure multiparty computation.
  arXiv  Detail & Related papers  (2023-10-17T18:48:22Z)
• Obfuscation of Pseudo-Deterministic Quantum Circuits [14.026980555435841]
  We show how to obfuscate pseudo-deterministic quantum circuits in the classical oracle model. Our obfuscator outputs a quantum state $ketwidetildeQ$ repeatedly on arbitrary inputs.
  arXiv  Detail & Related papers  (2023-02-22T01:14:20Z)
• Quantum Depth in the Random Oracle Model [57.663890114335736]
  We give a comprehensive characterization of the computational power of shallow quantum circuits combined with classical computation. For some problems, the ability to perform adaptive measurements in a single shallow quantum circuit is more useful than the ability to perform many shallow quantum circuits without adaptive measurements.
  arXiv  Detail & Related papers  (2022-10-12T17:54:02Z)
• Entanglement and coherence in Bernstein-Vazirani algorithm [58.720142291102135]
  Bernstein-Vazirani algorithm allows one to determine a bit string encoded into an oracle. We analyze in detail the quantum resources in the Bernstein-Vazirani algorithm. We show that in the absence of entanglement, the performance of the algorithm is directly related to the amount of quantum coherence in the initial state.
  arXiv  Detail & Related papers  (2022-05-26T20:32:36Z)
• 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)
• 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 copy-protection of compute-and-compare programs in the quantum random oracle model [48.94443749859216]
  We introduce a quantum copy-protection scheme for a class of evasive functions known as " compute-and-compare programs" We prove that our scheme achieves non-trivial security against fully malicious adversaries in the quantum random oracle model (QROM) As a complementary result, we show that the same scheme fulfils a weaker notion of software protection, called "secure software leasing"
  arXiv  Detail & Related papers  (2020-09-29T08:41:53Z)
• Quantum Gram-Schmidt Processes and Their Application to Efficient State Read-out for Quantum Algorithms [87.04438831673063]
  We present an efficient read-out protocol that yields the classical vector form of the generated state. Our protocol suits the case that the output state lies in the row space of the input matrix. One of our technical tools is an efficient quantum algorithm for performing the Gram-Schmidt orthonormal procedure.
  arXiv  Detail & Related papers  (2020-04-14T11:05:26Z)

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.