Quantum walk state transfer on a hypercube
- URL: http://arxiv.org/abs/2302.07581v2
- Date: Mon, 27 Nov 2023 07:01:39 GMT
- Title: Quantum walk state transfer on a hypercube
- Authors: Martin Stefanak and Stanislav Skoupy
- Abstract summary: We investigate state transfer on a hypercube by means of a quantum walk where the sender and the receiver vertices are marked by a weighted loops.
We show that one can tune the weight of the loop to achieve state transfer with high fidelity in shorter run-time.
- Score: 0.0
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: We investigate state transfer on a hypercube by means of a quantum walk where
the sender and the receiver vertices are marked by a weighted loops. First, we
analyze search for a single marked vertex, which can be used for state transfer
between arbitrary vertices by switching the weighted loop from the sender to
the receiver after one run-time. Next, state transfer between antipodal
vertices is considered. We show that one can tune the weight of the loop to
achieve state transfer with high fidelity in shorter run-time in comparison to
the state transfer with a switch. Finally, we investigate state transfer
between vertices of arbitrary distance. It is shown that when the distance
between the sender and the receiver is at least 2, the results derived for the
antipodes are well applicable. If the sender and the receiver are direct
neighbours the evolution follows a slightly different course. Nevertheless,
state transfer with high fidelity is achieved in the same run-time.
Related papers
- 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) - Pretty good state transfer among large sets of vertices [0.0]
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.
arXiv Detail & Related papers (2023-05-23T17:24:14Z) - Measurement-Induced State Transitions in a Superconducting Qubit: Within
the Rotating Wave Approximation [33.65845920594661]
We study resonant transitions between levels in the coupled qubit-resonator system that exhibit noisy behavior when measured repeatedly in time.
Our results suggest the transmon is excited to levels near the top of its cosine potential following a state transition.
arXiv Detail & Related papers (2022-12-09T19:48:55Z) - Quantum walk based state transfer algorithms on the complete M-partite
graph [0.0]
We investigate coined quantum walk search and state transfer algorithms, focusing on the complete $M$-partite graph with $N$ vertices in each partition.
We show that when the sender and the receiver are in different partitions the algorithm succeeds with fidelity approaching unity for a large graph.
However, when the sender and the receiver are in the same partition the fidelity does not reach exactly one.
arXiv Detail & Related papers (2022-12-01T14:52:49Z) - Exact solution of a family of staggered Heisenberg chains with
conclusive pretty good quantum state transfer [68.8204255655161]
We work out the exact solutions in the one-excitation subspace.
We present numerical evidence that pretty good transmission is achieved by chains whose length is not a power of two.
arXiv Detail & Related papers (2022-06-28T18:31:09Z) - Feedback-assisted quantum search by continuous-time quantum walks [58.720142291102135]
We address the quantum search of a target node on a cycle graph by means of a quantum walk assisted by continuous measurement and feedback.
In particular, our protocol is able to drive the walker to a desired target node.
arXiv Detail & Related papers (2022-01-12T16:59:53Z) - High-fidelity state transfer via quantum walks from delocalized states [0.0]
We study the state transfer through quantum walks placed on a bounded one-dimensional path.
We find such a state when superposing centered on the starting and antipodal positions preserves a high fidelity for a long time.
We also explore discrete-time quantum walks to evaluate the qubit fidelity throughout the walk.
arXiv Detail & Related papers (2021-12-07T00:17:46Z) - Quantum state transfer on the complete bipartite graph [0.0]
We show that it is still possible to achieve state transfer with high fidelity even when the sender and receiver are in different partitions with different sizes.
It is also possible to use an active switch approach using lackadaisical quantum walks.
arXiv Detail & Related papers (2021-11-25T18:02:34Z) - Pretty good quantum state transfer on isotropic and anisotropic
Heisenberg spin chains with tailored site dependent exchange couplings [68.8204255655161]
We consider chains with isotropic and anisotropic Heisenberg Hamiltonian with up to 100 spins.
We consider short transferred times, in particular shorter than those achievable with known time-dependent control schemes.
arXiv Detail & Related papers (2021-01-08T19:32:10Z) - Quantum Broadcast Channels with Cooperating Decoders: An
Information-Theoretic Perspective on Quantum Repeaters [78.7611537027573]
Communication over a quantum broadcast channel with cooperation between the receivers is considered.
We develop lower and upper bounds on the capacity region in each setting.
arXiv Detail & Related papers (2020-11-18T11:58:48Z) - Stable transmission of high-dimensional quantum states over a 2 km
multicore fiber [45.82374977939355]
We prove how path encoded high-dimensional quantum states can be reliably transmitted over a 2 km long multicore fiber.
We take advantage of a phase-locked loop system guaranteeing a stable interferometric detection.
arXiv Detail & Related papers (2020-01-30T09:19:36Z)
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.