Perfect state transfer in quantum walks on orientable maps
- URL: http://arxiv.org/abs/2211.12841v1
- Date: Wed, 23 Nov 2022 10:46:33 GMT
- Title: Perfect state transfer in quantum walks on orientable maps
- Authors: Krystal Guo and Vincent Schmeits
- Abstract summary: A discrete-time quantum walk is the quantum analogue of a Markov chain on a graph.
We show that the evolution of a general discrete-time quantum walk that consists of two reflections satisfies a Chebyshev recurrence.
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: A discrete-time quantum walk is the quantum analogue of a Markov chain on a
graph. Zhan [J. Algebraic Combin. 53(4):1187-1213, 2020] proposes a model of
discrete-time quantum walk whose transition matrix is given by two reflections,
using the face and vertex incidence relations of a graph embedded in an
orientable surface. We show that the evolution of a general discrete-time
quantum walk that consists of two reflections satisfies a Chebyshev recurrence,
under a projection. For the vertex-face walk, we prove theorems about perfect
state transfer and periodicity and give infinite families of examples where
these occur. We bring together tools from algebraic and topological graph
theory to analyze the evolution of this walk.
Related papers
- Quantum Random Walks and Quantum Oscillator in an Infinite-Dimensional Phase Space [45.9982965995401]
We consider quantum random walks in an infinite-dimensional phase space constructed using Weyl representation of the coordinate and momentum operators.
We find conditions for their strong continuity and establish properties of their generators.
arXiv Detail & Related papers (2024-06-15T17:39:32Z) - Quantum operations with the time axis in a superposed direction [0.0]
We introduce an expanded concept of matrix transposition, that takes into account general bipartite unitary transformations of a quantum operation's future and past Hilbert spaces.
This framework may have applications in approaches that treat time and space equally like quantum gravity.
arXiv Detail & Related papers (2023-06-05T10:20:59Z) - Geometric phases along quantum trajectories [58.720142291102135]
We study the distribution function of geometric phases in monitored quantum systems.
For the single trajectory exhibiting no quantum jumps, a topological transition in the phase acquired after a cycle.
For the same parameters, the density matrix does not show any interference.
arXiv Detail & Related papers (2023-01-10T22:05:18Z) - Algebraic Compression of Quantum Circuits for Hamiltonian Evolution [52.77024349608834]
Unitary evolution under a time dependent Hamiltonian is a key component of simulation on quantum hardware.
We present an algorithm that compresses the Trotter steps into a single block of quantum gates.
This results in a fixed depth time evolution for certain classes of Hamiltonians.
arXiv Detail & Related papers (2021-08-06T19:38:01Z) - Pretty good state transfer in discrete-time quantum walks [0.0]
We establish the theory for pretty good state transfer in discrete-time quantum walks.
For a class of walks, we show that pretty good state transfer is characterized by the spectrum of certain Hermitian adjacency matrix of the graph.
arXiv Detail & Related papers (2021-05-08T18:55:57Z) - Complete entropic inequalities for quantum Markov chains [17.21921346541951]
We prove that every GNS-symmetric quantum Markov semigroup on a finite dimensional algebra satisfies a modified log-Sobolev inequality.
We also establish the first general approximateization property of relative entropy.
arXiv Detail & Related papers (2021-02-08T11:47:37Z) - Unraveling the topology of dissipative quantum systems [58.720142291102135]
We discuss topology in dissipative quantum systems from the perspective of quantum trajectories.
We show for a broad family of translation-invariant collapse models that the set of dark state-inducing Hamiltonians imposes a nontrivial topological structure on the space of Hamiltonians.
arXiv Detail & Related papers (2020-07-12T11:26:02Z) - Projection Theorem for Discrete-Time Quantum Walks [0.0]
We make and generalize the observation that summing of probability amplitudes of a discrete-time quantum walk over partitions of the walking graph consistent with the step operator results in a unitary evolution on the reduced graph which is also a quantum walk.
We show that this is is the case for a lazy quantum walk, a walk with large coherent jumps and a walk on a circle with a twisted boundary condition.
arXiv Detail & Related papers (2020-04-03T01:51:55Z) - Analysis of Lackadaisical Quantum Walks [0.0]
The lackadaisical quantum walk is a quantum analogue of the lazy random walk obtained by adding a self-loop to each.
We analytically prove that lackadaisical quantum walks can find a unique marked.
vertebrae on any regular locally arc-transitive graph with constant success probability.
quadratically faster than the hitting time.
arXiv Detail & Related papers (2020-02-26T00:40:25Z) - 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) - Discrete-Time Quantum Walks on Oriented Graphs [0.0]
We define discrete-time quantum walks on arbitrary oriented graphs.
We introduce a parameter, called alpha, that quantifies the amount of orientation.
arXiv Detail & Related papers (2020-01-13T01:42:42Z)
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.