Heisenberg-Limited Quantum Metrology without Ancilla

• URL: http://arxiv.org/abs/2403.04585v2
• Date: Wed, 05 Feb 2025 14:09:18 GMT
• Title: Heisenberg-Limited Quantum Metrology without Ancilla
• Authors: Qiushi Liu, Yuxiang Yang,
• Abstract summary: The goal is to determine the ultimate precision limit of quantum channel estimation when many accesses to the channel are allowed. In general noiseless and controllable ancilla is required for attaining it. We present a novel theoretical framework to address this problem.
• Score: 9.570188943432331
• License:
• Abstract: Extensive research has been dedicated to the asymptotic theory of quantum metrology, where the goal is to determine the ultimate precision limit of quantum channel estimation when many accesses to the channel are allowed. The ultimate limit has been well established, but in general noiseless and controllable ancilla is required for attaining it. Little is known about the metrological performance without noiseless ancilla, which is more relevant in practical circumstances. In this work, we present a novel theoretical framework to address this problem, bridging quantum metrology and the asymptotic theory of quantum channels. Leveraging this framework, we prove sufficient conditions for achieving the Heisenberg limit with repeated applications of the channel to estimate, both with and without applying interleaved unitary control operations. For the latter case, we design an algorithm to identify explicitly the control operation.

Related papers

• Power Characterization of Noisy Quantum Kernels [52.47151453259434]
  We show that noise may make quantum kernel methods to only have poor prediction capability, even when the generalization error is small. We provide a crucial warning to employ noisy quantum kernel methods for quantum computation.
  arXiv  Detail & Related papers  (2024-01-31T01:02:16Z)
• Quantum metrology in the finite-sample regime [0.6299766708197883]
  In quantum metrology, the ultimate precision of estimating an unknown parameter is often stated in terms of the Cram'er-Rao bound. We propose to quantify the quality of a protocol by the probability of obtaining an estimate with a given accuracy.
  arXiv  Detail & Related papers  (2023-07-12T18:00:04Z)
• 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)
• Achieving metrological limits using ancilla-free quantum error-correcting codes [1.9265037496741413]
  Existing quantum error-correcting codes generally exploit entanglement between one probe and one noiseless ancilla of the same dimension. Here we construct two types of multi-probe quantum error-correcting codes, where the first one utilizes a negligible amount of ancillas and the second one is ancilla-free.
  arXiv  Detail & Related papers  (2023-03-02T00:51:02Z)
• Universal cost bound of quantum error mitigation based on quantum estimation theory [0.0]
  We present a unified approach to analyzing the cost of various quantum error mitigation methods on the basis of quantum estimation theory. We derive for a generic layered quantum circuit under a wide class of Markovian noise that, unbiased estimation of an observable encounters an exponential growth with the circuit depth in the lower bound on the measurement cost. Our results contribute to the understanding of the physical limitations of quantum error mitigation and offer a new criterion for evaluating the performance of quantum error mitigation techniques.
  arXiv  Detail & Related papers  (2022-08-19T15:04:36Z)
• 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)
• Adiabatic critical quantum metrology cannot reach the Heisenberg limit even when shortcuts to adiabaticity are applied [2.39698636522191]
  We show that the quantum Fisher information attained in an adiabatic approach to critical quantum metrology cannot lead to the Heisenberg limit of precision. As case studies, we explore the application of counter-diabatic driving to the Landau-Zener model and the quantum Rabi model.
  arXiv  Detail & Related papers  (2021-03-24T02:24:35Z)
• Direct Quantum Communications in the Presence of Realistic Noisy Entanglement [69.25543534545538]
  We propose a novel quantum communication scheme relying on realistic noisy pre-shared entanglement. Our performance analysis shows that the proposed scheme offers competitive QBER, yield, and goodput.
  arXiv  Detail & Related papers  (2020-12-22T13:06:12Z)
• Ultimate limits for multiple quantum channel discrimination [0.966840768820136]
  This paper studies the problem of hypothesis testing with quantum channels. We establish a lower limit for the ultimate error probability affecting the discrimination of an arbitrary number of quantum channels. We also show that this lower bound is achievable when the channels have certain symmetries.
  arXiv  Detail & Related papers  (2020-07-29T03:08:48Z)
• Boundaries of quantum supremacy via random circuit sampling [69.16452769334367]
  Google's recent quantum supremacy experiment heralded a transition point where quantum computing performed a computational task, random circuit sampling. We examine the constraints of the observed quantum runtime advantage in a larger number of qubits and gates.
  arXiv  Detail & Related papers  (2020-05-05T20:11:53Z)
• Using Quantum Metrological Bounds in Quantum Error Correction: A Simple Proof of the Approximate Eastin-Knill Theorem [77.34726150561087]
  We present a proof of the approximate Eastin-Knill theorem, which connects the quality of a quantum error-correcting code with its ability to achieve a universal set of logical gates. Our derivation employs powerful bounds on the quantum Fisher information in generic quantum metrological protocols.
  arXiv  Detail & Related papers  (2020-04-24T17:58:10Z)

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.