32,385 research outputs found
Block synchronization for quantum information
Locating the boundaries of consecutive blocks of quantum information is a
fundamental building block for advanced quantum computation and quantum
communication systems. We develop a coding theoretic method for properly
locating boundaries of quantum information without relying on external
synchronization when block synchronization is lost. The method also protects
qubits from decoherence in a manner similar to conventional quantum
error-correcting codes, seamlessly achieving synchronization recovery and error
correction. A family of quantum codes that are simultaneously synchronizable
and error-correcting is given through this approach.Comment: 7 pages, no figures, final accepted version for publication in
Physical Review
Time synchronization system utilizing moon reflected coded signals Patent
Time synchronization system for synchronizing clocks at remote locations with master clock using moon reflected coded signal
Algebraic techniques in designing quantum synchronizable codes
Quantum synchronizable codes are quantum error-correcting codes that can
correct the effects of quantum noise as well as block synchronization errors.
We improve the previously known general framework for designing quantum
synchronizable codes through more extensive use of the theory of finite fields.
This makes it possible to widen the range of tolerable magnitude of block
synchronization errors while giving mathematical insight into the algebraic
mechanism of synchronization recovery. Also given are families of quantum
synchronizable codes based on punctured Reed-Muller codes and their ambient
spaces.Comment: 9 pages, no figures. The framework presented in this article
supersedes the one given in arXiv:1206.0260 by the first autho
Random digital encryption secure communication system
The design of a secure communication system is described. A product code, formed from two pseudorandom sequences of digital bits, is used to encipher or scramble data prior to transmission. The two pseudorandom sequences are periodically changed at intervals before they have had time to repeat. One of the two sequences is transmitted continuously with the scrambled data for synchronization. In the receiver portion of the system, the incoming signal is compared with one of two locally generated pseudorandom sequences until correspondence between the sequences is obtained. At this time, the two locally generated sequences are formed into a product code which deciphers the data from the incoming signal. Provision is made to ensure synchronization of the transmitting and receiving portions of the system
Selective data segment monitoring system
High speed data monitoring apparatus is described for displaying the bit pattern of a selected portion of a block of transmitted data comprising a shift register for receiving the transmitted data and for temporarily containing the consecutive data bits. A programmable sync detector for monitoring the contents of the shift register and for generating a sync signal when the shift register contains a predetermined sync code is included. A counter is described for counting the data bits input to the shift register after the sync signal is generated and for generating a count complete signal when a selected number of data bits have been input to the register. A data storage device is used for storing the contents of the shift register at the time the count complete signal is generated
Parsing a sequence of qubits
We develop a theoretical framework for frame synchronization, also known as
block synchronization, in the quantum domain which makes it possible to attach
classical and quantum metadata to quantum information over a noisy channel even
when the information source and sink are frame-wise asynchronous. This
eliminates the need of frame synchronization at the hardware level and allows
for parsing qubit sequences during quantum information processing. Our
framework exploits binary constant-weight codes that are self-synchronizing.
Possible applications may include asynchronous quantum communication such as a
self-synchronizing quantum network where one can hop into the channel at any
time, catch the next coming quantum information with a label indicating the
sender, and reply by routing her quantum information with control qubits for
quantum switches all without assuming prior frame synchronization between
users.Comment: 11 pages, 2 figures, 1 table. Final accepted version for publication
in the IEEE Transactions on Information Theor
Quantum Synchronizable Codes From Quadratic Residue Codes and Their Supercodes
Quantum synchronizable codes are quantum error-correcting codes designed to
correct the effects of both quantum noise and block synchronization errors.
While it is known that quantum synchronizable codes can be constructed from
cyclic codes that satisfy special properties, only a few classes of cyclic
codes have been proved to give promising quantum synchronizable codes. In this
paper, using quadratic residue codes and their supercodes, we give a simple
construction for quantum synchronizable codes whose synchronization
capabilities attain the upper bound. The method is applicable to cyclic codes
of prime length
Rapid sync acquisition system Patent
System designed to reduce time required for obtaining synchronization in data communication with spacecraft utilizing pseudonoise code
- …