Search

This paper presents a quantum image steganography algorithm based on HSI color space embedding technique. To increase the security of sensitive information, a three-dimensional hyperchaotic system incorporating sinusoidal mapping, Henon mapping, and Cubic mapping using the cascade modulation method is first presented. Additionally, a brand-new steganography algorithm built on the HSI color space embedding method is suggested in this study. The effective pixel information of three channels can be concentrated in one intensity channel by converting color images from RGB to HSI, which decreases the null domain steganography algorithm's time and space complexity. In the meantime, a successful quantum steganography circuit is created. The simulation and numerical analysis results show that the algorithm has good invisibility, security, and robustness. [ABSTRACT FROM AUTHOR]

Due to the fact that many classical numerical methods have not yet mature quantum counterparts, quantum circuit design is very important in quantum image processing. In this paper, using the novel enhanced quantum representation (NEQR) model, an image encryption algorithm based on Feistel structure is carried out in quantum computer by giving the encryption quantum circuits. First, the modified Feistel structure for image encryption is proposed. It is a 128-bit block cipher and requires 16-bit subkeys to encrypt the image, and it is a mixture of Feistel and substitution–permutation network; then, the detailed quantum circuits design of the encryption algorithm are given. Through numerical simulation and analysis, it is verified that the proposed quantum image encryption algorithm is effective and can resist statistical attacks effectively. [ABSTRACT FROM AUTHOR]

A novel quantum steganography scheme is investigated based on efficient embedding algorithm of modified exploiting modification direction in this paper, which embeds two 2 n × 2 n binary images (secret information) into a 2 n × 2 n color image (carrier image). To improve the security of the secret information and enhance the robustness of the proposed scheme, a 2 n × 2 n binary image (secret key) is generated according to the exclusive or operation of two secret images. The secret key acts as the control key of choosing two channels from the carrier image's three channels of R, G and B (i.e., R, G or R, B channels chose as the pixel-group) to hide the secret information. In addition, the effective quantum circuits for investigated quantum steganography scheme are illustrated to better understanding the procedure of embedding algorithm. The experiment results simulated on the classical computer with MATLAB environment, and the numerical analyses demonstrate that the presented algorithm has good performance on imperceptibility and security. [ABSTRACT FROM AUTHOR]

Based on the modified flexible representation of quantum images, a novel quantum image encryption algorithm was proposed in this paper. The encryption process performs Arnold scrambling operation to disturb the quantum image information in spatial domain first. Then, quantum wavelet transforms are employed to decompose the scrambled quantum image into multiscale resolution (i.e., a sequence of subimages) in the frequency domain, which are mainly divided into two parts: the low-frequency component (i.e., the approximation) and high-frequency detail information (i.e., the horizontal details, vertical details and diagonal details in each decomposition level). Following that, Arnold scrambling operations are implemented to encrypt the wavelet coefficients within each subimage in the frequency domain once again. Finally, based on inverse quantum wavelet transforms, the encrypted wavelet coefficients can affect the pixel values of the entire reconstructed quantum images. Due to the fact that all the quantum operations are invertible, the decryption process of the encrypted image is performed in a straightforward manner by reversing all of the quantum operations within quantum image encryption process. The proposed encryption algorithm is simulated on a classical computer with MATLAB environments. Experimental results and numerical analysis indicate that the presented algorithm has a good encrypted effect and high security. [ABSTRACT FROM AUTHOR]

We point out that the main results—the analytic expressions for the Groverian measure of entanglement, in the above mentioned paper are erroneous. The technical mistake of the paper is discussed. It is shown by an explicit example that the formula for calculating the Groverian measure yields $${G(|\psi\rangle)=0}$$ for some entangled states. [ABSTRACT FROM AUTHOR]

This paper is concerned with the feasibility of the classical nearest-neighbor interpolation based on flexible representation of quantum images (FRQI) and novel enhanced quantum representation (NEQR). Firstly, the feasibility of the classical image nearest-neighbor interpolation for quantum images of FRQI and NEQR is proven. Then, by defining the halving operation and by making use of quantum rotation gates, the concrete quantum circuit of the nearest-neighbor interpolation for FRQI is designed for the first time. Furthermore, quantum circuit of the nearest-neighbor interpolation for NEQR is given. The merit of the proposed NEQR circuit lies in their low complexity, which is achieved by utilizing the halving operation and the quantum oracle operator. Finally, in order to further improve the performance of the former circuits, new interpolation circuits for FRQI and NEQR are presented by using Control-NOT gates instead of a halving operation. Simulation results show the effectiveness of the proposed circuits. [ABSTRACT FROM AUTHOR]

Various constraints concerning control fields can be imposed in the realistic implementations of quantum control systems. One of the most important is the restriction on the frequency spectrum of acceptable control parameters. It is important to consider the limitations of experimental equipment when trying to find appropriate control parameters. Therefore, in this paper, we present a general method of obtaining a piecewise-constant controls, which are robust with respect to spectral constraints. We consider here a Heisenberg spin chain; however, the method can be applied to a system with more general interactions. To model experimental restrictions, we apply an ideal low-pass filter to numerically obtained control pulses. The usage of the proposed method has negligible impact on the control quality as opposed to the standard approach, which does not take into account spectral limitations. [ABSTRACT FROM AUTHOR]

Quantum walks subject to decoherence generically suffer the loss of their genuine quantum feature, a quadratically faster spreading compared to classical random walks. This intuitive statement has been verified analytically for certain models and is also supported by numerical studies of a variety of examples. In this paper we analyze the long-time behavior of a particular class of decoherent quantum walks, which, to the best of our knowledge, was only studied at the level of numerical simulations before. We consider a local coin operation which is randomly and independently chosen for each time step and each lattice site and prove that, under rather mild conditions, this leads to classical behavior: With the same scaling as needed for a classical diffusion the position distribution converges to a Gaussian, which is independent of the initial state. Our method is based on non-degenerate perturbation theory and yields an explicit expression for the covariance matrix of the asymptotic Gaussian in terms of the randomness parameters. [ABSTRACT FROM AUTHOR]

We present a quantum-like (QL) model in that contexts (complexes of e.g. mental, social, biological, economic or even political conditions) are represented by complex probability amplitudes. This approach gives the possibility to apply the mathematical quantum formalism to probabilities induced in any domain of science. In our model quantum randomness appears not as irreducible randomness (as it is commonly accepted in conventional quantum mechanics, e.g., by von Neumann and Dirac), but as a consequence of obtaining incomplete information about a system. We pay main attention to the QL description of processing of incomplete information. Our QL model can be useful in cognitive, social and political sciences as well as economics and artificial intelligence. In this paper we consider in a more detail one special application–QL modeling of brain’s functioning. The brain is modeled as a QL-computer. [ABSTRACT FROM AUTHOR]

In this paper, we develop a theory of learning nonlinear input–output maps with fading memory by dissipative quantum systems, as a quantum counterpart of the theory of approximating such maps using classical dynamical systems. The theory identifies the properties required for a class of dissipative quantum systems to be universal, in that any input–output map with fading memory can be approximated arbitrarily closely by an element of this class. We then introduce an example class of dissipative quantum systems that is provably universal. Numerical experiments illustrate that with a small number of qubits, this class can achieve comparable performance to classical learning schemes with a large number of tunable parameters. Further numerical analysis suggests that the exponentially increasing Hilbert space presents a potential resource for dissipative quantum systems to surpass classical learning schemes for input–output maps. [ABSTRACT FROM AUTHOR]

In this paper, a polarization-coding scheme for subcarrier multiplexing quantum key distribution (SCM-QKD) is proposed, in which the overall QKD can be substantially increased by relying on parallel sideband channels. The polarization state of each sideband can be randomly and independently synthesized by controlling the phase difference of subcarriers. We derive the mathematical formulas of quantum bit error rate (QBER). Both the theoretical analysis and the numerical results show that an efficient implementation of BB84 protocol is feasible. By the proposed polarization coding in a parallel QKD system, without relying on dispersion compensation, a 6% performance gain in terms of correct bit rate over the conventional BB84 protocol (i.e., without polarization coding) is obtained. More importantly, the proposed polarization-coding-aided SCM-QKD can help achieve a long-distance QKD with a low QBER. [ABSTRACT FROM AUTHOR]