Hacking Quantum Networks: Extraction and Installation of Quantum Data

• URL: http://arxiv.org/abs/2105.13823v2
• Date: Fri, 18 Jun 2021 08:42:05 GMT
• Title: Hacking Quantum Networks: Extraction and Installation of Quantum Data
• Authors: Seok Hyung Lie, Yong Siah Teo, Hyunseok Jeong
• Abstract summary: We study the problem of quantum hacking, which is the procedure of quantum-information extraction from and installation on a quantum network given only partial access. We show that a properly prepared partially entangled probe state can generally outperform a maximally entangled one in quantum hacking.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We study the problem of quantum hacking, which is the procedure of quantum-information extraction from and installation on a quantum network given only partial access. This problem generalizes a central topic in contemporary physics -- information recovery from systems undergoing scrambling dynamics, such as the Hayden--Preskill protocol in black-hole studies. We show that a properly prepared partially entangled probe state can generally outperform a maximally entangled one in quantum hacking. Moreover, we prove that finding an optimal decoder for this stronger task is equivalent to that for Hayden--Preskill-type protocols, and supply analytical formulas for the optimal hacking fidelity of large networks. In the two-user scenario where Bob attempts to hack Alice's data, we find that the optimal fidelity increases with Bob's hacking space relative to Alice's user space. However, if a third neutral party, Charlie, is accessing the computer concurrently, the optimal hacking fidelity against Alice drops with Charlie's user-space dimension, rendering targeted quantum hacking futile in high-dimensional multi-user scenarios without classical attacks. When applied to the black-hole information problem, the limited hacking fidelity implies a reflectivity decay of a black hole as an information mirror.

Related papers

• Enigma: Privacy-Preserving Execution of QAOA on Untrusted Quantum Computers [0.6144680854063939]
  We propose Enigma, a suite of privacy-preserving quantum computation schemes. Unlike previous SQC schemes that obfuscate quantum circuits, Enigma transforms the input problem of QAOA. We show that the privacy improvements of Enigma come at only a small reduction in fidelity.
  arXiv  Detail & Related papers  (2023-11-22T17:40:23Z)
• Quantum advantage in a unified scenario and secure detection of resources [55.2480439325792]
  We consider a single task to study different approaches of having quantum advantage. We show that the optimal success probability in the overall process for a qubit communication might be higher than that for a cbit communication.
  arXiv  Detail & Related papers  (2023-09-22T23:06:20Z)
• Quantum Imitation Learning [74.15588381240795]
  We propose quantum imitation learning (QIL) with a hope to utilize quantum advantage to speed up IL. We develop two QIL algorithms, quantum behavioural cloning (Q-BC) and quantum generative adversarial imitation learning (Q-GAIL) Experiment results demonstrate that both Q-BC and Q-GAIL can achieve comparable performance compared to classical counterparts.
  arXiv  Detail & Related papers  (2023-04-04T12:47:35Z)
• Anticipative measurements in hybrid quantum-classical computation [68.8204255655161]
  We present an approach where the quantum computation is supplemented by a classical result. Taking advantage of its anticipation also leads to a new type of quantum measurements, which we call anticipative. In an anticipative quantum measurement the combination of the results from classical and quantum computations happens only in the end.
  arXiv  Detail & Related papers  (2022-09-12T15:47:44Z)
• Repeated Extraction of Scrambled Quantum Data: Sustainability of the Hayden-Preskill Type Protocols [0.0]
  Scrambler hacking is the procedure of quantum information extraction from and installation on a quantum scrambler given only partial access. We supply analytical formulas for the optimal hacking fidelity, a measure of the effectiveness of scrambler hacking with limited access. We show that the limited hacking fidelity implies the reflectivity decay of a black hole as an information mirror.
  arXiv  Detail & Related papers  (2022-04-01T11:48:03Z)
• An Evolutionary Pathway for the Quantum Internet Relying on Secure Classical Repeaters [64.48099252278821]
  We conceive quantum networks using secure classical repeaters combined with the quantum secure direct communication principle. In these networks, the ciphertext gleaned from a quantum-resistant algorithm is transmitted using QSDC along the nodes. We have presented the first experimental demonstration of a secure classical repeater based hybrid quantum network.
  arXiv  Detail & Related papers  (2022-02-08T03:24:06Z)
• Private Set Intersection with Delegated Blind Quantum Computing [0.0]
  We propose a protocol that solves the server-aided PSI problem using delegated blind quantum computing. The proposed protocol is correct, secure and blind against a malicious server.
  arXiv  Detail & Related papers  (2022-01-10T17:53:41Z)
• Quantum Ciphertext Dimension Reduction Scheme for Homomorphic Encrypted Data [4.825895794318393]
  Proposed quantum principal component extraction algorithm (QPCE) A quantum homomorphic ciphertext dimension reduction scheme (QHEDR) A quantum ciphertext dimensionality reduction scheme implemented in the quantum cloud.
  arXiv  Detail & Related papers  (2020-11-19T07:16:22Z)
• 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)
• Anti-Forging Quantum Data: Cryptographic Verification of Quantum Computational Power [1.9737117321211988]
  Quantum cloud computing is emerging as a popular model for users to experience the power of quantum computing through the internet. How can users be sure that the output strings sent by the server are really from a quantum hardware?
  arXiv  Detail & Related papers  (2020-05-04T14:28:14Z)
• Single-Shot Secure Quantum Network Coding for General Multiple Unicast Network with Free One-Way Public Communication [56.678354403278206]
  We propose a canonical method to derive a secure quantum network code over a multiple unicast quantum network. Our code correctly transmits quantum states when there is no attack. It also guarantees the secrecy of the transmitted quantum state even with the existence of an attack.
  arXiv  Detail & Related papers  (2020-03-30T09:25:13Z)

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.