Showing papers in "Quantum Information Processing in 2015"
TL;DR: This is one of the first studies of a quantum annealer’s performance on parametrized families of hard problems from a practical domain, exploring two different general mappings of planning problems to quadratic unconstrained binary optimization (QUBO) problems, and applying them to two parametrizated families of plans.
Abstract: We report on a case study in programming an early quantum annealer to attack optimization problems related to operational planning. While a number of studies have looked at the performance of quantum annealers on problems native to their architecture, and others have examined performance of select problems stemming from an application area, ours is one of the first studies of a quantum annealer's performance on parametrized families of hard problems from a practical domain. We explore two different general mappings of planning problems to quadratic unconstrained binary optimization (QUBO) problems, and apply them to two parametrized families of planning problems, navigation-type and scheduling-type. We also examine two more compact, but problem-type specific, mappings to QUBO, one for the navigation-type planning problems and one for the scheduling-type planning problems. We study embedding properties and parameter setting and examine their effect on the efficiency with which the quantum annealer solves these problems. From these results, we derive insights useful for the programming and design of future quantum annealers: problem choice, the mapping used, the properties of the embedding, and the annealing profile all matter, each significantly affecting the performance.
197 citations
TL;DR: Numerical simulations and theoretical analyses demonstrate that the proposed quantum image encryption algorithm with good feasibility and effectiveness has lower computational complexity than its classical counterpart.
Abstract: A quantum realization of the generalized Arnold transform is designed. A novel quantum image encryption algorithm based on generalized Arnold transform and double random-phase encoding is proposed. The pixels are scrambled by the generalized Arnold transform, and the gray-level information of images is encoded by the double random-phase operations. The keys of the encryption algorithm include the independent parameters of coefficients matrix, iterative times and classical binary sequences, and thus, the key space is extremely large. Numerical simulations and theoretical analyses demonstrate that the proposed algorithm with good feasibility and effectiveness has lower computational complexity than its classical counterpart.
194 citations
TL;DR: It is the first time to give the quantum image processing method that changes the size of an image and the quantum strategies developed in this paper initiate the research about quantum image scaling.
Abstract: Although image scaling algorithms in classical image processing have been extensively studied and widely used as basic image transformation methods, the quantum versions do not exist. Therefore, this paper proposes quantum algorithms and circuits to realize the quantum image scaling based on the improved novel enhanced quantum representation (INEQR) for quantum images. It is necessary to use interpolation in image scaling because there is an increase or a decrease in the number of pixels. The interpolation method used in this paper is nearest neighbor which is simple and easy to realize. First, NEQR is improved into INEQR to represent images sized $$2^{n_{1}} \times 2^{n_{2}}$$2n1×2n2. Based on it, quantum circuits for image scaling using nearest neighbor interpolation from $$2^{n_{1}} \times 2^{n_{2}}$$2n1×2n2 to $$2^{m_{1}} \times 2^{m_{2}}$$2m1×2m2 are proposed. It is the first time to give the quantum image processing method that changes the size of an image. The quantum strategies developed in this paper initiate the research about quantum image scaling.
182 citations
TL;DR: A quantum algorithm to scale up quantum images based on nearest-neighbor interpolation with integer scaling ratio is proposed and the novel enhanced quantum representation is improved to the generalized quantum image representation to represent a quantum image with arbitrary size.
Abstract: Quantum image processing is one of the most active fields in quantum computation and quantum information processing. Some concepts of quantum images and transformations have emerged in recent years. This paper proposes a quantum algorithm to scale up quantum images based on nearest-neighbor interpolation with integer scaling ratio. Firstly, the novel enhanced quantum representation is improved to the generalized quantum image representation to represent a quantum image with arbitrary size $$H \times W$$H×W. Then, nearest-neighbor interpolation is used to create new pixels in the enlarged images. Based on them, quantum image scaling up algorithms in the form of circuits are proposed.
117 citations
TL;DR: A quantum feature extraction framework is proposed based on the novel enhanced quantum representation of digital images that bridges the gap between quantum image processing and graph analysis based on quantum mechanics.
Abstract: Quantum image processing has been a hot issue in the last decade. However, the lack of the quantum feature extraction method leads to the limitation of quantum image understanding. In this paper, a quantum feature extraction framework is proposed based on the novel enhanced quantum representation of digital images. Based on the design of quantum image addition and subtraction operations and some quantum image transformations, the feature points could be extracted by comparing and thresholding the gradients of the pixels. Different methods of computing the pixel gradient and different thresholds can be realized under this quantum framework. The feature points extracted from quantum image can be used to construct quantum graph. Our work bridges the gap between quantum image processing and graph analysis based on quantum mechanics.
93 citations
TL;DR: The quantum image Gray-code and bit-plane (GB) scrambling scheme, an entire color space scrambling strategy, is proposed boldly and indicates the particular advantage of GB scrambling in quantum image processing field.
Abstract: With the rapid development of multimedia technology, the image scrambling for information hiding and digital watermarking is crucial. But, in quantum image processing field, the study on image scrambling is still few. Several quantum image scrambling schemes are basically position space scrambling strategies; however, the quantum image scrambling focused on the color space does not exist. Therefore, in this paper, the quantum image Gray-code and bit-plane (GB) scrambling scheme, an entire color space scrambling strategy, is proposed boldly. On the strength of a quantum image representation NEQR, several different quantum scrambling methods using GB knowledge are designed. Not only can they change the histogram distribution of the image dramatically, some designed schemes can almost make the image histogram flush, enhance the anti-attack ability of digital image, but also their cost or complexity is very low. The simulation experiments result also shows a good performance and indicates the particular advantage of GB scrambling in quantum image processing field.
92 citations
TL;DR: This paper studies the quantum image translation (QIT) for the first time to promote the development of quantum image processing and proposes two types of QIT: entire translation and cyclic translation are proposed by giving the quantum translation circuits.
Abstract: Image translation, which maps the position of each picture element into a new position, is a basic image transformation. Although it has been deeply researched and widely used in classical image processing, its quantum version is a vacancy. This paper studies the quantum image translation (QIT) for the first time to promote the development of quantum image processing. Two types of QIT: entire translation and cyclic translation are proposed by giving the quantum translation circuits. The translation in $$X$$X-direction and $$Y$$Y-direction is separable, and the circuits for translating right or left are different.
89 citations
TL;DR: It is shown that a realistic controlled bidirectional remote state preparation is possible using a large class of entangled quantum states having a particular structure.
Abstract: It is shown that a realistic controlled bidirectional remote state preparation is possible using a large class of entangled quantum states having a particular structure. Existing protocols of probabilistic, deterministic and joint remote state preparation are generalized to obtain the corresponding protocols of controlled bidirectional remote state preparation (CBRSP). A general way of incorporating the effects of two well-known noise processes, the amplitude-damping and phase-damping noise, on the probabilistic CBRSP process is studied in detail by considering that noise only affects the travel qubits of the quantum channel used for the probabilistic CBRSP process. Also indicated is how to account for the effect of these noise channels on deterministic and joint remote state CBRSP protocols.
86 citations
TL;DR: It is shown that all the schemes proposed here may be viewed as applications of the concept of quantum cryptographic switch which was recently introduced by some of us and the performances of the proposed protocols as subjected to the amplitude damping and phase damping noise on the channels are discussed.
Abstract: Recently, several aspects of controlled quantum communication (e.g., bidirectional controlled state teleportation, controlled quantum secure direct communication, controlled quantum dialogue, etc.) have been studied using $$n$$n-qubit $$(n\ge 3)$$(n?3) entanglement. Specially, a large number of schemes for bidirectional controlled state teleportation are proposed using $$m$$m-qubit entanglement $$(m\in \{5,6,7\})$$(m?{5,6,7}). Here, we propose a set of protocols to illustrate that it is possible to realize all these tasks related to controlled quantum communication using only Bell states and permutation of particles. As the generation and maintenance of a Bell state is much easier than a multi-partite entanglement, the proposed strategy has a clear advantage over the existing proposals. Further, it is shown that all the schemes proposed here may be viewed as applications of the concept of quantum cryptographic switch which was recently introduced by some of us. The performances of the proposed protocols as subjected to the amplitude damping and phase damping noise on the channels are also discussed.
82 citations
TL;DR: In this paper, two classes of quantum maximum distance-separable (MDS) codes with parameters based on classical constacyclic codes were constructed, and the quantum MDS codes exhibited here have parameters better than the ones available in the literature.
Abstract: Quantum maximum-distance-separable (MDS) codes form an important class of quantum codes It is very hard to construct quantum MDS codes with relatively large minimum distance In this paper, based on classical constacyclic codes, we construct two classes of quantum MDS codes with parameters $$\begin{aligned}{}[[\lambda (q-1),\lambda (q-1)-2d+2,d]]_q \end{aligned}$$[[?(q-1),?(q-1)-2d+2,d]]qwhere $$2\le d\le (q+1)/2+\lambda -1$$2≤d≤(q+1)/2+?-1, and $$q+1=\lambda r$$q+1=?r with $$r$$r even, and $$\begin{aligned}{}[[\lambda (q-1),\lambda (q-1)-2d+2,d]]_q \end{aligned}$$[[?(q-1),?(q-1)-2d+2,d]]qwhere $$2\le d\le (q+1)/2+\lambda /2-1$$2≤d≤(q+1)/2+?/2-1, and $$q+1=\lambda r$$q+1=?r with $$r$$r odd The quantum MDS codes exhibited here have parameters better than the ones available in the literature
81 citations
TL;DR: The main advantage of the quantum version for image segmentation over the classical approach is its speedup and is provided by the special properties of quantum information processing: superposition of states and inherent parallelism.
Abstract: In this paper, we address the field of quantum information processing and analyze the prospects of applying quantum computation concepts to image processing tasks Specifically, we discuss the development of a quantum version for the image segmentation operation This is an important technique that comes up in many image processing applications We consider the threshold-based segmentation and show that a quantum circuit to achieve this operation can be built using a quantum oracle that implements the thresholding function We discuss the circuit implementation of the oracle operator and provide examples of segmenting synthetic and real images The main advantage of the quantum version for image segmentation over the classical approach is its speedup and is provided by the special properties of quantum information processing: superposition of states and inherent parallelism
TL;DR: Based on unitary operations and four-qubit cluster states, a two-party and a three-party quantum key agreement protocols are proposed, respectively, and can resist against both participant and outsider attacks.
Abstract: Based on unitary operations and four-qubit cluster states, a two-party and a three-party quantum key agreement protocols are proposed, respectively, in this paper. The two-party protocol allows that each participant contributes equally to the agreement key by one party performing the unitary operations on two photons of a cluster state and another party performing the delayed measurement on the transformed cluster state. In the three-party scheme, each party can extract the other two parties' secret keys, respectively, encoded in the different photons of the same cluster state by performing the measurement with cluster basis and fairly generates the shared key. The security analysis shows that the two protocols can resist against both participant and outsider attacks. Furthermore, the two protocols also achieve high qubit efficiency.
TL;DR: It is proved that the proposed SQKD protocol is completely robust against joint attacks, and the number of the quantum states sent by Alice and Bob is decreased.
Abstract: In the existing semiquantum key distribution (SQKD) protocols, the both parties must measure qubits in some bases. In this paper, we show that the classical party's measurement capability is not necessary by constructing an SQKD protocol without invoking the classical Alice's measurement capability. In particular, we prove that the proposed SQKD protocol is completely robust against joint attacks. Compared with the existing SQKD protocols, the number of the quantum states sent by Alice and Bob is decreased.
TL;DR: This work investigates the uncertainty principle for two successive projective measurements in terms of Rényi entropy based on a single quantum system and shows that the low bound of the uncertainty relation has better tightness.
Abstract: We investigate the uncertainty principle for two successive projective measurements in terms of Renyi entropy based on a single quantum system. Our results cover a large family of the entropy (including the Shannon entropy) uncertainty relations with a lower optimal bound. We compare our relation with other formulations of the uncertainty principle in two-spin observables measured on a pure quantum state of qubit. It is shown that the low bound of our uncertainty relation has better tightness.
TL;DR: A scheme for a secure message communication network with authentication following the idea in controlled teleportation, where the servers of the network provide the service to prepare the entangled states as quantum channels.
Abstract: We propose a scheme for a secure message communication network with authentication following the idea in controlled teleportation. In this scheme, the servers of the network provide the service to prepare the entangled states as quantum channels. For preventing the eavesdropping, a security checking method is suggested. After the security check, any two users in the network may communicate securely and directly under the control of the servers on the network.
TL;DR: In this paper, a three-party controlled quantum secure direct communication protocol based on GHZ-like state is proposed, where the receiver can obtain the sender's two secret bits under the permission of the controller.
Abstract: In this paper, a three-party controlled quantum secure direct communication protocol based on GHZ-like state is proposed. In this scheme, the receiver can obtain the sender's two secret bits under the permission of the controller. By using entanglement swapping, no qubits carrying secret messages are transmitted. Therefore, if the perfect quantum channel is used, the protocol is completely secure. The motivation behind utilizing GHZ-like state as a quantum channel is that if a qubit is lost in the GHZ-like state, the other two qubits are still entangled. The proposed protocol improves the efficiency of the previous ones.
TL;DR: Neither auxiliary qubits nor two-qubit unitary transformations are required in these schemes, and the success probabilities are independent of the coefficients of the quantum channel, which means that they can reach 100 % for restricted classes of states.
Abstract: We propose two controlled remote state preparation protocols via partially entangled channels. One prepares a single-qubit state, and the other prepares a two-qubit state. Different from other controlled remote state preparation schemes which also utilize partially entangled channels, neither auxiliary qubits nor two-qubit unitary transformations are required in our schemes, and the success probabilities are independent of the coefficients of the quantum channel. The success probabilities are 50 and 25 % for arbitrary single-qubit states and two-qubit states, respectively. We also show that the success probabilities can reach 100 % for restricted classes of states.
TL;DR: A (t, n) threshold quantum secret sharing scheme is proposed, in which the secret is a quantum state, and the dealer encodes the secret through the phase shift operation.
Abstract: A (t, n) threshold quantum secret sharing scheme is proposed, in which the secret is a quantum state, and the dealer encodes the secret through the phase shift operation. The participants perform the phase shift operations on the quantum state according to their private keys, and any t out of the n participants can use the Lagrange interpolation to recover the original quantum state. Compared to the existing schemes, the proposed scheme is simpler and more efficient.
TL;DR: This work proposes a new protocol of bidirectional and asymmetric quantum controlled teleportation, using a maximally eight-qubit entangled state as the quantum channel, and compared the aspects of quantum resource consumption, operation complexity, classical resources consumption, quantum information bits transmitted and efficiency with other schemes.
Abstract: We propose a new protocol of bidirectional and asymmetric quantum controlled teleportation, using a maximally eight-qubit entangled state as the quantum channel We compared the aspects of quantum resource consumption, operation complexity, classical resource consumption, quantum information bits transmitted and efficiency with other schemes
TL;DR: This work constructs many maximal entanglement EAQECCs with very good parameters, including the construction of low-dimensional quaternary codes for all code lengths and higher- dimensional quaternARY codes for short lengths.
Abstract: An entanglement-assisted quantum error-correcting code (EAQECC) is a generalization of standard stabilizer quantum code. Maximal entanglement EAQECCs can achieve the EA-hashing bound asymptotically. In this work, the construction of quaternary zero radical codes is discussed, including the construction of low- dimensional quaternary codes for all code lengths and higher- dimensional quaternary codes for short lengths. Using the obtained quaternary codes, we construct many maximal entanglement EAQECCs with very good parameters. Some of these EAQECCs are optimal codes, and some of them are better than previously known ones. Combining these results with known bounds, we formulate a table of upper and lower bounds on the minimum distance of any maximal entanglement EAQECCs with length up to 20 channel qubits.
TL;DR: This research connects the areas of quantum state sharing and remote state preparation with noisy environment and shows that the secret state can be shared among agents with some information lost.
Abstract: We study quantum state sharing (QSTS) with noisy environment in this paper. As an example, we present a QSTS scheme of a known state whose information is hold by the dealer and then investigate the noisy influence process of the scheme. Taking the amplitude-damping noise and the phase-damping noise as typical noisy channels, we show that the secret state can be shared among agents with some information lost. Our research connects the areas of quantum state sharing and remote state preparation.
TL;DR: A protocol of joint remote state preparation of an equatorial two-qubit pure quantum state using GHZ states, performing projective measurements and appropriate unitary operations is proposed.
Abstract: In this paper, we propose a protocol of joint remote state preparation of an equatorial two-qubit pure quantum state using GHZ states, performing projective measurements and appropriate unitary operations. The probability of success of our scheme is shown to increase if one of the parties holding the partial information transmits the information classically to the receiver.
TL;DR: Two efficient measurement-based schemes for remotely preparing arbitrary three- and four-particle W-class entangled states by utilizing genuine tripartite Greenberg–Horn–Zeilinger-type states as quantum channels are developed.
Abstract: We develop two efficient measurement-based schemes for remotely preparing arbitrary three- and four-particle W-class entangled states by utilizing genuine tripartite Greenberg---Horn---Zeilinger-type states as quantum channels, respectively. Through appropriate local operations and classical communication, the desired states can be faithfully retrieved at the receiver's place with certain probability. Compared with the previously existing schemes, the success probability in current schemes is greatly increased. Moreover, the required classical communication cost is calculated as well. Further, several attractive discussions on the properties of the presented schemes, including the success probability and reducibility, are made. Remarkably, the proposed schemes can be faithfully achieved with unity total success probability when the employed channels are reduced into maximally entangled ones.
TL;DR: It is found that the transitions between Q_{\theta }$$Qθ subdomains occur suddenly, but continuously and smoothly, i.e., nonanalyticity is hidden and can be observed in higher order derivatives of discord function.
Abstract: Quantum discord Q is a function of density matrix elements. The domain of such a function in the case of two-qubit system with X density matrix may consist of three subdomains at most: two ones where the quantum discord is expressed in closed analytical forms ($$Q_{\pi /2}$$Q?/2 and $$Q_0$$Q0) and an intermediate subdomain for which, to extract the quantum discord $$Q_{\theta }$$Q?, it is required to solve numerically a one-dimensional minimization problem to find the optimal measurement angle $$\theta \in (0,\pi /2)$$??(0,?/2). Hence, the quantum discord is given by a piecewise analytical---numerical formula $$Q=\min \{Q_{\pi /2},Q_{\theta },Q_0\}$$Q=min{Q?/2,Q?,Q0}. It is shown that the boundaries between the subdomains consist of bifurcation points. The $$Q_{\theta }$$Q? subdomains are discovered in the dynamical phase flip channel model, in the anisotropic spin systems at thermal equilibrium, and in the heteronuclear dimers in an external magnetic field. We found that the transitions between $$Q_{\theta }$$Q? subdomain and $$Q_{\pi /2}$$Q?/2 and $$Q_0$$Q0 ones occur suddenly, but continuously and smoothly, i.e., nonanalyticity is hidden and can be observed in higher order derivatives of discord function.
TL;DR: This work generalizes the BCJRSP to multidirectional controlled joint remote state preparation by utilizing multi GHZ-type states of multi-qubit as quantum channel and proposes two generalized BC JRSP schemes.
Abstract: Fusing the ideas of bidirectional controlled teleportation and joint remote state preparation, we put forward a protocol for implementing five-party bidirectional controlled joint remote state preparation (BCJRSP) by using an eight-qubit cluster state as quantum channel. It can be shown that two distant senders can simultaneously and deterministically exchange their states with the other senders under the control of the supervisor. In order to extend BCJRSP, we generalize this protocol from five participants to multi participants utilizing two multi-qubit GHZ-type states as channel and propose two generalized BCJRSP schemes. On the other hand, we generalize the BCJRSP to multidirectional controlled joint remote state preparation by utilizing multi GHZ-type states of multi-qubit as quantum channel. By integrating bidirectional quantum teleportation, quantum state sharing and joint remote state preparation, some modified versions are discussed. Only Pauli operations and single-qubit measurements are used in our schemes, so the scheme with five-party is easily realized in physical experiment.
TL;DR: The criterion for bipartite quantum states is effective in detecting several well-known classes of quantum states, and the criterion for two-qudit states requires less local measurements than the one based on mutually unbiased measurements.
Abstract: We study the quantum separability problem by using general symmetric informationally complete measurements and present separability criteria for both $$d$$d-dimensional bipartite and multipartite systems. The criterion for bipartite quantum states is effective in detecting several well-known classes of quantum states. For isotropic states, it becomes both necessary and sufficient. Furthermore, our criteria can be experimentally implemented, and the criterion for two-qudit states requires less local measurements than the one based on mutually unbiased measurements.
TL;DR: The proposed stratagem embeds the watermark image both into the spatial domain and the frequency domain of the multi-channel quantum carrier image, while also providing a quantum measurement-based algorithm to generate an unknown key that is used to protect the color information.
Abstract: Utilizing a stockpile of efficient transformations consisting of channel of interest, channel swapping, and quantum Fourier transforms, a duple watermarking strategy on multi-channel quantum images is proposed. It embeds the watermark image both into the spatial domain and the frequency domain of the multi-channel quantum carrier image, while also providing a quantum measurement-based algorithm to generate an unknown key that is used to protect the color information, which accompanies another key that is mainly used to scramble the spatial content of the watermark image in order to further safeguard the copyright of the carrier image. Simulation-based experiments using a watermark logo and nine building images as watermark image and carrier images, respectively, offer a duple protection for the copyright of carrier images in terms of the visible quality of the watermarked images. The proposed stratagem advances available literature in the quantum watermarking research field and sets the stage for the applications aimed at quantum data protection.
TL;DR: It is proved that the proposed protocol is secure in terms of the user security and the database security and can be implemented in the situation where not all the parties can afford expensive quantum resources and operations.
Abstract: A novel private database query protocol with only one quantum state is proposed. The database owner Bob sends only one quantum state to the user Alice. The proposed protocol combines the idea of semiquantum key distribution and private query. It can be implemented in the situation where not all the parties can afford expensive quantum resources and operations. So our proposal is more practical in use. We also prove that the proposed protocol is secure in terms of the user security and the database security.
TL;DR: This work analyzes the computational power of the first non-abelian anyon system with only integral quantum dimensions and sets up three qutrit computational models, finding a universal gate set for each model.
Abstract: Harnessing non-abelian statistics of anyons to perform quantum computational tasks is getting closer to reality. While the existence of universal anyons by braiding alone such as the Fibonacci anyon is theoretically a possibility, accessible anyons with current technology all belong to a class that is called weakly integral--anyons whose squared quantum dimensions are integers. We analyze the computational power of the first non-abelian anyon system with only integral quantum dimensions--$$D(S_3)$$D(S3), the quantum double of $$S_3$$S3. Since all anyons in $$D(S_3)$$D(S3) have finite images of braid group representations, they cannot be universal for quantum computation by braiding alone. Based on our knowledge of the images of the braid group representations, we set up three qutrit computational models. Supplementing braidings with some measurements and ancillary states, we find a universal gate set for each model.
TL;DR: A quantum fully homomorphic encryption (QFHE) scheme, which permits arbitrary quantum transformation on any encrypted data, is presented and is proved to be perfectly secure.
Abstract: Fully homomorphic encryption enables arbitrary computation on encrypted data without decrypting the data. Here it is studied in the context of quantum information processing. Based on universal quantum circuit, we present a quantum fully homomorphic encryption (QFHE) scheme, which permits arbitrary quantum transformation on any encrypted data. The QFHE scheme is proved to be perfectly secure. In the scheme, the decryption key is different from the encryption key; however, the encryption key cannot be revealed. Moreover, the evaluation algorithm of the scheme is independent of the encryption key, so it is suitable for delegated quantum computing between two parties.