A | B | C | D | E | F | G | H | CH | I | J | K | L | M | N | O | P | Q | R | S | T | U | V | W | X | Y | Z | 0 | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9
This article includes a list of references, related reading, or external links, but its sources remain unclear because it lacks inline citations. (September 2019) |
Quantum block codes are useful in quantum computing and in quantum communications. The encoding circuit for a large block code typically has a high complexity although those for modern codes do have lower complexity.
Quantum convolutional coding theory offers a different paradigm for coding quantum information. The convolutional structure is useful for a quantum communication scenario where a sender possesses a stream of qubits to send to a receiver. The encoding circuit for a quantum convolutional code has a much lower complexity than an encoding circuit needed for a large block code. It also has a repetitive pattern so that the same physical devices or the same routines can manipulate the stream of quantum information.
Quantum convolutional stabilizer codes borrow heavily from the structure of their classical counterparts. Quantum convolutional codes are similar because some of the qubits feed back into a repeated encoding unitary and give the code a memory structure like that of a classical convolutional code. The quantum codes feature online encoding and decoding of qubits. This feature gives quantum convolutional codes both their low encoding and decoding complexity and their ability to correct a larger set of errors than a block code with similar parameters.
Definition
A quantum convolutional stabilizer code acts on a Hilbert space which is a countably infinite tensor product of two-dimensional qubit Hilbert spaces indexed over integers ≥ 0 :
A sequence of Pauli matrices , where
can act on states in . Let denote the set of all Pauli sequences. The support supp of a Pauli sequence is the set of indices of the entries in that are not equal to the identity. The weight of a sequence is the size of its support. The delay del of a sequence is the smallest index for an entry not equal to the identity. The degree deg of a sequence is the largest index for an entry not equal to the identity. E.g., the following Pauli sequence
has support , weight three, delay one, and degree four. A sequence has finite support if its weight is finite. Let denote the set of Pauli sequences with finite support. The following definition for a quantum convolutional code utilizes the set in its description.
A rate -convolutional stabilizer code with is a commuting set of all -qubit shifts of a basic generator set . The basic generator set has Pauli sequences of finite support:
The constraint length of the code is the maximum degree of the generators in . A frame of the code consists of qubits.
A quantum convolutional code admits an equivalent definition in terms of the delay transform or -transform. The -transform captures shifts of the basic generator set . Let us define the -qubit delay operator acting on any Pauli sequence as follows:
We can write repeated applications of as a power of :
Let
Antropológia
Aplikované vedy
Bibliometria
Dejiny vedy
Encyklopédie
Filozofia vedy
Forenzné vedy
Humanitné vedy
Knižničná veda
Kryogenika
Kryptológia
Kulturológia
Literárna veda
Medzidisciplinárne oblasti
Metódy kvantitatívnej analýzy
Metavedy
Metodika
Text je dostupný za podmienok Creative
Commons Attribution/Share-Alike License 3.0 Unported; prípadne za ďalších
podmienok.
Podrobnejšie informácie nájdete na stránke Podmienky
použitia.
www.astronomia.sk | www.biologia.sk | www.botanika.sk | www.dejiny.sk | www.economy.sk | www.elektrotechnika.sk | www.estetika.sk | www.farmakologia.sk | www.filozofia.sk | Fyzika | www.futurologia.sk | www.genetika.sk | www.chemia.sk | www.lingvistika.sk | www.politologia.sk | www.psychologia.sk | www.sexuologia.sk | www.sociologia.sk | www.veda.sk I www.zoologia.sk