The Asymmetric Quantum Cloning Region

• URL: http://arxiv.org/abs/2209.11999v1
• Date: Sat, 24 Sep 2022 12:52:50 GMT
• Title: The Asymmetric Quantum Cloning Region
• Authors: Ion Nechita, Cl\'ement Pellegrini, Denis Rochette
• Abstract summary: We study the general case of $1 to N$ asymmetric cloning. We characterize, for all Hilbert space dimensions and number of clones, the set of all possible clone qualities.
• Score: 1.2891210250935143
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Quantum cloning is a fundamental protocol of quantum information theory. Perfect universal quantum cloning is prohibited by the laws of quantum mechanics, only imperfect copies being reachable. Symmetric quantum cloning is concerned with case when the quality of the clones is identical. In this work, we study the general case of $1 \to N$ asymmetric cloning, where one asks for arbitrary qualities of the clones. We characterize, for all Hilbert space dimensions and number of clones, the set of all possible clone qualities. This set is realized as the nonnegative part of the unit ball of a newly introduced norm, which we call the $\mathcal{Q}$-norm. We also provide a closed form expression for the quantum cloner achieving a given clone quality vector. Our analysis relies on the Schur-Weyl duality and on the study of the spectral properties of partially transposed permutation operators.

Related papers

• Cloning Games, Black Holes and Cryptography [53.93687166730726]
  This paper is the new, natural, notion of Haar cloning games together with two applications. In the area of black-hole physics, our game reveals that, in an idealized model of a black hole, the information from infalling entangled qubits can only be recovered from either the interior or the exterior. In the area of quantum cryptography, our game helps us construct succinct unclonable encryption schemes from the existence of pseudorandom unitaries.
  arXiv  Detail & Related papers  (2024-11-07T14:09:32Z)
• A vertical gate-defined double quantum dot in a strained germanium double quantum well [48.7576911714538]
  Gate-defined quantum dots in silicon-germanium heterostructures have become a compelling platform for quantum computation and simulation. We demonstrate the operation of a gate-defined vertical double quantum dot in a strained germanium double quantum well. We discuss challenges and opportunities and outline potential applications in quantum computing and quantum simulation.
  arXiv  Detail & Related papers  (2023-05-23T13:42:36Z)
• 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)
• A Computational Separation Between Quantum No-cloning and No-telegraphing [9.520158869896395]
  Two of the fundamental no-go theorems of quantum information are the no-cloning theorem and the no-teleportation theorem. We give a collection of quantum states and quantum oracles relative to which these states are efficiently clonable but not efficiently telegraphable. We show how such states can be used to protect against key exfiltration.
  arXiv  Detail & Related papers  (2023-02-03T17:05:38Z)
• Quantum Worst-Case to Average-Case Reductions for All Linear Problems [66.65497337069792]
  We study the problem of designing worst-case to average-case reductions for quantum algorithms. We provide an explicit and efficient transformation of quantum algorithms that are only correct on a small fraction of their inputs into ones that are correct on all inputs.
  arXiv  Detail & Related papers  (2022-12-06T22:01:49Z)
• Optimized Telecloning Circuits: Theory and Practice of Nine NISQ Clones [0.0]
  We present results of a of $1 rightarrow 9$ universal, symmetric, optimal quantum telecloning implementation on a cloud accessible quantum computer. The demonstration of creating $9$ approximate clones on a quantum processor is the largest number of clones that has been generated, telecloning or otherwise.
  arXiv  Detail & Related papers  (2022-10-18T21:12:41Z)
• Quantum Telecloning on NISQ Computers [0.0]
  Quantum telecloning is a protocol that originates from a combination of quantum teleportation and quantum cloning. NISQ devices can achieve near-optimal quantum telecloning fidelity.
  arXiv  Detail & Related papers  (2022-04-30T01:40:24Z)
• 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)
• Quantum deleting and cloning in a pseudo-unitary system [20.489044283783358]
  We investigate the quantum deleting and cloning in a pseudo-unitary system. We show that it is possible to delete and clone a class of two different and nonorthogonal states. We simulate the pseudo-unitary operators in conventional quantum mechanics with post-selection.
  arXiv  Detail & Related papers  (2021-03-29T05:59:27Z)
• Cloning of Quantum Entanglement [8.113018294676946]
  We demonstrate quantum cloning of two photon entangled states for the first time. Results are a key step towards cloning of complex quantum systems, and are likely to provide new insights into quantum entanglement.
  arXiv  Detail & Related papers  (2020-10-05T09:53:23Z)
• Quantum Gram-Schmidt Processes and Their Application to Efficient State Read-out for Quantum Algorithms [87.04438831673063]
  We present an efficient read-out protocol that yields the classical vector form of the generated state. Our protocol suits the case that the output state lies in the row space of the input matrix. One of our technical tools is an efficient quantum algorithm for performing the Gram-Schmidt orthonormal procedure.
  arXiv  Detail & Related papers  (2020-04-14T11:05:26Z)

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.