Single Qubit Multi-Party Transmission Using Universal Symmetric Quantum Cloning

• URL: http://arxiv.org/abs/2310.04920v2
• Date: Mon, 18 Dec 2023 19:09:02 GMT
• Title: Single Qubit Multi-Party Transmission Using Universal Symmetric Quantum Cloning
• Authors: Elijah Pelofske
• Abstract summary: We consider a hypothetical quantum network where Alice wishes to transmit one qubit of information to $M$ parties. We show that Alice can send significantly fewer qubits compared to direct transmission of the message qubits to each of the $M$ remote receivers.
• Score: 1.0878040851638
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We consider the hypothetical quantum network case where Alice wishes to transmit one qubit of information (specifically a pure quantum state) to $M$ parties, where $M$ is some large number. The remote receivers locally perform single qubit quantum state tomography on the transmitted qubits in order to compute the quantum state within some error rate (dependent on the tomography technique and number of qubits used). We show that with the use of an intermediate optimal symmetric universal quantum cloning machine (between Alice and the remote receivers) as a repeater-type node in a hypothetical quantum network, Alice can send significantly fewer qubits compared to direct transmission of the message qubits to each of the $M$ remote receivers. This is possible due to two properties of quantum cloning. The first being that single qubit quantum clones retain the same angle, in the Bloch sphere representation, as the initial quantum state. This means that if the mixed state of the quantum clone can be computed to high enough accuracy, the pure quantum state can be computed by extrapolating that vector to the surface of the Bloch sphere. The second property is that the state overlap of approximate quantum clones, with respect to the original pure quantum state, quickly converges (specifically for $1 \rightarrow M$ the limit of the fidelity as M goes to infinity is $\frac{2}{3}$). This means that Alice can prepare a constant number of qubits (which are then passed through the quantum cloning machine) in order to achieve a desired error rate, if $M$ is large enough. Combined, these two properties mean that for large $M$, Alice can prepare orders of magnitude fewer qubits in order to achieve the same single qubit transmission accuracy compared to the naive direct qubit transmission approach.

Related papers

• Probing Quantum Telecloning on Superconducting Quantum Processors [0.6990493129893112]
  Quantum telecloning allows approximate copies of quantum information to be constructed by separate parties. Quantum telecloning can be implemented as a circuit on quantum computers using a classical co-processor. We present one of the largest and most comprehensive NISQ computer experimental analyses on (single qubit) quantum telecloning to date.
  arXiv  Detail & Related papers  (2023-08-29T19:12:31Z)
• 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)
• Oblivious Quantum Computation and Delegated Multiparty Quantum Computation [61.12008553173672]
  We propose a new concept, oblivious computation quantum computation, where secrecy of the input qubits and the program to identify the quantum gates are required. Exploiting quantum teleportation, we propose a two-server protocol for this task. Also, we discuss delegated multiparty quantum computation, in which, several users ask multiparty quantum computation to server(s) only using classical communications.
  arXiv  Detail & Related papers  (2022-11-02T09:01:33Z)
• 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)
• Efficient Bipartite Entanglement Detection Scheme with a Quantum Adversarial Solver [89.80359585967642]
  Proposal reformulates the bipartite entanglement detection as a two-player zero-sum game completed by parameterized quantum circuits. We experimentally implement our protocol on a linear optical network and exhibit its effectiveness to accomplish the bipartite entanglement detection for 5-qubit quantum pure states and 2-qubit quantum mixed states.
  arXiv  Detail & Related papers  (2022-03-15T09:46:45Z)
• 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)
• Heralded entanglement distribution between two absorptive quantum memories [7.245400332036547]
  Experimental demonstration of heralded entanglement between absorptive quantum memories. Quantum repeaters based on absorptive quantum memories can overcome limitations.
  arXiv  Detail & Related papers  (2021-01-13T09:17:10Z)
• 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)
• 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)
• Communication Cost of Quantum Processes [49.281159740373326]
  A common scenario in distributed computing involves a client who asks a server to perform a computation on a remote computer. An important problem is to determine the minimum amount of communication needed to specify the desired computation. We analyze the total amount of (classical and quantum) communication needed by a server in order to accurately execute a quantum process chosen by a client.
  arXiv  Detail & Related papers  (2020-02-17T08:51:42Z)
• Wireless Multihop Quantum Teleportation Utilizing a 4-Qubit Cluster State [0.0]
  This paper proposes a quantum routing protocol using multihop teleportation for wireless mesh backbone networks. We analyze the success probability of quantum state transfer and find that the optimal success probability is achieved when $tau_2|1 = frac1sqrt2$.
  arXiv  Detail & Related papers  (2017-07-31T22:13:03Z)

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.