Realization of a quantum gate using gravitational search algorithm by perturbing three-dimensional harmonic oscillator with an electromagnetic field

The aim of this paper is to design a current source obtained as a representation of p information symbols \(\{I_k\}\) so that the electromagnetic (EM) field generated interacts with a quantum atomic system producing after a fixed duration T a unitary gate U(T) that is as close as possible to a given unitary gate \(U_g\). The design procedure involves calculating the EM field produced by \(\{I_k\}\) and hence the perturbing Hamiltonian produced by \(\{I_k\}\) finally resulting in the evolution operator produced by \(\{I_k\}\) up to cubic order based on the Dyson series expansion. The gate error energy is thus obtained as a cubic polynomial in \(\{I_k\}\) which is minimized using gravitational search algorithm. The signal to noise ratio (SNR) in the designed gate is higher as compared to that using quadratic Dyson series expansion. The SNR is calculated as the ratio of the Frobenius norm square of the desired gate to that of the desired gate error.     

Teleportation of a general two-photon state employing a polarization-entangled $$\chi $$ state with nondemolition parity analyses

Employing a polarization-entangled \(\chi \) state, which is a four-photon genuine entangled state, we propose a protocol teleporting a general two-photon polarization state. Firstly, the sender needs to perform one Controlled-NOT gate, one Hadamard gate, and one Controlled-NOT gate on the state to be teleported in succession. Secondly, the sender performs local nondemolition parity analyses based on cross-Kerr nonlinearities and publicizes the achieved outcomes. Finally, conditioned on the sender’s analysis outcomes, the receiver executes the single-photon unitary transformation operations on his own photons to obtain the state originally sit in the sender’s location. Due to the employment of nondemolition parity analyses rather than four-qubit joint measurement, it can be realized more feasible with currently available technologies. Moreover, the resources of Bell states can be achieved because the nondestructive measurement is exploited, which facilitates other potential tasks of quantum information processing.     

Generation of GHZ states with invariant-based shortcuts

A scheme is proposed to generate three-atom GHZ states by applying the inversely engineered control method on the basis of Lewis–Riesenfeld invariants. In the proposal, three atoms that have different configurations are trapped in a bimodal cavity. Numerical simulations indicate that our protocol has an obvious improvement of speed for the generation of GHZ states. Moreover, the present scheme is robust against both parameter fluctuations and dissipation.     

Quantum image encryption based on generalized affine transform and logistic map

Quantum circuits of the generalized affine transform are devised based on the novel enhanced quantum representation of digital images. A novel quantum image encryption algorithm combining the generalized affine transform with logistic map is suggested. The gray-level information of the quantum image is encrypted by the XOR operation with a key generator controlled by the logistic map, while the position information of the quantum image is encoded by the generalized affine transform. The encryption keys include the independent control parameters used in the generalized affine transform and the logistic map. Thus, the key space is large enough to frustrate the possible brute-force attack. Numerical simulations and analyses indicate that the proposed algorithm is realizable, robust and has a better performance than its classical counterpart in terms of computational complexity.     

Quantum teleportation between a single-rail single-photon qubit and a coherent-state qubit using hybrid entanglement under decoherence effects

We study quantum teleportation between two different types of optical qubits using hybrid entanglement as a quantum channel under decoherence effects. One type of qubit employs the vacuum and single-photon states for the basis, called a single-rail single-photon qubit, and the other utilizes coherent states of opposite phases. We find that teleportation from a single-rail single-photon qubit to a coherent-state qubit is better than the opposite direction in terms of fidelity and success probability. We compare our results with those using a different type of hybrid entanglement between a polarized single-photon qubit and a coherent state.     

Protection of quantum correlations against decoherence

The protection of different quantum correlations, such as Bell nonlocality, quantum discord, and geometric quantum discord as trace distance against noise, is explored. By weak measurement and quantum measurement reversal, we show that the mentioned quantum correlations can be effectively preserved probabilistically from the decoherence due to amplitude damping. The results will play an important role in the experiments using the quantum correlations as resource.     

Quantum walk in terms of quantum Bernoulli noises

Quantum Bernoulli noises are the family of annihilation and creation operators acting on Bernoulli functionals, which satisfy a canonical anti-commutation relation in equal time. In this paper, we first present some new results concerning quantum Bernoulli noises, which themselves are interesting. Then, based on these new results, we construct a time-dependent quantum walk with infinitely many degrees of freedom. We prove that the walk has a unitary representation and hence belongs to the category of the so-called unitary quantum walks. We examine its distribution property at the vacuum initial state and some other initial states and find that it has the same limit distribution as the classical random walk, which contrasts sharply with the case of the usual quantum walks with finite degrees of freedom.     

Adaptive niche quantum-inspired immune clonal algorithm

The adaptive niche quantum-inspired immune clonal algorithm (ANQICA) is proposed by combining the quantum coding, immune clone and niche mechanism together to solve the multi-modal function optimization more effectively and make the function converge to as many as possible extreme value points. The quantum coding can better explore the solution space, the niche mechanism ensures the algorithm to converge to multi-extremum and the adaptive mechanism is introduced according to the characteristics of each procedure of the algorithm to improve the effect of the algorithm. Example analysis shows that the ANQICA is better in exploration and convergence. Therefore, the ANQICA can be used to solve the problem of multi-modal function optimization effectively.     

Pseudo-inversion: closure properties and decidability

We consider a pseudo-inversion operation inspired by biological events, such as DNA sequence transformations, where only parts of a string are reversed. We define the pseudo-inversion of a string \(w = uxv\) to be the set of all strings \(v^Rxu^R\), where \(uv \ne \lambda \) and consider the operation from a formal language theoretic viewpoint. We show that regular languages are closed under the pseudo-inversion operation whereas context-free languages are not. Furthermore, we study the iterated pseudo-inversion operation and show that the iterated pseudo-inversion of a context-free language is recognized by a nondeterministic reversal-bounded multicounter machine. Finally, we introduce the notion of pseudo-inversion-freeness and examine closure properties and decidability problems for regular and context-free languages. We demonstrate that pseudo-inversion-freeness is decidable in polynomial time for regular languages and undecidable for context-free languages.     

Minimal output unstable configurations in chemical reaction networks and deciders

We study the set of output stable configurations of chemical reaction deciders (CRDs). It turns out that CRDs with only bimolecular reactions (which are almost equivalent to population protocols) have a special structure that allows for an algorithm to efficiently compute their finite set of minimal output unstable configurations. As a consequence, a relatively large set of configurations may be efficiently checked for output stability. We also provide a number of observations regarding the semilinearity result of Angluin et al. (Distrib Comput 20(4):279–304, 2007) from the context of population protocols (which is a central result for output stable CRDs). In particular, we observe that the computation-friendly class of totally stable CRDs has equal expressive power as the larger class of output stable CRDs.