Bounding the benefit of adaptivity in quantum metrology using the relative fidelity

• URL: http://arxiv.org/abs/2104.11292v2
• Date: Thu, 9 Sep 2021 18:00:04 GMT
• Title: Bounding the benefit of adaptivity in quantum metrology using the relative fidelity
• Authors: Jason L. Pereira, Leonardo Banchi, Stefano Pirandola
• Abstract summary: Protocols for discriminating between a pair of channels or for estimating a channel parameter can often be aided by adaptivity or by entanglement between the probe states. We introduce a quantity that we call the relative fidelity of a given pair of channels and a pair of input states to those channels. We are then able to lower bound the fidelity between the possible output states of any protocol acting on one of two possible channels in terms of the minimum relative fidelity.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Protocols for discriminating between a pair of channels or for estimating a channel parameter can often be aided by adaptivity or by entanglement between the probe states. This can make it difficult to bound the best possible performance for such protocols. In this paper, we introduce a quantity that we call the relative fidelity of a given pair of channels and a pair of input states to those channels. Constraining the allowed input states to all pairs of states whose fidelity is greater than some minimum "input fidelity" and minimising this quantity over the valid pairs of states, we get the minimum relative fidelity for that input fidelity constraint. We are then able to lower bound the fidelity between the possible output states of any protocol acting on one of two possible channels in terms of the minimum relative fidelity. This allows us to bound the performance of the most general, adaptive discrimination and parameter estimation protocols. By finding a continuity bound for the relative fidelity, we also provide a simple confirmation that the quantum Fisher information (QFI) of the output of an $N$-use protocol is no more than $N^2$ times the one-shot QFI.

Related papers

• Resolvability of classical-quantum channels [54.825573549226924]
  We study the resolvability of classical-quantum channels in two settings, for the channel output generated from the worst input, and form the fixed independent and identically distributed (i.i.d.) input. For the fixed-input setting, while the direct part follows from the known quantum soft covering result, we exploit the recent alternative quantum Sanov theorem to solve the strong converse.
  arXiv  Detail & Related papers  (2024-10-22T05:18:43Z)
• Optimal quantum strategy for locating Unruh channels [0.0]
  We employ the tools of channel-position finding to locate Unruh channels. The signal-idler and idler-free protocols are explored to determine the position of the target Unruh channel.
  arXiv  Detail & Related papers  (2024-04-30T02:33:37Z)
• 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)
• Optimal supplier of single-error-type entanglement via coherent-state transmission [1.2891210250935146]
  We consider protocol that presents single-error-type entanglement for distant qubits via coherent-state transmission over a lossy channel. This protocol is regarded as a subroutine to serve entanglement for larger protocol to yield a final output, such as ebits or pbits.
  arXiv  Detail & Related papers  (2022-03-31T15:36:54Z)
• Fault-tolerant parity readout on a shuttling-based trapped-ion quantum computer [64.47265213752996]
  We experimentally demonstrate a fault-tolerant weight-4 parity check measurement scheme. We achieve a flag-conditioned parity measurement single-shot fidelity of 93.2(2)%. The scheme is an essential building block in a broad class of stabilizer quantum error correction protocols.
  arXiv  Detail & Related papers  (2021-07-13T20:08:04Z)
• Fidelity Bounds for Device-Independent Advantage Distillation [0.0]
  We develop an algorithm that returns arbitrarily tight lower bounds on the fidelity of a device-independent repetition-code protocol. Our results give new insight on how strong the fidelity-related security conditions are, and could also be used to compute some lower bounds on one-way protocol keyrates.
  arXiv  Detail & Related papers  (2021-05-07T12:37:01Z)
• Composably secure data processing for Gaussian-modulated continuous variable quantum key distribution [58.720142291102135]
  Continuous-variable quantum key distribution (QKD) employs the quadratures of a bosonic mode to establish a secret key between two remote parties. We consider a protocol with homodyne detection in the general setting of composable finite-size security. In particular, we analyze the high signal-to-noise regime which requires the use of high-rate (non-binary) low-density parity check codes.
  arXiv  Detail & Related papers  (2021-03-30T18:02:55Z)
• Entanglement purification by counting and locating errors with entangling measurements [62.997667081978825]
  We consider entanglement purification protocols for multiple copies of qubit states. We use high-dimensional auxiliary entangled systems to learn about number and positions of errors in the noisy ensemble.
  arXiv  Detail & Related papers  (2020-11-13T19:02:33Z)
• On the optimal certification of von Neumann measurements [55.41644538483948]
  certification of quantum measurements can be viewed as the extension of quantum hypotheses testing. We show the connection between the certification of quantum channels or von Neumann measurements and the notion of $q$-numerical range.
  arXiv  Detail & Related papers  (2020-09-14T22:38:23Z)
• Bounds on amplitude damping channel discrimination [0.0]
  adaptivity has been shown to improve the performance of discrimination protocols. We present a tighter lower bound on the achievable trace norm between protocol outputs. The upper and lower bounds are compared with existing bounds and then applied to quantum hacking and biological quantum sensing scenarios.
  arXiv  Detail & Related papers  (2020-09-10T11:35:47Z)
• Direct estimation of minimum gate fidelity [18.98854210281999]
  A key measure of the performance of a quantum gate is the minimum gate fidelity, i.e., the fidelity of the gate, minimized over all input states. We propose a hybrid numerical-experimental scheme that employs a numerical gradient-free minimization (GFM) and an experimental target-fidelity estimation procedure.
  arXiv  Detail & Related papers  (2020-04-06T06:36:31Z)

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.