Related papers: Designing pretty good state transfer via isospectr…
Graph states are a central resource in measurement-based quantum information processing. In the photonic qubit architecture based on Gottesman-Kitaev-Preskill (GKP) encoding, the generation of high-fidelity graph states composed of…
This paper considers optimization problems over networks where agents have individual objectives to meet, or individual parameter vectors to estimate, subject to subspace constraints that require the objectives across the network to lie in…
Open quantum systems evolving according to discrete-time dynamics are capable, unlike continuous-time counterparts, to converge to a stable equilibrium in finite time with zero error. We consider dissipative quantum circuits consisting of…
Achieving quantum state transfer in passive ways can become a powerful asset for scalable quantum networks. Here, we demonstrate how giant atoms coupled to 1D waveguides provide a platform for such a passive, deterministic transfer.…
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…
In this paper we show that approximation can help reduce the space used for self-stabilization. In the classic \emph{state model}, where the nodes of a network communicate by reading the states of their neighbors, an important measure of…
Quantum state transfer is investigated beyond the nearest-neighbour coupling scheme in long spin-$\frac{1}{2}$ linear chains. Exploiting the properties of the next-nearest neighbour Hamiltonian's dispersion relation, it is shown that with…
In this paper we derive analytical relations between probabilities of the excited state transfers and entanglements calculated by both the Wootters and positive partial transpose (PPT) criteria for the arbitrary spin system with single…
We present a protocol to store a polynomial number of arbitrary bit strings, encoded as spin configurations, in the approximately degenerate low-energy manifold of an all-to-all connected Ising spin glass. The iterative protocol is inspired…
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…
Neural-network quantum states have shown great potential for the study of many-body quantum systems. In statistical machine learning, transfer learning designates protocols reusing features of a machine learning model trained for a problem…
A candidate application for quantum computers is to simulate the low-temperature properties of quantum systems. For this task, there is a well-studied quantum algorithm that performs quantum phase estimation on an initial trial state that…
We study pretty good quantum state transfer (i.e., state transfer that becomes arbitrarily close to perfect) between vertices of graphs with an involution in the presence of an energy potential. In particular, we show that if a graph has an…
Quantum states can be efficiently transferred over a long distance if the entire quantum channel can be divided into several small blocks. We consider a scenario in which each block consists of two copies of a multiparty state -- one is…
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…
Estimating the eigenstate properties of quantum systems is a long-standing, challenging problem for both classical and quantum computing. Existing universal quantum algorithms typically rely on ideal and efficient query models (e.g. time…
The speed limit of quantum state transfer (QST) in a system of interacting particles is not only important for quantum information processing, but also directly linked to Lieb-Robinson-type bounds that are crucial for understanding various…
High-fidelity quantum computation and quantum state transfer are possible in short spin chains. We exploit a system based on a dispersive qubit-boson interaction to mimic XY coupling. In this model, the usually assumed nearest-neighbors…
In this work, quantum state transfer (QST) over binary-tree spin networks is studied by using advantages of partially collapsing measurements. To this aim, we perform initially a weak measurement (WM) on central qubit of the binary-tree…
We explicitate the relation between Hamiltonians for networks of interacting qubits in the XYZ model and graph Laplacians. We then study evolution in networks in which all sites can communicate with each other. These are modeled by the…