Fundamental limits on quantum cloning from the no-signalling principle
- URL: http://arxiv.org/abs/2305.02002v3
- Date: Fri, 19 Jan 2024 14:52:03 GMT
- Title: Fundamental limits on quantum cloning from the no-signalling principle
- Authors: Yanglin Hu and Marco Tomamichel
- Abstract summary: The no-cloning theorem is a cornerstone of quantum cryptography.
We generalize and rederive in a unified framework various upper bounds on the maximum achievable fidelity of probabilistic and deterministic cloning machines.
- Score: 10.60608983034705
- License: http://creativecommons.org/licenses/by-nc-nd/4.0/
- Abstract: The no-cloning theorem is a cornerstone of quantum cryptography. Here we
generalize and rederive in a unified framework various upper bounds on the
maximum achievable fidelity of probabilistic and deterministic cloning
machines. Building on ideas by Gisin [Phys.~Lett.~A, 1998], our result starts
from the fact that remote state preparation is possible and the no-signalling
principle holds. We apply our general theorem to several subsets of states that
are of interest in quantum cryptography.
Related papers
- Coherence generation with Hamiltonians [44.99833362998488]
We explore methods to generate quantum coherence through unitary evolutions.
This quantity is defined as the maximum derivative of coherence that can be achieved by a Hamiltonian.
We identify the quantum states that lead to the largest coherence derivative induced by the Hamiltonian.
arXiv Detail & Related papers (2024-02-27T15:06:40Z) - 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) - Fundamental Limitations within the Selected Cryptographic Scenarios and
Supra-Quantum Theories [0.0]
We study the fundamental limitations within the selected quantum and supra-quantum cryptographic scenarios.
We investigate various security paradigms, bipartite and multipartite settings.
We propose a novel type of rerouting attack on the quantum Internet.
arXiv Detail & Related papers (2023-11-14T14:48:57Z) - 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) - Quantum Pseudoentanglement [4.3053817709507]
Entanglement is a quantum resource, in some ways analogous to randomness in classical computation.
We give a construction of pseudoentangled states with entanglement entropy arbitrarily close to $log n$ across every cut.
We discuss applications of this result to Matrix Product State testing, entanglement distillation, and the complexity of the AdS/CFT correspondence.
arXiv Detail & Related papers (2022-11-01T21:04:49Z) - Theory of Quantum Generative Learning Models with Maximum Mean
Discrepancy [67.02951777522547]
We study learnability of quantum circuit Born machines (QCBMs) and quantum generative adversarial networks (QGANs)
We first analyze the generalization ability of QCBMs and identify their superiorities when the quantum devices can directly access the target distribution.
Next, we prove how the generalization error bound of QGANs depends on the employed Ansatz, the number of qudits, and input states.
arXiv Detail & Related papers (2022-05-10T08:05:59Z) - No-signalling constrains quantum computation with indefinite causal
structure [45.279573215172285]
We develop a formalism for quantum computation with indefinite causal structures.
We characterize the computational structure of higher order quantum maps.
We prove that these rules, which have a computational and information-theoretic nature, are determined by the more physical notion of the signalling relations between the quantum systems.
arXiv Detail & Related papers (2022-02-21T13:43:50Z) - Certifying beyond quantumness of locally quantum no-signalling theories
through quantum input Bell test [0.0]
Physical theories constrained with local quantum structure and satisfying the no-signalling principle can allow beyond-quantum global states.
In a standard Bell experiment, correlations obtained from any such beyond-quantum bipartite state can always be reproduced by quantum states and measurements.
We show that if the Bell experiment is generalized to allow local quantum inputs, then beyond-quantum correlations can be generated by every beyond-quantum state.
arXiv Detail & Related papers (2021-11-07T04:58:02Z) - Impossibility of creating a superposition of unknown quantum states [16.467540842571328]
We show that the existence of a protocol that superposes two unknown pure states with nonzero probability leads to violation of other no-go theorems.
Such a protocol can be used to perform certain state discrimination and cloning tasks that are forbidden in quantum theory.
arXiv Detail & Related papers (2020-11-04T13:25:42Z) - 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) - From a quantum theory to a classical one [117.44028458220427]
We present and discuss a formal approach for describing the quantum to classical crossover.
The method was originally introduced by L. Yaffe in 1982 for tackling large-$N$ quantum field theories.
arXiv Detail & Related papers (2020-04-01T09:16:38Z)
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.