Finite-round quantum error correction on symmetric quantum sensors

• URL: http://arxiv.org/abs/2212.06285v3
• Date: Sat, 10 Feb 2024 19:55:28 GMT
• Title: Finite-round quantum error correction on symmetric quantum sensors
• Authors: Yingkai Ouyang and Gavin K. Brennen
• Abstract summary: 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.
• Score: 8.339831319589134
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: The Heisenberg limit provides a quadratic improvement over the standard quantum limit, and is the maximum quantum advantage that linear quantum sensors could provide over classical methods. It remains elusive, however, because of the inevitable presence of noise decohering quantum sensors. Namely, if infinite rounds of quantum error correction corrects any part of a quantum sensor's signal, a no-go result purports that the standard quantum limit scaling can not be exceeded. We side-step this no-go result by using an optimal finite number of rounds of quantum error correction, such that even if part of the signal is corrected away, our quantum field sensing protocol can approach the Heisenberg limit in the face of a linear rate of deletion errors. Here, we focus on quantum error correction codes within the symmetric subspace. Symmetric states of collective angular momentum are good candidates for multi-qubit probe states in quantum sensors because they are easy to prepare and can be controlled without requiring individual addressability. We show how the representation theory of the symmetric group can inform practical decoding algorithms for permutation-invariant codes. These decoding algorithms involve measurements of total angular momentum, quantum Schur transforms or logical state teleportations, and geometric pulse gates. Our completion of the theory of permutation-invariant codes allows near-term implementation of quantum error correction using simple quantum control techniques.

Related papers

• Quantum process tomography of continuous-variable gates using coherent states [49.299443295581064]
  We demonstrate the use of coherent-state quantum process tomography (csQPT) for a bosonic-mode superconducting circuit. We show results for this method by characterizing a logical quantum gate constructed using displacement and SNAP operations on an encoded qubit.
  arXiv  Detail & Related papers  (2023-03-02T18:08:08Z)
• 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)
• Variational Quantum Metrology with Loschmidt Echo [20.002455345052702]
  We propose a scalable scheme with a symmetrical variational quantum circuit which, same as the Loschmidt echo, consists of a forward and a backward evolution. We show that in this scheme the quantum Fisher information, which quantifies the precision limit, can be efficiently obtained from a measurement signal of the Loschmidt echo. We experimentally implement the scheme on an ensemble of 10-spin quantum processor and successfully achieves a precision near the theoretical limit which outperforms the standard quantum limit with 12.4 dB.
  arXiv  Detail & Related papers  (2022-11-22T14:21:59Z)
• Circuit Symmetry Verification Mitigates Quantum-Domain Impairments [69.33243249411113]
  We propose circuit-oriented symmetry verification that are capable of verifying the commutativity of quantum circuits without the knowledge of the quantum state. In particular, we propose the Fourier-temporal stabilizer (STS) technique, which generalizes the conventional quantum-domain formalism to circuit-oriented stabilizers.
  arXiv  Detail & Related papers  (2021-12-27T21:15:35Z)
• Mitigating Quantum Errors via Truncated Neumann Series [10.04862322536857]
  We propose a unified framework that can mitigate quantum gate and measurement errors in computing quantum expectation values. The essential idea is to cancel the effect of quantum error by approximating its inverse via linearly combining quantum errors of different orders. We test this framework for different quantum errors and find that the computation accuracy is substantially improved.
  arXiv  Detail & Related papers  (2021-11-01T04:16:49Z)
• Linear programming bounds for quantum channels acting on quantum error-correcting codes [9.975163460952047]
  We introduce corresponding quantum weight enumerators that naturally generalize the Shor-Laflamme quantum weight enumerators. An exact weight enumerator completely quantifies the quantum code's projector, and is independent of the underlying noise process. Our framework allows us to establish the non-existence of certain quantum codes that approximately correct amplitude damping errors.
  arXiv  Detail & Related papers  (2021-08-10T03:56:25Z)
• 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)
• New perspectives on covariant quantum error correction [3.3811802886738462]
  We prove new and powerful lower bounds on the infidelity of covariant quantum error correction. Explicit lower bounds are derived for both erasure and depolarizing noises. We also present a type of covariant codes which nearly saturates these lower bounds.
  arXiv  Detail & Related papers  (2020-05-25T04:33:59Z)
• 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)

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.