Continuous Variable Quantum MacWilliams Identities

• URL: http://arxiv.org/abs/2502.09514v1
• Date: Thu, 13 Feb 2025 17:30:22 GMT
• Title: Continuous Variable Quantum MacWilliams Identities
• Authors: Ansgar G. Burchards,
• Abstract summary: We derive bounds on general quantum error correcting codes against the displacement noise channel. Our main result is a quantum analogue of the classical Cohn-Elkies bound on sphere packing densities attainable in Euclidean space. We argue that Gottesman--Kitaev--Preskill codes based on the $E_8$ and Leech lattices achieve optimal distances.
• Score: 0.0
• License:
• Abstract: We derive bounds on general quantum error correcting codes against the displacement noise channel. The bounds limit the distances attainable by codes and also apply in an approximate setting. Our main result is a quantum analogue of the classical Cohn-Elkies bound on sphere packing densities attainable in Euclidean space. We further derive a quantum version of Levenshtein's sphere packing bound and argue that Gottesman--Kitaev--Preskill (GKP) codes based on the $E_8$ and Leech lattices achieve optimal distances. The main technical tool is a continuous variable version of the quantum MacWilliams identities, which we introduce. The identities relate a pair of weight distributions which can be obtained for any two trace-class operators. General properties of these weight distributions are discussed, along with several examples.

Related papers

• Exact path integrals on half-line in quantum cosmology with a fluid clock and aspects of operator ordering ambiguity [0.0]
  We perform $textitexact$ half-line path integral quantization of flat, homogeneous cosmological models containing a perfect fluid acting as an internal clock. We argue that a particular ordering prescription in the quantum theory can preserve two symmetries.
  arXiv  Detail & Related papers  (2025-01-20T19:00:02Z)
• Exploring the quantum capacity of a Gaussian random displacement channel using Gottesman-Kitaev-Preskill codes and maximum likelihood decoding [0.9208007322096532]
  We analyze the error-correction performance of several families of multi-mode Gottesman-Kitaev-Preskill codes. We find that the error threshold of the surface-square GKP code is remarkably close to $sigma=1/sqrtesimeq 0.6065$. By focusing on multi-mode GKP codes that encode just one logical qubit over multiple bosonic modes, we show that GKP codes can achieve non-zero quantum state transmission rates.
  arXiv  Detail & Related papers  (2024-11-06T21:47:20Z)
• The multimode conditional quantum Entropy Power Inequality and the squashed entanglement of the extreme multimode bosonic Gaussian channels [53.253900735220796]
  Inequality determines the minimum conditional von Neumann entropy of the output of the most general linear mixing of bosonic quantum modes. Bosonic quantum systems constitute the mathematical model for the electromagnetic radiation in the quantum regime.
  arXiv  Detail & Related papers  (2024-10-18T13:59:50Z)
• Normal quantum channels and Markovian correlated two-qubit quantum errors [77.34726150561087]
  We study general normally'' distributed random unitary transformations. On the one hand, a normal distribution induces a unital quantum channel. On the other hand, the diffusive random walk defines a unital quantum process.
  arXiv  Detail & Related papers  (2023-07-25T15:33:28Z)
• Quantum dynamics corresponding to chaotic BKL scenario [62.997667081978825]
  Quantization smears the gravitational singularity avoiding its localization in the configuration space. Results suggest that the generic singularity of general relativity can be avoided at quantum level.
  arXiv  Detail & Related papers  (2022-04-24T13:32:45Z)
• Singleton Bounds for Entanglement-Assisted Classical and Quantum Error Correcting Codes [0.0]
  We show that entirely quantum Shannon theoretic methods can be used to derive Singleton bounds on the performance of EACQ error correcting codes. We show that a large part of this region is attainable by certain EACQ codes, whenever the local alphabet size is large enough.
  arXiv  Detail & Related papers  (2022-02-04T15:22:18Z)
• Experimental violations of Leggett-Garg's inequalities on a quantum computer [77.34726150561087]
  We experimentally observe the violations of Leggett-Garg-Bell's inequalities on single and multi-qubit systems. Our analysis highlights the limits of nowadays quantum platforms, showing that the above-mentioned correlation functions deviate from theoretical prediction as the number of qubits and the depth of the circuit grow.
  arXiv  Detail & Related papers  (2021-09-06T14:35:15Z)
• Depth-efficient proofs of quantumness [77.34726150561087]
  A proof of quantumness is a type of challenge-response protocol in which a classical verifier can efficiently certify quantum advantage of an untrusted prover. In this paper, we give two proof of quantumness constructions in which the prover need only perform constant-depth quantum circuits.
  arXiv  Detail & Related papers  (2021-07-05T17:45:41Z)
• The Quantum Wasserstein Distance of Order 1 [16.029406401970167]
  We propose a generalization of the Wasserstein distance of order 1 to the quantum states of $n$ qudits. The proposed distance is invariant with respect to permutations of the qudits and unitary operations acting on one qudit. We also propose a generalization of the Lipschitz constant to quantum observables.
  arXiv  Detail & Related papers  (2020-09-09T18:00:01Z)
• Describing quantum metrology with erasure errors using weight distributions of classical codes [9.391375268580806]
  We consider using quantum probe states with a structure that corresponds to classical $[n,k,d]$ binary block codes of minimum distance. We obtain bounds on the ultimate precision that these probe states can give for estimating the unknown magnitude of a classical field.
  arXiv  Detail & Related papers  (2020-07-06T16:22:40Z)
• 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)

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.