12,719 research outputs found
Programmable networks for quantum algorithms
The implementation of a quantum computer requires the realization of a large
number of N-qubit unitary operations which represent the possible oracles or
which are part of the quantum algorithm. Until now there are no standard ways
to uniformly generate whole classes of N-qubit gates. We have developed a
method to generate arbitrary controlled phase shift operations with a single
network of one-qubit and two-qubit operations. This kind of network can be
adapted to various physical implementations of quantum computing and is
suitable to realize the Deutsch-Jozsa algorithm as well as Grover's search
algorithm.Comment: 4 pages. Accepted version; Journal-ref. adde
Adiabatic Quantum Computation and Deutsch's Algorithm
We show that by a suitable choice of a time dependent Hamiltonian, Deutsch's
algorithm can be implemented by an adiabatic quantum computer. We extend our
analysis to the Deutsch-Jozsa problem and estimate the required running time
for both global and local adiabatic evolutions.Comment: 6 Pages, Revtex. Typos corrected, references added. Published versio
Logic programming as quantum measurement
The emphasis is made on the juxtaposition of (quantum~theorem) proving versus
quantum (theorem~proving). The logical contents of verification of the
statements concerning quantum systems is outlined. The Zittereingang (trembling
input) principle is introduced to enhance the resolution of predicate
satisfiability problem provided the processor is in a position to perform
operations with continuous input. A realization of Zittereingang machine by a
quantum system is suggested.Comment: 11 pages, latex, paper accepted for publication in the International
Journal of Theoretical Physic
A quantitative study of the orientation bias of some edge detector schemes
The evaluation of a particular set of edge detection schemes is described. The results obtained are compared with those obtained from an edge detection scheme using a texture oriented approach. The orientational bias of these schemes is emphasized. Improved qualitative observations are reported and a comparison of the evaluation method with another edge detection evaluation method is presented
On Halting Process of Quantum Turing Machine
We prove that there is no algorithm to tell whether an arbitrarily
constructed Quantum Turing Machine has same time steps for different branches
of computation. We, hence, can not avoid the notion of halting to be
probabilistic in Quantum Turing Machine. Our result suggests that halting
scheme of Quantum Turing Machine and quantum complexity theory based upon the
existing halting scheme sholud be reexamined.Comment: 2 page
Entangled Mixed States and Local Purification
Linden, Massar and Popescu have recently given an optimization argument to
show that a single two-qubit Werner state, or any other mixture of the
maximally entangled Bell states, cannot be purified by local operations and
classical communications. We generalise their result and give a simple
explanation. In particular, we show that no purification scheme using local
operations and classical communications can produce a pure singlet from any
mixed state of two spin-1/2 particles. More generally, no such scheme can
produce a maximally entangled state of any pair of finite-dimensional systems
from a generic mixed state. We also show that the Werner states belong to a
large class of states whose fidelity cannot be increased by such a scheme.Comment: 3 pages, Latex with Revtex. Small clarifications and reference adde
Viterbi decoder node synchronization losses in the Reed-Solomon/Veterbi concatenated channel
The Viterbi decoders currently used by the Deep Space Network (DSN) employ an algorithm for maintaining node synchronization that significantly degrades at bit signal-to-noise ratios (SNRs) of below 2.0 dB. In a recent report by the authors, it was shown that the telemetry receiving system, which uses a convolutionally encoded downlink, will suffer losses of 0.85 dB and 1.25 dB respectively at Voyager 2 Uranus and Neptune encounters. This report extends the results of that study to a concatenated (255,223) Reed-Solomon/(7, 1/2) convolutionally coded channel, by developing a new radio loss model for the concatenated channel. It is shown here that losses due to improper node synchronization of 0.57 dB at Uranus and 1.0 dB at Neptune can be expected if concatenated coding is used along with an array of one 64-meter and three 34-meter antennas
A systolic architecture for the correlation and accumulation of digital sequences
A fully systolic architecture for the implementation of digital sequence correlator/accumulators is described. These devices consist of a two-dimensional array of processing elements that are conceived for efficient fabrication in Very Large Scale Integrated (VLSI) circuits. A custom VLSI chip that was implemented using these concepts is described. The chip, which contains a four-lag three-level sequence correlator and four bits of accumulation with overflow detection, was designed using the Integrated UNIX-Based Computer Aided Design (CAD) System. Applications of such devices include the synchronization of coded telemetry data, alignment of both real time and non-real time Very Large Baseline Interferometry (VLBI) signals, and the implementation of digital filters and processes of many types
Quantum Analogue Computing
We briefly review what a quantum computer is, what it promises to do for us,
and why it is so hard to build one. Among the first applications anticipated to
bear fruit is quantum simulation of quantum systems. While most quantum
computation is an extension of classical digital computation, quantum
simulation differs fundamentally in how the data is encoded in the quantum
computer. To perform a quantum simulation, the Hilbert space of the system to
be simulated is mapped directly onto the Hilbert space of the (logical) qubits
in the quantum computer. This type of direct correspondence is how data is
encoded in a classical analogue computer. There is no binary encoding, and
increasing precision becomes exponentially costly: an extra bit of precision
doubles the size of the computer. This has important consequences for both the
precision and error correction requirements of quantum simulation, and
significant open questions remain about its practicality. It also means that
the quantum version of analogue computers, continuous variable quantum
computers (CVQC) becomes an equally efficient architecture for quantum
simulation. Lessons from past use of classical analogue computers can help us
to build better quantum simulators in future.Comment: 10 pages, to appear in the Visions 2010 issue of Phil. Trans. Roy.
Soc.
Simple scheme for implementing the Deutsch-Jozsa algorithm in thermal cavity
We present a simple scheme to implement the Deutsch-Jozsa algorithm based on
two-atom interaction in a thermal cavity. The photon-number-dependent parts in
the evolution operator are canceled with the strong resonant classical field
added. As a result, our scheme is immune to thermal field, and does not require
the cavity to remain in the vacuum state throughout the procedure. Besides,
large detuning between the atoms and the cavity is not necessary neither,
leading to potential speed up of quantum operation. Finally, we show by
numerical simulation that the proposed scheme is equal to demonstrate the
Deutsch-Jozsa algorithm with high fidelity.Comment: 7 pages, 4 figure
- …