No Arabic abstract
We study transfer of a quantum state through XX spin chains with static imperfections. We combine the two standard approaches for state transfer based on (i) modulated couplings between neighboring spins throughout the spin chain and (ii) weak coupling of the outermost spins to an unmodulated spin chain. The combined approach allows us to design spin chains with modulated couplings and localized boundary states, permitting high-fidelity state transfer in the presence of random static imperfections of the couplings. The modulated couplings are explicitly obtained from an exact algorithm using the close relation between tridiagonal matrices and orthogonal polynomials [Linear Algebr. Appl. 21, 245 (1978)]. The implemented algorithm and a graphical user interface for constructing spin chains with boundary states (spinGUIn) are provided as Supplemental Material.
Quantum state propagation over binary tree configurations is studied in the context of quantum spin networks. For binary tree of order two a simple protocol is presented which allows to achieve arbitrary high transfer fidelity. It does not require fine tuning of local fields and two-nodes coupling of the intermediate spins. Instead it assumes simple local operations on the intended receiving node: their role is to brake the transverse symmetry of the network that induces an effective refocusing of the propagating signals. Some ideas on how to scale up these effect to binary tree of arbitrary order are discussed.
We present a matrix product state (MPS) algorithm to approximate ground states of translationally invariant systems with periodic boundary conditions. For a fixed value of the bond dimension D of the MPS, we discuss how to minimize the computational cost to obtain a seemingly optimal MPS approximation to the ground state. In a chain of N sites and correlation length xi, the computational cost formally scales as g(D,xi /N)D^3, where g(D,xi /N) is a nontrivial function. For xi << N, this scaling reduces to D^3, independent of the system size N, making our algorithm N times faster than previous proposals. We apply the method to obtain MPS approximations for the ground states of the critical quantum Ising and Heisenberg spin-1/2 models as well as for the noncritical Heisenberg spin-1 model. In the critical case, for any chain length N, we find a model-dependent bond dimension D(N) above which the polynomial decay of correlations is faithfully reproduced throughout the entire system.
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 in these finite quantum information systems for both the spatial and the transport domains. Finally, we consider the effect of disorder on the eigenstate and energy spectrum of our Hamiltonian, where results support our conclusions on the presence of Anderson localisation.
We derive the optimal analytical quantum-state-transfer control solutions for two disparate quantum memory blocks. Employing the SLH formalism description of quantum network theory, we calculate the full quantum dynamics of system populations, which lead to the optimal solution for the highest quantum fidelity attainable. We show that, for the example where the mechanical modes of two optomechanical oscillators act as the quantum memory blocks, their optical modes and a waveguide channel connecting them can be used to achieve a quantum state transfer fidelity of 96% with realistic parameters using our derived optimal control solution. The effects of the intrinsic losses and the asymmetries in the physical memory parameters are discussed quantitatively.
In the current work we address the problem of quantum process tomography (QPT) in the case of imperfect preparation and measurement of the states which are used for QPT. The fuzzy measurements approach which helps us to efficiently take these imperfections into account is considered. However, to implement such a procedure one should have a detailed information about the errors. An approach for obtaining the partial information about them is proposed. It is based on the tomography of the ideal identity gate. This gate could be implemented by performing the measurement right after the initial state preparation. By using the result of the identity gate tomography we were able to significantly improve further QPT procedures. The proposed approach has been tested experimentally on the IBM superconducting quantum processor. As a result, we have obtained an increase in fidelity from 89% to 98% for Hadamard transformation and from 77% to 95% for CNOT gate.