Quick Navigation

Topics

Trapped Ion Quantum Computing Superconducting Qubits

Efficient n-qubit entangling operations via a superconducting quantum router

arXiv
Authors: Xuntao Wu, Haoxiong Yan, Gustav Andersson, Alexander Anferov, Christopher R. Conner, Yash J. Joshi, Bayan Karimi, Amber M. King, Shiheng Li, Howard L. Malc, Jacob M. Miller, Harsh Mishra, Hong Qiao, Minseok Ryu, Jian Shi, Andrew N. Cleland

Year

2026

Paper ID

52505

Status

Preprint

Abstract Read

~2 min

Abstract Words

172

Citations

N/A

Abstract

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 nth-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.

Why This Paper Matters

  • This paper contributes to the Superconducting Qubits research area in the Quantum Articles archive.
  • It adds a 2026 reference point for readers tracking recent quantum research.
  • Quantum algorithms on near-term quantum processors are typically executed using shallow quantum circuits composed of one- and two-qubit gates.

Paper Tools

Become a member to use research tools

Sign in to open papers, visit source links, share, cite, compare, copy DOI links, request category corrections, and build your reading list.

Show Paper arXiv Publisher Share Cite This Paper Copy URL Compare Copy DOI Add to Reading List Category Correction Request

References & Citation Signals

Local Citation Graph (Related-Paper Links)

Current Paper #52505 #68985 Floquet Entanglement Generation... #69039 SAT, MaxSAT, and SMT for QLDPC ... #69038 Physically Constrained Ensemble... #69031 Amplitude-dependent quantum hyd...

External citation index: OpenAlex citation signal

Community Reactions

Quick sentiment from readers on this paper.

Score: 0
Likes: 0 Dislikes: 0

Sign in to react to this paper.

Discussion & Reviews (Moderated)

Average Rating: 0.0 / 5 (0 ratings)

No written reviews yet.