اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدAll the stabilizer codes of distance 3
184
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
We give necessary and sufficient conditions for the existence of stabilizer codes $[[n,k,3]]$ of distance 3 for qubits: $n-kge lceillog_2(3n+1)rceil+epsilon_n$ where $epsilon_n=1$ if $n=8frac{4^m-1}3+{pm1,2}$ or $n=frac{4^{m+2}-1}3-{1,2,3}$ for some integer $mge1$ and $epsilon_n=0$ otherwise. Or equivalently, a code $[[n,n-r,3]]$ exists if and only if $nleq (4^r-1)/3, (4^r-1)/3-n otinlbrace 1,2,3rbrace$ for even $r$ and $nleq 8(4^{r-3}-1)/3, 8(4^{r-3}-1)/3-n ot=1$ for odd $r$. Given an arbitrary length $n$ we present an explicit construction for an optimal quantum stabilizer code of distance 3 that saturates the above bound.
قيم البحث
اقرأ أيضاً
We present an algorithm for manipulating quantum information via a sequence of projective measurements. We frame this manipulation in the language of stabilizer codes: a quantum computation approach in which errors are prevented and corrected in part
by repeatedly measuring redundant degrees of freedom. We show how to construct a set of projective measurements which will map between two arbitrary stabilizer codes. We show that this process preserves all quantum information. It can be used to implement Clifford gates, braid extrinsic defects, or move between codes in which different operations are natural.
Quantum error-correcting codes are used to protect qubits involved in quantum computation. This process requires logical operators, acting on protected qubits, to be translated into physical operators (circuits) acting on physical quantum states. We
propose a mathematical framework for synthesizing physical circuits that implement logical Clifford operators for stabilizer codes. Circuit synthesis is enabled by representing the desired physical Clifford operator in $mathbb{C}^{N times N}$ as a partial $2m times 2m$ binary symplectic matrix, where $N = 2^m$. We state and prove two theorems that use symplectic transvections to efficiently enumerate all binary symplectic matrices that satisfy a system of linear equations. As a corollary of these results, we prove that for an $[![ m,k ]!]$ stabilizer code every logical Clifford operator has $2^{r(r+1)/2}$ symplectic solutions, where $r = m-k$, up to stabilizer degeneracy. The desired physical circuits are then obtained by decomposing each solution into a product of elementary symplectic matrices, that correspond to elementary circuits. This enumeration of all physical realizations enables optimization over the ensemble with respect to a suitable metric. Furthermore, we show that any circuit that normalizes the stabilizer of the code can be transformed into a circuit that centralizes the stabilizer, while realizing the same logical operation. Our method of circuit synthesis can be applied to any stabilizer code, and this paper discusses a proof of concept synthesis for the $[![ 6,4,2 ]!]$ CSS code. Programs implementing the algorithms in this paper, which includes routines to solve for binary symplectic solutions of general linear systems and our overall LCS (logical circuit synthesis) algorithm, can be found at: https://github.com/nrenga/symplectic-arxiv18a
Reliable models of a large variety of open quantum systems can be described by Lindblad master equation. An important property of some open quantum systems is the existence of decoherence-free subspaces. In this paper, we develop tools for constructi
ng stabilizer codes over open quantum systems governed by Lindblad master equation. We apply the developed stabilizer code formalism to the area of quantum metrology. In particular, a strategy to attain the Heisenberg limit scaling is proposed.
Coherent errors are a dominant noise process in many quantum computing architectures. Unlike stochastic errors, these errors can combine constructively and grow into highly detrimental overrotations. To combat this, we introduce a simple technique fo
r suppressing systematic coherent errors in low-density parity-check (LDPC) stabilizer codes, which we call stabilizer slicing. The essential idea is to slice low-weight stabilizers into two equally-weighted Pauli operators and then apply them by rotating in opposite directions, causing their overrotations to interfere destructively on the logical subspace. With access to native gates generated by 3-body Hamiltonians, we can completely eliminate purely coherent overrotation errors, and for overrotation noise of 0.99 unitarity we achieve a 135-fold improvement in the logical error rate of Surface-17. For more conventional 2-body ion trap gates, we observe an 89-fold improvement for Bacon-Shor-13 with purely coherent errors which should be testable in near-term fault-tolerance experiments. This second scheme takes advantage of the prepared gauge degrees of freedom, and to our knowledge is the first example in which the state of the gauge directly affects the robustness of a codes memory. This work demonstrates that coherent noise is preferable to stochastic noise within certain code and gate implementations when the coherence is utilized effectively.
We propose a scheme that converts a stabilizer code into another stabilizer code in a fault tolerant manner. The scheme first puts both codes in specific forms, and proceeds the conversion from a source code to a target code by applying Clifford gate
s. The Clifford gates are chosen from the comparisons between both codes. The fault tolerance of the conversion is guaranteed by quantum error correction in every step during the entire conversion process. As examples, we show three
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
