Quantifying State Transfer Strength on Graphs with Involution
- URL: http://arxiv.org/abs/2310.08690v1
- Date: Thu, 12 Oct 2023 19:52:13 GMT
- Title: Quantifying State Transfer Strength on Graphs with Involution
- Authors: Gabor Lippner, Yujia Shi
- Abstract summary: It provides an approach to achieving high-state transfer by strategically selecting energy potentials based on the maximum degrees of the graphs.
The study also involves an analysis of the time necessary for quantum transfer to occur.
- Score: 0.4662017507844857
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: This paper discusses continuous-time quantum walks and asymptotic state
transfer in graphs with an involution. By providing quantitative bounds on the
eigenvectors of the Hamiltonian, it provides an approach to achieving
high-fidelity state transfer by strategically selecting energy potentials based
on the maximum degrees of the graphs. The study also involves an analysis of
the time necessary for quantum transfer to occur.
Related papers
- Universal scaling of quantum state transport in one-dimensional topological chain under nonadiabatic dynamics [4.9347081318119015]
We study the scaling of quantum state transport in a one-dimensional topological system subject to a linear drive.
We illustrate the power-law dependencies of the quantum state's transport distance, width, and peak magnitude on the driving velocity.
arXiv Detail & Related papers (2024-06-26T02:08:28Z) - Thermalization and Criticality on an Analog-Digital Quantum Simulator [133.58336306417294]
We present a quantum simulator comprising 69 superconducting qubits which supports both universal quantum gates and high-fidelity analog evolution.
We observe signatures of the classical Kosterlitz-Thouless phase transition, as well as strong deviations from Kibble-Zurek scaling predictions.
We digitally prepare the system in pairwise-entangled dimer states and image the transport of energy and vorticity during thermalization.
arXiv Detail & Related papers (2024-05-27T17:40:39Z) - Strong quantum state transfer on graphs via loop edges [0.39462888523270856]
We quantify the effect of weighted loops at the source and target nodes of a graph on the strength of quantum state transfer.
By considering local spectral symmetry, we show that the required weight depends only on the maximum degree of the graph.
arXiv Detail & Related papers (2024-04-01T15:26:38Z) - Unitary equivalence of twisted quantum states [0.0]
We present the time dynamics of twisted quantum states.
We find an explicit connection between the well-known stationary Landau state and an evolving twisted state, even when the Hamiltonian accounts for linear energy dissipation.
arXiv Detail & Related papers (2023-05-10T16:30:53Z) - 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) - High Fidelity Quantum State Transfer by Pontryagin Maximum Principle [68.8204255655161]
We address the problem of maximizing the fidelity in a quantum state transformation process satisfying the Liouville-von Neumann equation.
By introducing fidelity as the performance index, we aim at maximizing the similarity of the final state density operator with the one of the desired target state.
arXiv Detail & Related papers (2022-03-07T13:27:26Z) - Interplay between transport and quantum coherences in free fermionic
systems [58.720142291102135]
We study the quench dynamics in free fermionic systems.
In particular, we identify a function, that we dub emphtransition map, which takes the value of the stationary current as input and gives the value of correlation as output.
arXiv Detail & Related papers (2021-03-24T17:47:53Z) - Transport efficiency of continuous-time quantum walks on graphs [0.0]
Continuous-time quantum walk describes the propagation of a quantum particle evolving continuously in time on a graph.
We investigate the transport properties of graphs with different regularity, symmetry, and connectivity.
arXiv Detail & Related papers (2020-11-27T15:45:26Z) - Approximate quantum fractional revival in paths and cycles [0.0]
We give a complete characterization of approximate fractional revival in a graph in terms of the eigenvalues and eigenvectors of the adjacency matrix of a graph.
This characterization follows from a lemma due to Kronecker on Diophantine approximation, and is similar to the spectral characterization of pretty good state transfer in graphs.
arXiv Detail & Related papers (2020-05-01T17:07:17Z) - Spectra of Perfect State Transfer Hamiltonians on Fractal-Like Graphs [62.997667081978825]
We study the spectral features, on fractal-like graphs, of Hamiltonians which exhibit the special property of perfect quantum state transfer.
The essential goal is to develop the theoretical framework for understanding the interplay between perfect quantum state transfer, spectral properties, and the geometry of the underlying graph.
arXiv Detail & Related papers (2020-03-25T02:46:14Z) - Quantum Statistical Complexity Measure as a Signalling of Correlation
Transitions [55.41644538483948]
We introduce a quantum version for the statistical complexity measure, in the context of quantum information theory, and use it as a signalling function of quantum order-disorder transitions.
We apply our measure to two exactly solvable Hamiltonian models, namely: the $1D$-Quantum Ising Model and the Heisenberg XXZ spin-$1/2$ chain.
We also compute this measure for one-qubit and two-qubit reduced states for the considered models, and analyse its behaviour across its quantum phase transitions for finite system sizes as well as in the thermodynamic limit by using Bethe ansatz.
arXiv Detail & Related papers (2020-02-05T00:45:21Z)
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.