Quantum communication with $SU(2)$ invariant separable $2\times N$ level systems

• URL: http://arxiv.org/abs/2104.04469v2
• Date: Fri, 26 Nov 2021 13:44:38 GMT
• Title: Quantum communication with $SU(2)$ invariant separable $2\times N$ level systems
• Authors: Sooryansh Asthana, Rajni Bala and V. Ravishankar
• Abstract summary: We propose protocols for remote transfers of information in a known and an unknown qubit to qudits. We also propose a protocol for swapping of quantum discord from $frac12otimes S$- systems to $Sotimes S$- systems.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Information is encoded in a qubit in the form of its Bloch vector. In this paper, we propose protocols for remote transfers of information in a known and an unknown qubit to qudits using $SU(2)$- invariant $\frac{1}{2}\otimes S$ discordant states as a channel. These states have been identified as separable equivalents of the two-qubit entangled Werner states in [Bharath & Ravishankar, Phys. Rev. A 89, 062110]. Due to $SU(2) \times SU(2)$ invariance of these states, the remote qudit can be changed by performing appropriate measurements on the qubit. We also propose a protocol for transferring information of an unknown qudit to a remote qudit using a $\frac{1}{2}\otimes S$- state as a channel. Finally, we propose a protocol for swapping of quantum discord from $\frac{1}{2}\otimes S$- systems to $S\otimes S$- systems. All the protocols proposed in this paper involve separable states as quantum channels. Employing these protocols, we believe that quantum information processing can be performed using highly mixed separable higher dimensional states.

Related papers

• Tools for the analysis of quantum protocols requiring state generation within a time window [1.9021200954913475]
  Quantum protocols commonly require a certain number of quantum resource states to be available simultaneously. Here, we consider a setting in which a process generates a quantum resource state with some probability $p$ in each time step. To maintain sufficient quality for an application, each resource state is discarded from the memory after $w$ time steps.
  arXiv  Detail & Related papers  (2023-04-25T09:22:16Z)
• Bi-directional quantum teleportation of GHZ-like states [0.0]
  The protocol is based on the method that at first, each user, through a series of $mboxCNOT$ gates, converts the $n$-qubit state into a single qubit and some $0$ qubits. By re-applying the $mboxCNOT$ gates on the transmitted qubits and auxiliary $0$ states, each user reconstructs the initial GHZ-like state.
  arXiv  Detail & Related papers  (2023-02-22T11:36:17Z)
• Gaussian conversion protocol for heralded generation of qunaught states [66.81715281131143]
  bosonic codes map qubit-type quantum information onto the larger bosonic Hilbert space. We convert between two instances of these codes GKP qunaught states and four-foldsymmetric binomial states corresponding to a zero-logical encoded qubit. We obtain GKP qunaught states with a fidelity of over 98% and a probability of approximately 3.14%.
  arXiv  Detail & Related papers  (2023-01-24T14:17:07Z)
• Compression for Qubit Clocks [55.38708484314286]
  We propose a compression protocol for $n$ identically prepared states of qubit clocks. The protocol faithfully encodes the states into $(1/2)log n$ qubits and $(1/2)log n$ classical bits.
  arXiv  Detail & Related papers  (2022-09-14T09:45:53Z)
• Multi-state Swap Test Algorithm [2.709321785404766]
  Estimating the overlap between two states is an important task with several applications in quantum information. We design a quantum circuit to measure overlaps of multiple quantum states.
  arXiv  Detail & Related papers  (2022-05-15T03:31:57Z)
• 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)
• Optimal State Transfer and Entanglement Generation in Power-law Interacting Systems [0.5592394503914488]
  We present an optimal protocol for encoding an unknown qubit state into a multiqubit Greenberger-Horne-Zeilinger-like state. The protocol has a wide range of applications, including in quantum sensing, quantum computing, and preparation of topologically ordered states.
  arXiv  Detail & Related papers  (2020-10-06T18:00:02Z)
• Gaussian conversion protocols for cubic phase state generation [104.23865519192793]
  Universal quantum computing with continuous variables requires non-Gaussian resources. The cubic phase state is a non-Gaussian state whose experimental implementation has so far remained elusive. We introduce two protocols that allow for the conversion of a non-Gaussian state to a cubic phase state.
  arXiv  Detail & Related papers  (2020-07-07T09:19:49Z)
• 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)

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.