Limits of noisy quantum metrology with restricted quantum controls

• URL: http://arxiv.org/abs/2402.18765v2
• Date: Tue, 22 Oct 2024 15:31:17 GMT
• Title: Limits of noisy quantum metrology with restricted quantum controls
• Authors: Sisi Zhou,
• Abstract summary: Heisenberg limit (HL) and standard quantum limit (propto 1/sqrtn$) are fundamental limits in estimating an unknown parameter in $n$ copies of quantum channels. It is unknown though, whether these limits are still achievable in restricted quantum devices when QEC is unavailable.
• Score: 0.0
• License:
• Abstract: The Heisenberg limit (HL, with estimation error scales as $1/n$) and the standard quantum limit (SQL, $\propto 1/\sqrt{n}$) are two fundamental limits in estimating an unknown parameter in $n$ copies of quantum channels and are achievable with full quantum controls, e.g., quantum error correction (QEC). It is unknown though, whether these limits are still achievable in restricted quantum devices when QEC is unavailable, e.g., with only unitary controls or bounded system sizes. In this Letter, we discover various new limits for estimating qubit channels under restrictive controls. The HL is shown to be unachievable in various cases, indicating the necessity of QEC in achieving the HL. Furthermore, a necessary and sufficient condition to achieve the SQL is determined, where a single-qubit unitary control protocol is identified to achieve the SQL for certain types of noisy channels, and for other cases a constant floor on the estimation error is proven. A practical example of the unitary protocol is provided.

Related papers

• Space-bounded quantum state testing via space-efficient quantum singular value transformation [2.647089498084052]
  We present a novel complete characterization for space-bounded quantum computation. We consider settings with one-sided error (unitary coRQL) and two-sided error (BQL) Our results reveal that the space-bounded state testing problems all correspond to the same class.
  arXiv  Detail & Related papers  (2023-08-09T17:16:19Z)
• Compilation of a simple chemistry application to quantum error correction primitives [44.99833362998488]
  We estimate the resources required to fault-tolerantly perform quantum phase estimation on a minimal chemical example. We find that implementing even a simple chemistry circuit requires 1,000 qubits and 2,300 quantum error correction rounds.
  arXiv  Detail & Related papers  (2023-07-06T18:00:10Z)
• 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)
• Finite-round quantum error correction on symmetric quantum sensors [8.339831319589134]
  Heisenberg limit provides a quadratic improvement over the standard quantum limit. It remains elusive because of the inevitable presence of noise decohering quantum sensors. We side-step this no-go result by using an optimal finite number of rounds of quantum error correction.
  arXiv  Detail & Related papers  (2022-12-12T23:41:51Z)
• 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)
• Fault-tolerant Coding for Quantum Communication [71.206200318454]
  encode and decode circuits to reliably send messages over many uses of a noisy channel. For every quantum channel $T$ and every $eps>0$ there exists a threshold $p(epsilon,T)$ for the gate error probability below which rates larger than $C-epsilon$ are fault-tolerantly achievable. Our results are relevant in communication over large distances, and also on-chip, where distant parts of a quantum computer might need to communicate under higher levels of noise.
  arXiv  Detail & Related papers  (2020-09-15T15:10:50Z)
• 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)
• Analysis of lower bounds for quantum control times and their relation to the quantum speed limit [0.0]
  Limitations to the speed of evolution of quantum systems, typically referred to as quantum speed limits (QSLs), have important consequences for quantum control problems. In this paper we present a short introductory overview of quantum speed limit for unitary dynamics and its connection to quantum control.
  arXiv  Detail & Related papers  (2020-02-25T19:19:29Z)
• 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.