An integrity measure to benchmark quantum error correcting memories
نویسندگان
چکیده
Rapidly developing experiments acrossmultiple platformsnowaim to realise small quantumcodes, and so demonstrate amemorywithinwhich a logical qubit canbeprotected fromnoise. There is aneed to benchmark the achievements in these diverse systems, and to compare the inherent power of the codes they rely upon.Wedescribe a recently introducedperformancemeasure called integrity, which relates to the probability that an ideal agentwill successfully ‘guess’ the state of a logical qubit after aperiodof storage in thememory. Integrity is straightforward to evaluate experimentallywithout state tomography and it can be related to various establishedmetrics such as the logicalfidelity and thepseudo-threshold.Weoffer a set of experimentalmilestones that are steps towards demonstratingunconditionally superior encoded memories.Using intensive numerical simulationswe comparememories basedon thefive-qubit code, the seven-qubit Steane code, and anine-qubit codewhich is the smallest instanceof a surface code;we assess both the simple and fault-tolerant implementationsof each.While the ‘best’ codeuponwhich tobase a memorydoes vary according to thenature and severity of thenoise, nevertheless certain trends emerge.
منابع مشابه
One-point Goppa Codes on Some Genus 3 Curves with Applications in Quantum Error-Correcting Codes
We investigate one-point algebraic geometric codes CL(D, G) associated to maximal curves recently characterized by Tafazolian and Torres given by the affine equation yl = f(x), where f(x) is a separable polynomial of degree r relatively prime to l. We mainly focus on the curve y4 = x3 +x and Picard curves given by the equations y3 = x4-x and y3 = x4 -1. As a result, we obtain exact value of min...
متن کاملExperimental implementation of encoded logical qubit operations in a perfect quantum error correcting code.
Large-scale universal quantum computing requires the implementation of quantum error correction (QEC). While the implementation of QEC has already been demonstrated for quantum memories, reliable quantum computing requires also the application of nontrivial logical gate operations to the encoded qubits. Here, we present examples of such operations by implementing, in addition to the identity op...
متن کاملDouble Error Correcting Codes
The construction of optimal linear block errorcorrecting codes is not an easy problem, for this, many studies describe methods for generating good. That is, even when taking into account the multitude of errors possible for multilevel quantum systems, topological quantum error-correction codes employing. The point of error correcting codes is to control the error rate. Let's say you have a Sing...
متن کاملOn The Generalization of Error - Correcting WOM
WOM (Write Once Memory) codes are codes for efficiently storing and updating data in a memory whose state transition is irreversible. Storage media that can be classified as WOM includes flash memories, optical disks and punch cards. Error-correcting WOM codes can correct errors besides its regular data updating capability. They are increasingly important for electronic memories using MLCs (mul...
متن کاملGENERALIZED JOINT HIGHER-RANK NUMERICAL RANGE
The rank-k numerical range has a close connection to the construction of quantum error correction code for a noisy quantum channel. For noisy quantum channel, a quantum error correcting code of dimension k exists if and only if the associated joint rank-k numerical range is non-empty. In this paper the notion of joint rank-k numerical range is generalized and some statements of [2011, Generaliz...
متن کامل