Related papers: Quantum State Transfer in Graphs with Tails
We clarify the correspondence between the two approaches to quantum graphs: via quantum adjacency matrices and via quantum relations. We show how the choice of a (possibly non-tracial) weight manifests itself on the quantum relation side…
The problem of reconstructing information on a physical system from data acquired in long sequences of direct (projective) measurements of some simple physical quantities - histories - is analyzed within quantum mechanics; that is, the…
This paper is an introduction to diagrammatic methods for representing quantum processes and quantum computing. We review basic notions for quantum information and quantum computing. We discuss topological diagrams and some issues about…
We show a surprising link between experimental setups to realize high-dimensional multipartite quantum states and Graph Theory. In these setups, the paths of photons are identified such that the photon-source information is never created.…
Quantum networks are important for quantum communication, enabling tasks such as quantum teleportation, quantum key distribution, quantum sensing, and quantum error correction, often utilizing graph states, a specific class of multipartite…
This workshop brought together experts in classical graph theory and quantum information science to explore the intersection of these fields, with a focus on quantum graph states and their applications in computing, networking, and sensing.…
The connection between certain entangled states and graphs has been heavily studied in the context of measurement-based quantum computation as a tool for understanding entanglement. Here we show that this correspondence can be harnessed in…
We consider quantum walks on the cycle in the non-stationary case where the `coin' operation is allowed to change at each time step. We characterize, in algebraic terms, the set of possible state transfers and prove that, as opposed to the…
We formulate and prove a de Finetti representation theorem for finitely exchangeable states of a quantum system consisting of k infinite-dimensional subsystems. The theorem is valid for states that can be written as the partial trace of a…
Quantum state transfer, first introduced by Bose in 2003, is an important physical phenomenon in quantum networks, which plays a vital role in quantum communication and quantum computing. In 2004, Christandl et al. proposed the concept of…
Pretty good state transfer in networks of qubits occurs when a continuous-time quantum walk allows the transmission of a qubit state from one node of the network to another, with fidelity arbitrarily close to 1. We prove that in a…
Distributed quantum communication and quantum computing offer many new opportunities for quantum information processing. Here networks based on highly nonlocal quantum resources with complex entanglement structures have been proposed for…
We give a complete characterization of pretty good state transfer on paths between any pair of vertices with respect to the quantum walk model determined by the XY-Hamiltonian. If $n$ is the length of the path, and the vertices are indexed…
The $\mathcal{Q}$-graph of a graph $G$, denoted by $\mathcal{Q}(G)$, is the graph derived from $G$ by plugging a new vertex to each edge of $G$ and adding a new edge between two new vertices which lie on adjacent edges of $G$. In this…
One of the strengths of quantum information theory is that it can treat quantum states without referring to their particular physical representation. In principle, quantum states can be therefore fully swapped between various quantum…
We consider an exact state transmission, where a density matrix in one information processor A at time $t=0$ is exactly equal to that in another processor B at a later time. We demonstrate that there always exists a complete set of…
Quantum spin networks can be used to transport information between separated registers in a quantum information processor. To find a practical implementation, the strict requirements of ideal models for perfect state transfer need to be…
For a wide set of quantum systems it is demonstrated that the quantum regime can be considered as the transient phase while the final classical statistical regime is a permanent state. A basis where exact matrix decoherence appears for…
We investigate fractional revival in graphs with respect to the adjacency, Laplacian, and signless Laplacian matrices. We observe that, under certain conditions, fractional revival is preserved under graph complementation. Then we establish…
Finite-depth quantum circuits preserve the long-range entanglement structure in quantum states and map between states within a gapped phase. To map between states of different gapped phases, we can use Sequential Quantum Circuits which…