Constructing quantum codes from any classical code and their embedding in ground space of local Hamiltonians

• URL: http://arxiv.org/abs/2012.01453v2
• Date: Tue, 8 Dec 2020 18:51:55 GMT
• Title: Constructing quantum codes from any classical code and their embedding in ground space of local Hamiltonians
• Authors: Ramis Movassagh and Yingkai Ouyang
• Abstract summary: We give an algorithm that explicitly constructs quantum codes with linear distance and constant rate. Motivated by quantum LDPC codes and the use of physics to protect quantum information, we introduce a new 2-local frustration free quantum spin chain Hamiltonian.
• Score: 6.85316573653194
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We introduce a framework for constructing a quantum error correcting code from any classical error correcting code. This includes CSS codes and goes beyond the stabilizer formalism to allow quantum codes to be constructed from classical codes that are not necessarily linear or self-orthogonal (Fig. 1). We give an algorithm that explicitly constructs quantum codes with linear distance and constant rate from classical codes with a linear distance and rate. As illustrations for small size codes, we obtain Steane's $7-$qubit code uniquely from Hamming's [7,4,3] code, and obtain other error detecting quantum codes from other explicit classical codes of length 4 and 6. Motivated by quantum LDPC codes and the use of physics to protect quantum information, we introduce a new 2-local frustration free quantum spin chain Hamiltonian whose ground space we analytically characterize completely. By mapping classical codewords to basis states of the ground space, we utilize our framework to demonstrate that the ground space contains explicit quantum codes with linear distance. This side-steps the Bravyi-Terhal no-go theorem because our work allows for more general quantum codes beyond the stabilizer and/or linear codes. We hesitate to call this an example of {\it subspace} quantum LDPC code with linear distance.

Related papers

• Homology, Hopf Algebras and Quantum Code Surgery [55.2480439325792]
  We study quantum error-correction codes from an algebraic perspective.<n>We derive new methods of performing fault-tolerant quantum computation.<n>At its core, this thesis asks: what is lattice surgery?
  arXiv  Detail & Related papers  (2025-08-02T21:38:33Z)
• Continuous-Variable Quantum MacWilliams Identities [0.0]
  We derive bounds on general quantum error correcting codes against the displacement noise channel. We argue that Gottesman--Kitaev--Preskill codes based on the $E_8$ and Leech lattices achieve optimal distances.
  arXiv  Detail & Related papers  (2025-02-13T17:30:22Z)
• Quantum information with quantum-like bits [0.0]
  In previous work we have proposed a construction of quantum-like bits that could endow a large, complex classical system. This paper aims to explore the mathematical structure of quantum-like resources, and shows how arbitrary gates can be implemented by manipulating emergent states.
  arXiv  Detail & Related papers  (2024-08-12T20:40:54Z)
• Quotient Space Quantum Codes [0.0]
  In this paper, I establish the quotient space codes to construct quantum codes. These new codes unify additive codes and codeword stabilized codes and can transmit classical codewords. I also present new bounds for quantum codes and provide a simple proof of the quantum Singleton bound.
  arXiv  Detail & Related papers  (2023-11-13T12:03:59Z)
• Geometrically Local Quantum and Classical Codes from Subdivision [10.357542321841887]
  A geometrically local quantum code is an error correcting code situated within $mathbbRD$, where the checks only act on qubits within a fixed spatial distance. Recently, Portnoy made a significant breakthrough with codes achieving optimal dimension and distance up to polylogs. This paper bypasses this step and streamlines the construction by noticing that a family of good quantum low-density parity-check codes, balanced product codes, naturally carries a two-dimensional structure.
  arXiv  Detail & Related papers  (2023-09-28T02:12:38Z)
• Simple Tests of Quantumness Also Certify Qubits [69.96668065491183]
  A test of quantumness is a protocol that allows a classical verifier to certify (only) that a prover is not classical. We show that tests of quantumness that follow a certain template, which captures recent proposals such as (Kalai et al., 2022) can in fact do much more. Namely, the same protocols can be used for certifying a qubit, a building-block that stands at the heart of applications such as certifiable randomness and classical delegation of quantum computation.
  arXiv  Detail & Related papers  (2023-03-02T14:18:17Z)
• Quantum spherical codes [55.33545082776197]
  We introduce a framework for constructing quantum codes defined on spheres by recasting such codes as quantum analogues of the classical spherical codes. We apply this framework to bosonic coding, obtaining multimode extensions of the cat codes that can outperform previous constructions.
  arXiv  Detail & Related papers  (2023-02-22T19:00:11Z)
• 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)
• LQP: The Dynamic Logic of Quantum Information [77.34726150561087]
  This paper introduces a dynamic logic formalism for reasoning about information flow in composite quantum systems. We present a finitary syntax, a relational semantics and a sound proof system for this logic. As applications, we use our system to give formal correctness for the Teleportation protocol and for a standard Quantum Secret Sharing protocol.
  arXiv  Detail & Related papers  (2021-10-04T12:20:23Z)
• Theory of quasi-exact fault-tolerant quantum computing and valence-bond-solid codes [3.6192409729339223]
  We develop the theory of quasi-exact fault-tolerant quantum computation, which uses qubits encoded into quasi-exact quantum error-correction codes ("quasi codes") The model of QEQ lies in between the two well-known ones: the usual noisy quantum universality without error correction and the usual fault-tolerant quantum computation, but closer to the later.
  arXiv  Detail & Related papers  (2021-05-31T08:17:30Z)
• Secure Two-Party Quantum Computation Over Classical Channels [63.97763079214294]
  We consider the setting where the two parties (a classical Alice and a quantum Bob) can communicate only via a classical channel. We show that it is in general impossible to realize a two-party quantum functionality with black-box simulation in the case of malicious quantum adversaries. We provide a compiler that takes as input a classical proof of quantum knowledge (PoQK) protocol for a QMA relation R and outputs a zero-knowledge PoQK for R that can be verified by classical parties.
  arXiv  Detail & Related papers  (2020-10-15T17:55:31Z)
• Modifying method of constructing quantum codes from highly entangled states [0.0]
  We provide explicit constructions for codewords, encoding procedure and stabilizer formalism of the QECCs. We modify the method to produce another set of stabilizer QECCs that encode a logical qudit into a subspace spanned by AME states.
  arXiv  Detail & Related papers  (2020-05-04T12:28:58Z)
• From a quantum theory to a classical one [117.44028458220427]
  We present and discuss a formal approach for describing the quantum to classical crossover. The method was originally introduced by L. Yaffe in 1982 for tackling large-$N$ quantum field theories.
  arXiv  Detail & Related papers  (2020-04-01T09:16:38Z)

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.