Dispensing of quantum information beyond no-broadcasting theorem -- is
it possible to broadcast anything genuinely quantum?
- URL: http://arxiv.org/abs/2208.10341v1
- Date: Fri, 19 Aug 2022 07:54:59 GMT
- Title: Dispensing of quantum information beyond no-broadcasting theorem -- is
it possible to broadcast anything genuinely quantum?
- Authors: Teiko Heinosaari, Martin Pl\'avala
- Abstract summary: We generalize the standard definition of broadcasting by restricting the set of states which we want to broadcast.
We show that in all of the investigated cases broadcasting is equivalent to commutativity.
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: No-broadcasting theorem is one of the most fundamental results in quantum
information theory; it guarantees that the simplest attacks on any quantum
protocol, based on eavesdropping and copying of quantum information, are
impossible. Due to the fundamental importance of the no-broadcasting theorem,
it is essential to understand the exact boundaries of this limitation. We
generalize the standard definition of broadcasting by restricting the set of
states which we want to broadcast and restricting the sets of measurements
which we use to test the broadcasting. We show that in all of the investigated
cases broadcasting is equivalent to commutativity.
Related papers
- Power Characterization of Noisy Quantum Kernels [52.47151453259434]
We show that noise may make quantum kernel methods to only have poor prediction capability, even when the generalization error is small.
We provide a crucial warning to employ noisy quantum kernel methods for quantum computation.
arXiv Detail & Related papers (2024-01-31T01:02:16Z) - Orthogonality Broadcasting and Quantum Position Verification [3.549868541921029]
Security in quantum cryptographic protocols derives from a possibly weaker property that classical information encoded in certain quantum states cannot be broadcast.
We introduce the study of "orthogonality broadcasting"
arXiv Detail & Related papers (2023-11-01T17:37:20Z) - Many facets of multiparty broadcasting of known quantum information
using optimal quantum resource [3.274290296343038]
We show that it's possible to broadcast known quantum information to multiple receivers in deterministic as well as probabilistic manner.
A proof of principle realization of the proposed optimal scheme using IBM quantum computer is also reported.
arXiv Detail & Related papers (2023-04-30T05:23:03Z) - A simple formulation of no-cloning and no-hiding that admits efficient
and robust verification [0.0]
Incompatibility is a feature of quantum theory that sets it apart from classical theory.
The no-hiding theorem is another such instance that arises in the context of the black-hole information paradox.
We formulate both of these fundamental features of quantum theory in a single form that is amenable to efficient verification.
arXiv Detail & Related papers (2023-03-05T12:48:11Z) - Simple Tests of Quantumness Also Certify Qubits [69.96668065491183]
A test of quantumness is a protocol that allows a classical verifier to certify (only) that a prover is not classical.
We show that tests of quantumness that follow a certain template, which captures recent proposals such as (Kalai et al., 2022) can in fact do much more.
Namely, the same protocols can be used for certifying a qubit, a building-block that stands at the heart of applications such as certifiable randomness and classical delegation of quantum computation.
arXiv Detail & Related papers (2023-03-02T14:18:17Z) - No-broadcasting theorem for non-signalling boxes and assemblages [0.0]
The no-broadcasting theorem is one of the most fundamental results in quantum information theory.
We prove Joshi, Grudka and Horodecki$otimes 4$ conjectured that one cannot locally broadcast nonlocal boxes.
arXiv Detail & Related papers (2022-11-25T19:08:28Z) - Depth-efficient proofs of quantumness [77.34726150561087]
A proof of quantumness is a type of challenge-response protocol in which a classical verifier can efficiently certify quantum advantage of an untrusted prover.
In this paper, we give two proof of quantumness constructions in which the prover need only perform constant-depth quantum circuits.
arXiv Detail & Related papers (2021-07-05T17:45:41Z) - 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) - Ultimate limits for multiple quantum channel discrimination [0.966840768820136]
This paper studies the problem of hypothesis testing with quantum channels.
We establish a lower limit for the ultimate error probability affecting the discrimination of an arbitrary number of quantum channels.
We also show that this lower bound is achievable when the channels have certain symmetries.
arXiv Detail & Related papers (2020-07-29T03:08:48Z) - Using Quantum Metrological Bounds in Quantum Error Correction: A Simple
Proof of the Approximate Eastin-Knill Theorem [77.34726150561087]
We present a proof of the approximate Eastin-Knill theorem, which connects the quality of a quantum error-correcting code with its ability to achieve a universal set of logical gates.
Our derivation employs powerful bounds on the quantum Fisher information in generic quantum metrological protocols.
arXiv Detail & Related papers (2020-04-24T17:58:10Z) - 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.