A Computational Separation Between Quantum No-cloning and No-telegraphing

• URL: http://arxiv.org/abs/2302.01858v3
• Date: Sat, 19 Oct 2024 23:13:14 GMT
• Title: A Computational Separation Between Quantum No-cloning and No-telegraphing
• Authors: Barak Nehoran, Mark Zhandry,
• Abstract summary: Two of the fundamental no-go theorems of quantum information are the no-cloning theorem and the no-teleportation theorem. We give a collection of quantum states and quantum oracles relative to which these states are efficiently clonable but not efficiently telegraphable. We show how such states can be used to protect against key exfiltration.
• Score: 9.520158869896395
• License:
• Abstract: Two of the fundamental no-go theorems of quantum information are the no-cloning theorem (that it is impossible to make copies of general quantum states) and the no-teleportation theorem (the prohibition on telegraphing, or sending quantum states over classical channels without pre-shared entanglement). They are known to be equivalent, in the sense that a collection of quantum states is telegraphable if and only if it is clonable. Our main result suggests that this is not the case when computational efficiency is considered. We give a collection of quantum states and quantum oracles relative to which these states are efficiently clonable but not efficiently telegraphable. Given that the opposite scenario is impossible (states that can be telegraphed can always trivially be cloned), this gives the most complete quantum oracle separation possible between these two important no-go properties. We additionally study the complexity class clonableQMA, a subset of QMA whose witnesses are efficiently clonable. As a consequence of our main result, we give a quantum oracle separation between clonableQMA and the class QCMA, whose witnesses are restricted to classical strings. We also propose a candidate oracle-free promise problem separating these classes. We finally demonstrate an application of clonable-but-not-telegraphable states to cryptography, by showing how such states can be used to protect against key exfiltration.

Related papers

• On the hardness of cloning and connections to representation theory [0.0]
  We conjecture about cloning algorithms for maximally entangled states over hidden subspaces. The conjecture and result follow from connections between quantum computation and representation theory.
  arXiv  Detail & Related papers  (2024-11-18T18:19:08Z)
• Uncloneable Quantum Advice [1.1970409518725493]
  We show for the first time unkeyed quantum uncloneablity, via the study of a complexity-theoretic tool that enables a computation. We show the unconditional existence of promise problems admitting uncloneable quantum advice, and the existence of languages with uncloneable advice.
  arXiv  Detail & Related papers  (2023-09-10T22:09:05Z)
• Quantum process tomography of continuous-variable gates using coherent states [49.299443295581064]
  We demonstrate the use of coherent-state quantum process tomography (csQPT) for a bosonic-mode superconducting circuit. We show results for this method by characterizing a logical quantum gate constructed using displacement and SNAP operations on an encoded qubit.
  arXiv  Detail & Related papers  (2023-03-02T18:08:08Z)
• 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)
• Optimized Telecloning Circuits: Theory and Practice of Nine NISQ Clones [0.0]
  We present results of a of $1 rightarrow 9$ universal, symmetric, optimal quantum telecloning implementation on a cloud accessible quantum computer. The demonstration of creating $9$ approximate clones on a quantum processor is the largest number of clones that has been generated, telecloning or otherwise.
  arXiv  Detail & Related papers  (2022-10-18T21:12:41Z)
• 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)
• Quantum Telecloning on NISQ Computers [0.0]
  Quantum telecloning is a protocol that originates from a combination of quantum teleportation and quantum cloning. NISQ devices can achieve near-optimal quantum telecloning fidelity.
  arXiv  Detail & Related papers  (2022-04-30T01:40:24Z)
• 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)
• 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)
• Cloning of Quantum Entanglement [8.113018294676946]
  We demonstrate quantum cloning of two photon entangled states for the first time. Results are a key step towards cloning of complex quantum systems, and are likely to provide new insights into quantum entanglement.
  arXiv  Detail & Related papers  (2020-10-05T09:53:23Z)
• 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.