5 documents found, page 1 of 1
Fault-tolerant noise guessing decoding of quantum random codes
Cruz, D.; Monteiro, F. A.; Roque, A.; Coutinho, B. C.This work addresses the open question of implementing fault-tolerant QRLCs with feasible computational overhead. We present a new decoder for quantum random linear codes (QRLCs) capable of dealing with imperfect decoding operations. A first approach, introduced by Cruz et al., only considered channel errors, and perfect gates at the decoder. Here, we analyze the fault-tolerant characteristics of QRLCs with a ne...
Efficient entanglement purification based on noise guessing decoding
Roque, A.; Cruz, D.; Monteiro, F. A.; Coutinho, B. C.In this paper, we propose a novel bipartite entanglement purification protocol built upon hashing and upon the guessing random additive noise decoding (GRAND) approach recently devised for classical error correction codes. Our protocol offers substantial advantages over existing hashing protocols, requiring fewer qubits for purification, achieving higher fidelities, and delivering better yields with reduced com...
Quantum error correction via noise guessing decoding
Cruz, D.; Monteiro, F. A.; Coutinho, B. C.Quantum error correction codes (QECCs) play a central role in both quantum communications and quantum computation. Practical quantum error correction codes, such as stabilizer codes, are generally structured to suit a specific use, and present rigid code lengths and code rates. This paper shows that it is possible to both construct and decode QECCs that can attain the maximum performance of the finite blockleng...
Distributing multipartite entanglement over noisy quantum networks
Bugalho. L.; Coutinho, B. C.; Monteiro, F. A.; Omar, Y.A quantum internet aims at harnessing networked quantum technologies, namely by distributing bipartite entanglement between distant nodes. However, multipartite entanglement between the nodes may empower the quantum internet for additional or better applications for communications, sensing, and computation. In this work, we present an algorithm for generating multipartite entanglement between different nodes of...
Shortest path finding in quantum networks with quasi-linear complexity
Santos, S.; Monteiro, F. A.; Coutinho, B. C.; Omar, Y.A fully-quantum network implies the creation of quantum entanglement between a given source node and some other destination node, with a number of quantum repeaters in between. This paper tackles the problem of quantum entanglement distribution by solving the routing problem over an infrastructure based on quantum repeaters and with a finite number of pairs of entangled qubits available in each link. The networ...