Remote entanglement via adiabatic passage using a tunably-dissipative quantum communication system

• URL: http://arxiv.org/abs/2005.12334v2
• Date: Thu, 28 May 2020 01:48:11 GMT
• Title: Remote entanglement via adiabatic passage using a tunably-dissipative quantum communication system
• Authors: Hung-Shen Chang, Youpeng Zhong, Audrey Bienfait, Ming-Han Chou, Christopher R. Conner, \'Etienne Dumur, Joel Grebel, Gregory A. Peairs, Rhys G. Povey, Kevin J. Satzinger, Andrew N. Cleland
• Abstract summary: We present a superconducting quantum communication system, comprising two superconducting qubits connected by a 0.73 m-long communication channel. When set for minimum loss in the channel, we demonstrate an adiabatic quantum state transfer protocol that achieves 99% transfer efficiency. We show that the adiabatic protocol protects against loss in the channel, achieving higher state transfer and entanglement fidelities than the relay method.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Effective quantum communication between remote quantum nodes requires high fidelity quantum state transfer and remote entanglement generation. Recent experiments have demonstrated that microwave photons, as well as phonons, can be used to couple superconducting qubits, with a fidelity limited primarily by loss in the communication channel. Adiabatic protocols can overcome channel loss by transferring quantum states without populating the lossy communication channel. Here we present a unique superconducting quantum communication system, comprising two superconducting qubits connected by a 0.73 m-long communication channel. Significantly, we can introduce large tunable loss to the channel, allowing exploration of different entanglement protocols in the presence of dissipation. When set for minimum loss in the channel, we demonstrate an adiabatic quantum state transfer protocol that achieves 99% transfer efficiency as well as the deterministic generation of entangled Bell states with a fidelity of 96%, all without populating the intervening communication channel, and competitive with a qubit-resonant mode-qubit relay method. We also explore the performance of the adiabatic protocol in the presence of significant channel loss, and show that the adiabatic protocol protects against loss in the channel, achieving higher state transfer and entanglement fidelities than the relay method.

Related papers

• Quantum channel correction outperforming direct transmission [0.0]
  Long-distance optical quantum channels are necessarily lossy. Quantum states carrying information in the channel can be probabilistically amplified to compensate for loss, but are destroyed when amplification fails. We perform distillation by heralded amplification to improve a noisy entanglement channel. We employ entanglement swapping to demonstrate that arbitrary quantum information transmission is unconditionally improved.
  arXiv  Detail & Related papers  (2024-06-07T06:09:26Z)
• Covert Quantum Communication Over Optical Channels [2.2474167740753557]
  Covert communication ensures that an adversary is unable to detect transmissions, which are concealed in channel noise. We investigate an achievable lower bound on quantum covert communication using photonic dual-rail qubits. This encoding has practical significance, as it has been proposed for long-range repeater-based quantum communication over optical channels.
  arXiv  Detail & Related papers  (2024-01-12T18:54:56Z)
• Fault-tolerant Coding for Entanglement-Assisted Communication [46.0607942851373]
  This paper studies the study of fault-tolerant channel coding for quantum channels. We use techniques from fault-tolerant quantum computing to establish coding theorems for sending classical and quantum information in this scenario. We extend these methods to the case of entanglement-assisted communication, in particular proving that the fault-tolerant capacity approaches the usual capacity when the gate error approaches zero.
  arXiv  Detail & Related papers  (2022-10-06T14:09:16Z)
• Entanglement purification and protection in a superconducting quantum network [0.0]
  High-fidelity quantum entanglement is a key resource for quantum communication and distributed quantum computing. Here we demonstrate the entanglement purification of Bell pairs shared between two remote superconducting quantum nodes connected by a moderately lossy, 1-meter long superconducting communication cable. We use both dynamical decoupling and Rabi driving to protect the entangled states from local noise, increasing the effective qubit dephasing time by a factor of 4, from $3rm mu s$ to $12rmmu s$.
  arXiv  Detail & Related papers  (2022-01-25T23:59:05Z)
• Moving beyond the transmon: Noise-protected superconducting quantum circuits [55.49561173538925]
  superconducting circuits offer opportunities to store and process quantum information with high fidelity. Noise-protected devices constitute a new class of qubits in which the computational states are largely decoupled from local noise channels. This Perspective reviews the theoretical principles at the heart of these new qubits, describes recent experiments, and highlights the potential of robust encoding of quantum information in superconducting qubits.
  arXiv  Detail & Related papers  (2021-06-18T18:00:13Z)
• Direct Quantum Communications in the Presence of Realistic Noisy Entanglement [69.25543534545538]
  We propose a novel quantum communication scheme relying on realistic noisy pre-shared entanglement. Our performance analysis shows that the proposed scheme offers competitive QBER, yield, and goodput.
  arXiv  Detail & Related papers  (2020-12-22T13:06:12Z)
• Quantum-enabled communication without a phase reference [1.14219428942199]
  A phase reference has been a standard requirement in continuous-variable quantum sensing and communication protocols. We show that quantum communication and entanglement-assisted communication without a phase reference are possible, when a short-time memory effect is present.
  arXiv  Detail & Related papers  (2020-10-22T18:19:00Z)
• Fault-tolerant Coding for Quantum Communication [71.206200318454]
  encode and decode circuits to reliably send messages over many uses of a noisy channel. For every quantum channel $T$ and every $eps>0$ there exists a threshold $p(epsilon,T)$ for the gate error probability below which rates larger than $C-epsilon$ are fault-tolerantly achievable. Our results are relevant in communication over large distances, and also on-chip, where distant parts of a quantum computer might need to communicate under higher levels of noise.
  arXiv  Detail & Related papers  (2020-09-15T15:10:50Z)
• Microwave Quantum Link between Superconducting Circuits Housed in Spatially Separated Cryogenic Systems [43.55994393060723]
  We report the successful operation of a cryogenic waveguide coherently linking transmon qubits located in two dilution refrigerators separated by a physical distance of five meters. We transfer qubit states and generate entanglement on-demand with average transfer and target state fidelities of 85.8 % and 79.5 %, respectively.
  arXiv  Detail & Related papers  (2020-08-04T15:36:51Z)
• Universal non-adiabatic control of small-gap superconducting qubits [47.187609203210705]
  We introduce a superconducting composite qubit formed from two capacitively coupled transmon qubits. We control this low-frequency CQB using solely baseband pulses, non-adiabatic transitions, and coherent Landau-Zener interference. This work demonstrates that universal non-adiabatic control of low-frequency qubits is feasible using solely baseband pulses.
  arXiv  Detail & Related papers  (2020-03-29T22:48:34Z)
• Fast and efficient deterministic quantum state transfer between two remote mechanical resonators [0.0]
  We show that one obtains a quantum state transfer with high efficiency using adiabatic variation of the effective coupling strengths. Our results show that the shortcut to adiabaticity provides an efficient and fast quantum state transfer even for small values of the coupling strength.
  arXiv  Detail & Related papers  (2020-03-02T20:18:54Z)

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.