Pretty good state transfer among large sets of vertices
- URL: http://arxiv.org/abs/2305.14276v1
- Date: Tue, 23 May 2023 17:24:14 GMT
- Title: Pretty good state transfer among large sets of vertices
- Authors: Ada Chan and Peter Sin
- Abstract summary: In a continuous-time quantum walk on a network of qubits, pretty good state transfer is the phenomenon of state transfer between two vertices with fidelity arbitrarily close to 1.
We construct families of graphs to demonstrate that there is no bound on the size of a set of vertices that admit pretty good state transfer between any two vertices of the set.
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: In a continuous-time quantum walk on a network of qubits, pretty good state
transfer is the phenomenon of state transfer between two vertices with fidelity
arbitrarily close to 1. We construct families of graphs to demonstrate that
there is no bound on the size of a set of vertices that admit pretty good state
transfer between any two vertices of the set.
Related papers
- Deterministic generation of a 20-qubit two-dimensional photonic cluster state [87.34681687753141]
We present a device capable of emitting large-scale entangled microwave photonic states in a two dimensional ladder structure.
By interleaving two-qubit gates with controlled photon emission, we generate 2 x n grids of time- and frequency-multiplexed cluster states of itinerant microwave photons.
We measure a signature of localizable entanglement across up to 20 photonic qubits.
arXiv Detail & Related papers (2024-09-10T16:25:24Z) - Quantum Pair State Transfer on Isomorphic Branches [0.0]
The evolution of certain pair states in a quantum network with Heisenberg $XY$ Hamiltonian depends only on the local structure of the network.
All graphs with high fidelity state transfer may be considered as isomorphic branches of the graph underlying a large quantum network to exhibit high fidelity pair state transfer.
arXiv Detail & Related papers (2024-02-11T01:18:10Z) - New results in vertex sedentariness [0.0]
We show that the direct product and join operations preserve the sedentary state of a graph.
We also completely characterize sedentariness in blow-up graphs.
As an application, we determine the conditions in which perfect state transfer, pretty good state transfer and sedentariness occur in complete bipartite graphs and threshold graphs of any order.
arXiv Detail & Related papers (2023-12-31T01:22:06Z) - A Quantum Optimal Control Problem with State Constrained Preserving
Coherence [68.8204255655161]
We consider a three-level $Lambda$-type atom subjected to Markovian decoherence characterized by non-unital decoherence channels.
We formulate the quantum optimal control problem with state constraints where the decoherence level remains within a pre-defined bound.
arXiv Detail & Related papers (2022-03-24T21:31:34Z) - CenGCN: Centralized Convolutional Networks with Vertex Imbalance for
Scale-Free Graphs [38.427695265783726]
We propose a novel centrality-based framework named CenGCN to address the inequality of information.
We present two variants CenGCN_D and CenGCN_E, based on degree centrality and eigenvector centrality, respectively.
Results demonstrate that the two variants significantly outperform state-of-the-art baselines.
arXiv Detail & Related papers (2022-02-16T02:18:16Z) - 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) - Stochastic approximate state conversion for entanglement and general quantum resource theories [41.94295877935867]
An important problem in any quantum resource theory is to determine how quantum states can be converted into each other.
Very few results have been presented on the intermediate regime between probabilistic and approximate transformations.
We show that these bounds imply an upper bound on the rates for various classes of states under probabilistic transformations.
We also show that the deterministic version of the single copy bounds can be applied for drawing limitations on the manipulation of quantum channels.
arXiv Detail & Related papers (2021-11-24T17:29:43Z) - 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) - Quantum Discrimination of Two Noisy Displaced Number States [68.2727599930504]
We first consider the quantum discrimination of two noiseless displaced number states.
We then address the problem of discriminating between two noisy displaced number states.
arXiv Detail & Related papers (2020-12-09T16:56:16Z) - Majorana bound states in topological insulators with hidden Dirac points [25.488181126364186]
We show that well-defined Majorana bound states can be obtained even in materials with hidden Dirac point.
The obtained topological phase diagram allows one to extract precisely the position of the Dirac point in the spectrum.
arXiv Detail & Related papers (2020-04-22T15:04:39Z) - 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.