Towards surgery with good quantum LDPC codes

• URL: http://arxiv.org/abs/2309.16406v2
• Date: Mon, 8 Jan 2024 12:01:14 GMT
• Title: Towards surgery with good quantum LDPC codes
• Authors: Alexander Cowtan
• Abstract summary: We show that the good quantum LDPC codes of Panteleev-chev citePK allow for surgery using any logical qubits, albeit incurring a penalty which lowers the rate and distance scaling.
• Score: 65.268245109828
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We show that the good quantum LDPC codes of Panteleev-Kalachev \cite{PK} allow for surgery using any logical qubits, albeit incurring an asymptotic penalty which lowers the rate and distance scaling. We also prove that we can satisfy 3 of the 4 conditions for performing surgery \textit{without} incurring an asymptotic penalty. If the last condition is also satisfied then we can perform code surgery while maintaining $k, d\in \Theta(n)$.

Related papers

• Parallel Logical Measurements via Quantum Code Surgery [42.95092131256421]
  Quantum code surgery is a flexible and low overhead technique for performing logical measurements on quantum error-correcting codes. We present a code surgery scheme, applicable to any Calderbank-Shor-Steane quantum low-density parity check (LDPC) code, that fault-tolerantly measures many logical Pauli operators in parallel.
  arXiv  Detail & Related papers  (2025-03-06T22:05:52Z)
• Realizing Lattice Surgery on Two Distance-Three Repetition Codes with Superconducting Qubits [31.25958618453706]
  We demonstrate lattice surgery between two distance-three repetition-code qubits by splitting a single distance-three surface-code qubit. We achieve an improvement in the value of the decoded $ZZ$ logical two-qubit observable compared to a similar non-encoded circuit.
  arXiv  Detail & Related papers  (2025-01-08T16:49:27Z)
• SDP bounds on quantum codes [6.417777780911225]
  This paper provides a semidefinite programming hierarchy based on state optimization to determine the existence of quantum codes. The hierarchy is complete, in the sense that if a $(!(n,K,delta)!)$ code does not exist then a level of the hierarchy is infeasible. While it is formally-free, we restrict it to qubit codes through quasi-Clifford algebras.
  arXiv  Detail & Related papers  (2024-08-19T18:00:07Z)
• SSIP: automated surgery with quantum LDPC codes [55.2480439325792]
  We present Safe Surgery by Identifying Pushouts (SSIP), an open-source lightweight Python package for automating surgery between qubit CSS codes. Under the hood, it performs linear algebra over $mathbbF$ governed by universal constructions in the category of chain complexes. We show that various logical measurements can be performed cheaply by surgery without sacrificing the high code distance.
  arXiv  Detail & Related papers  (2024-07-12T16:50:01Z)
• Qubit Number Optimization for Restriction Terms of QUBO Hamiltonians [62.997667081978825]
  It is mathematically allowed to ask for fractional values of $R$. We show how they can reduce the number of qubits needed to implement the restriction hamiltonian even further. Finally, we characterize the response of DWave's Advantage$_$system4.1 Quantum Annealer (QA) when faced with the implementation of FRCs.
  arXiv  Detail & Related papers  (2023-06-12T08:25:56Z)
• 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)
• Biased Gottesman-Kitaev-Preskill repetition code [0.0]
  Continuous-variable quantum computing architectures based upon the Gottesmann-Kitaev-Preskill (GKP) encoding have emerged as a promising candidate. We study the code-capacity behaviour of a rectangular-lattice GKP encoding with a repetition code under an isotropic Gaussian displacement channel.
  arXiv  Detail & Related papers  (2022-12-21T22:56:05Z)
• A lower bound on the space overhead of fault-tolerant quantum computation [51.723084600243716]
  The threshold theorem is a fundamental result in the theory of fault-tolerant quantum computation. We prove an exponential upper bound on the maximal length of fault-tolerant quantum computation with amplitude noise.
  arXiv  Detail & Related papers  (2022-01-31T22:19:49Z)
• Balanced Product Quantum Codes [5.33024001730262]
  This work provides the first explicit and non-random family of $[[N,K,D]]$ LDPC quantum codes. The family is constructed by amalgamating classical codes and Ramanujan graphs via an operation called balanced product.
  arXiv  Detail & Related papers  (2020-12-16T21:19:38Z)
• Quantum Gram-Schmidt Processes and Their Application to Efficient State Read-out for Quantum Algorithms [87.04438831673063]
  We present an efficient read-out protocol that yields the classical vector form of the generated state. Our protocol suits the case that the output state lies in the row space of the input matrix. One of our technical tools is an efficient quantum algorithm for performing the Gram-Schmidt orthonormal procedure.
  arXiv  Detail & Related papers  (2020-04-14T11:05:26Z)
• Decoding quantum information via the Petz recovery map [16.276576840098254]
  We show that there is a sharp error threshold above which $Qn, epsilon(mathcalN)$ scales as $sqrtn$. Applying our achievability bound to the 50-50 erasure channel, we find that there is a sharp error threshold above which $Qn, epsilon(mathcalN)$ scales as $sqrtn$.
  arXiv  Detail & Related papers  (2015-04-17T06:20:32Z)

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.