Reversible computing basically means computation with less or not at all electrical power. Since the standard binary gates are not usually reversible we use the Fredkin gate in order to achieve reversibility. An algorithm for designing reversible digital circuits is described in this paper. The algorithm is based on Multi Expression Programming (MEP), a Genetic Programming variant with a linear...

In many of cryptographic schemes, the most time consuming basic arithmetic operation is the finite field multiplication and its hardware implementation may require millions of logic gates. It is a complex and costly task to develop such large finite field multipliers which will always yield error free outputs. In this effect, this paper considers fault tolerant multiplication in finite fields. ...

We propose an approach to coherently transfer populations between selected quantum states in one- and two-qubit systems by using controllable Stark-chirped rapid adiabatic passages. These evolution-time insensitive transfers, assisted by easily implementable single-qubit phase-shift operations, could serve as elementary logic gates for quantum computing. Specifically, this proposal could be con...

Given Hamming coded or systematic Bose–Chaudhuri-Hocquenghem (BCH) or Reed-Solomon correctable operands x and y and an operation op , we present arithmetic to compute the operation Correct( x )opCorrect(y) while preserving the correct-ability of the result. If the Hamming distance of x(y) from Correct(x) (Correct(y)) is dx (dy, respectively) and the maximal correctable distance is dc then our i...

We present experimental results on two-qubit Rydberg-blockade quantum gates and entanglement in a twodimensional qubit array. Without postselection against atom loss we achieve a Bell state fidelity of 0.73 ± 0.05. The experiments are performed in an array of single Cs atom qubits with a site to site spacing of 3.8 μm. Using the standard protocol for a Rydberg-blockade CZ gate together with sin...

We propose a protocol and physical implementation for partial Bell-state measurements of Fermionic qubits, allowing for deterministic quantum computing in solid-state systems without the need for two-qubit gates. Our scheme consists of two spin qubits in a double quantum dot where the two dots have different Zeeman splittings and resonant tunneling between the dots is only allowed when the spin...

The field of quantum computing is based on the laws of quantum mechanics, including states superposition and entanglement. Quantum cryptography is amongst the most surprising applications of quantum mechanics in quantum information processing. Remote state preparation allows a known state to a sender to be remotely prepared at a receiver’s location when they prior share entanglement and transmi...

We introduce a scheme for linear optics quantum computation, that makes no use of teleported gates, and requires stable interferometry over only the coherence length of the photons. We achieve a much greater degree of efficiency and a simpler implementation than previous proposals. We follow the "cluster state" measurement based quantum computational approach, and show how cluster states may be...