اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدA family of stabilizer codes for $D({mathbb Z}_2)$ anyons and Majorana modes
194
0
0.0
(
0
)
تأليف
James R. Wootton
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
We study and generalize the class of qubit topological stabilizer codes that arise in the Abelian phase of the honeycomb lattice model. The resulting family of codes, which we call `matching codes realize the same anyon model as the surface codes, and so may be similarly used in proposals for quantum computation. We show that these codes are particularly well suited to engineering twist defects that behave as Majorana modes. A proof of principle system that demonstrates the braiding properties of the Majoranas is discussed that requires only three qubits.
قيم البحث
اقرأ أيضاً
Kitaevs toric code is an exactly solvable model with $mathbb{Z}_2$-topological order, which has potential applications in quantum computation and error correction. However, a direct experimental realization remains an open challenge. Here, we propose
a building block for $mathbb{Z}_2$ lattice gauge theories coupled to dynamical matter and demonstrate how it allows for an implementation of the toric-code ground state and its topological excitations. This is achieved by introducing separate matter excitations on individual plaquettes, whose motion induce the required plaquette terms. The proposed building block is realized in the second-order coupling regime and is well suited for implementations with superconducting qubits. Furthermore, we propose a pathway to prepare topologically non-trivial initial states during which a large gap on the order of the underlying coupling strength is present. This is verified by both analytical arguments and numerical studies. Moreover, we outline experimental signatures of the ground-state wavefunction and introduce a minimal braiding protocol. Detecting a $pi$-phase shift between Ramsey fringes in this protocol reveals the anyonic excitations of the toric-code Hamiltonian in a system with only three triangular plaquettes. Our work paves the way for realizing non-Abelian anyons in analog quantum simulators.
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.
We apply quantum Construction X on quasi-cyclic codes with large Hermitian hulls over $mathbb{F}_4$ and $mathbb{F}_9$ to derive good qubit and qutrit stabilizer codes, respectively. In several occasions we obtain quantum codes with stricly improved p
arameters than the current record. In numerous other occasions we obtain quantum codes with best-known performance. For the qutrit ones we supply a systematic construction to fill some gaps in the literature.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
