arXiv subjects
Publications and source records attributed to V. Karimipour.
We show that a Shared Singlet State (SSS) can supersede a Shared Reference Frame (SRF) in certain quantum communication tasks, i.e. tasks in which two remote players are required to estimate certain parameters of a two particle state sent to them. This shows that task specific value of resources maybe some what different from their common values based on their exchange possibilities.
We show that two parties far apart can use shared entangled states and classical communication to align their coordinate systems with a very high fidelity. Moreover compared with previous methods proposed for such a task, i.e. sending parallel or anti-parallel pairs or groups of spin states, our method has the extra advantages of using single qubit measurements and also being secure, so that third parties do not extract any information about the aligned coordinate system established between the two parties. The latter property is important in many other quantum information protocols in which measurements inevitably play a significant role.
We show that the two dimensional Ising model is complete, in the sense that the partition function of any lattice model on any graph is equal to the partition function of the 2D Ising model with complex coupling. The latter model has all its spin-spin coupling equal to iπ/4 and all the parameters of the original model are contained in the local magnetic fields of the Ising model. This result has already been derived by using techniques from quantum information theory and by exploiting the universality of cluster states. Here we do not use the quantum formalism and hence make the completeness result accessible to a wide audience. Furthermore our method has the advantage of being algorithmic in nature so that by following a set of simple graphical transformations, one is able to transform any discrete lattice model to an Ising model defined on a (polynomially) larger 2D lattice.
We use the matrix product formalism to find exact ground states of two new spin-1 quantum chains with nearest neighbor interactions. One of the models, model I, describes a one-parameter family of quantum chains for which the ground state can be found exactly. In certain limit of the parameter, the Hamiltonian turns into the interesting case $H=\sum_i ({\bf S}_i\cdot {\bf S}_{i+1})^2$. The other model which we label as model II, corresponds to a family of solvable three-state vertex models on square two dimensional lattices. The ground state of this model is highly degenerate and the matrix product states is a generating state of such degenerate states. The simple structure of the matrix product state allows us to determine the properties of degenerate states which are otherwise difficult to determine. For both models we find exact expressions for correlation functions.
We introduce a family of spin-1/2 quantum chains, and show that their exact ground states break the rotational and translational symmetries of the original Hamiltonian. We also show how one can use projection to construct a spin-3/2 quantum chain with nearest neighbor interaction, whose exact ground states break the rotational symmetry of the Hamiltonian. Correlation functions of both models are determined in closed form. Although we confine ourselves to examples, the method can easily be adapted to encompass more general models.
Using the matrix product formalism, we define a multi-parameter family of spin models on one dimensional chains, with nearest and next-nearest neighbor anti-ferromagnetic interaction for which exact analytical expressions can be found for its doubly degenerate ground states. The family of Hamiltonians which we define, depend on 5 continuous parameters and the Majumdar-Ghosh model is a particular point in this parameter space. Like the Majumdar-Ghosh model, the doubly degenerate ground states of our models have a very simple structure, they are the product of entangled states on adjacent sites. In each of these states there is a non-zero staggered magnetization, which vanishes when we take their translation-invariant combination as the new ground states. At the Majumdar-Ghosh point, these entangled states become the spin-singlets pertaining to this model. We will also calculate in closed form the two point correlation functions, both for finite size of the chain and in the thermodynamic limit.
Using the matrix product formalism, we introduce a two parameter family of exactly solvable $xyz$ spin 1/2 Heisenberg chains in magnetic field (with nearest neighbor interactions) and calculate the ground state and correlation functions in compact form. The ground state has a very interesting property: all the pairs of spins are equally entangled with each other. Therefore it is possible to engineer long-range entanglement in experimentally realizable spin systems on the one hand and study more closely quantum phase transition in such systems on the other.
We investigate quantum phase transitions in ladders of spin 1/2 particles by engineering suitable matrix product states for these ladders. We take into account both discrete and continuous symmetries and provide general classes of such models. We also study the behavior of entanglement of different neighboring sites near the transition point and show that quantum phase transitions in these systems are accompanied by divergences in derivatives of entanglement.
We consider a one-parameter family of matrix product states of spin one particles on a periodic chain and study in detail the entanglement properties of such a state. In particular we calculate exactly the entanglement of one site with the rest of the chain, and the entanglement of two distant sites with each other and show that the derivative of both these properties diverge when the parameter $g$ of the states passes through a critical point. Such a point can be called a point of quantum phase transition, since at this point, the character of the matrix product state which is the ground state of a Hamiltonian, changes discontinuously. We also study the finite size effects and show how the entanglement depends on the size of the chain. This later part is relevant to the field of quantum computation where the problem of initial state preparation in finite arrays of qubits or qutrits is important. It is also shown that entanglement of two sites have scaling behavior near the critical point.
We investigate the dynamics of an initially disentangled Gaussian state on a general finite symmetric graph. As concrete examples we obtain properties of this dynamics on mean field graphs of arbitrary sizes. In the same way that chains can be used for transmitting entanglement by their natural dynamics, these graphs can be used to store entanglement. We also consider two kinds of regular polyhedron which show interesting features of entanglement sharing.
We investigate the problem of enhancement of mutual information by encoding classical data into entangled input states of arbitrary length and show that while there is a threshold memory or correlation parameter beyond which entangled states outperform the separable states, resulting in a higher mutual information, this memory threshold increases toward unity as the length of the string increases. These observations imply that encoding classical data into entangled states may not enhance the classical capacity of quantum channels.
We construct a class of quantum channels in arbitrary dimensions for which entanglement improves the performance of the channel. The channels have correlated noise and when the level of correlation passes a critical value we see a sharp transition in the optimal input states (states which minimize the output entropy) from separable to maximally entangled states. We show that for a subclass of channels with some extra conditions, including the examples which we consider, the states which minimize the output entropy are the ones which maximize the mutual information.
In a recent comment, it has been shown that in a quantum secret sharing protocol proposed in [S. Bagherinezhad, V. Karimipour, Phys. Rev. {\bf A}, 67, 044302, (2003)], one of the receivers can cheat by splitting the entanglement of the carrier and intercepting the secret, without being detected. In this reply we show that a simple modification of the protocol prevents the receivers from this kind of cheating.
We determine thermal entanglement in mean field clusters of $N$ spin one-half particles interacting via the anisotropic Heisenberg interaction, with and without external magnetic field. For the $xxx$ cluster in the absence of magnetic field we prove that only the N=2 ferromagnetic cluster shows entanglement. An external magnetic field $B$ can only entangle $xxx$ anti-ferromagnetic clusters in certain regions of the $B-T$ plane. On the other hand, the $xxz$ clusters of size $N>2$ are entangled only when the interaction is ferromagnetic. Detailed dependence of the entanglement on various parameters is investigated in each case.
In a recent comment \cite{ch1} it has been claimed that an entangled-based quantum key distribution protocol proposed in \cite{zhang} and its generalization to d-level systems in \cite{v1} are insecure against an attack devised by the authors of the comment. We invalidate the arguments of the comment and show that the protocols are still secure.
Let an EPR source which generates maximally entangled pairs be located so that it has distances $L_1$ and $L_2$ to two users. After taking into account various effects like loss of photons, deficiencies in the source and detectors, an entangled pair traveling through the channel may loose its perfect correlation due to errors in the channel. How the entanglement of the received pair depends on the above distances and the local properties of the channels used for this transmission? What is the best location of the source if we want to achieve the highest fidelity? What is the threshold distance beyond which the entanglement of the pair vanishes and becomes useless for using in teleportation. We discuss these problems for the Pauli channel which simulates the effect of optical fibers and possibly the atmosphere on the polarization-entangled photons.
We find exact solutions for a universal set of quantum gates on a scalable candidate for quantum computers, namely an array of two level systems. The gates are constructed by a combination of dynamical and geometrical (non-Abelian) phases. Previously these gates have been constructed mostly on non-scalable systems and by numerical searches among the loops in the manifold of control parameters of the Hamiltonian.
We show that the criticism of a recent comment \cite{ch2} on the insecurity of a quantum secret sharing protocol proposed in \cite{v2} is based on a misconception about the meaning of security and hence is invalid. The same misconception also appears in another comment of the authors \cite{ch1} on the security of an entangled-based quantum key distribution protocol \cite{zhang,v1}.