Resource Reduction in Multiplexed High-Dimensional Quantum Reed-Solomon Codes

Abstract

Quantum communication technologies will play an important role in quantum information processing in the near future as we network devices together. However, their implementation is still a challenging task due to both loss and gate errors. Quantum error correction codes are one important technique to address this issue. In particular, the Quantum Reed-Solomon codes are known to be quite efficient for quantum communication tasks. The high degree of physical resources required, however, makes such a code difficult to use in practice. A recent technique called quantum multiplexing has been shown to reduce resources by using multiple degrees of freedom of a photon. In this work, we propose a method to decompose multi-controlled gates using fewer $\mathrm{CX}$ gates via this quantum multiplexing technique. We show that our method can significantly reduce the required number of $\mathrm{CX}$ gates needed in the encoding circuits for the quantum Reed-Solomon code. Our approach is also applicable to many other quantum error correction codes and quantum algorithms, including Grovers and quantum walks.

9 pages, 11 figures

References in corpus (10)

• The Quantum Internet
• Quantum cryptography: Public key distribution and coin tossing
• Efficient Toffoli Gates Using Qudits
• Linear optics quantum Toffoli and Fredkin gates
• Quantum Phase Estimation with Time-Frequency Qudits in a Single Photon
• Quantum multiplexing
• Modified belief propagation decoders for quantum low-density parity-check codes
• One way quantum repeaters with quantum Reed-Solomon codes
• Resource reduction for distributed quantum information processing using quantum multiplexed photons
• Aggregating Quantum Networks

Cited by in corpus (2)

• Comparing One- and Two-way Quantum Repeater Architectures
• Multiplexed Quantum Communication with Surface and Hypergraph Product Codes