No Practical Quantum Broadcasting: Even Virtually
- URL: http://arxiv.org/abs/2503.16380v1
- Date: Thu, 20 Mar 2025 17:43:20 GMT
- Title: No Practical Quantum Broadcasting: Even Virtually
- Authors: Yunlong Xiao, Xiangjing Liu, Zhenhuan Liu,
- Abstract summary: We prove that no linear process can uphold sample efficiency, unitary covariance, permutation invariance, and classical consistency.<n>We use Schur-Weyl duality to provide a significantly simplified derivation of the uniqueness of the canonical virtual broadcasting map.<n>Our approach naturally extends the uniqueness of virtual broadcasting to the 1-to-N case and provides its construction.
- Score: 0.8639941465436463
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: Quantum information cannot be broadcast -- an intrinsic limitation imposed by quantum mechanics. However, recent advances in virtual operations have brought new insights into the no-broadcasting theorem. Here, we focus on the practical utility and introduce sample efficiency as a fundamental constraint, requiring any practical broadcasting protocol perform no worse than the naive approach of direct preparation and distribution. We prove that no linear process -- whether quantum or beyond -- can simultaneously uphold sample efficiency, unitary covariance, permutation invariance, and classical consistency. This leads to a no-practical-broadcasting theorem, which places strict limits on the practical distribution of quantum information. To achieve this, we use Schur-Weyl duality to provide a significantly simplified derivation of the uniqueness of the canonical virtual broadcasting map, which satisfies the latter three conditions, and determine its sample complexity via semidefinite programming. Our approach naturally extends the uniqueness of virtual broadcasting to the 1-to-N case and provides its construction. Moreover, we demonstrate that the connection between virtual broadcasting and pseudo-density operators is limited to the 1-to-2 case and generally does not hold, further underscoring the fundamental asymmetry between spatial and temporal statistics in the quantum world.
Related papers
- Observation of disorder-free localization and efficient disorder averaging on a quantum processor [117.33878347943316]
We implement an efficient procedure on a quantum processor, leveraging quantum parallelism, to efficiently sample over all disorder realizations.
We observe localization without disorder in quantum many-body dynamics in one and two dimensions.
arXiv Detail & Related papers (2024-10-09T05:28:14Z) - Quantum Channel Simulation in Fidelity is no more difficult than State Splitting [13.744740747451537]
We show that the quantum channel simulation can be directly achieved via quantum state splitting without using a technique known as the deFinetti reduction.
Using the bounds, we also recover the quantum reverse Shannon theorem in a much simpler way.
arXiv Detail & Related papers (2024-03-21T14:05:32Z) - Optimal unilocal virtual quantum broadcasting [5.80377843790023]
We introduce protocols that can be approximated using physical operations with minimal cost.
We formalize the simulation cost of a virtual quantum broadcasting protocol into a semidefinite programming problem.
arXiv Detail & Related papers (2023-10-23T17:56:02Z) - Virtual quantum broadcasting [2.3895981099137535]
We show that, although quantum broadcasting cannot be achieved by any physical process, it can be achieved by a virtual process.
We show that the optimal physical approximation to the canonical broadcasting map is the optimal universal quantum cloning.
arXiv Detail & Related papers (2023-10-19T18:00:01Z) - Tight One-Shot Analysis for Convex Splitting with Applications in
Quantum Information Theory [23.18400586573435]
We establish a one-shot error exponent and a one-shot strong converse for convex splitting with trace distance as an error criterion.
This leads to new one-shot exponent results in various tasks such as communication over quantum wiretap channels, secret key distillation, one-way quantum message compression, quantum measurement simulation, and quantum channel coding with side information at the transmitter.
arXiv Detail & Related papers (2023-04-24T12:47:37Z) - Improved Quantum Algorithms for Fidelity Estimation [77.34726150561087]
We develop new and efficient quantum algorithms for fidelity estimation with provable performance guarantees.
Our algorithms use advanced quantum linear algebra techniques, such as the quantum singular value transformation.
We prove that fidelity estimation to any non-trivial constant additive accuracy is hard in general.
arXiv Detail & Related papers (2022-03-30T02:02:16Z) - Nontraditional Deterministic Remote State Preparation Using a
Non-Maximally Entangled Channel without Additional Quantum Resources [10.351739012146378]
We have developed a nontraditional remote state preparation protocol that allows for deterministically transferring information encoded in quantum states.
With an auxiliary particle and a simple measurement method, the success probability of preparing a d-dimensional quantum state is increased to 1 without spending additional quantum resources in advance to improve quantum channels.
arXiv Detail & Related papers (2022-03-16T08:59:49Z) - Entanglement catalysis for quantum states and noisy channels [41.94295877935867]
We investigate properties of entanglement and its role for quantum communication.
For transformations between bipartite pure states, we prove the existence of a universal catalyst.
We further develop methods to estimate the number of singlets which can be established via a noisy quantum channel.
arXiv Detail & Related papers (2022-02-10T18:36:25Z) - Interactive Protocols for Classically-Verifiable Quantum Advantage [46.093185827838035]
"Interactions" between a prover and a verifier can bridge the gap between verifiability and implementation.
We demonstrate the first implementation of an interactive quantum advantage protocol, using an ion trap quantum computer.
arXiv Detail & Related papers (2021-12-09T19:00:00Z) - Stochastic approximate state conversion for entanglement and general quantum resource theories [41.94295877935867]
An important problem in any quantum resource theory is to determine how quantum states can be converted into each other.
Very few results have been presented on the intermediate regime between probabilistic and approximate transformations.
We show that these bounds imply an upper bound on the rates for various classes of states under probabilistic transformations.
We also show that the deterministic version of the single copy bounds can be applied for drawing limitations on the manipulation of quantum channels.
arXiv Detail & Related papers (2021-11-24T17:29:43Z) - Experimental multi-state quantum discrimination through a Quantum
network [63.1241529629348]
We have experimentally implemented two discrimination schemes in a minimum-error scenario based on a receiver featured by a network structure and a dynamical processing of information.
The first protocol achieves binary optimal discrimination, while the second one provides a novel approach to multi-state quantum discrimination, relying on the dynamical features of the network-like receiver.
arXiv Detail & Related papers (2021-07-21T09:26:48Z) - 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)
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.