Zobrazeno 1 - 10
of 149
pro vyhledávání: '"Vasić, Bane"'
Autor:
Pacenti, Michele, Vasic, Bane
Recently, Lin and Pryadko presented the quantum two-block group algebra codes, a generalization of bicycle codes obtained from Cayley graphs of non-Abelian groups. We notice that their construction is naturally suitable to obtain a quantum equivalent
Externí odkaz:
http://arxiv.org/abs/2409.09830
We provide a brief review of the fundamentals of quantum computation and quantum error correction for the participants of the first Quantum Information Knowledge (QuIK) workshop at the 2024 IEEE International Symposium on Information Theory (ISIT 202
Externí odkaz:
http://arxiv.org/abs/2407.12737
Quantum low-density parity-check (QLDPC) codes have been proven to achieve higher minimum distances at higher code rates than surface codes. However, this family of codes imposes stringent latency requirements and poor performance under iterative dec
Externí odkaz:
http://arxiv.org/abs/2406.17070
Bell-state measurement (BSM) on entangled states shared between quantum repeaters is the fundamental operation used to route entanglement in quantum networks. Performing BSMs on Werner states shared between repeaters leads to exponential decay in the
Externí odkaz:
http://arxiv.org/abs/2405.00849
Publikováno v:
IEEE Transactions on Communications (2024)
Topological quantum codes, such as toric and surface codes, are excellent candidates for hardware implementation due to their robustness against errors and their local interactions between qubits. However, decoding these codes efficiently remains a c
Externí odkaz:
http://arxiv.org/abs/2402.15924
This paper proposes two approaches for reducing the impact of the error floor phenomenon when decoding quantum low-density parity-check codes with belief propagation based algorithms. First, a low-complexity syndrome-based linear programming (SB-LP)
Externí odkaz:
http://arxiv.org/abs/2311.18488
Autor:
Xu, Qian, Ataides, J. Pablo Bonilla, Pattison, Christopher A., Raveendran, Nithin, Bluvstein, Dolev, Wurtz, Jonathan, Vasic, Bane, Lukin, Mikhail D., Jiang, Liang, Zhou, Hengyun
Quantum low-density parity-check (qLDPC) codes can achieve high encoding rates and good code distance scaling, providing a promising route to low-overhead fault-tolerant quantum computing. However, the long-range connectivity required to implement su
Externí odkaz:
http://arxiv.org/abs/2308.08648
Machine learning based approaches are being increasingly used for designing decoders for next generation communication systems. One widely used framework is neural belief propagation (NBP), which unfolds the belief propagation (BP) iterations into a
Externí odkaz:
http://arxiv.org/abs/2305.10540
Publikováno v:
Proceedings of the International Telemetering Conference (ITC 2019), ISSN 1546-2188, vol. 55, pp. 387 - 396, Las Vegas, NV, USA, Octobar 21 - 24, 2019
Best and practical watermarking schemes for copyright protection of 3D meshes are required to be blind and robust to attacks and errors. In this paper, we present the latest developments in 3D blind watermarking with a special emphasis on our Ordered
Externí odkaz:
http://arxiv.org/abs/2304.10348
Publikováno v:
Quantum 8, 1233 (2024)
Recent constructions of quantum low-density parity-check (QLDPC) codes provide optimal scaling of the number of logical qubits and the minimum distance in terms of the code length, thereby opening the door to fault-tolerant quantum systems with minim
Externí odkaz:
http://arxiv.org/abs/2210.14143