Skip to content
DraconiticResearch
Search Sources API
178,970 studies31 sourcesUpdated 46 min ago
PreprintarXiv licencearXiv

Encoding and Node Choices in Transversal Fault-Tolerant Distributed Quantum Computations: An Initial Study

Abstract

We compare and study different Bivariate-Bicycle (BB) encodings and node choices for distributed quantum operations such as transversal non-local CNOTs. We observe that while some encodings have more physical qubits requiring more ebits for a distributed computation, reducing ebit consumption alone might not be the best criterion for selecting an encoding for the logical qubits, if the goal is to reduce the logical error rate of the distributed computation; for example, one should also consider encodings with a larger distance, which using more physical qubits can provide. We consider distributed, or non-local, CNOTs and computation of the global gate (GCZ) over distributed logical qubits as examples. The choice of encoding enables particular concurrent operations; e.g., we show that a transversal physical GCZ on a self-dual $[[120,8,12]] BB$ code can realize eight concurrent logical GCZ operations after accounting for the logical permutation induced by transversal Hadamard.

Related

  1. Encodings and Node Architecture: Lessons from the Fault-Tolerant Distributed Transversal Fanout
    Seng W. Loke
    arXivPreprintarXiv licenceFull textQuantum physics & quantum informationarXiv
  2. Transversal Fanout for Fault Tolerant Distributed Quantum Computing: Analysis and Application
    Seng W. Loke
    arXivPreprintarXiv licenceFull textQuantum physics & quantum informationarXiv
  3. Unitary fault-tolerant encoding of Pauli states in surface codes
    Luis Colmenarez, Remmy Zen, Jan Olle +2
    npj Quantum InformationPeer-reviewedCC BY-NC-ND 4.0Full textQuantum physics & quantum informationCrossref
  4. First fault-tolerant quantum memory demonstration for a generalized superfast encoding
    James Brown, Kenny Heitritter
    arXivPreprintarXiv licenceFull textQuantum physics & quantum informationarXiv
  5. Feasibility of Distributed Fault-Tolerant Quantum Computing: From Quantum Links to Algorithms
    Takumi Kobayashi, Hodaka Kurokawa, Yasunari Suzuki +1
    arXivPreprintCC BY 4.0Full textQuantum physics & quantum informationarXiv
BibTeX
@misc{loke2026encoding,
  title = {{Encoding and Node Choices in Transversal Fault-Tolerant Distributed Quantum Computations: An Initial Study}},
  author = {Seng W. Loke},
  howpublished = {arXiv},
  year = {2026},
  month = sep,
  doi = {10.48550/arxiv.2609.37210},
  eprint = {2609.37210},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2609.37210},
}
RIS
TY  - UNPB
TI  - Encoding and Node Choices in Transversal Fault-Tolerant Distributed Quantum Computations: An Initial Study
AU  - Seng W. Loke
PY  - 2026
DA  - 2026/09/29
PB  - arXiv
DO  - 10.48550/arxiv.2609.37210
UR  - https://arxiv.org/abs/2609.37210
AB  - We compare and study different Bivariate-Bicycle (BB) encodings and node choices for distributed quantum operations such as transversal non-local CNOTs. We observe that while some encodings have more physical qubits requiring more ebits for a distributed computation, reducing ebit consumption alone might not be the best criterion for selecting an encoding for the logical qubits, if the goal is to reduce the logical error rate of the distributed computation; for example, one should also consider encodings with a larger distance, which using more physical qubits can provide. We consider distributed, or non-local, CNOTs and computation of the global gate (GCZ) over distributed logical qubits as examples. The choice of encoding enables particular concurrent operations; e.g., we show that a transversal physical GCZ on a self-dual $[[120,8,12]] BB$ code can realize eight concurrent logical GCZ operations after accounting for the logical permutation induced by transversal Hadamard.
ER  -