Beyond Integral-Domain Stabilizer Codes

• URL: http://arxiv.org/abs/2501.04888v1
• Date: Wed, 08 Jan 2025 23:58:13 GMT
• Title: Beyond Integral-Domain Stabilizer Codes
• Authors: Lane G. Gunderman,
• Abstract summary: Quantum error-correcting codes aim to protect information in quantum systems to enable fault-tolerant quantum computations. This work lays out central methods for working with composite dimensional systems, enabling full use of the computational space of some systems.
• Score: 0.0
• License:
• Abstract: Quantum error-correcting codes aim to protect information in quantum systems to enable fault-tolerant quantum computations. The most prevalent method, stabilizer codes, has been well developed for many varieties of systems, however, largely the case of composite number of levels in the system has been avoided. This relative absence is due to the underlying ring theoretic tools required for analyzing such systems. Here we explore composite local-dimension quantum stabilizer codes, providing a pair of constructions for transforming known stabilizer codes into valid ones for composite local-dimensions. In addition remarks on logical encodings and the counts possible are discussed. This work lays out central methods for working with composite dimensional systems, enabling full use of the computational space of some systems, and expanding the understanding of the symplectic spaces involved.

Related papers

• The fabulous world of GKP codes [0.0]
  Quantum error correction is an essential ingredient in the development of quantum technologies. A quintessential tool in quantum error correction is the stabilizer formalism, which tames quantum systems by enforcing symmetries. A Gottesman-Kitaev-Preskill code is a stabilizer code that creates a logical subspace within an infinite dimensional Hilbert space by endowing it with translational symmetries.
  arXiv  Detail & Related papers  (2024-12-03T13:27:37Z)
• Quantum control by the environment: Turing uncomputability, Optimization over Stiefel manifolds, Reachable sets, and Incoherent GRAPE [56.47577824219207]
  In many practical situations, the controlled quantum systems are open, interacting with the environment. In this note, we briefly review some results on control of open quantum systems using environment as a resource.
  arXiv  Detail & Related papers  (2024-03-20T10:09:13Z)
• 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)
• Quantum verification and estimation with few copies [63.669642197519934]
  The verification and estimation of large entangled systems represents one of the main challenges in the employment of such systems for reliable quantum information processing. This review article presents novel techniques focusing on a fixed number of resources (sampling complexity) and thus prove suitable for systems of arbitrary dimension. Specifically, a probabilistic framework requiring at best only a single copy for entanglement detection is reviewed, together with the concept of selective quantum state tomography.
  arXiv  Detail & Related papers  (2021-09-08T18:20:07Z)
• 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)
• Detecting entanglement structure in continuous many-body quantum systems [0.0]
  A prerequisite for the comprehensive understanding of many-body quantum systems is a characterization in terms of their entanglement structure. We develop a general scheme for certifying entanglement and demonstrate it by revealing entanglement between distinct subsystems of a spinor Bose-Einstein condensate. The detection of squeezing in Bogoliubov modes in a multi-mode setting illustrates its potential to boost the capabilities of quantum simulations to study entanglement in spatially extended many-body systems.
  arXiv  Detail & Related papers  (2021-05-25T21:12:07Z)
• Sensing quantum chaos through the non-unitary geometric phase [62.997667081978825]
  We propose a decoherent mechanism for sensing quantum chaos. The chaotic nature of a many-body quantum system is sensed by studying the implications that the system produces in the long-time dynamics of a probe coupled to it.
  arXiv  Detail & Related papers  (2021-04-13T17:24:08Z)
• Neuromorphic computing with a single qudit [0.0]
  Reservoir computing is an alternative to high-fidelity control of many-body quantum systems. Here, we consider a reservoir comprised of a single qudit ($d$-dimensional quantum system) We demonstrate a robust performance advantage compared to an analogous classical system.
  arXiv  Detail & Related papers  (2021-01-27T22:35:22Z)
• Changing the Local-Dimension of an Entanglement-Assisted Stabilizer Code Removes Entanglement Need [0.0]
  We show that codes for qudit quantum computers can be derived from already known codes. This could prove to be useful for fault-tolerant qudit, and even qubit, quantum computers.
  arXiv  Detail & Related papers  (2020-12-24T18:52:52Z)
• Transmon platform for quantum computing challenged by chaotic fluctuations [55.41644538483948]
  We investigate the stability of a variant of a many-body localized (MBL) phase for system parameters relevant to current quantum processors. We find that these computing platforms are dangerously close to a phase of uncontrollable chaotic fluctuations.
  arXiv  Detail & Related papers  (2020-12-10T19:00:03Z)
• Efficient simulatability of continuous-variable circuits with large Wigner negativity [62.997667081978825]
  Wigner negativity is known to be a necessary resource for computational advantage in several quantum-computing architectures. We identify vast families of circuits that display large, possibly unbounded, Wigner negativity, and yet are classically efficiently simulatable. We derive our results by establishing a link between the simulatability of high-dimensional discrete-variable quantum circuits and bosonic codes.
  arXiv  Detail & Related papers  (2020-05-25T11:03:42Z)

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.