Robust projective measurements through measuring code-inspired observables
arXiv:2402.04093 · doi:10.1038/s41534-024-00904-y
Abstract
Quantum measurements are ubiquitous in quantum information processing tasks, but errors can render their outputs unreliable. Here, we present a scheme that implements a robust projective measurement through measuring code-inspired observables. Namely, given a projective POVM, a classical code and a constraint on the number of measurement outcomes each observable can have, we construct commuting observables whose measurement is equivalent to the projective measurement in the noiseless setting. Moreover, we can correct errors on the classical outcomes of the observables' measurement if the classical code corrects errors. Since our scheme does not require the encoding of quantum data onto a quantum error correction code, it can help construct robust measurements for near-term quantum algorithms that do not use quantum error correction. Moreover, our scheme works for any projective POVM, and hence can allow robust syndrome extraction procedures in non-stabilizer quantum error correction codes.
arXiv comment7 pages, 1 figure, 2 columns
References in corpus (43)
- Measurement-based quantum computation with cluster states
- Encoding a qubit in an oscillator
- Noiseless Quantum Codes
- Measurement-based quantum computation
- General framework for estimating the ultimate precision limit in noisy quantum-enhanced metrology
- Universal Quantum Computation with Continuous-Variable Cluster States
- Experimental Boson Sampling
- Quantum Error Mitigation
- Roads towards fault-tolerant universal quantum computation
- New class of quantum error-correcting codes for a bosonic mode
- Mitigating measurement errors in multi-qubit experiments
- Low-distance Surface Codes under Realistic Quantum Noise
- Building a fault-tolerant quantum computer using concatenated cat codes
- Mitigation of readout noise in near-term quantum devices by classical post-processing based on detector tomography
- Bosonic Quantum Codes for Amplitude Damping
- Quantum Sampling Problems, BosonSampling and Quantum Supremacy
- Fault-tolerant bosonic quantum error correction with the surface-GKP code
- Optimal quantum learning of a unitary transformation
- Evaluating the Holevo Cramér-Rao bound for multi-parameter quantum metrology
- Universal quantum computation with little entanglement
- Fundamental limits to quantum channel discrimination
- A theory of single-shot error correction for adversarial noise
- Permutation-invariant quantum codes
- Comparison between the Cramer-Rao and the mini-max approaches in quantum channel estimation
- Asymptotic theory of quantum channel estimation
- Single-shot error correction of three-dimensional homological product codes
- Rigorous measurement error correction
- Efficient computation of the Nagaoka--Hayashi bound for multi-parameter estimation with separable measurements
- Nonadditive quantum error-correcting code
- Pauli Exchange Errors in Quantum Computation
- Ability of stabilizer quantum error correction to protect itself from its own imperfection
- Permutation-invariant qudit codes from polynomials
- Permutation-invariant constant-excitation quantum codes for amplitude damping
- Learning quantum circuits of some gates
- Quantum Sampling Algorithms for Near-Term Devices
- Tight Cramér-Rao type bounds for multiparameter quantum metrology through conic programming
- Avoiding coherent errors with rotated concatenated stabilizer codes
- Geometric pathway to scalable quantum sensing
- Optimal protocols for quantum metrology with noisy measurements
- A family of permutationally invariant quantum codes
- Mitigating Coherent Noise by Balancing Weight-2 -Stabilizers
- Finite-round quantum error correction on symmetric quantum sensors
- Learning quantum graph states with product measurements