Abstract: In the field of quantum secure communication, there
is no evaluation that characterizes quantum secure communication
(QSC) protocols in a complete, general manner. The current paper
addresses the problem concerning the lack of such an evaluation
for QSC protocols by introducing an optimality evaluation, which
is expressed as the average over the three main parameters of QSC
protocols: efficiency, security, and practicality. For the efficiency
evaluation, the common expression of this parameter is used, which
incorporates all the classical and quantum resources (bits and qubits)
utilized for transferring a certain amount of information (bits) in a
secure manner. By using criteria approach whether or not certain
criteria are met, an expression for the practicality evaluation is
presented, which accounts for the complexity of the QSC practical
realization. Based on the error rates that the common quantum attacks
(Measurement and resend, Intercept and resend, probe attack, and
entanglement swapping attack) induce, the security evaluation for
a QSC protocol is proposed as the minimum function taken over
the error rates of the mentioned quantum attacks. For the sake of
clarity, an example is presented in order to show how the optimality
is calculated.
Abstract: Quantum gates are the basic building blocks in the
quantum circuits model. These gates can be implemented using
adiabatic or non adiabatic processes. Adiabatic models can be
controlled using auxiliary qubits, whereas non adiabatic models can
be simplified by using one single-shot implementation. In this paper,
the controlled adiabatic evolutions is combined with the single-shot
implementation to obtain quantum gates with controlled non adiabatic
evolutions. This is an important improvement which can speed the
implementation of quantum gates and reduce the errors due to the
long run in the adiabatic model. The robustness of our scheme to
different types of errors is also investigated.
Abstract: A network of coupled stochastic oscillators is
proposed for modeling of a cluster of entangled qubits that is
exploited as a computation resource in one-way quantum
computation schemes. A qubit model has been designed as a
stochastic oscillator formed by a pair of coupled limit cycle
oscillators with chaotically modulated limit cycle radii and
frequencies. The qubit simulates the behavior of electric field of
polarized light beam and adequately imitates the states of two-level
quantum system. A cluster of entangled qubits can be associated
with a beam of polarized light, light polarization degree being
directly related to cluster entanglement degree. Oscillatory network,
imitating qubit cluster, is designed, and system of equations for
network dynamics has been written. The constructions of one-qubit
gates are suggested. Changing of cluster entanglement degree caused
by measurements can be exactly calculated.
Abstract: We propose the use of magneto-optic Kerr effect (MOKE) to realize single-qubit quantum gates. We consider longitudinal and polar MOKE in reflection geometry in which the magnetic field is parallel to both the plane of incidence and surface of the film. MOKE couples incident TE and TM polarized photons and the Hamiltonian that represents this interaction is isomorphic to that of a canonical two-level quantum system. By varying the phase and amplitude of the magnetic field, we can realize Hadamard, NOT, and arbitrary phase-shift single-qubit quantum gates. The principal advantage is operation with magnetically non-transparent materials.
Abstract: Due to the non- intuitive nature of Quantum
algorithms, it becomes difficult for a classically trained person to
efficiently construct new ones. So rather than designing new
algorithms manually, lately, Genetic algorithms (GA) are being
implemented for this purpose. GA is a technique to automatically
solve a problem using principles of Darwinian evolution. This has
been implemented to explore the possibility of evolving an n-qubit
circuit when the circuit matrix has been provided using a set of
single, two and three qubit gates. Using a variable length population
and universal stochastic selection procedure, a number of possible
solution circuits, with different number of gates can be obtained for
the same input matrix during different runs of GA. The given
algorithm has also been successfully implemented to obtain two and
three qubit Boolean circuits using Quantum gates. The results
demonstrate the effectiveness of the GA procedure even when the
search spaces are large.
Abstract: Quantum computation using qubits made of two component Bose-Einstein condensates (BECs) is analyzed. We construct a general framework for quantum algorithms to be executed using the collective states of the BECs. The use of BECs allows for an increase of energy scales via bosonic enhancement, resulting in two qubit gate operations that can be performed at a time reduced by a factor of N, where N is the number of bosons per qubit. We illustrate the scheme by an application to Deutsch-s and Grover-s algorithms, and discuss possible experimental implementations. Decoherence effects are analyzed under both general conditions and for the experimental implementation proposed.
Abstract: Nature conducts its action in a very private manner. To
reveal these actions classical science has done a great effort. But
classical science can experiment only with the things that can be seen
with eyes. Beyond the scope of classical science quantum science
works very well. It is based on some postulates like qubit,
superposition of two states, entanglement, measurement and
evolution of states that are briefly described in the present paper.
One of the applications of quantum computing i.e.
implementation of a novel quantum evolutionary algorithm(QEA) to
automate the time tabling problem of Dayalbagh Educational Institute
(Deemed University) is also presented in this paper. Making a good
timetable is a scheduling problem. It is NP-hard, multi-constrained,
complex and a combinatorial optimization problem. The solution of
this problem cannot be obtained in polynomial time. The QEA uses
genetic operators on the Q-bit as well as updating operator of
quantum gate which is introduced as a variation operator to converge
toward better solutions.