## Description

Code that can be obtained via an optimization procedure that ensures correction against a set \(\cal{E}\) of errors as well as guaranteeting optimal precision in locally estimating a parameter using a noiseless ancilla. For tensor-product spaces consisting of \(n\) subsystems (e.g., qubits, modular qudits, or Galois qudits), the procedure can yield a code whose parameter estimation precision satisfies Heisenberg scaling, i.e., scales quadratically with the number \(n\) of subsystems.

The conditions required for a code are that it corrects errors in the set \(\cal{E}\) and admits a continuous-parameter \(U(1)\) group of logical gates generated by some signal Hamiltonian \(H\) (with the time of evolution by \(H\) the parameter that is to be estimated). This means that \(H\) cannot itself be a detectable error, i.e., \(H\) cannot be expressed as a linear combination of the errors, a condition known as the Hamiltonian-not-in-Kraus-span condition [3] (alternatively, Hamiltonian-not-in-Lindblad-span for Markovian noise [2]). If these conditions are satisfied, a semidefinite-program based optimization procedure yields a metrologically optimal code. The procedure has been generalized to more general groups, corresponding to multiparameter estimation [4]. If these conditions are not satisfied, Heisenberg scaling is not achievable, but metrologically optimal codes can still be obtained via another semidefinite-program based optimization procedure [5][3].

Metrologically optimal QECCs require error-free ancillas for optimal local parameter estimation using an entangling gate. In this sense, such codes can be thought of as being entanglement-assisted. Ancilla-free versions exist in the case when the noise commutes with the signal Hamiltonian [6][7].

## Parent

- Finite-dimensional quantum error-correcting code — Semidefinite-program optimization procedure for finding a metrologically optimal code holds for finite-dimensional spaces.

## Child

## Cousins

- Entanglement-assisted (EA) QECC — Metrologically optimal codes can be thought of as being entanglement-assisted because they require error-free ancillas for optimal local parameter estimation, and the estimation procedure uses an entangling gate.
- Hamiltonian-based code — Metrologically optimal codes admit a \(U(1)\) set of gates generated by a signal Hamiltonian \(H\), meaning that there exists a basis of codewords that are eigenstates of the \(H\).
- Metrological code — Error-corrected sensing codes are required to satisfy the Knill-Laflamme conditions, while metrological codes need only satisfy the conditions partially.
- GNU permutation-invariant code — GNU codes can be used to sense signals within the permutation-invariant subspace [8].

## References

- [1]
- R. Demkowicz-Dobrzański, J. Czajkowski, and P. Sekatski, “Adaptive Quantum Metrology under General Markovian Noise”, Physical Review X 7, (2017) arXiv:1704.06280 DOI
- [2]
- S. Zhou et al., “Achieving the Heisenberg limit in quantum metrology using quantum error correction”, Nature Communications 9, (2018) arXiv:1706.02445 DOI
- [3]
- S. Zhou and L. Jiang, “Asymptotic Theory of Quantum Channel Estimation”, PRX Quantum 2, (2021) arXiv:2003.10559 DOI
- [4]
- W. Górecki et al., “Optimal probes and error-correction schemes in multi-parameter quantum metrology”, Quantum 4, 288 (2020) arXiv:1901.00896 DOI
- [5]
- S. Zhou and L. Jiang, “Optimal approximate quantum error correction for quantum metrology”, Physical Review Research 2, (2020) arXiv:1910.08472 DOI
- [6]
- D. Layden et al., “Ancilla-Free Quantum Error Correction Codes for Quantum Metrology”, Physical Review Letters 122, (2019) arXiv:1811.01450 DOI
- [7]
- S. Zhou, A. G. Manes, and L. Jiang, “Achieving metrological limits using ancilla-free quantum error-correcting codes”, (2023) arXiv:2303.00881
- [8]
- Y. Ouyang and G. K. Brennen, “Quantum error correction on symmetric quantum sensors”, (2022) arXiv:2212.06285

## Page edit log

- Sisi Zhou (2022-07-28) — most recent
- Victor V. Albert (2022-07-28)

## Cite as:

“Error-corrected sensing code”, The Error Correction Zoo (V. V. Albert & P. Faist, eds.), 2022. https://errorcorrectionzoo.org/c/metopt