Two-state transfer: a generalization of pair and plus state transfer
- URL: http://arxiv.org/abs/2404.16654v1
- Date: Thu, 25 Apr 2024 14:45:49 GMT
- Title: Two-state transfer: a generalization of pair and plus state transfer
- Authors: Sooyeong Kim, Hermie Monterde, Bahman Ahmadi, Ada Chan, Stephen Kirkland, Sarah Plosker,
- Abstract summary: A two-state in a graph $X$ is a quantum state of the form $mathbfe_u+smathbfe_v$.
We investigate quantum state transfer between two-states, where the Hamiltonian is taken to be the adjacency, Laplacian or signless Laplacian matrix of the graph.
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: In the study of quantum state transfer, one is interested in being able to transmit a quantum state with high fidelity within a quantum spin network. In most of the literature, the state of interest is taken to be associated with a standard basis vector; however, more general states have recently been considered. Here, we consider a general linear combination of two vertex states, which encompasses the definitions of pair states and plus states in connected weighted graphs. A two-state in a graph $X$ is a quantum state of the form $\mathbf{e}_u+s\mathbf{e}_v$, where $u$ and $v$ are two vertices in $X$ and $s$ is a non-zero real number. If $s=-1$ or $s=1$, then such a state is called a pair state or a plus state, respectively. In this paper, we investigate quantum state transfer between two-states, where the Hamiltonian is taken to be the adjacency, Laplacian or signless Laplacian matrix of the graph. By analyzing the spectral properties of the Hamiltonian, we characterize strongly cospectral two-states built from strongly cospectral vertices. This allows us to characterize perfect state transfer (PST) between two-states in complete graphs, cycles and hypercubes. We also produce infinite families of graphs that admit strong cospectrality and PST between two-states that are neither pair nor plus states. Using singular values and singular vectors, we show that vertex PST in the line graph of $X$ implies PST between the plus states formed by corresponding edges in $X$. Furthermore, we provide conditions such that the converse of the previous statement holds. As an application, we characterize strong cospectrality and PST between vertices in line graphs of trees, unicyclic graphs and Cartesian products.
Related papers
- Conformal geometry from entanglement [14.735587711294299]
We identify a quantum information-theoretic mechanism by which the conformal geometry emerges at the gapless edge of a 2+1D quantum many-body system.
We show that stationarity of $mathfrakc_mathrmtot$ is equivalent to a vector fixed-point equation involving $eta$, making our assumption locally checkable.
arXiv Detail & Related papers (2024-04-04T18:00:03Z) - Geometry of degenerate quantum states, configurations of $m$-planes and invariants on complex Grassmannians [55.2480439325792]
We show how to reduce the geometry of degenerate states to the non-abelian connection $A$.
We find independent invariants associated with each triple of subspaces.
Some of them generalize the Berry-Pancharatnam phase, and some do not have analogues for 1-dimensional subspaces.
arXiv Detail & Related papers (2024-04-04T06:39:28Z) - A high-fidelity quantum state transfer algorithm on the complete
bipartite graph [15.305667582809924]
Current quantum state transfer algorithms on the complete bipartite graph suffer from low fidelity in some cases.
We propose a two-stage quantum state transfer algorithm on the complete bipartite graph.
arXiv Detail & Related papers (2023-02-23T11:20:12Z) - Tensor Rank and Other Multipartite Entanglement Measures of Graph States [5.8087716340417765]
Graph states play an important role in quantum information theory through their connection to measurement-based computing and error correction.
We show that several multipartite extensions of bipartite entanglement measures are dichotomous for graph states based on the connectivity of the corresponding graph.
arXiv Detail & Related papers (2022-09-13T21:59:31Z) - Concentration bounds for quantum states and limitations on the QAOA from
polynomial approximations [17.209060627291315]
We prove concentration for the following classes of quantum states: (i) output states of shallow quantum circuits, answering an open question from [DPMRF22]; (ii) injective matrix product states, answering an open question from [DPMRF22]; (iii) output states of dense Hamiltonian evolution, i.e. states of the form $eiota H(p) cdots eiota H(1) |psirangle for any $n$-qubit product state $|psirangle$, where each $H(
arXiv Detail & Related papers (2022-09-06T18:00:02Z) - $n$-qubit states with maximum entanglement across all bipartitions: A
graph state approach [0.0]
We show that a subset of the 'graph states' satisfy this condition, hence providing a recipe for constructing $k$-uniform states.
Finding recipes for construction of $k$-uniform states using graph states is useful since every graph state can be constructed starting from a product state.
arXiv Detail & Related papers (2022-01-14T19:00:09Z) - Quantum state transfer between twins in weighted graphs [0.0]
We explore the role of twin vertices in quantum state transfer.
We provide characterizations of periodicity, perfect state transfer, and pretty good state transfer.
As an application, we provide characterizations of all simple unweighted double cones on regular graphs that exhibit periodicity, perfect state transfer, and pretty good state transfer.
arXiv Detail & Related papers (2022-01-08T01:15:24Z) - Perfect state transfer in Grover walks between states associated to
vertices of a graph [0.0]
We study perfect state transfer in Grover walks, which are typical discrete-time quantum walk models.
We call such states type states.
We derive a necessary condition on eigenvalues of a graph for perfect state transfer between type states to occur.
arXiv Detail & Related papers (2021-09-14T03:59:47Z) - Constructions of $k$-uniform states from mixed orthogonal arrays [18.378398718548016]
We study $k$-uniform states in heterogeneous systems whose local dimensions are mixed.
We present two constructions of $2$-uniform states in heterogeneous systems.
We show that some $k$-uniform bases can not be distinguished by local operations and classical communications.
arXiv Detail & Related papers (2020-06-07T08:35:22Z) - Perfect edge state transfer on cubelike graphs [13.477892615179481]
We show that every bent function, and some semi-bent functions as well, can produce some graphs having PEST.
Notably, using our method, one can obtain some classes of infinite graphs possessing PEST.
arXiv Detail & Related papers (2020-03-24T02:33:32Z) - Perfect State Transfer on Oriented Graphs [0.0]
We study the phenomena, unique to oriented graphs, of multiple state transfer.
We give a characterization of multiple state transfer, and a new example of a graph where it occurs.
arXiv Detail & Related papers (2020-02-11T20:34:54Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.