Search and state transfer between hubs by quantum walks

• URL: http://arxiv.org/abs/2409.02707v1
• Date: Wed, 4 Sep 2024 13:43:23 GMT
• Title: Search and state transfer between hubs by quantum walks
• Authors: Stanislav Skoupy, Martin Stefanak,
• Abstract summary: 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.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Search and state transfer between hubs, i.e. fully connected vertices, on otherwise arbitrary connected graph is investigated. Motivated by a recent result of Razzoli et al. (J. Phys. A: Math. Theor. 55, 265303 (2022)) on universality of hubs in continuous-time quantum walks and spatial search, we extend the investigation to state transfer and also to the discrete-time case. 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. Turning to the discrete-time case, we show that the search for hubs is successful provided that the initial state is locally modified to account for a degree of each individual vertex. Concerning state transfer using discrete-time quantum walk, it is shown that between a single sender and a single receiver one can transfer two orthogonal states in the same run-time. Hence, it is possible to transfer an arbitrary quantum state of a qubit between two hubs. In addition, if the sender and the receiver know each other location, another linearly independent state can be transferred, allowing for exchange of a qutrit state. Finally, we consider the case of transfer between multiple senders and receivers. In this case we cannot transfer specific quantum states. Nevertheless, quantum walker can be transferred with high probability in two regimes - either when there is a similar number of senders and receivers, which is the same as for the continuous-time quantum walk, or when the number of receivers is considerably larger than the number of senders. Our investigation is based on dimensional reduction utilizing the invariant subspaces of the respective evolutions and the fact that for the appropriate choice of the loop weights the problem can be reduced to the complete graph with loops.

Related papers

• Transfer and routing of Gaussian states through quantum complex networks with and without community structure [0.8437187555622164]
  We study the routing of single-mode Gaussian states and entanglement through complex networks of quantum harmonic oscillators. We find that even in a random and homogeneous network, the transfer fidelity still depends on the degree of the nodes for any link density. Our results pave the way for further exploration of the role of community structure in state transfer and related tasks.
  arXiv  Detail & Related papers  (2024-03-08T19:00:03Z)
• 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)
• 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)
• Entanglement catalysis for quantum states and noisy channels [41.94295877935867]
  We investigate properties of entanglement and its role for quantum communication. For transformations between bipartite pure states, we prove the existence of a universal catalyst. We further develop methods to estimate the number of singlets which can be established via a noisy quantum channel.
  arXiv  Detail & Related papers  (2022-02-10T18:36:25Z)
• A quantum processor based on coherent transport of entangled atom arrays [44.62475518267084]
  We show a quantum processor with dynamic, nonlocal connectivity, in which entangled qubits are coherently transported in a highly parallel manner. We use this architecture to realize programmable generation of entangled graph states such as cluster states and a 7-qubit Steane code state.
  arXiv  Detail & Related papers  (2021-12-07T19:00:00Z)
• 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)
• Stochastic approximate state conversion for entanglement and general quantum resource theories [41.94295877935867]
  An important problem in any quantum resource theory is to determine how quantum states can be converted into each other. Very few results have been presented on the intermediate regime between probabilistic and approximate transformations. We show that these bounds imply an upper bound on the rates for various classes of states under probabilistic transformations. We also show that the deterministic version of the single copy bounds can be applied for drawing limitations on the manipulation of quantum channels.
  arXiv  Detail & Related papers  (2021-11-24T17:29:43Z)
• Telecom-heralded entanglement between remote multimode solid-state quantum memories [55.41644538483948]
  Future quantum networks will enable the distribution of entanglement between distant locations and allow applications in quantum communication, quantum sensing and distributed quantum computation. Here we report the demonstration of heralded entanglement between two spatially separated quantum nodes, where the entanglement is stored in multimode solid-state quantum memories. We also show that the generated entanglement is robust against loss in the heralding path, and demonstrate temporally multiplexed operation, with 62 temporal modes.
  arXiv  Detail & Related papers  (2021-01-13T14:31:54Z)
• Adiabatic quantum state transfer in a semiconductor quantum-dot spin chain [0.0]
  We present evidence of adiabatic quantum-state transfer in semiconductor quantum-dot electron spins. Based on simulations, we estimate that the probability to correctly transfer single-spin eigenstates and two-spin singlet states can exceed 0.95.
  arXiv  Detail & Related papers  (2020-07-08T03:01:27Z)
• 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.