Coherent transport on Apollonian networks and continuous-time quantum walks

We study the coherent exciton transport on Apollonian networks generated by simple iterative rules. The coherent exciton dynamics is modeled by continuous-time quantum walks and we calculate the transition probabilities between two nodes of the networks. We find that the transport depends on the initial nodes of the excitation. For networks less than the second generation the coherent transport shows perfect revivals when the initial excitation starts at the central node. For networks of higher generation, the transport only shows partial revivals. Moreover, we find that the excitation is most likely to be found at the initial nodes while the coherent transport to other nodes has a very low probability. In the long time limit, the transition probabilities show characteristic patterns with identical values of limiting probabilities. Finally, the dynamics of quantum transport are compared with the classical transport modeled by continuous-time random walks.Comment: 5 pages, 6 figues. Submitted to Phys. ReV.

Continuous-time quantum walks on one-dimension regular networks

In this paper, we consider continuous-time quantum walks (CTQWs) on one-dimension ring lattice of N nodes in which every node is connected to its 2m nearest neighbors (m on either side). In the framework of the Bloch function ansatz, we calculate the spacetime transition probabilities between two nodes of the lattice. We find that the transport of CTQWs between two different nodes is faster than that of the classical continuous-time random walk (CTRWs). The transport speed, which is defined by the ratio of the shortest path length and propagating time, increases with the connectivity parameter m for both the CTQWs and CTRWs. For fixed parameter m, the transport of CTRWs gets slow with the increase of the shortest distance while the transport (speed) of CTQWs turns out to be a constant value. In the long time limit, depending on the network size N and connectivity parameter m, the limiting probability distributions of CTQWs show various paterns. When the network size N is an even number, the probability of being at the original node differs from that of being at the opposite node, which also depends on the precise value of parameter m.Comment: Typos corrected and Phys. ReV. E comments considered in this versio

Conditional Quantum Walk and Iterated Quantum Games

Iterated bipartite quantum games are implemented in terms of the discrete-time quantum walk on the line. Our proposal allows for conditional strategies, as two rational agents make a choice from a restricted set of two-qubit unitary operations. Several frequently used classical strategies give rise to families of corresponding quantum strategies. A quantum version of the Prisoner's Dilemma in which both players use mixed strategies is presented as a specific example. Since there are now quantum walk physical implementations at a proof-of principle stage, this connection may represent a step towards the experimental realization of quantum games.Comment: Revtex 4, 6 pages, 3 figures. Expanded version with one more figure and updated references. Abstract was rewritte

Exchange-Only Dynamical Decoupling in the 3-Qubit Decoherence Free Subsystem

The Uhrig dynamical decoupling sequence achieves high-order decoupling of a single system qubit from its dephasing bath through the use of bang-bang Pauli pulses at appropriately timed intervals. High-order decoupling of single and multiple qubit systems from baths causing both dephasing and relaxation can also be achieved through the nested application of Uhrig sequences, again using single-qubit Pauli pulses. For the 3-qubit decoherence free subsystem (DFS) and related subsystem encodings, Pauli pulses are not naturally available operations; instead, exchange interactions provide all required encoded operations. Here we demonstrate that exchange interactions alone can achieve high-order decoupling against general noise in the 3-qubit DFS. We present decoupling sequences for a 3-qubit DFS coupled to classical and quantum baths and evaluate the performance of the sequences through numerical simulations

Cloning transformations in spin networks without external control

In this paper we present an approach to quantum cloning with unmodulated spin networks. The cloner is realized by a proper design of the network and a choice of the coupling between the qubits. We show that in the case of phase covariant cloner the XY coupling gives the best results. In the 1->2 cloning we find that the value for the fidelity of the optimal cloner is achieved, and values comparable to the optimal ones in the general N->M case can be attained. If a suitable set of network symmetries are satisfied, the output fidelity of the clones does not depend on the specific choice of the graph. We show that spin network cloning is robust against the presence of static imperfections. Moreover, in the presence of noise, it outperforms the conventional approach. In this case the fidelity exceeds the corresponding value obtained by quantum gates even for a very small amount of noise. Furthermore we show how to use this method to clone qutrits and qudits. By means of the Heisenberg coupling it is also possible to implement the universal cloner although in this case the fidelity is 10% off that of the optimal cloner.Comment: 12 pages, 13 figures, published versio

Building multiparticle states with teleportation

We describe a protocol which can be used to generate any N-partite pure quantum state using Einstein-Podolsky-Rosen (EPR) pairs. This protocol employs only local operations and classical communication between the N parties (N-LOCC). In particular, we rely on quantum data compression and teleportation to create the desired state. This protocol can be used to obtain upper bounds for the bipartite entanglement of formation of an arbitrary N-partite pure state, in the asymptotic limit of many copies. We apply it to a few multipartite states of interest, showing that in some cases it is not optimal. Generalizations of the protocol are developed which are optimal for some of the examples we consider, but which may still be inefficient for arbitrary states.Comment: 11 pages, 1 figure. Version 2 contains an example for which protocol P3 is better than protocol P2. Correction to references in version

Properties of Entanglement Monotones for Three-Qubit Pure States

Various parameterizations for the orbits under local unitary transformations of three-qubit pure states are analyzed. The interconvertibility, symmetry properties, parameter ranges, calculability and behavior under measurement are looked at. It is shown that the entanglement monotones of any multipartite pure state uniquely determine the orbit of that state under local unitary transformations. It follows that there must be an entanglement monotone for three-qubit pure states which depends on the Kempe invariant defined in [Phys. Rev. A 60, 910 (1999)]. A form for such an entanglement monotone is proposed. A theorem is proved that significantly reduces the number of entanglement monotones that must be looked at to find the maximal probability of transforming one multipartite state to another.Comment: 14 pages, REVTe

Response of Multi-strip Multi-gap Resistive Plate Chamber

A prototype of Multi-strip Multi-gap Resistive Plate chamber (MMRPC) with active area 40 cm $\times$ 20 cm has been developed at SINP, Kolkata. Detailed response of the developed detector was studied with the pulsed electron beam from ELBE at Helmholtz-Zentrum Dresden-Rossendorf. In this report the response of SINP developed MMRPC with different controlling parameters is described in details. The obtained time resolution ($\sigma_t$) of the detector after slew correction was 91.5$\pm$3 ps. Position resolution measured along ($\sigma_x$) and across ($\sigma_y$) the strip was 2.8$\pm$0.6 cm and 0.58 cm, respectively. The measured absolute efficiency of the detector for minimum ionizing particle like electron was 95.8$\pm$1.3 $\%$. Better timing resolution of the detector can be achieved by restricting the events to a single strip. The response of the detector was mainly in avalanche mode but a few percentage of streamer mode response was also observed. A comparison of the response of these two modes with trigger rate was studiedComment: 19 pages, 26 figure

The effect of large-decoherence on mixing-time in Continuous-time quantum walks on long-range interacting cycles

In this paper, we consider decoherence in continuous-time quantum walks on long-range interacting cycles (LRICs), which are the extensions of the cycle graphs. For this purpose, we use Gurvitz's model and assume that every node is monitored by the corresponding point contact induced the decoherence process. Then, we focus on large rates of decoherence and calculate the probability distribution analytically and obtain the lower and upper bounds of the mixing time. Our results prove that the mixing time is proportional to the rate of decoherence and the inverse of the distance parameter (\emph{m}) squared. This shows that the mixing time decreases with increasing the range of interaction. Also, what we obtain for \emph{m}=0 is in agreement with Fedichkin, Solenov and Tamon's results \cite{FST} for cycle, and see that the mixing time of CTQWs on cycle improves with adding interacting edges.Comment: 16 Pages, 2 Figure

Optimal estimation of two-qubit pure-state entanglement

We present optimal measuring strategies for the estimation of the entanglement of unknown two-qubit pure states and of the degree of mixing of unknown single-qubit mixed states, of which N identical copies are available. The most general measuring strategies are considered in both situations, to conclude in the first case that a local, although collective, measurement suffices to estimate entanglement, a non-local property, optimally.Comment: REVTEX, 9 pages, 1 figur