Optimal exploitation of the resource in remote state preparation

• URL: http://arxiv.org/abs/2003.09755v2
• Date: Sun, 7 Jun 2020 23:31:28 GMT
• Title: Optimal exploitation of the resource in remote state preparation
• Authors: Morteza Nikaeen, Mehdi Ramezani and Alireza Bahrampour
• Abstract summary: The encoding and decoding strategies of the protocol are restricted to the physically relevant classes of projective and unitary operators. The TE of the protocol in terms of both linear and quadratic fidelities is evaluated in a fully optimized scenario. The results show that in this scenario, the TE scales with the sum of the two largest eigenvalues of the squared correlation matrix of the resource state that is zero only for product states.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Transmission efficiency (TE) of remote state preparation (RSP) with a shared quantum state and one bit of classical communication is considered. Following [B. Daki et al., Nat. Phys. 8, 666 (2012)], the encoding and decoding strategies of the protocol are restricted to the physically relevant classes of projective measurements and unitary operators, respectively. It is shown that contrary to the previous arguments, the quadratic fidelity as well as the linear fidelity could be a valid figure of merit to quantify the TE of RSP. Then, the TE of the protocol in terms of both linear and quadratic fidelities is evaluated in a fully optimized scenario which includes the maximization over the encoding parameters as well as a meaningful maximization over the decoding parameters. The results show that in this scenario, the TE scales with the sum of the two largest eigenvalues of the squared correlation matrix of the resource state that is zero only for product states. This approach successfully quantifies the performance of the protocol in terms of the resource state parameters and provides a means to compare the usefulness of any two resource states for RSP.

Related papers

• Statistical evaluation and optimization of entanglement purification protocols [0.0]
  We demonstrate that pioneering protocols are unable to improve the estimated initial average concurrence of almost uniformly sampled density matrices. We also develop a more efficient protocol and investigate it numerically together with a recent proposal based on an entangling rank-$2$ projector.
  arXiv  Detail & Related papers  (2024-02-19T16:58:03Z)
• Performance of entanglement purification including maximally entangled mixed states [0.0]
  Entanglement between distant quantum systems is a critical resource for implementing quantum communication. We propose an entanglement purification protocol based on two entangling two-qubit operations. Two variants of the core protocol are introduced and shown to be more practical in certain scenarios.
  arXiv  Detail & Related papers  (2024-02-06T18:34:34Z)
• Optimal remote restoring of quantum states in communication lines via local magnetic field [0.0]
  We study the remote restoring of a quantum state transferred along a spin chain We develop a remote state-restoring protocol which uses an inhomogeneous magnetic field with step-wise time-dependent Larmor frequencies as the state-control tool.
  arXiv  Detail & Related papers  (2024-01-17T19:46:39Z)
• Finding the optimal probe state for multiparameter quantum metrology using conic programming [61.98670278625053]
  We present a conic programming framework that allows us to determine the optimal probe state for the corresponding precision bounds. We also apply our theory to analyze the canonical field sensing problem using entangled quantum probe states.
  arXiv  Detail & Related papers  (2024-01-11T12:47:29Z)
• Robust and efficient verification of graph states in blind measurement-based quantum computation [52.70359447203418]
  Blind quantum computation (BQC) is a secure quantum computation method that protects the privacy of clients. It is crucial to verify whether the resource graph states are accurately prepared in the adversarial scenario. Here, we propose a robust and efficient protocol for verifying arbitrary graph states with any prime local dimension.
  arXiv  Detail & Related papers  (2023-05-18T06:24:45Z)
• Greedy based Value Representation for Optimal Coordination in Multi-agent Reinforcement Learning [64.05646120624287]
  We derive the expression of the joint Q value function of LVD and MVD. To ensure optimal consistency, the optimal node is required to be the unique STN. Our method outperforms state-of-the-art baselines in experiments on various benchmarks.
  arXiv  Detail & Related papers  (2022-11-22T08:14:50Z)
• Decomposition of Matrix Product States into Shallow Quantum Circuits [62.5210028594015]
  tensor network (TN) algorithms can be mapped to parametrized quantum circuits (PQCs) We propose a new protocol for approximating TN states using realistic quantum circuits. Our results reveal one particular protocol, involving sequential growth and optimization of the quantum circuit, to outperform all other methods.
  arXiv  Detail & Related papers  (2022-09-01T17:08:41Z)
• Data post-processing for the one-way heterodyne protocol under composable finite-size security [62.997667081978825]
  We study the performance of a practical continuous-variable (CV) quantum key distribution protocol. We focus on the Gaussian-modulated coherent-state protocol with heterodyne detection in a high signal-to-noise ratio regime. This allows us to study the performance for practical implementations of the protocol and optimize the parameters connected to the steps above.
  arXiv  Detail & Related papers  (2022-05-20T12:37:09Z)
• Pessimistic Minimax Value Iteration: Provably Efficient Equilibrium Learning from Offline Datasets [101.5329678997916]
  We study episodic two-player zero-sum Markov games (MGs) in the offline setting. The goal is to find an approximate Nash equilibrium (NE) policy pair based on a dataset collected a priori.
  arXiv  Detail & Related papers  (2022-02-15T15:39:30Z)
• Deterministic Entanglement Transmission on Series-Parallel Quantum Networks [2.86989372262348]
  This paper explores and amplifies a new and more effective mapping of QN, referred to as concurrence percolation theory (ConPT) We implement ConPT via a novel deterministic entanglement transmission scheme that is fully analogous to resistor network analysis. The DET is designed for general d-dimensional information carriers, scalable and adaptable for any series-parallel QN, and experimentally feasible as tested on IBM's quantum platform.
  arXiv  Detail & Related papers  (2021-10-11T03:29:03Z)
• Multiphase estimation without a reference mode [0.0]
  We show that the absence of an external reference mode reduces the number of simultaneously estimatable parameters. We also show that the symmetries of the parameters being estimated dictate the symmetries of the optimal probe states.
  arXiv  Detail & Related papers  (2020-06-23T18:00: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.