We exploit a ferromagnetic chain of interacting $d$-level ($d>2$) particles for arbitrary perfect transfer of quantum states with $(d-1)$ levels. The presence of one extra degree of freedom in the Hilbert space of particles, which is not used in encoding, allows to achieve perfect transfer even in a uniform chain through a repeated measurement procedure with consecutive single site measurements. Apart from the first iteration, for which the time of evolution grows linearly with the size of the chain, in all other iterations, the evolution times are short and does not scale with the length. The success probability of the mechanism grows with the number of repetitions and practically after a few iterations the transfer is accomplished with a high probability.
The natural notion of almost perfect state transfer (APST) is examined. It is applied to the modelling of efficient quantum wires with the help of $XX$ spin chains. It is shown that APST occurs in mirror-symmetric systems, when the 1-excitation energies of the chains are linearly independent over rational numbers. This result is obtained as a corollary of the Kronecker theorem in Diophantine approximation. APST happens under much less restrictive conditions than perfect state transfer (PST) and moreover accommodates the unavoidable imperfections. Some examples are discussed.
We suggest a protocol for perfect quantum communication through spin chain channels. By combining a dual-rail encoding with measurements only at the receiving end, we can get conclusively perfect state transfer, whose probability of success can be made arbitrarily close to unity. As an example of such an amplitude delaying channel, we show how two parallel Heisenberg spin chains can be used as quantum wires. Perfect state transfer with a probability of failure lower than P in a Heisenberg chain of N spin-1/2 particles can be achieved in a timescale of the order of N^1.7|ln(P)|. We demonstrate …
A recent numerical study of short chains found near-perfect quantum state transfer between the boundary sites of a spin-1/2 XX chain if a sufficiently strong magnetic field acts on these sites. We show that the phenomenon is based on a pair of states strongly localized at the boundaries of the system and provide a simple quantitative analytical explanation.
We suggest a scheme that allows arbitrarily perfect state transfer even in the presence of random fluctuations in the couplings of a quantum chain. The scheme performs well for both spatially correlated and uncorrelated fluctuations if they are relatively weak (say 5%). Furthermore, we show that given a quite arbitrary pair of quantum chains, one can check whether it is capable of perfect transfer by only local operations at the ends of the chains, and the system in the middle being a "black box". We argue that unless some specific symmetries are present in the system, it will be capable of pe…
We propose to use ferromagnetic systems for entanglement generation and distribution together with perfect state transfer between distant parties in a qubit chain. The scheme relies on an effective 2-qubit dynamics, realized by leaving two empty sites in a uniformly filled chain. This allows long-range interacting qubit chains to serve as quantum channels for both tasks with optimal performances. Remarkably, the entanglement between sender and receiver sites is independent of both the transmission distance and of system size. This property opens new perspectives for short and mid-range quantum…
We present a communication protocol for chains of permanently coupled qubits which achieves perfect quantum state transfer and which is efficient with respect to the number chains employed in the scheme. The system consists of $M$ uncoupled identical quantum chains. Local control (gates, measurements) is only allowed at the sending/receiving end of the chains. Under a quite general hypothesis on the interaction Hamiltonian of the qubits a theorem is proved which shows that the receiver is able to asymptotically recover the messages by repetitive monitoring of his qubits.
We investigate quantum state transfer in XY spin chains and propose a recursive procedure to construct the nonuniform couplings of these chains with arbitrary length to achieve perfect state transfer(PST). We show that this method is capable of finding all possible coupling schemes for PST. These schemes, without external control fields, only involve preengineered couplings but not dynamical control of them, so they can be simply realized experimentally. The analytical solutions provide all information for coupling design.
The three- spin chain with Heisenberg XY- interaction is simulated in a three- qubit nuclear magnetic resonance (NMR) quantum computer. The evolution caused by the XY- interaction is decomposed into a series of single- spin rotations and the $J$- coupling evolutions between the neighboring spins. The perfect state transfer (PST) algorithm proposed by M. Christandl et al [Phys. Rev. Lett, 92, 187902(2004)] is realized in the XY- chain.
We demonstrate that perfect state transfer can be achieved using an engineered spin chain and clean local end-chain operations, without requiring the initialization of the state of the medium nor fine tuning of control-pulses. This considerably relaxes the prerequisites for obtaining reliable transfer of quantum information across interacting-spin systems. Moreover, it allows us to shed light on the interplay among purity, entanglement and operations on a class of many-body systems potentially useful for quantum information processing tasks.
A globally controlled scheme for quantum transport is proposed. The scheme works on a 1D chain of nearest neighbor coupled systems of qudits (finite dimension), or qunats (continuous variable), taking any arbitrary initial quantum state of the chain and producing a final quantum state which is perfectly spatially mirrored about the mid-point of the chain. As a particular novel application, the method can be used to transport continuous variable (CV) quantum states. A physical realization is proposed where it is shown how the quantum states of the microwave fields held in a chain of driven supe…
Quantum information transfer is an important part of quantum information processing. Several proposals for quantum information transfer along linear arrays of nearest-neighbor coupled qubits or spins were made recently. Perfect transfer was shown to exist in two models with specifically designed strongly inhomogeneous couplings. We show that perfect transfer occurs in an entire class of chains, including systems whose nearest-neighbor couplings vary only weakly along the chain. The key to these observations is the Jordan-Wigner mapping of spins to noninteracting lattice fermions which display …
Although a complete picture of the full evolution of complex quantum systems would certainly be the most desirable goal, for particular Quantum Information Processing schemes such an analysis is not necessary. When quantum correlations between only specific elements of a many-body system are required for the performance of a protocol, a more distinguished and specialised investigation is helpful. Here, we provide a striking example with the achievement of perfect state transfer in a spin chain without state initialisation, whose realisation has been shown to be possible in virtue of the correl…
We introduce an analytical $XX$ spin chain with asymmetrical transport properties. It has an even number $N+1$ of sites labeled by $n=0,\cdots N$. It does not exhibit perfect state transfer (PST) from end-to-end but rather from the first site to the next to last one. In fact, PST of one-excitation states takes place between the even sites: $n\leftrightarrow N-n-1$, $n=0,2,\cdots, N-1$; while states localized at a single odd site undergo fractional revival (FR) over odd sites only. Perfect return is witnessed at double the PST/FR time. The couplings and local magnetic fields are related to the …
We present a perfect state transfer protocol via a qubit chain with the evolution governed by the $xx$ Hamiltonian. In contrast to the recent protocol announced in [Phys. Rev. Lett. {\bf 101}, 230502 (2008)], our method does not demand any remote-cooperated initialization and sending classical information about measurement outcomes. We achieve the perfect state transfer only with the assumption of access to two spins at each end of the chain, while the initial state of the whole chain is irrelevant.
We investigate the most general conditions under which a finite ferromagnetic long-range inter- acting spin chain achieves unitary fidelity and the shortest transfer time in transmitting an unknown input qubit. A deeper insight into system dynamics, allows us to identify an ideal system involving sender and receiver only. However, this two-spin ideal chain is unpractical due to the rapid decrease of the coupling strength with the distance. Therefore, we propose an optimization scheme for ap- proaching the ideal behaviour, while keeping the interaction strength still reasonably high. The proced…
Anderson localisation is an important phenomenon arising in many areas of physics, and here we explore it in the context of quantum information devices. Finite dimensional spin chains have been demonstrated to be important devices for quantum information transport, and in particular can be engineered to allow for "perfect state transfer" (PST). Here we present extensive investigations of disordered PST spin chains, demonstrating spatial localisation and transport retardation effects, and relate these effects to conventional Anderson localisation. We provide thresholds for Anderson localisation…
We show how to efficiently send an M-partite entangled state along a spin chain of arbitrary size. Specifically, we show how an entangled M-partite W sate can be almost flawlessly transmitted from one end (Alice) to the other end (Bob) of a spin-1/2 chain described by a slightly modified XX model. We achieve an almost perfect transmission without employing external magnetic fields or modulating the coupling constants among the spins of the chain, the two standard approaches used to achieve a good transmission efficiency. Moreover, the protocol here proposed can be used to transform an M-partit…
A general formalism of the problem of perfect state transfer is presented. We show that there are infinitely many Hamiltonians which may provide solution to this problem. In a first attempt to give a classification of them we investigate their possible forms and the related dynamics during the transfer. Finally, we show how the present formalism can be used for the engineering of perfect quantum wires of various topologies and coupling configurations.
The difficulty of an optimization task in quantum information science depends on the proper mathematical expression of the physical target. Here we demonstrate the power of optimization functionals targeting an arbitrary perfect two-qubit entangler, creating a maximally-entangled state out of some initial product state. For two quantum information platforms of current interest, nitrogen vacancy centers in diamond and superconducting Josephson junctions, we show that an arbitrary perfect entangler can be reached faster and with higher fidelity than specific two-qubit gates or local equivalence …
Certain non-uniformly coupled spin chains can exhibit perfect transfer of quantum states from end to end. Motivated by recent experimental implementations, we extend the simplest such chain to next-to-nearest neighbour (NNN) couplings. It is shown analytically that perfect state transfer can be maintained under the extension and that end-to-end entanglement generation (fractional revival) can occur.
In a one-dimensional Heisenberg chain, we show that there are no sets of coupling strengths such that the evolution perfectly transfers a quantum state between the two ends of the chain without the addition of magnetic fields. In lieu of perfect transfer, we consider a range of options for achieving high quality transfer, whether in finite time, or via "pretty good" transfer where one waits long times in the hope of getting arbitrarily close to perfect transfer. In attempting to engineer arbitrarily accurate transfer, we explore a new paradigm that facilitates time estimates for achieving any …
In this work, we study transfer of coherence matrices along spin-1/2 chains of various length. Unlike higher order coherence matrices, 0-order coherence matrix can be perfectly transferred if its elements are properly fixed. In certain cases, to provide the perfect transfer, an extended receiver together with optimized its unitary transformation has to be included into the protocol. In this work, the asymptotic perfectly transferable 0-order coherence matrix for an infinitely long chain is considered and deviation of a perfectly transferred state from this asymptotic state is studied as a func…
Faithfully transferring the quantum state is essential for quantum information processing. Here we demonstrate a fast (in 84 ns) and high-fidelity (99.2%) transfer of arbitrary quantum states in a chain of four superconducting qubits with nearest-neighbor coupling. This transfer relies on full control of the effective couplings between neighboring qubits, which is realized only by our parametrically modulating the qubits without increasing circuit complexity. Once the couplings between qubits fulfill a specific ratio, perfect quantum state transfer can be achieved in a single step, and is ther…
Optimal control theory is a powerful tool for improving figures of merit in quantum information tasks. Finding the solution to any optimal control problem via numerical optimization depends crucially on the choice of the optimization functional. Here, we derive a functional that targets the full set of two-qubit perfect entanglers, gates capable of creating a maximally-entangled state out of some initial product state. The functional depends on easily-computable local invariants and uniquely determines when a gate evolves into a perfect entangler. Optimization with our functional is most usefu…
We propose a class of qubit networks that admit perfect state transfer of any two-dimensional quantum state in a fixed period of time. We further show that such networks can distribute arbitrary entangled states between two distant parties, and can, by using such systems in parallel, transmit the higher dimensional systems states across the network. Unlike many other schemes for quantum computation and communication, these networks do not require qubit couplings to be switched on and off. When restricted to $N$-qubit spin networks of identical qubit couplings, we show that $2\log_3 N$ is the m…
We consider the perfect transfer of a state between arbitrary nodes of one-dimensional spin-1/2 chain with optimally engineered couplings. Motivated by the fact that such a system could be used as a data bus for connecting multiple quantum processors, we derive two necessary and sufficient conditions that have to be met in order to perfectly transfer a state between any two nodes and we employ them to examine both open and closed geometries. Analytical calculations and numerical optimizations are performed for both cases in order to determine the reachability of certain target states and to pr…
We propose a scheme for using a spin chain with fixed symmetry interaction as a channel for perfect quantum communication. The perfect quantum communication is determined by the eigenvalues that form a special arithmetical progression, the concrete interaction parameter $J_i$ is obtained as a function of integer and perfect transmission time $t_p$. There are infinite choices of $J_i$ for perfect transmission and one can design the channel according to the requirement of $t_p$. This scheme will provide more choices of spin chain for future experiment in quantum communication.
A famously hard graph problem with a broad range of applications is computing the number of perfect matchings, that is the number of unique and complete pairings of the vertices of a graph. We propose a method to estimate the number of perfect matchings of undirected graphs based on the relation between Gaussian Boson Sampling and graph theory. The probability of measuring zero or one photons in each output mode is directly related to the hafnian of the adjacency matrix, and thus to the number of perfect matchings of a graph. We present encodings of the adjacency matrix of a graph into a Gauss…
Perfect state transfer is possible in modulated spin chains, imperfections however are likely to corrupt the state transfer. We study the robustness of this quantum communication protocol in the presence of disorder both in the exchange couplings between the spins and in the local magnetic field. The degradation of the fidelity can be suitably expressed, as a function of the level of imperfection and the length of the chain, in a scaling form. In addition the time signal of fidelity becomes fractal. We further characterize the state transfer by analyzing the spectral properties of the Hamilton…
Dynamics of the one-dimensional open Ising chain under influence of $π$ -pulses is studied. It is shown that the application of a specific sequence of such instant kicks to selective spins stimulates arising of perfect dynamical pairwise entanglement between ends of the spin chain. Analytic formulas for the concurrence dynamics are derived. It is also shown that the time required to perfectly entangle the ends of the chains grows linearly with the number of spins in the chain. The final entangled state of the ending spins is always the same and does not depend on length the chain.
Analogs of Krawtchouk polynomials defined on a bi-lattice are introduced. They are shown to provide a (novel) spin chain with perfect transfer. Their characterization is given as well as their connection to the quadratic Hahn algebra
Spin chains have been proposed as wires to transport information between distributed registers in a quantum information processor. Unfortunately, the challenges in manufacturing linear chains with engineered couplings has hindered experimental implementations. Here we present strategies to achieve perfect quantum information transport in arbitrary spin networks. Our proposal is based on the weak coupling limit for pure state transport, where information is transferred between two end-spins that are only weakly coupled to the rest of the network. This regime allows disregarding the complex, int…
We review the subject of perfect state transfer; how one designs the (fixed) interactions of a chain of spins so that a quantum state, initially inserted on one end of the chain, is perfectly transferred to the opposite end in a fixed time. The perfect state transfer systems are then used as a constructive tool to design Hamiltonian implementations of other primitive protocols such as entanglement generation and signal amplification in measurements, before showing that, in fact, universal quantum computation can be implemented in this way.
A pulse traveling on a uniform nondissipative chain of $N$ masses connected by springs is soon destructured by dispersion. Here it is shown that a proper modulation of the masses and the elastic constants makes it possible to obtain a periodic dynamics and a perfect transmission of any kind of pulse between the chain ends, since the initial configuration evolves to its mirror image in the half period. This makes the chain to behave as a Newton's cradle. By a known algorithm based on orthogonal polynomials one can numerically solve the general inverse problem leading from the spectrum to the dy…
Future quantum computers are likely to be expensive and affordable outright by few, motivating client/server models for outsourced computation. However, the applications for quantum computing will often involve sensitive data, and the client would like to keep her data secret, both from eavesdroppers and the server itself. Homomorphic encryption is an approach for encrypted, outsourced quantum computation, where the client's data remains secret, even during execution of the computation. We present a scheme for the homomorphic encryption of arbitrary quantum states of light with no more than a …
We show that using a slightly modified XX model for a spin-1/2 chain, one can transmit almost perfectly a maximally entangled two-qubit state from one end of the chain to the other one. This is accomplished without external fields or modulation of the coupling constants among the qubits. We also show that this strategy works for any size of the chain and is relatively robust to imperfections in the coupling constants among the qubits belonging to the chain. Actually, under certain scenarios of small disorder, we obtain better results than those predicted by the optimal ordered and noiseless ca…
The notion of perfect correlations between arbitrary observables, or more generally arbitrary POVMs, is introduced in the standard formulation of quantum mechanics, and characterized by several well-established statistical conditions. The transitivity of perfect correlations is proved to generally hold, and applied to a simple articulation for the failure of Hardy's nonlocality proof for maximally entangled states. The notion of perfect correlations between observables and POVMs is used for defining the notion of a precise measurement of a given observable in a given state. A longstanding misc…
The ability to transfer quantum information from one location to another with high fidelity is of central importance to quantum information science. Unfortunately for the simplest system of a uniform chain (a spin chain or a particle in a one-dimensional lattice), the state transfer time grows exponentially in the chain length $N$ at fixed fidelity. In this work we show that the addition of an impurity near each endpoint, coupled to the uniform chain with strength $w$, is sufficient to ensure efficient and high-fidelity state transfer. An eigenstate localized in the vicinity of the impurity ca…
Using a global optimization algorithm we obtain spin chains with site-dependent exchange coefficients which allow almost perfect quantum state transfer between the extremes of the chains without any further time-dependent external control. We consider chains with isotropic and anisotropic Heisenberg Hamiltonian with up to 100 spins. The method allow us to choose the arrival of the transferred state by changing the range available to the exchange coupling strengths. We consider short transferred times, in particular shorter than those achievable with known time-dependent control schemes. The ch…
We study the rectification of spin current in $XXZ$ chains segmented in two parts, each with a different anisotropy parameter. Using exact diagonalization and a matrix product states algorithm we find that a large rectification (of the order of $10^4$) is attainable even using a short chain of $N=8$ spins, when one half of the chain is gapless while the other has large enough anisotropy. We present evidence of diffusive transport when the current is driven in one direction and of a transition to an insulating behavior of the system when driven in the opposite direction, leading to a perfect di…
In this work we provide a recursive method of calculating the wavefunction of a XX spin chain coupled at both ends to non-Markovian reservoirs with arbitrary spectral density. The method is based on the appropriate handling of the time-dependent Schrodinger's equations of motion in Laplace space and leads to closed form solutions of the transformed amplitudes, for arbitrary chain lengths as well as arbitrary initial conditions, within the single-excitation subspace. Results on the dynamical as well as state transfer properties of the system for various combinations of parameters are also prese…
We find analytic models that can perfectly transfer, without state initializati$ or remote collaboration, arbitrary functions in two- and three-dimensional interacting bosonic and fermionic networks. We elaborate on a possible implementation of state transfer through bosonic or fermionic atoms trapped in optical lattices. A significant finding is that the state of a spin qubit can be perfectly transferred through a fermionic system. Families of Hamiltonians, both linear and nonlinear, are described which are related to the linear Boson model and that enable the perfect transfer of arbitrary fu…
Spin chains have been proposed as quantum wires in many quantum information processing architectures. Coherent transmission of quantum information over short distances is enabled by their internal dynamics, which drives the transport of single-spin excitations in perfectly polarized chains. Given the practical challenge of preparing the chain in a pure state, we propose to use a chain that is initially in the maximally mixed state. We compare the transport properties of pure and mixed-state chains, finding similarities that enable the experimental study of pure-state transfer by its simulation…
A uniformly coupled double quantum Hamiltonian for a spin chain has recently been implemented experimentally. We propose a method for the determination of initial quantum states that will provide perfect or near-perfect state transmission for an arbitrary Hamiltonian including this one. By calculating the eigenvalues and eigenvectors of a unitary operator obtained from the free evolution plus an exchange operator, we find that the double quantum Hamiltonian spin chain will support a three-spin initial encoding that will transfer along the chain with remarkably high fidelity. The fidelity is al…
We study the protocol known as quantum state transfer for a strongly coupled antiferromagnetic spin chain or ring (acting as a spin bus), with weakly coupled external qubits. By treating the weak coupling as a perturbation, we find that perfect state transfer (PST) is possible when second order terms are included in the expansion. We also show that PST is robust against variations in the couplings along the spin bus and between the bus and the qubits. As evidence of the quantum interference which mediates PST, we show that the optimal time for PST can be smaller with larger qubit separations, …
We show how to obtain perfect samples from a quantum Gibbs state on a quantum computer. To do so, we adapt one of the `Coupling from the Past'-algorithms proposed by Propp and Wilson. The algorithm has a probabilistic run-time and produces perfect samples without any previous knowledge of the mixing time of a quantum Markov chain. To implement it, we assume we are able to perform the phase estimation algorithm for the underlying Hamiltonian and implement a quantum Markov chain such that the transition probabilities between eigenstates only depend on their energy. We provide some examples of qu…
Quantum communication through spin chains has been extensively investigated. In this scenario, state transfer through linearly arranged spins connected by uniform nearest-neighbor couplings qualifies as a natural choice, with minimal control requirements. However, quantum states usually cannot be perfectly transferred through a uniformly coupled chain due to the dispersion of the chain. Here, we propose an effective quantum control technique to realize almost exact state transfer (AEST) in a quantum spin chain. The strategy is to add a leakage elimination operator (LEO) Hamiltonian to the evol…
We show a perfect state transfer of an arbitrary unknown two-qubit state can be achieved via a discrete-time quantum walk with various settings of coin flippings, and extend this method to distribution of an arbitrary unknown multi-qubit entangled state between every pair of sites in the multi-dimensional network. Furthermore, we study the routing of quantum information on this network in a quantum walk architecture, which can be used as quantum information processors to communicate between separated qubits.
In Phys. Rev. A 74, 030303 (2006), Yung showed that for a one-dimensional spin chain of length $N$ and maximum coupling strength $J_{\max}$, the time $t_0$ for a quantum state to transfer from one end of the chain to another is bounded by $J_{\max} t_0\geqπN/4$ (even $N$) and $J_{\max} t_0\geqπ\sqrt{N^2-1}/4$ (odd $N$). The proof for even $N$ was elegant, but the proof for odd $N$ was less so. This note provides a proof for the odd $N$ case that is simpler, and more in keeping with the proof for the even case.
Superconducting systems such as those modeled by the Kitaev Hamiltonian are found to exhibit the Zitterbewegung (ZB) oscillations. Remarkably, the dispersion relation in one-dimensional Kitaev systems allows for wavepackets of arbitrary size undergoing non-decaying ZB without any distortion, with the typical ZB amplitude being one lattice site. To motivate possible experimental interest in this dynamical aspect of superconducting systems, we further show that certain on-resonance modulation of the Hamiltonian parameter can be exploited to convert ZB oscillations to net drifting of particle's w…
We show how to perfectly transfer, without state initialization and remote collaboration, arbitrary functions in interacting boson lattices. We describe a possible implementation of state transfer through bosonic atoms trapped in optical lattices or polaritons in on-chip coupled cavities. Significantly, a family of Hamiltonians, both linear and nonlinear, is found which are related to the Bose-Hubbard model and that enable the perfect transfer of arbitrary functions. It is shown that the state transfer between two sites in two-dimensional lattices can result in quantum interference due to the …
Quantum recurrence and dynamic localization are investigated in a class of ac-driven tight-binding Hamiltonians, the Krawtchouk quantum chain, which in the undriven case provides a paradigmatic Hamiltonian model that realizes perfect quantum state transfer and mirror inversion. The equivalence between the the ac-driven single-particle Krawtchouk Hamiltonian $\hat{H}(t)$ and the non-interacting ac-driven bosonic junction Hamiltonian enables to determine in a closed form the quasi energy spectrum of $\hat{H}(t)$ and the conditions for exact wave packet reconstruction (dynamic localization). In p…
