arXiv:2403.18768 · APL Quantum
Efficient generation of multi-partite entanglement between non-local superconducting qubits using classical feedback
Akel Hashim, Ming Yuan, Pranav Gokhale, Larry Chen, Christian Jünger, Neelay Fruitwala, Yilun Xu, Gang Huang, Kasra Nowrouzi, Liang Jiang, Irfan A. Siddiqi
Abstract
Quantum entanglement is one of the primary features which distinguish quantum computers from classical computers. In gate-based quantum computing, the creation of entangled states or the distribution of entanglement across a quantum processor often requires circuit depths, which grow with the number of entangled qubits. However, in teleportation-based quantum computing, one can deterministically generate entangled states with a circuit depth that is constant in the number of qubits, provided that one has access to an entangled resource state, the ability to perform mid-circuit measurements, and can rapidly transmit classical information. In this work, aided by fast classical field programmable gate array-based control hardware with a feedback latency of only 150 ns, we explore the utility of teleportation-based protocols for generating non-local, multi-partite entanglement between superconducting qubits. First, we demonstrate well-known protocols for generating Greenberger–Horne–Zeilinger states and non-local controlled-NOT gates in constant depth. Next, we utilize both protocols for implementing a quantum fan-out gate in constant depth among three non-local qubits (i.e., controlled-NOT-NOT). Finally, we demonstrate deterministic state teleportation and entanglement swapping between qubits on opposite sides of our quantum processor. Throughout this work, we find that the fidelity of our teleportation-based protocols is limited by measurement-induced dephasing on idling spectator qubits. Therefore, our work serves as a useful study of the current benefits and limitations of teleportation-based protocols on contemporary superconducting quantum processors.