International Journal of Quantum Information

The class of entangled N-qubit states known as graph states, and the corresponding stabilizer groups of N-qubit Pauli observables, have found a wide range of applications in quantum information processing and the foundations of quantum mechanics. A review of the properties of graph states is given and core spaces of graph states are introduced and discussed. A bonding model of entanglement for generalized graph states is then presented, in which the presence or absence of a bond between two qubits unequivocally specifies whether or not they are entangled. A physical interpretation of these bonds is given, along with a characterization of how they can be created or destroyed by entangling unitary operations and how they can be destroyed by local Pauli measurements. It is shown that local unitary operations do not affect the bond structure of a graph state, and therefore that if two graph states have nonisomorphic bond structures, then local unitary operations and/or reordering of qubits cannot change one into the other. Color multigraphs are introduced to depict the bond structures of graph states and to make some of their properties more apparent.

The pairwise correlations in a multi-qubit state are quantified through a linear variant of relative entropy. In particular, we derive the explicit expressions of total, quantum and classical bipartite correlations. Two different bi-partioning schemes are considered. We discuss the derivation of closest product, quantum–classical and quantum–classical product states. We also investigate the additivity relation between the various pairwise correlations existing in pure and mixed states. As illustration, some special cases are examined.

We report a systematic study of asymptotic behavior of entanglement between the position and coin degrees of freedom for a one-dimensional discrete quantum walk. Effects of coin bias, initial coin asymmetry and phase difference and non-locality of initial position state on the fluctuations and asymptotic value of entanglement are investigated by using Fourier approach. Fluctuations in entropy are found to die out as power law in time as t^-α with α = 1/2,3/2 and 5/2 depending on the initial state parameters of the system.

Mixed state quantum computation can perform certain tasks which are believed to be efficiently intractable on a classical computer. For a specific model of mixed state quantum computation, namely, deterministic quantum computation with a single qubit (DQC1), recent investigations suggest that quantum correlations other than entanglement might be responsible for the power of DQC1 model. However, strictly speaking, the role of entanglement in this model of computation was not entirely clear. We provide conclusive evidence that there are instances where quantum entanglement is not present in any part of this model, nevertheless we have advantage over classical computation. This establishes the fact that quantum dissonance (a kind of quantum correlations) present in fully separable (FS) states provide power to DQC1 model.

This paper offers a theoretical protocol for one-party controlled remote state preparation (RSP) of n-qubit states with minimum resources consumption. We are mainly focused on the case of the n-qubit state chosen from equatorial circle on a Bloch sphere. We use n - 1 EPR pairs and one GHZ state as quantum channel and show that only n + 1 cbits, n ebits and 2n + 1 qubits are consumed during the controlled RSP processing.

Hardy's paradox is of fundamental importance in quantum information theory. So far, there have been two types of its extensions into higher dimensions: in the first type the maximum probability of nonlocal events is roughly 9% and remains the same as the dimension changes (dimension-independent), while in the second type the probability becomes larger as the dimension increases, reaching approximately 40% in the infinite limit. Here, we (i) give an alternative proof of the first type, (ii) study the situation in which the maximum probability of nonlocal events can also be dimension-independent in the second type and (iii) conjecture how the situation could be changed in order that (ii) still holds.

Homogenization proposed in [Y.-C Wu and M. Żukowski, Phys. Rev. A 85 (2012) 022119] is a procedure to transform a tight Bell inequality with partial correlations into a full-correlation form that is also tight. In this paper, we check the homogenizations of two families of n-partite Bell inequalities: the Hardy inequality and the tight Bell inequality without quantum violation. For Hardy's inequalities, their homogenizations bear stronger quantum violation for the maximally entangled state; the tight Bell inequalities without quantum violation give the boundary of quantum and supra-quantum, but their homogenizations do not have the similar properties. We find their homogenization are violated by the maximally entangled state. Numerically computation shows the the domains of quantum violation of homogenized Hardy's inequalities for the generalized GHZ states are smaller than those of Hardy's inequalities.

Let R = F₃ + vF₃ be a finite commutative ring, where v² = 1. It is a finite semi-local ring, not a chain ring. In this paper, we give a construction for quantum codes from cyclic codes over R. We derive self-orthogonal codes over F₃ as Gray images of linear and cyclic codes over R. In particular, we use two codes associated with a cyclic code over R of arbitrary length to determine the parameters of the corresponding quantum code.

In a recent paper, an improvement of quantum sealed-bid auction protocol is proposed by introducing hash function. However, in this comment, it is shown that the improvement brings in other problems which would not complete the task of a sealed-bid auction fairly.