Linear programming bounds for quantum channels acting on quantum error-correcting codes

• URL: http://arxiv.org/abs/2108.04434v1
• Date: Tue, 10 Aug 2021 03:56:25 GMT
• Title: Linear programming bounds for quantum channels acting on quantum error-correcting codes
• Authors: Yingkai Ouyang and Ching-Yi Lai
• Abstract summary: 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.
• Score: 9.975163460952047
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: While quantum weight enumerators establish some of the best upper bounds on the minimum distance of quantum error-correcting codes, these bounds are not optimized to quantify the performance of quantum codes under the effect of arbitrary quantum channels that describe bespoke noise models. Herein, for any Kraus decomposition of any given quantum channel, we introduce corresponding quantum weight enumerators that naturally generalize the Shor-Laflamme quantum weight enumerators. We establish an indirect linear relationship between these generalized quantum weight enumerators by introducing an auxiliary exact weight enumerator that completely quantifies the quantum code's projector, and is independent of the underlying noise process. By additionally working within the framework of approximate quantum error correction, we establish a general framework for constructing a linear program that is infeasible whenever approximate quantum error correcting codes with corresponding parameters do not exist. Our linear programming framework allows us to establish the non-existence of certain quantum codes that approximately correct amplitude damping errors, and obtain non-trivial upper bounds on the maximum dimension of a broad family of permutation-invariant quantum codes.

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)
• 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)
• Quantum Worst-Case to Average-Case Reductions for All Linear Problems [66.65497337069792]
  We study the problem of designing worst-case to average-case reductions for quantum algorithms. We provide an explicit and efficient transformation of quantum algorithms that are only correct on a small fraction of their inputs into ones that are correct on all inputs.
  arXiv  Detail & Related papers  (2022-12-06T22:01:49Z)
• 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)
• Efficient criteria of quantumness for a large system of qubits [58.720142291102135]
  We discuss the dimensionless combinations of basic parameters of large, partially quantum coherent systems. Based on analytical and numerical calculations, we suggest one such number for a system of qubits undergoing adiabatic evolution.
  arXiv  Detail & Related papers  (2021-08-30T23:50:05Z)
• Quantum Computation and Communication in Bosonic Systems [1.52292571922932]
  I provide an overview of bosonic quantum error correction schemes and present my contributions to the field. I demonstrate that fault-tolerant bosonic QEC is possible by concatenating a single-mode bosonic code with a multi-qubit error-correcting code. I provide explicit bosonic error correction schemes that nearly achieve the fundamental performance limit set by the quantum capacity.
  arXiv  Detail & Related papers  (2021-03-17T05:09:04Z)
• 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)
• 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)
• 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)
• Linear programming bounds for quantum amplitude damping codes [9.975163460952047]
  We introduce quantum weight enumerators for amplitude damping (AD) errors and work within the framework of approximate quantum error correction. This allows us to establish a linear program that is infeasible only when AQEC AD codes with corresponding parameters do not exist.
  arXiv  Detail & Related papers  (2020-01-12T18:46:59Z)

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.