Quantum Pair State Transfer on Isomorphic Branches

• URL: http://arxiv.org/abs/2402.07078v2
• Date: Tue, 20 Feb 2024 05:46:31 GMT
• Title: Quantum Pair State Transfer on Isomorphic Branches
• Authors: Hiranmoy Pal
• Abstract summary: The evolution of certain pair states in a quantum network with Heisenberg $XY$ Hamiltonian depends only on the local structure of the network. All graphs with high fidelity state transfer may be considered as isomorphic branches of the graph underlying a large quantum network to exhibit high fidelity pair state transfer.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Quantum state transfer plays an important role in quantum information processing. The evolution of certain pair states in a quantum network with Heisenberg $XY$ Hamiltonian depends only on the local structure of the network, and it remains unchanged even if the global structure is altered. All graphs with high fidelity vertex state transfer may be considered as isomorphic branches of the graph underlying a large quantum network to exhibit high fidelity pair state transfer. Among other graphs, one may construct infinite family of trees admitting perfect pair state transfer.

Related papers

• 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)
• Deterministic multipartite entanglement via fractional state transfer across quantum networks [0.0]
  We propose a fractional quantum state transfer, in which the excitation of an emitter is partially transmitted through the quantum communication channel. We show that genuine multipartite entangled states can be faithfully prepared within current experimental platforms.
  arXiv  Detail & Related papers  (2024-08-02T10:59:16Z)
• 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)
• Enhanced quantum state transfer: Circumventing quantum chaotic behavior [35.74056021340496]
  We show how to transfer few-particle quantum states in a two-dimensional quantum network. Our approach paves the way to short-distance quantum communication for connecting distributed quantum processors or registers.
  arXiv  Detail & Related papers  (2024-02-01T19:00:03Z)
• Quantum Generative Diffusion Model: A Fully Quantum-Mechanical Model for Generating Quantum State Ensemble [40.06696963935616]
  We introduce Quantum Generative Diffusion Model (QGDM) as their simple and elegant quantum counterpart. QGDM exhibits faster convergence than Quantum Generative Adversarial Network (QGAN) It can achieve 53.02% higher fidelity in mixed-state generation than QGAN.
  arXiv  Detail & Related papers  (2024-01-13T10:56:34Z)
• 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)
• Is there a finite complete set of monotones in any quantum resource theory? [39.58317527488534]
  We show that there does not exist a finite set of resource monotones which completely determines all state transformations. We show that totally ordered theories allow for free transformations between all pure states.
  arXiv  Detail & Related papers  (2022-12-05T18:28:36Z)
• Quantum LOSR networks cannot generate graph states with high fidelity [6.720135092777862]
  We prove that all multi-qubit graph states arising from a connected graph cannot originate from any quantum network with bipartite sources. The fidelity of a multi-qubit graph state and any network state cannot exceed $9/10$.
  arXiv  Detail & Related papers  (2022-08-25T14:00:00Z)
• Quantum transfer of interacting qubits [0.0]
  transfer of quantum information between different locations is key to many quantum information processing tasks. We address the problem of transferring the state of n interacting qubits. By employing tools from random matrix theory and using the formalism of quantum dynamical maps, we derive a general expression for the average and the variance of the fidelity of an arbitrary quantum state transfer protocol.
  arXiv  Detail & Related papers  (2022-05-03T15:54:38Z)
• 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)
• One-shot quantum state redistribution and quantum Markov chains [15.66921140731163]
  We revisit the task of quantum state redistribution in the one-shot setting. We design a protocol for this task with communication cost in terms of a measure of distance from quantum Markov chains. Our result is the first to operationally connect quantum state redistribution and quantum chains.
  arXiv  Detail & Related papers  (2021-04-18T07:34:22Z)

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.