6,609 research outputs found
The VLSI design of a single chip Reed-Solomon encoder
A design for a single chip implementation of a Reed-Solomon encoder is presented. The architecture that leads to this single VLSI chip design makes use of a bit serial finite field multiplication algorithm
A VLSI single chip (255,223) Reed-Solomon encoder with interleaver
A single-chip implementation of a Reed-Solomon encoder with interleaving capability is described. The code used was adapted by the CCSDS (Consulative Committee on Space Data Systems). It forms the outer code of the NASA standard concatenated coding system which includes a convolutional inner code of rate 1/2 and constraint length 7. The architecture, leading to this single VLSI chip design, makes use of a bit-serial finite field multiplication algorithm due to E.R. Berlekamp
Entangling capacity of global phases and implications for Deutsch-Jozsa algorithm
We investigate the creation of entanglement by the application of phases
whose value depends on the state of a collection of qubits. First we give the
necessary and sufficient conditions for a given set of phases to result in the
creation of entanglement in a state comprising of an arbitrary number of
qubits. Then we analyze the creation of entanglement between any two qubits in
three qubit pure and mixed states. We use our result to prove that entanglement
is necessary for Deutsch-Jozsa algorithm to have an exponential advantage over
its classical counterpart.Comment: All 8 figures at the en
Experimental study of optimal measurements for quantum state tomography
Quantum tomography is a critically important tool to evaluate quantum
hardware, making it essential to develop optimized measurement strategies that
are both accurate and efficient. We compare a variety of strategies using
nearly pure test states. Those that are informationally complete for all states
are found to be accurate and reliable even in the presence of errors in the
measurements themselves, while those designed to be complete only for pure
states are far more efficient but highly sensitive to such errors. Our results
highlight the unavoidable tradeoffs inherent to quantum tomography.Comment: 5 pages, 3 figure
VLSI architectures for computing multiplications and inverses in GF(2-m)
Finite field arithmetic logic is central in the implementation of Reed-Solomon coders and in some cryptographic algorithms. There is a need for good multiplication and inversion algorithms that are easily realized on VLSI chips. Massey and Omura recently developed a new multiplication algorithm for Galois fields based on a normal basis representation. A pipeline structure is developed to realize the Massey-Omura multiplier in the finite field GF(2m). With the simple squaring property of the normal-basis representation used together with this multiplier, a pipeline architecture is also developed for computing inverse elements in GF(2m). The designs developed for the Massey-Omura multiplier and the computation of inverse elements are regular, simple, expandable and, therefore, naturally suitable for VLSI implementation
Efficient Scheme for Initializing a Quantum Register with an Arbitrary Superposed State
Preparation of a quantum register is an important step in quantum computation
and quantum information processing. It is straightforward to build a simple
quantum state such as |i_1 i_2 ... i_n\ket with being either 0 or 1,
but is a non-trivial task to construct an {\it arbitrary} superposed quantum
state. In this Paper, we present a scheme that can most generally initialize a
quantum register with an arbitrary superposition of basis states.
Implementation of this scheme requires standard 1- and 2-bit gate
operations, {\it without introducing additional quantum bits}. Application of
the scheme in some special cases is discussed.Comment: 4 pages, 4 figures, accepted by Phys. Rev.
Quantum Logic for Trapped Atoms via Molecular Hyperfine Interactions
We study the deterministic entanglement of a pair of neutral atoms trapped in
an optical lattice by coupling to excited-state molecular hyperfine potentials.
Information can be encoded in the ground-state hyperfine levels and processed
by bringing atoms together pair-wise to perform quantum logical operations
through induced electric dipole-dipole interactions. The possibility of
executing both diagonal and exchange type entangling gates is demonstrated for
two three-level atoms and a figure of merit is derived for the fidelity of
entanglement. The fidelity for executing a CPHASE gate is calculated for two
87Rb atoms, including hyperfine structure and finite atomic localization. The
main source of decoherence is spontaneous emission, which can be minimized for
interaction times fast compared to the scattering rate and for sufficiently
separated atomic wavepackets. Additionally, coherent couplings to states
outside the logical basis can be constrained by the state dependent trapping
potential.Comment: Submitted to Physical Review
- …