Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userQuantum information masking basing on quantum teleportation
108
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
The no-masking theorem says that masking quantum information is impossible in a bipartite scenario. However, there exist schemes to mask quantum states in multipartite systems. In this work, we show that, the joint measurement in the teleportation is really a masking process, when the apparatus is regarded as a quantum participant in the whole system.Based on the view, we present two four-partite maskers and a tripartite masker. One of the former provides a generalization in arbitrary dimension of the four-qubit scheme given by Li and Wang [Phys. Rev. A 98, 062306 (2018)], and the latter is precisely their tripartite scheme. The occupation probabilities and coherence of quantum states are masked in two steps of our schemes. And the information can be extracted naturally in their reverse processes.
rate research
Read More
Masking of quantum information spreads it over nonlocal correlations and hides it from the subsystems. It is known that no operation can simultaneously mask all pure states [Phys. Rev. Lett. 120, 230501 (2018)], so in what sense is quantum information masking useful? Here, we extend the definition of quantum information masking to general mixed states, and show that the resource of maskable quantum states are far more abundant than the no-go theorem seemingly suggests. Geometrically, the simultaneously maskable states lays on hyperdisks in the state hypersphere, and strictly contain the broadcastable states. We devise a photonic quantum information masking machine using time-correlated photons to experimentally investigate the properties of qubit masking, and demonstrate the transfer of quantum information into bipartite correlations and its faithful retrieval. The versatile masking machine has decent extensibility, and may be applicable to quantum secret sharing and fault-tolerant quantum communication. Our results provide some insights on the comprehension and potential application of quantum information masking.
A fundamental pursuit in complexity theory concerns reducing worst-case problems to average-case problems. There exist complexity classes such as PSPACE that admit worst-case to average-case reductions. However, for many other classes such as NP, the evidence so far is typically negative, in the sense that the existence of such reductions would cause collapses of the polynomial hierarchy(PH). Basing cryptographic primitives, e.g., the average-case hardness of inverting one-way permutations, on NP-completeness is a particularly intriguing instance. As there is evidence showing that classical reductions from NP-hard problems to breaking these primitives result in PH collapses, it seems unlikely to base cryptographic primitives on NP-hard problems. Nevertheless, these results do not rule out the possibilities of the existence of quantum reductions. In this work, we initiate a study of the quantum analogues of these questions. Aside from formalizing basic notions of quantum reductions and demonstrating powers of quantum reductions by examples of separations, our main result shows that if NP-complete problems reduce to inverting one-way permutations using certain types of quantum reductions, then coNP $subseteq$ QIP(2).
Quantum teleportation is a fundamental concept in quantum physics which now finds important applications at the heart of quantum technology including quantum relays, quantum repeaters and linear optics quantum computing (LOQC). Photonic implementations have largely focussed on achieving long distance teleportation due to its suitability for decoherence-free communication. Teleportation also plays a vital role in the scalability of photonic quantum computing, for which large linear optical networks will likely require an integrated architecture. Here we report the first demonstration of quantum teleportation in which all key parts - entanglement preparation, Bell-state analysis and quantum state tomography - are performed on a reconfigurable integrated photonic chip. We also show that a novel element-wise characterisation method is critical to mitigate component errors, a key technique which will become increasingly important as integrated circuits reach higher complexities necessary for quantum enhanced operation.
We present a model of quantum teleportation protocol based on a double quantum dot array. The unknown qubit is encoded using a pair of quantum dots, coupled by tunneling, with one excess electron. It is shown how to create maximally entangled states with this kind of qubits using an adiabatically increasing Coulomb repulsion between different pairs. This entangled states are exploited to perform teleportation again using an adiabatic coupling between them and the incoming unknown state. Finally, a sudden separation of Bobs qubit enables a time evolution of Alices state providing a modified version of standard Bell measurement. Substituting the four quantum dots entangled state with a chain of coupled DQDs, a quantum channel with high fidelity arises from this scheme allowing the transmission over long distances.
I propose to replace the dual classical and nonlocal channels used for teleporting unknown quantum states in the original protocol (OP) [Bennett, C. H., et al. Phys. Rev. Lett. 70 1895 (1993)] by either (i) one single quantum channel or (ii) two nonlocal channels in order to turn the OP into an all-quantum teleportation (AQT) protocol. Ideally, N runs of single channel AQT can be achieved with a single Einstein-Podolsky-Rosen (EPR) pair, in contrast with the OP, which consumes N EPR pairs. In the two nonlocal channels proposal, Alice uses the superdense coding technique to send Bob her result, which makes AQT more economical than OP.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
