Skip to content
DraconiticResearch
Search Sources API
203,234 studies31 sourcesUpdated 56 min ago
Peer-reviewedCC BY 4.0New Journal of Physics

Scalable long-distance quantum fan-out gates with reduced resource overhead

  1. 1Shijiazhuang Tiedao University
  2. 2University of Science and Technology Beijing

Abstract

Scalable long-distance quantum gates are essential for distributed quantum computation and scalable quantum networks. We propose an efficient scheme for implementing an n -qubit fan-out gate C n (also known as a controlled-NOT- ⋯ -NOT gate) across spatially separated parties. Our protocol requires only a pre-shared n -qubit Greenberger–Horne–Zeilinger state, n local controlled-NOT (CNOT) gates, and feed-forward operations, thereby reducing both the CNOT and Hadamard gate counts by ( n − 2 ) when compared with the standard decomposition-based approach. We further develop two optical architectures to implement the heralded and post-selected n -photon fan-out gates, respectively. These schemes require fewer single photons resources and achieve higher success probabilities than their decomposition-based counterparts, representing significant improvements. The results indicate that our approach is experimentally feasible and pave the way toward practical long-distance quantum computation.

Versions

Related

  1. Scalable Hybrid Device Architecture on Thin-Film Lithium Tantalate for Long Distance Quantum Network Nodes with Atomic Frequency Comb Quantum Memories
    Ayed Sayem, Towsif Taher
    arXivPreprintCC BY 4.0Full textOptics & photonicsQuantum physics & quantum informationarXiv
  2. Quantum circuit compilation with constant overhead
    Chenyi Zhang, Xinyu Tan, Robin Kothari +2
    arXivPreprintarXiv licenceFull textQuantum physics & quantum informationarXiv
  3. Purely-logarithmic-time- and constant-space-overhead fault-tolerant quantum computation
    Zhengyi Han, Zi-Wen Liu
    arXivPreprintarXiv licenceFull textQuantum physics & quantum informationarXiv
  4. Reducing the Entanglement Cost of Distributed Bipartite Quantum Computation with Constant Qubit Overhead
    Kosuke Matsui, Jun-Yi Wu, Min-Hsiu Hsieh +1
    arXivPreprintCC BY 4.0Full textQuantum physics & quantum informationarXiv
  5. Doubly-polylog-time-overhead fault-tolerant quantum computation by a polylog-time parallel minimum-weight perfect matching decoder
    Yugo Takada, Hayata Yamasaki
    npj Quantum InformationPeer-reviewedCC BYFull textQuantum physics & quantum informationDOAJ
BibTeX
@article{liu2026scalable,
  title = {{Scalable long-distance quantum fan-out gates with reduced resource overhead}},
  author = {Wen-Qiang Liu and Hai-Rui Wei},
  journal = {New Journal of Physics},
  year = {2026},
  month = oct,
  doi = {10.1088/1367-2630/aeaf0f},
  url = {https://iopscience.iop.org/article/10.1088/1367-2630/aeaf0f},
  note = {CC BY 4.0},
}
RIS
TY  - JOUR
TI  - Scalable long-distance quantum fan-out gates with reduced resource overhead
AU  - Wen-Qiang Liu
AU  - Hai-Rui Wei
PY  - 2026
DA  - 2026/10/13
JO  - New Journal of Physics
DO  - 10.1088/1367-2630/aeaf0f
UR  - https://iopscience.iop.org/article/10.1088/1367-2630/aeaf0f
AB  - Scalable long-distance quantum gates are essential for distributed quantum computation and scalable quantum networks. We propose an efficient scheme for implementing an n -qubit fan-out gate C n (also known as a controlled-NOT- ⋯ -NOT gate) across spatially separated parties. Our protocol requires only a pre-shared n -qubit Greenberger–Horne–Zeilinger state, n local controlled-NOT (CNOT) gates, and feed-forward operations, thereby reducing both the CNOT and Hadamard gate counts by ( n − 2 ) when compared with the standard decomposition-based approach. We further develop two optical architectures to implement the heralded and post-selected n -photon fan-out gates, respectively. These schemes require fewer single photons resources and achieve higher success probabilities than their decomposition-based counterparts, representing significant improvements. The results indicate that our approach is experimentally feasible and pave the way toward practical long-distance quantum computation.
SN  - 1367-2630
ER  -