Quantum Lego and XP Stabilizer Codes
- URL: http://arxiv.org/abs/2310.19538v1
- Date: Mon, 30 Oct 2023 13:44:39 GMT
- Title: Quantum Lego and XP Stabilizer Codes
- Authors: Ruohan Shen, Yixu Wang and ChunJun Cao
- Abstract summary: We apply the recent graphical framework of ''quantum lego'' to XP stabilizer codes.
We show that the idea of operator matching continues to hold for such codes.
We provide an efficient classical algorithm for tracking these symmetries.
- Score: 1.8087157239832479
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: We apply the recent graphical framework of ''quantum lego'' to XP stabilizer
codes where the stabilizer group is generally non-abelian. We show that the
idea of operator matching continues to hold for such codes and is sufficient
for generating all their XP symmetries provided the resulting code is XP. We
provide an efficient classical algorithm for tracking these symmetries under
tensor contraction or conjoining. This constitutes a partial extension of the
algorithm implied by Gottesman-Knill theorem beyond Pauli stabilizer states and
Clifford operations. Because conjoining transformations generate quantum
operations that are universal, the XP symmetries obtained from these algorithms
do not uniquely identify the resulting tensors in general. Using this extended
framework, we provide a novel XP stabilizer code with higher distance and a
$[[8,1,2]]$ code with fault-tolerant $T$ gate. For XP regular codes, we also
construct a tensor-network-based the maximum likelihood decoder for any i.i.d.
single qubit error channel.
Related papers
- 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) - Extracting topological orders of generalized Pauli stabilizer codes in
two dimensions [5.593891873998947]
We introduce an algorithm for extracting topological data from translation invariant generalized Pauli stabilizer codes in two-dimensional systems.
The algorithm applies to $mathbbZ_d$ qudits, including instances where $d$ is a nonprime number.
arXiv Detail & Related papers (2023-12-18T13:18:19Z) - Quantum Lego Expansion Pack: Enumerators from Tensor Networks [1.489619600985197]
We provide the first tensor network method for computing quantum weight enumerators in the most general form.
For non-(Pauli)-stabilizer codes, this constitutes the current best algorithm for computing the code distance.
We show that these enumerators can be used to compute logical error rates exactly and thus construct decoders for any i.i.d. single qubit or qudit error channels.
arXiv Detail & Related papers (2023-08-09T18:00:02Z) - Fault-Tolerant Computing with Single Qudit Encoding [49.89725935672549]
We discuss stabilizer quantum-error correction codes implemented in a single multi-level qudit.
These codes can be customized to the specific physical errors on the qudit, effectively suppressing them.
We demonstrate a Fault-Tolerant implementation on molecular spin qudits, showcasing nearly exponential error suppression with only linear qudit size growth.
arXiv Detail & Related papers (2023-07-20T10:51:23Z) - Homological Quantum Rotor Codes: Logical Qubits from Torsion [51.9157257936691]
homological quantum rotor codes allow one to encode both logical rotors and logical qudits in the same block of code.
We show that the $0$-$pi$-qubit as well as Kitaev's current-mirror qubit are indeed small examples of such codes.
arXiv Detail & Related papers (2023-03-24T00:29:15Z) - Error-correcting codes for fermionic quantum simulation [4.199246521960609]
We present methodologies for fermions via qubit systems on a two-dimensional lattice algorithm.
We identify a family of stabilizer codes suitable for fermion simulation.
Our method can increase the code distances without decreasing the (fermionic) code rate.
arXiv Detail & Related papers (2022-10-16T01:43:07Z) - Tailored XZZX codes for biased noise [60.12487959001671]
We study a family of codes having XZZX-type stabilizer generators.
We show that these XZZX codes are highly qubit efficient if tailored to biased noise.
arXiv Detail & Related papers (2022-03-30T17:26:31Z) - The XP Stabiliser Formalism: a Generalisation of the Pauli Stabiliser
Formalism with Arbitrary Phases [3.222802562733787]
XP stabiliser formalism allows for a wider range of states and codespaces to be represented.
We describe the states which arise in the formalism, and demonstrate an equivalence between XP stabiliser states and 'weighted hypergraph states'
arXiv Detail & Related papers (2022-02-28T21:42:05Z) - Finding the disjointness of stabilizer codes is NP-complete [77.34726150561087]
We show that the problem of calculating the $c-disjointness, or even approximating it to within a constant multiplicative factor, is NP-complete.
We provide bounds on the disjointness for various code families, including the CSS codes,$d codes and hypergraph codes.
Our results indicate that finding fault-tolerant logical gates for generic quantum error-correcting codes is a computationally challenging task.
arXiv Detail & Related papers (2021-08-10T15:00:20Z) - Trellis Decoding For Qudit Stabilizer Codes And Its Application To Qubit
Topological Codes [3.9962751777898955]
We show that trellis decoders have strong structure, extend the results using classical coding theory as a guide, and demonstrate a canonical form from which the structural properties of the decoding graph may be computed.
The modified decoder works for any stabilizer code $S$ and separates into two parts: a one-time, offline which builds a compact, graphical representation of the normalizer of the code, $Sperp$, and a quick, parallel, online computation using the Viterbi algorithm.
arXiv Detail & Related papers (2021-06-15T16:01:42Z) - Quantum copy-protection of compute-and-compare programs in the quantum random oracle model [48.94443749859216]
We introduce a quantum copy-protection scheme for a class of evasive functions known as " compute-and-compare programs"
We prove that our scheme achieves non-trivial security against fully malicious adversaries in the quantum random oracle model (QROM)
As a complementary result, we show that the same scheme fulfils a weaker notion of software protection, called "secure software leasing"
arXiv Detail & Related papers (2020-09-29T08:41:53Z)
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.