Cracking the quantum code

Physics World ◽  
2020 ◽  
Vol 33 (7) ◽  
pp. 46-*
Author(s):  
Kate Gardner
Keyword(s):  
2014 ◽  
Vol 28 (06) ◽  
pp. 1450017 ◽  
Author(s):  
RUIHU LI ◽  
GEN XU ◽  
LUOBIN GUO

In this paper, we discuss two problems on asymmetric quantum error-correcting codes (AQECCs). The first one is on the construction of a [[12, 1, 5/3]]2 asymmetric quantum code, we show an impure [[12, 1, 5/3 ]]2 exists. The second one is on the construction of AQECCs from binary cyclic codes, we construct many families of new asymmetric quantum codes with dz> δ max +1 from binary primitive cyclic codes of length n = 2m-1, where δ max = 2⌈m/2⌉-1 is the maximal designed distance of dual containing narrow sense BCH code of length n = 2m-1. A number of known codes are special cases of the codes given here. Some of these AQECCs have parameters better than the ones available in the literature.


Quantum ◽  
2020 ◽  
Vol 4 ◽  
pp. 304
Author(s):  
Leonid P. Pryadko

Error probability distribution associated with a given Clifford measurement circuit is described exactly in terms of the circuit error-equivalence group, or the circuit subsystem code previously introduced by Bacon, Flammia, Harrow, and Shi. This gives a prescription for maximum-likelihood decoding with a given measurement circuit. Marginal distributions for subsets of circuit errors are also analyzed; these generate a family of related asymmetric LDPC codes of varying degeneracy. More generally, such a family is associated with any quantum code. Implications for decoding highly-degenerate quantum codes are discussed.


Author(s):  
Todd A. Brun

Quantum error correction is a set of methods to protect quantum information—that is, quantum states—from unwanted environmental interactions (decoherence) and other forms of noise. The information is stored in a quantum error-correcting code, which is a subspace in a larger Hilbert space. This code is designed so that the most common errors move the state into an error space orthogonal to the original code space while preserving the information in the state. It is possible to determine whether an error has occurred by a suitable measurement and to apply a unitary correction that returns the state to the code space without measuring (and hence disturbing) the protected state itself. In general, codewords of a quantum code are entangled states. No code that stores information can protect against all possible errors; instead, codes are designed to correct a specific error set, which should be chosen to match the most likely types of noise. An error set is represented by a set of operators that can multiply the codeword state. Most work on quantum error correction has focused on systems of quantum bits, or qubits, which are two-level quantum systems. These can be physically realized by the states of a spin-1/2 particle, the polarization of a single photon, two distinguished levels of a trapped atom or ion, the current states of a microscopic superconducting loop, or many other physical systems. The most widely used codes are the stabilizer codes, which are closely related to classical linear codes. The code space is the joint +1 eigenspace of a set of commuting Pauli operators on n qubits, called stabilizer generators; the error syndrome is determined by measuring these operators, which allows errors to be diagnosed and corrected. A stabilizer code is characterized by three parameters [[n,k,d]], where n is the number of physical qubits, k is the number of encoded logical qubits, and d is the minimum distance of the code (the smallest number of simultaneous qubit errors that can transform one valid codeword into another). Every useful code has n>k; this physical redundancy is necessary to detect and correct errors without disturbing the logical state. Quantum error correction is used to protect information in quantum communication (where quantum states pass through noisy channels) and quantum computation (where quantum states are transformed through a sequence of imperfect computational steps in the presence of environmental decoherence to solve a computational problem). In quantum computation, error correction is just one component of fault-tolerant design. Other approaches to error mitigation in quantum systems include decoherence-free subspaces, noiseless subsystems, and dynamical decoupling.


1999 ◽  
Vol 60 (2) ◽  
pp. R729-R732 ◽  
Author(s):  
Paolo Zanardi
Keyword(s):  

1999 ◽  
Vol 60 (3) ◽  
pp. 1924-1943 ◽  
Author(s):  
Debbie Leung ◽  
Lieven Vandersypen ◽  
Xinlan Zhou ◽  
Mark Sherwood ◽  
Constantino Yannoni ◽  
...  

2018 ◽  
Vol 16 (04) ◽  
pp. 1850037 ◽  
Author(s):  
Xiao-Yu Chen ◽  
Li-Zhen Jiang ◽  
Zhu-An Xu

A Multipartite entangled state has many different kinds of entanglements specified by the number of partitions. The most essential example of multipartite entanglement is the entanglement of multi-qubit Greenberger–Horne–Zeilinger (GHZ) state in white noise. We explicitly construct the entanglement witnesses for these states with stabilizer generators of the GHZ states. For an [Formula: see text] qubit GHZ state in white noise, we demonstrate the necessary and sufficient criterion of separability when it is divided into [Formula: see text] parties with [Formula: see text] for arbitrary [Formula: see text] and [Formula: see text]. The criterion covers more than a half of all kinds of partial entanglements for [Formula: see text]-qubit GHZ states in white noise. For the rest of multipartite entanglement problems, we present a method to obtain the sufficient conditions of separability. As an application, we consider [Formula: see text] qubit GHZ state as a codeword of the degenerate quantum code passing through depolarizing channel. We find that the output state is neither genuinely entangled nor fully separable when the quantum channel capacity reduces from positive to zero.


2020 ◽  
Vol 34 (08) ◽  
pp. 2050059 ◽  
Author(s):  
Duc Manh Nguyen ◽  
Sunghwan Kim

In this research, we propose a novel construction of quantum stabilizer code based on a binary formalism. First, from any binary vector of even length, we generate the parity-check matrix of the quantum code from a set composed of elements from this vector and its relations by shifts via subtraction and addition. We prove that the proposed matrices satisfy the condition constraint for the construction of quantum codes. Finally, we consider some constraint vectors which give us quantum stabilizer codes with various dimensions and a large minimum distance with code length from six to twelve digits.


2003 ◽  
Vol 5 (3) ◽  
pp. 309-312 ◽  
Author(s):  
Yong Zhang ◽  
Zheng-Wei Zhou ◽  
Bo Yu ◽  
Guang-Can Guo
Keyword(s):  

Sign in / Sign up

Export Citation Format

Share Document