Degenerate Local-dimension-invariant Stabilizer Codes and an Alternative Bound for the Distance Preservation Condition

• URL: http://arxiv.org/abs/2110.15274v1
• Date: Thu, 28 Oct 2021 16:36:04 GMT
• Title: Degenerate Local-dimension-invariant Stabilizer Codes and an Alternative Bound for the Distance Preservation Condition
• Authors: Lane G. Gunderman
• Abstract summary: 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.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: One hurdle to performing reliable quantum computations is overcoming noise. One possibility is to reduce the number of particles needing to be protected from noise and instead use systems with more states, so called qudit quantum computers. In this paper we show that codes for these systems can be derived from already known codes, and in particular that degenerate stabilizer codes can have their distance also promised upon sufficiently large local-dimension, as well as a new bound on the local-dimension required to preserve the distance of local-dimension-invariant codes, which is a result which could prove to be useful for error-corrected qudit quantum computers.

Related papers

• Quantum subspace verification for error correction codes [13.856955493134908]
  We introduce a framework of quantum subspace verification, employing the knowledge of quantum error correction code subspaces to reduce the potential measurement budgets. For certain codes like the notable Calderbank-Shor-Steane codes and QLDPC stabilizer codes, the setting number and sample complexity can be significantly reduced. By combining the proposed subspace verification and direct fidelity estimation, we construct a protocol to verify the fidelity of general magic logical states.
  arXiv  Detail & Related papers  (2024-10-16T13:28:33Z)
• Non-local resources for error correction in quantum LDPC codes [0.0]
  Surface code suffers from a low encoding rate, requiring a vast number of physical qubits for large-scale quantum computation. hypergraph product codes present a promising alternative, as both their encoding rate and distance scale with block size. Recent advancements have shown how to deterministically perform high-fidelity cavity enabled non-local many-body gates.
  arXiv  Detail & Related papers  (2024-09-09T17:28:41Z)
• Deep Quantum Error Correction [73.54643419792453]
  Quantum error correction codes (QECC) are a key component for realizing the potential of quantum computing. In this work, we efficiently train novel emphend-to-end deep quantum error decoders. The proposed method demonstrates the power of neural decoders for QECC by achieving state-of-the-art accuracy.
  arXiv  Detail & Related papers  (2023-01-27T08:16:26Z)
• Gaussian conversion protocol for heralded generation of qunaught states [66.81715281131143]
  bosonic codes map qubit-type quantum information onto the larger bosonic Hilbert space. We convert between two instances of these codes GKP qunaught states and four-foldsymmetric binomial states corresponding to a zero-logical encoded qubit. We obtain GKP qunaught states with a fidelity of over 98% and a probability of approximately 3.14%.
  arXiv  Detail & Related papers  (2023-01-24T14:17:07Z)
• Suppressing Amplitude Damping in Trapped Ions: Discrete Weak Measurements for a Non-unitary Probabilistic Noise Filter [62.997667081978825]
  We introduce a low-overhead protocol to reverse this degradation. We present two trapped-ion schemes for the implementation of a non-unitary probabilistic filter against amplitude damping noise. This filter can be understood as a protocol for single-copy quasi-distillation.
  arXiv  Detail & Related papers  (2022-09-06T18:18:41Z)
• Local-dimension-invariant Calderbank-Shor-Steane Codes with an Improved Distance Promise [0.0]
  We prove how to construct codes with parameters $[2N,2N-1-2N,geq 3]]_q$ for any choice of prime $q$ and natural number $N$. This is accomplished using the technique of local-dimension-invariant (LDI) codes.
  arXiv  Detail & Related papers  (2021-10-21T22:45:51Z)
• Error mitigation for variational quantum algorithms through mid-circuit measurements [0.0]
  Noisy Intermediate-Scale Quantum (NISQ) algorithms require novel paradigms of error mitigation. We present mid-circuit post-selection schemes for frequently used encodings such as one-hot, binary, gray, and domain-wall encoding. We demonstrate the effectiveness of the approach for the Quantum Alternating Operator Ansatz algorithm.
  arXiv  Detail & Related papers  (2021-08-24T19:34:03Z)
• Hardware-Efficient, Fault-Tolerant Quantum Computation with Rydberg Atoms [55.41644538483948]
  We provide the first complete characterization of sources of error in a neutral-atom quantum computer. We develop a novel and distinctly efficient method to address the most important errors associated with the decay of atomic qubits to states outside of the computational subspace. Our protocols can be implemented in the near-term using state-of-the-art neutral atom platforms with qubits encoded in both alkali and alkaline-earth atoms.
  arXiv  Detail & Related papers  (2021-05-27T23:29:53Z)
• 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)
• Heterogeneous Multipartite Entanglement Purification for Size-Constrained Quantum Devices [68.8204255655161]
  Purifying entanglement resources after their imperfect generation is an indispensable step towards using them in quantum architectures. Here we depart from the typical purification paradigm for multipartite states explored in the last twenty years. We find that smaller sacrificial' states, like Bell pairs, can be more useful in the purification of multipartite states than additional copies of these same states.
  arXiv  Detail & Related papers  (2020-11-23T19:00:00Z)
• 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.