Efficient Generation of Multi-partite Entanglement between Non-local Superconducting Qubits using Classical Feedback (2403.18768v2)
Abstract: Quantum entanglement is one of the primary features which distinguishes 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 FPGA-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 (GHZ) states and non-local CNOT gates in constant depth. Next, we utilize both protocols for implementing an unbounded fan-out (i.e., controlled-NOT-NOT) gate in constant depth between three non-local qubits. Finally, we demonstrate deterministic state teleportation and entanglement swapping between qubits on opposite side of our quantum processor.
- D. Gottesman and I. L. Chuang, Nature 402, 390 (1999).
- J. Preskill, Quantum 2, 79 (2018).
- H. J. Briegel and R. Raussendorf, Physical Review Letters 86, 910 (2001).
- N. D. Mermin, Am. J. Phys 58, 731 (1990).
- P. Shor, in Proceedings of 37th Conference on Foundations of Computer Science (1996) pp. 56–65.
- W. Dür and J. Cirac, Journal of Physics A: Mathematical and General 34, 6837 (2001).
- O. Gühne and M. Seevinck, New Journal of Physics 12, 053002 (2010).
- H. J. Kimble, Nature 453, 1023 (2008).
- N. P. Breuckmann and J. N. Eberhardt, PRX Quantum 2, 040101 (2021).
- Q. Xu, J. P. B. Ataides, C. A. Pattison, N. Raveendran, D. Bluvstein, J. Wurtz, B. Vasic, M. D. Lukin, L. Jiang, and H. Zhou, “Constant-overhead fault-tolerant quantum computation with reconfigurable atom arrays,” (2023b), arXiv:2308.08648 [quant-ph] .
- P. Høyer and R. Špalek, Theory of computing 1, 81 (2005).
- P. W. Shor, in Proceedings 35th annual symposium on foundations of computer science (Ieee, 1994) pp. 124–134.
- D. Coppersmith, arXiv preprint quant-ph/0201067 (2002).
- Y. Takahashi and S. Tani, computational complexity 25, 849 (2016).
- G. Rosenthal, “Query and Depth Upper Bounds for Quantum Unitaries via Grover Search,” (2023), arXiv:2111.07992 [quant-ph].
- H. Buhrman, M. Folkertsma, B. Loff, and N. M. P. Neumann, “State preparation by shallow circuits using feed forward,” (2023), arXiv:2307.14840 [quant-ph].
- M. Mastriani, Scientific Reports 13, 21998 (2023).
- A. Maudsley, Journal of Magnetic Resonance (1969) 69, 488 (1986).
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.