Related papers: Repeated Extraction of Scrambled Quantum Data: Sustainability of the Hayden-Preskill Type Protocols

Repeated Extraction of Scrambled Quantum Data: Sustainability of the Hayden-Preskill Type Protocols

URL: http://arxiv.org/abs/2204.00374v1
Date: Fri, 1 Apr 2022 11:48:03 GMT
Title: Repeated Extraction of Scrambled Quantum Data: Sustainability of the Hayden-Preskill Type Protocols
Authors: Seok Hyung Lie, Yong Siah Teo and Hyunseok Jeong
Abstract summary: 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.
Score: 0.0
License: http://creativecommons.org/licenses/by-sa/4.0/
Abstract: We introduce and study the problem of scrambler hacking, which is the procedure of quantum information extraction from and installation on a quantum scrambler given only partial access. This problem necessarily emerges from a central topic in contemporary physics - information recovery from systems undergoing scrambling dynamics, such as the Hayden-Preskill protocol in black hole studies - because one must replace quantum data with another when extracting it due to the no-cloning theorem. For large scramblers, we supply analytical formulas for the optimal hacking fidelity, a quantitative measure of the effectiveness of scrambler hacking with limited access. In the two-user scenario where Bob attempts to hack Alice's data, we find that the optimal fidelity converges to $64/(9\pi^2)\approx0.72$ with increasing Bob's hacking space relative to Alice's user space. We applied our results to the black hole information problem and showed that the limited hacking fidelity implies the reflectivity decay of a black hole as an information mirror, which questions the solvability of the black hole information paradox through the Hayden-Preskill type protocol.

Related papers

Cloning Games, Black Holes and Cryptography [53.93687166730726]
This paper is the new, natural, notion of Haar cloning games together with two applications. In the area of black-hole physics, our game reveals that, in an idealized model of a black hole, the information from infalling entangled qubits can only be recovered from either the interior or the exterior. In the area of quantum cryptography, our game helps us construct succinct unclonable encryption schemes from the existence of pseudorandom unitaries.
arXiv Detail & Related papers (2024-11-07T14:09:32Z)
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)
Page Time as a Transition of Information Channels: High-fidelity Information Retrieval for Radiating Black Holes [11.13371546439765]
In this Letter, we demonstrate that this view can be relaxed in a new postselection model. We investigate information recoverability in a radiating black hole through the non-unitary dynamics that projects the randomly-selected modes from a scrambling unitary. We show that the model has the merit of producing the von Neumann entropy of black holes consistent with the island formula calculation. In this model the Page time gains a new interpretation as the transition point between two channels of information transmission when sufficient amounts of effective modes are annihilated inside the horizon.
arXiv Detail & Related papers (2023-09-05T03:12:48Z)
Information retrieval from Hawking radiation in the non-isometric model of black hole interior: theory and quantum simulations [11.13371546439765]
The non-isometric holographic model of the black hole interior stands out as a potential resolution of the long-standing black hole information puzzle. We show how Yoshida-Kitaev decoding strategy can be employed in the modified Hayden-Preskill protocol. This study would stimulate more interests to explore black hole information problem on the quantum processors.
arXiv Detail & Related papers (2023-07-04T03:16:36Z)
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)
Retrieving information from a black hole using quantum machine learning [0.0]
We show that an information retrieval decoder can be learned with fidelity scaling as $exp(-alpha t)$ using quantum machine learning. We show that the crossover between learnability and non-learnability is driven by the amount of non-stabilizerness present in the black hole.
arXiv Detail & Related papers (2022-06-13T18:00:02Z)
Efficient Bipartite Entanglement Detection Scheme with a Quantum Adversarial Solver [89.80359585967642]
Proposal reformulates the bipartite entanglement detection as a two-player zero-sum game completed by parameterized quantum circuits. We experimentally implement our protocol on a linear optical network and exhibit its effectiveness to accomplish the bipartite entanglement detection for 5-qubit quantum pure states and 2-qubit quantum mixed states.
arXiv Detail & Related papers (2022-03-15T09:46:45Z)
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)
Hacking Quantum Networks: Extraction and Installation of Quantum Data [0.0]
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.
arXiv Detail & Related papers (2021-05-28T13:34:53Z)
Geometry of Banach spaces: a new route towards Position Based Cryptography [65.51757376525798]
We study Position Based Quantum Cryptography (PBQC) from the perspective of geometric functional analysis and its connections with quantum games. The main question we are interested in asks for the optimal amount of entanglement that a coalition of attackers have to share in order to compromise the security of any PBQC protocol. We show that the understanding of the type properties of some more involved Banach spaces would allow to drop out the assumptions and lead to unconditional lower bounds on the resources used to attack our protocol.
arXiv Detail & Related papers (2021-03-30T13:55:11Z)
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)

This list is automatically generated from the titles and abstracts of the papers in this site.