Quantum state transfer on the complete bipartite graph

• URL: http://arxiv.org/abs/2111.13197v1
• Date: Thu, 25 Nov 2021 18:02:34 GMT
• Title: Quantum state transfer on the complete bipartite graph
• Authors: R. A. M. Santos
• Abstract summary: 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.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Previously it was shown that (almost) perfect state transfer can be achieved on the complete bipartite graph by a discrete-time coined quantum walk based algorithm when both the sender and receiver vertices are in the same partition of the graph and when the sender and receiver are in opposite partitions of the same size. By changing the coin operator, we analyze the state transfer problem and 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. Moreover, it is also possible to use an active switch approach using lackadaisical quantum walks where the marked vertex is switched between the sender and receiver during the algorithm.

Related papers

• 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)
• Zero-entropy encoders and simultaneous decoders in identification via quantum channels [49.126395046088014]
  We show that all four combinations (pure/mixed encoder, simultaneous/general decoder) have a double-exponentially growing code size. We show that the simultaneous identification capacity of a quantum channel equals the simultaneous identification capacity with pure state encodings.
  arXiv  Detail & Related papers  (2024-02-14T11:59:23Z)
• Quantum process tomography of continuous-variable gates using coherent states [49.299443295581064]
  We demonstrate the use of coherent-state quantum process tomography (csQPT) for a bosonic-mode superconducting circuit. We show results for this method by characterizing a logical quantum gate constructed using displacement and SNAP operations on an encoded qubit.
  arXiv  Detail & Related papers  (2023-03-02T18:08:08Z)
• Two qubits in one transmon -- QEC without ancilla hardware [68.8204255655161]
  We show that it is theoretically possible to use higher energy levels for storing and controlling two qubits within a superconducting transmon. The additional qubits could be used in algorithms which need many short-living qubits in error correction or by embedding effecitve higher connectivity in qubit networks.
  arXiv  Detail & Related papers  (2023-02-28T16:18:00Z)
• A high-fidelity quantum state transfer algorithm on the complete bipartite graph [15.305667582809924]
  Current quantum state transfer algorithms on the complete bipartite graph suffer from low fidelity in some cases. We propose a two-stage quantum state transfer algorithm on the complete bipartite graph.
  arXiv  Detail & Related papers  (2023-02-23T11:20:12Z)
• Quantum walk state transfer on a hypercube [0.0]
  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.
  arXiv  Detail & Related papers  (2023-02-15T10:43:58Z)
• 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)
• 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 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)
• Genuine quantum networks: superposed tasks and addressing [68.8204255655161]
  We show how to make quantum networks, both standard and entanglement-based, genuine quantum. We provide them with the possibility of handling superposed tasks and superposed addressing.
  arXiv  Detail & Related papers  (2020-04-30T18:00:06Z)
• Controllable double quantum state transfers by one topological channel in a frequency-modulated optomechanical array [5.35952718937799]
  We show that the quantum state transfer between the photonic left edge state and the photonic right edge state can be achieved with a high fidelity. Our scheme provides a novel path to switch two different kinds of quantum state transfers in a controllable way.
  arXiv  Detail & Related papers  (2019-12-31T09:27:03Z)

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.