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
- State transfer in discrete-time quantum walks via projected transition matrices [0.0]
We consider state transfer in quantum walks by using methods.
We define peak state transfer as the highest state transfer that could be achieved between an initial and a target state.
arXiv Detail & Related papers (2024-11-08T13:35:27Z) - Search and state transfer between hubs by quantum walks [0.0]
We show that the continuous-time quantum walk allows for perfect state transfer between multiple hubs if the numbers of senders and receivers are close.
We also consider the case of transfer between multiple senders and receivers.
arXiv Detail & Related papers (2024-09-04T13:43:23Z) - Quantum state transfer between superconducting cavities via exchange-free interactions [20.561557006177914]
We propose and experimentally demonstrate a novel protocol for transferring quantum states between superconducting cavities.
This approach resembles quantum teleportation, where quantum information is transferred between different nodes without directly transmitting carrier photons.
We experimentally realize coherent and bidirectional transfer of arbitrary quantum states, including bosonic quantum error correction codes.
arXiv Detail & Related papers (2024-08-26T07:57: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) - 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) - Strong Converse for Privacy Amplification against Quantum Side
Information [19.624719072006936]
We establish a one-shot strong converse bound for privacy amplification against quantum side information using trace distance as a security criterion.
The result has an application to bounding the information leakage of classical-quantum wiretap channel coding and private communication over quantum channels.
arXiv Detail & Related papers (2022-02-21T14:28:01Z) - 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) - 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)
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.