Efficient $n$-qubit entangling operations via a superconducting quantum router

Fuente: arXiv
Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Wu, Xuntao, Yan, Haoxiong, Andersson, Gustav, Anferov, Alexander, Conner, Christopher R., Joshi, Yash J., Karimi, Bayan, King, Amber M., Li, Shiheng, Malc, Howard L., Miller, Jacob M., Mishra, Harsh, Qiao, Hong, Ryu, Minseok, Shi, Jian, Cleland, Andrew N.
Format: Preprint
Veröffentlicht: 2026
Schlagworte:
Online-Zugang:
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
_version_ 1866910136505729024
author Wu, Xuntao
Yan, Haoxiong
Andersson, Gustav
Anferov, Alexander
Conner, Christopher R.
Joshi, Yash J.
Karimi, Bayan
King, Amber M.
Li, Shiheng
Malc, Howard L.
Miller, Jacob M.
Mishra, Harsh
Qiao, Hong
Ryu, Minseok
Shi, Jian
Cleland, Andrew N.
author_facet Wu, Xuntao
Yan, Haoxiong
Andersson, Gustav
Anferov, Alexander
Conner, Christopher R.
Joshi, Yash J.
Karimi, Bayan
King, Amber M.
Li, Shiheng
Malc, Howard L.
Miller, Jacob M.
Mishra, Harsh
Qiao, Hong
Ryu, Minseok
Shi, Jian
Cleland, Andrew N.
contents Quantum algorithms on near-term quantum processors are typically executed using shallow quantum circuits composed of one- and two-qubit gates. However, as circuit depth and gate number increase, gate imperfections and qubit decoherence begin to dominate, limiting algorithmic complexity. An alternative approach is to explore gates involving more than two qubits. In previous work (X. Wu et al., Physical Review X 14, 041030 (2024)), we demonstrated a new superconducting qubit architecture with user-selectable two-qubit interactions via a reconfigurable router, used to connect pairs of qubits. Here, we leverage this novel architecture to realize programmable and efficient multi-qubit operations involving more than two qubits, resulting in faster preparation of multi-qubit entangled states with good fidelities. We also successfully apply model-free reinforcement learning to perform multi-qubit gates, including training a two-qubit controlled-Z gate as well as three-qubit controlled-SWAP and controlled-controlled-phase (Fredkin and Toffoli) gates. Higher $n$th-order gates may also be feasible, using our high-connectivity router design. This could provide a more efficient and higher-fidelity implementation of complex quantum algorithms and a more practical approach to quantum computation.
format Preprint
id arxiv_https___arxiv_org_abs_2604_15432
institution arXiv
publishDate 2026
record_format arxiv
spellingShingle Efficient $n$-qubit entangling operations via a superconducting quantum router
Wu, Xuntao
Yan, Haoxiong
Andersson, Gustav
Anferov, Alexander
Conner, Christopher R.
Joshi, Yash J.
Karimi, Bayan
King, Amber M.
Li, Shiheng
Malc, Howard L.
Miller, Jacob M.
Mishra, Harsh
Qiao, Hong
Ryu, Minseok
Shi, Jian
Cleland, Andrew N.
Quantum Physics
Quantum algorithms on near-term quantum processors are typically executed using shallow quantum circuits composed of one- and two-qubit gates. However, as circuit depth and gate number increase, gate imperfections and qubit decoherence begin to dominate, limiting algorithmic complexity. An alternative approach is to explore gates involving more than two qubits. In previous work (X. Wu et al., Physical Review X 14, 041030 (2024)), we demonstrated a new superconducting qubit architecture with user-selectable two-qubit interactions via a reconfigurable router, used to connect pairs of qubits. Here, we leverage this novel architecture to realize programmable and efficient multi-qubit operations involving more than two qubits, resulting in faster preparation of multi-qubit entangled states with good fidelities. We also successfully apply model-free reinforcement learning to perform multi-qubit gates, including training a two-qubit controlled-Z gate as well as three-qubit controlled-SWAP and controlled-controlled-phase (Fredkin and Toffoli) gates. Higher $n$th-order gates may also be feasible, using our high-connectivity router design. This could provide a more efficient and higher-fidelity implementation of complex quantum algorithms and a more practical approach to quantum computation.
title Efficient $n$-qubit entangling operations via a superconducting quantum router
topic Quantum Physics
url https://arxiv.org/abs/2604.15432