相关论文: Perfect quantum state transfer with randomly coupl…
We describe a protocol for perfectly transferring a quantum state from one party to another under the dynamics of a fixed, engineered Hamiltonian. Our protocol combines the concepts of fractional revival, dual rail encoding, and a rare…
We study perfect state transfer of quantum walks on signed graphs. Our aim is to show that negative edges are useful for perfect state transfer. Specific results we prove include: (1) The signed join of a negative 2-clique with any positive…
We propose a new coherent state quantum key distribution protocol that eliminates the need to randomly switch between measurement bases. This protocol provides significantly higher secret key rates with increased bandwidths than previous…
We examine the role that interference plays in quantum state transfer through several types of finite spin chains, including chains with isotropic Heisenberg interaction between nearest neighbors, chains with reduced coupling constants to…
Quantum many-body scars (QMBS) offer a mechanism for weak ergodicity breaking, enabling non-thermal dynamics to persist in a chaotic many-body system. While most studies of QMBS focus on anomalous eigenstate properties or long-lived…
A perfect quantum state transfer(QST) has been shown in an engineered spin chain with "always-on interaction". Here, we consider a more realistic problem for such a protocol, the quantum decoherence induced by a spatially distributed…
In this article we introduce two new perfect simulation algorithms for chains with infinite memory. Both algorithms belong to the coupling of past procedures. The novelty of our approach is that it allows to include unknown states to the…
State transfer is a well-known routine for various systems of spins-$\frac{1}2$. Still, it is not well studied for chains of spins of larger magnitudes. In this contribution we argue that while perfect state transfer may seem unnatural in…
We propose a protocol for perfect state transfer between any pair of vertices in a hypercube. Given a pair of distinct vertices in the hypercube we determine a sub-hypercube that contains the pair of vertices as antipodal vertices. Then a…
We propose a method to improve quantum state transfer in transmission lines. The idea is to localize the information on the last qubit of a transmission line, by dynamically varying the coupling constants between the first and the last pair…
The transport of quantum states is a crucial aspect of information processing systems, facilitating operations such as quantum key distribution and inter-component communication within quantum computers. Most quantum networks rely on…
We investigate the quantum state transfer in a chain of particles satisfying q-deformed oscillators algebra. This general algebraic setting includes the spin chain and the bosonic chain as limiting cases. We study conditions for perfect…
We analyze the transfer of a quantum state between two resonators connected by a superconducting transmission line. Nearly perfect state-transfer efficiency can be achieved by using adjustable couplers and destructive interference to cancel…
It is shown how to perfectly transfer an arbitrary qudit state in interacting boson networks. By defining a family of Hamiltonians related to Bose-Hubbard model, we describe a possible method for state transfer through bosonic atoms trapped…
We investigate several control strategies for the transport of an excitation along a spin chain. We demonstrate that fast, high fidelity transport can be achieved using protocols designed with differentiable programming. Building on this,…
Quantum-state transfer with fidelity higher than 0.99 can be achieved in the ballistic regime of an arbitrarily long one-dimensional chain with uniform nearest-neighbor interaction, except for the two pairs of mirror symmetric extremal…
Quantum state transfer within a quantum computer can be achieved by using a network of qubits, and such a network can be modelled mathematically by a graph. Here, we focus on the corresponding Laplacian matrix, and those graphs for which…
We study the teleportation scheme performed by means of a partially entangled pure state. We found that the information belonging to the quantum channel can be distributed into both the system of the transmitter and the system of the…
The scalability of solid state quantum computation relies on the ability of connecting the qubits to the macroscopic world. Quantum chains can be used as quantum wires to keep regions of external control at a distance. However even in the…
State transfer across discrete quantum networks is one of the elementary tasks of quantum information processing. Its aim is the faithful placement of information into a specific position in the network. However, all physical systems suffer…