Distributed Quantum Walk Control Plane Implementation

• André Ribeiro USP
• Matheus Guedes de Andrade University of Massachusetts Amhers
• Fabio Kon USP
• Don Towsley University of Massachusetts Amhers

DOI: https://doi.org/10.5753/wqunets.2024.3392

Resumo

The Quantum Walk Control Protocol (QWCP) enables universal distributed quantum computing in quantum networks. In its debut, QWCP was specified in terms of logical quantum operations required by a quantum network to implement the protocol. In this paper, we propose two possible implementations of the QWCP based on different ways to encode quantum walks in physical qubits. The proposed encodings require different numbers of qubits and remote entangled states to perform control operations. Our approaches help to bridge the gap between the logical description of the QCWP and possible physical realizations of the protocol.

Referências

Buhrman, H. and Röhrig, H. (2003). Distributed quantum computing. In International Symposium on Mathematical Foundations of Computer Science, pages 1–20. Springer.

Collins, D., Linden, N., and Popescu, S. (2001). Nonlocal content of quantum operations. Phys. Rev. A, 64:032302.

de Andrade, M. G., Panigrahy, N. K., Dai, W., Guha, S., and Towsley, D. (2023). Universal quantum walk control plane for quantum networks. arXiv preprint arXiv:2307.06492.

Dür, W., Vidal, G., and Cirac, J. I. (2000). Three qubits can be entangled in two inequivalent ways. Physical Review A, 62(6):062314.

Kimble, H. J. (2008). The quantum internet. Nature, 453(7198):1023–1030.

Pant, M., Krovi, H., Towsley, D., Tassiulas, L., Jiang, L., Basu, P., Englund, D., and Guha, S. (2019). Routing entanglement in the quantum internet. npj Quantum Information, 5(1):25.

Portugal, R. (2018). Quantum Walks, and Search Algorithms. Springer Nature, Switzerland.

Stiebitz, M., Scheide, D., Toft, B., and Favrholdt, L. M. (2012). Graph edge coloring: Vizing’s theorem and Goldberg’s conjecture, volume 75. John Wiley & Sons.