Success probabilities in time-reversal based hybrid quantum state transfer

• URL: http://arxiv.org/abs/2401.08110v2
• Date: Thu, 6 Jun 2024 03:58:39 GMT
• Title: Success probabilities in time-reversal based hybrid quantum state transfer
• Authors: Kevin J. Randles, S. J. van Enk,
• Abstract summary: We consider two memory nodes of a quantum network connected by flying qubits. We show how and why the probability of interfacing successfully is determined by the overlap of the spectral shape of the actual flying qubit and the ideal shape.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We consider two memory nodes of a quantum network connected by flying qubits. We are particularly interested in the case where a flying qubit produced by one node has to be transformed before it can interface efficiently with the next node. Such transformations can be utilized as a key part of the distribution of quantum states and hence entanglement between the nodes of a hybrid quantum network linking together different quantum technologies. We show how and why the probability of interfacing successfully is determined by the overlap of the spectral shape of the actual flying qubit and the ideal shape. This allows us to analytically and numerically analyze how the probability of success is impacted by realistic errors, and show the utility of our scheme (in consonance with known error correction methods) in connecting hybrid nodes of a quantum network. We focus here on a concrete implementation in which the memory nodes consist of three-level atoms in cavities and the flying qubits are photons.

Related papers

• Realizing fracton order from long-range quantum entanglement in programmable Rydberg atom arrays [45.19832622389592]
  Storing quantum information requires battling quantum decoherence, which results in a loss of information over time. To achieve error-resistant quantum memory, one would like to store the information in a quantum superposition of degenerate states engineered in such a way that local sources of noise cannot change one state into another. We show that this platform also allows to detect and correct certain types of errors en route to the goal of true error-resistant quantum memory.
  arXiv  Detail & Related papers  (2024-07-08T12:46:08Z)
• Distributed Partial Quantum Consensus of Qubit Networks with Connected Topologies [13.978557505365604]
  Two partial quantum consensus protocols, based on the Lyapunov method for chain graphs and the geometry method for connected graphs, are proposed. The numerical simulation over a qubit network is demonstrated to verify the validity and the effectiveness of the theoretical results.
  arXiv  Detail & Related papers  (2024-02-22T03:44:45Z)
• A vertical gate-defined double quantum dot in a strained germanium double quantum well [48.7576911714538]
  Gate-defined quantum dots in silicon-germanium heterostructures have become a compelling platform for quantum computation and simulation. We demonstrate the operation of a gate-defined vertical double quantum dot in a strained germanium double quantum well. We discuss challenges and opportunities and outline potential applications in quantum computing and quantum simulation.
  arXiv  Detail & Related papers  (2023-05-23T13:42:36Z)
• Simulation of Entanglement Generation between Absorptive Quantum Memories [56.24769206561207]
  We use the open-source Simulator of QUantum Network Communication (SeQUeNCe), developed by our team, to simulate entanglement generation between two atomic frequency comb (AFC) absorptive quantum memories. We realize the representation of photonic quantum states within truncated Fock spaces in SeQUeNCe. We observe varying fidelity with SPDC source mean photon number, and varying entanglement generation rate with both mean photon number and memory mode number.
  arXiv  Detail & Related papers  (2022-12-17T05:51:17Z)
• QuanGCN: Noise-Adaptive Training for Robust Quantum Graph Convolutional Networks [124.7972093110732]
  We propose quantum graph convolutional networks (QuanGCN), which learns the local message passing among nodes with the sequence of crossing-gate quantum operations. To mitigate the inherent noises from modern quantum devices, we apply sparse constraint to sparsify the nodes' connections. Our QuanGCN is functionally comparable or even superior than the classical algorithms on several benchmark graph datasets.
  arXiv  Detail & Related papers  (2022-11-09T21:43:16Z)
• Quantum State Transfer: Interplay between Gate and Readout Errors [0.0]
  We simulate quantum state transfer between two nodes connected in a linear geometry through other nodes. We find that the nominal success probability is not necessarily a monotonic function of the two error rates.
  arXiv  Detail & Related papers  (2022-09-15T03:22:40Z)
• Cavity-enhanced quantum network nodes [0.0]
  A future quantum network will consist of quantum processors that are connected by quantum channels. I will describe how optical resonators facilitate quantum network nodes.
  arXiv  Detail & Related papers  (2022-05-30T18:50:35Z)
• Efficient Bipartite Entanglement Detection Scheme with a Quantum Adversarial Solver [89.80359585967642]
  Proposal reformulates the bipartite entanglement detection as a two-player zero-sum game completed by parameterized quantum circuits. We experimentally implement our protocol on a linear optical network and exhibit its effectiveness to accomplish the bipartite entanglement detection for 5-qubit quantum pure states and 2-qubit quantum mixed states.
  arXiv  Detail & Related papers  (2022-03-15T09:46:45Z)
• Interactive Protocols for Classically-Verifiable Quantum Advantage [46.093185827838035]
  "Interactions" between a prover and a verifier can bridge the gap between verifiability and implementation. We demonstrate the first implementation of an interactive quantum advantage protocol, using an ion trap quantum computer.
  arXiv  Detail & Related papers  (2021-12-09T19:00:00Z)
• Distributing Multipartite Entanglement over Noisy Quantum Networks [0.0]
  A quantum internet aims at harnessing networked quantum technologies, namely by distributing bipartite entanglement between distant nodes. We present an algorithm for generating multipartite entanglement between different nodes of a quantum network with noisy quantum repeaters and imperfect quantum memories.
  arXiv  Detail & Related papers  (2021-03-26T22:48:05Z)
• Quantum State Discrimination on Reconfigurable Noise-Robust Quantum Networks [6.85316573653194]
  A fundamental problem in Quantum Information Processing is the discrimination amongst a set of quantum states of a system. In this paper, we address this problem on an open quantum system described by a graph, whose evolution is defined by a Quantum Walk. We optimize the parameters of the network to obtain the highest probability of correct discrimination.
  arXiv  Detail & Related papers  (2020-03-25T19:07: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.