One-shot quantum state redistribution and quantum Markov chains
- URL: http://arxiv.org/abs/2104.08753v2
- Date: Thu, 12 Oct 2023 20:56:33 GMT
- Title: One-shot quantum state redistribution and quantum Markov chains
- Authors: Anurag Anshu, Shima Bab Hadiashar, Rahul Jain, Ashwin Nayak, Dave
Touchette
- Abstract summary: We revisit the task of quantum state redistribution in the one-shot setting.
We design a protocol for this task with communication cost in terms of a measure of distance from quantum Markov chains.
Our result is the first to operationally connect quantum state redistribution and quantum chains.
- Score: 15.66921140731163
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: We revisit the task of quantum state redistribution in the one-shot setting,
and design a protocol for this task with communication cost in terms of a
measure of distance from quantum Markov chains. More precisely, the distance is
defined in terms of quantum max-relative entropy and quantum hypothesis testing
entropy.
Our result is the first to operationally connect quantum state redistribution
and quantum Markov chains, and can be interpreted as an operational
interpretation for a possible one-shot analogue of quantum conditional mutual
information. The communication cost of our protocol is lower than all
previously known ones and asymptotically achieves the well-known rate of
quantum conditional mutual information. Thus, our work takes a step towards the
important open question of near-optimal characterization of the one-shot
quantum state redistribution.
Related papers
- Strong Converse Exponent of Quantum Dichotomies [5.371337604556312]
We study the large-deviation behavior of quantum dichotomies and determine the exact strong converse exponent based on the purified distance.
Our result is characterized by a simple optimization of quantum R'enyi information measures involving all four mutually non-commuting quantum states.
arXiv Detail & Related papers (2024-10-16T13:54:18Z) - 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) - Variational Approach to Quantum State Tomography based on Maximal
Entropy Formalism [3.6344381605841187]
We employ the maximal entropy formalism to construct the least biased mixed quantum state that is consistent with the given set of expectation values.
We employ a parameterized quantum circuit and a hybrid quantum-classical variational algorithm to obtain such a target state making our recipe easily implementable on a near-term quantum device.
arXiv Detail & Related papers (2022-06-06T01:16:22Z) - Quantum Semantic Communications for Resource-Efficient Quantum Networking [52.3355619190963]
This letter proposes a novel quantum semantic communications (QSC) framework exploiting advancements in quantum machine learning and quantum semantic representations.
The proposed framework achieves approximately 50-75% reduction in quantum communication resources needed, while achieving a higher quantum semantic fidelity.
arXiv Detail & Related papers (2022-05-05T03:49:19Z) - Efficient criteria of quantumness for a large system of qubits [58.720142291102135]
We discuss the dimensionless combinations of basic parameters of large, partially quantum coherent systems.
Based on analytical and numerical calculations, we suggest one such number for a system of qubits undergoing adiabatic evolution.
arXiv Detail & Related papers (2021-08-30T23:50:05Z) - On exploring the potential of quantum auto-encoder for learning quantum systems [60.909817434753315]
We devise three effective QAE-based learning protocols to address three classically computational hard learning problems.
Our work sheds new light on developing advanced quantum learning algorithms to accomplish hard quantum physics and quantum information processing tasks.
arXiv Detail & Related papers (2021-06-29T14:01:40Z) - Quantum teleportation is a reversal of quantum measurement [0.0]
We introduce a generalized concept of quantum teleportation in the framework of quantum measurement and reversing operation.
Our framework makes it possible to find an optimal protocol for quantum teleportation enabling a faithful transfer of unknown quantum states.
arXiv Detail & Related papers (2021-04-25T15:03:08Z) - Information Scrambling in Computationally Complex Quantum Circuits [56.22772134614514]
We experimentally investigate the dynamics of quantum scrambling on a 53-qubit quantum processor.
We show that while operator spreading is captured by an efficient classical model, operator entanglement requires exponentially scaled computational resources to simulate.
arXiv Detail & Related papers (2021-01-21T22:18:49Z) - Direct Quantum Communications in the Presence of Realistic Noisy
Entanglement [69.25543534545538]
We propose a novel quantum communication scheme relying on realistic noisy pre-shared entanglement.
Our performance analysis shows that the proposed scheme offers competitive QBER, yield, and goodput.
arXiv Detail & Related papers (2020-12-22T13:06:12Z) - The Min-entropy as a Resource for One-Shot Private State Transfer,
Quantum Masking and State Transition [0.0]
We show that the min-entropy of entanglement of a pure bipartite state is the maximum number of qubits privately transferable.
We show that the min-entropy of a quantum state is the half of the size of quantum state it can catalytically dephase.
arXiv Detail & Related papers (2020-10-28T07:30:27Z)
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.