Stabilizer Codes with Exotic Local-dimensions

• URL: http://arxiv.org/abs/2303.17000v2
• Date: Tue, 6 Feb 2024 02:19:00 GMT
• Title: Stabilizer Codes with Exotic Local-dimensions
• Authors: Lane G. Gunderman
• Abstract summary: We show that any traditional stabilizer code can be used for analog continuous-variable codes. We also show that a stabilizer code originally designed with a finite field local-dimension can be transformed into a code with the same $n$, $k$, and $d$ parameters.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Traditional stabilizer codes operate over prime power local-dimensions. In this work we extend the stabilizer formalism using the local-dimension-invariant setting to import stabilizer codes from these standard local-dimensions to other cases. In particular, we show that any traditional stabilizer code can be used for analog continuous-variable codes, and consider restrictions in phase space and discretized phase space. This puts this framework on an equivalent footing as traditional stabilizer codes. Following this, using extensions of prior ideas, we show that a stabilizer code originally designed with a finite field local-dimension can be transformed into a code with the same $n$, $k$, and $d$ parameters for any integral domain. This is of theoretical interest and can be of use for systems whose local-dimension is better described by mathematical rings, which permits the use of traditional stabilizer codes for protecting their information as well.

Related papers

• Tile Codes: High-Efficiency Quantum Codes on a Lattice with Boundary [10.159681653887237]
  Tile codes generalize the usual surface code by allowing for a bit more flexibility in terms of locality and stabilizer weight. We find codes with parameters $[288, 8, 12]]$ using weight-6 stabilizers and $[[288, 8, 14]]$ using weight-8 stabilizers, outperforming all previously known constructions in this direction.
  arXiv  Detail & Related papers  (2025-04-12T10:25:26Z)
• Puncturing Quantum Stabilizer Codes [28.796017729194713]
  We generalize the puncturing procedure to allow more freedom in the choice of which coded states are kept and which are removed. We present several ways to utilize this for the search of codes with good or even optimal parameters.
  arXiv  Detail & Related papers  (2024-10-23T10:31:34Z)
• Robust Incremental Structure-from-Motion with Hybrid Features [73.55745864762703]
  We introduce an incremental Structure-from-Motion (SfM) system that leverages lines and their structured geometric relations. Our system is consistently more robust and accurate compared to the widely used point-based state of the art in SfM.
  arXiv  Detail & Related papers  (2024-09-29T22:20:32Z)
• Bipartite entanglement of noisy stabilizer states through the lens of stabilizer codes [8.59730790789283]
  We show that the spectra of the corresponding reduced states can be expressed in terms of properties of an associated stabilizer code. We find stabilizer states that are resilient against noise, allowing for more robust entanglement distribution in near-term quantum networks.
  arXiv  Detail & Related papers  (2024-06-04T15:46:51Z)
• Stabiliser codes over fields of even order [2.048226951354646]
  We describe stabiliser codes on n quqits with local dimension q=2h and binary stabiliser codes on hn qubits. A stabiliser code over a field of even order corresponds to a so-called quantum set of symplectic polar spaces.
  arXiv  Detail & Related papers  (2024-01-12T15:08:50Z)
• Dimensionless Policies based on the Buckingham $\pi$ Theorem: Is This a Good Way to Generalize Numerical Results? [66.52698983694613]
  This article explores the use of the Buckingham $pi$ theorem as a tool to encode the control policies of physical systems into a generic form of knowledge. We show, by restating the solution to a motion control problem using dimensionless variables, that (1) the policy mapping involves a reduced number of parameters and (2) control policies generated numerically for a specific system can be transferred exactly to a subset of dimensionally similar systems by scaling the input and output variables appropriately. It remains to be seen how practical this approach can be to generalize policies for more complex high-dimensional problems, but the early results show that it is a
  arXiv  Detail & Related papers  (2023-07-29T00:51:26Z)
• Disentanglement via Latent Quantization [60.37109712033694]
  In this work, we construct an inductive bias towards encoding to and decoding from an organized latent space. We demonstrate the broad applicability of this approach by adding it to both basic data-re (vanilla autoencoder) and latent-reconstructing (InfoGAN) generative models.
  arXiv  Detail & Related papers  (2023-05-28T06:30:29Z)
• Qubit-oscillator concatenated codes: decoding formalism & code comparison [1.8759305308855916]
  Concatenating bosonic error-correcting codes with qubit codes can substantially boost the error-correcting power of the original qubit codes. GKP-stabilizer codes allow protection of a logical bosonic mode from fluctuations of the mode's conjugate variables. We develop efficient maximum-likelihood decoders for and analyze the performance of three different concatenations of codes.
  arXiv  Detail & Related papers  (2022-09-10T02:30:15Z)
• Degenerate Local-dimension-invariant Stabilizer Codes and an Alternative Bound for the Distance Preservation Condition [0.0]
  We show that degenerate stabilizer codes can have their distance promised upon sufficiently large local-dimension. New bound on the local-dimension required to preserve the distance of local-dimension-invariant codes could be useful for error-corrected qudit quantum computers.
  arXiv  Detail & Related papers  (2021-10-28T16:36:04Z)
• Stabilizing Equilibrium Models by Jacobian Regularization [151.78151873928027]
  Deep equilibrium networks (DEQs) are a new class of models that eschews traditional depth in favor of finding the fixed point of a single nonlinear layer. We propose a regularization scheme for DEQ models that explicitly regularizes the Jacobian of the fixed-point update equations to stabilize the learning of equilibrium models. We show that this regularization adds only minimal computational cost, significantly stabilizes the fixed-point convergence in both forward and backward passes, and scales well to high-dimensional, realistic domains.
  arXiv  Detail & Related papers  (2021-06-28T00:14:11Z)
• Pointwise Feasibility of Gaussian Process-based Safety-Critical Control under Model Uncertainty [77.18483084440182]
  Control Barrier Functions (CBFs) and Control Lyapunov Functions (CLFs) are popular tools for enforcing safety and stability of a controlled system, respectively. We present a Gaussian Process (GP)-based approach to tackle the problem of model uncertainty in safety-critical controllers that use CBFs and CLFs.
  arXiv  Detail & Related papers  (2021-06-13T23:08:49Z)
• Mitigating Coherent Noise by Balancing Weight-2 $Z$-Stabilizers [2.4851820343103035]
  Physical platforms such as trapped ions suffer from coherent noise where errors manifest as rotations about a particular axis and can accumulate over time. We investigate passive mitigation through decoherence free subspaces, requiring the noise to preserve the code space of a stabilizer code. By adjusting the size of these components, we are able to construct a large family of QECC codes, oblivious to coherent noise.
  arXiv  Detail & Related papers  (2020-10-31T06:09:40Z)
• Learning Stabilizing Controllers for Unstable Linear Quadratic Regulators from a Single Trajectory [85.29718245299341]
  We study linear controllers under quadratic costs model also known as linear quadratic regulators (LQR) We present two different semi-definite programs (SDP) which results in a controller that stabilizes all systems within an ellipsoid uncertainty set. We propose an efficient data dependent algorithm -- textsceXploration -- that with high probability quickly identifies a stabilizing controller.
  arXiv  Detail & Related papers  (2020-06-19T08:58:57Z)

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.