Results 31 to 40 of about 369,878 (291)

Quantum Locally Testable Codes [PDF]

SIAM Journal on Computing, 2015
Some of the results presented here appeared in an initial form in our quant-ph submission arXiv:1301.3407. This is a much extended and improved version.
Aharonov, Dorit, Eldar, Lior
openaire   +4 more sources

Extra Shared Entanglement Reduces Memory Demand in Quantum Convolutional Coding [PDF]

, 2009
We show how extra entanglement shared between sender and receiver reduces the memory requirements for a general entanglement-assisted quantum convolutional code. We construct quantum convolutional codes with good error-correcting properties by exploiting
Mark M. Wilde, R. Johannesson, Todd A. Brun   +2 more
core   +3 more sources

Unified quantum convolutional coding [PDF]

2008 IEEE International Symposium on Information Theory, 2008
We outline a quantum convolutional coding technique for protecting a stream of classical bits and qubits. Our goal is to provide a framework for designing codes that approach the ``grandfather'' capacity of an entanglement-assisted quantum channel for sending classical and quantum information simultaneously.
Wilde, Mark M., Brun, Todd A.
openaire   +2 more sources

New quantum codes from CSS codes

Quantum Information Processing, 2023
AbstractWe present a new propagation rule for CSS codes. Starting with a CSS code $$[\![n,k,d]\!]_q$$ [ [ n , k ,
openaire   +2 more sources

Asymptotically good quantum codes [PDF]

Physical Review A, 2001
Using algebraic geometry codes we give a polynomial construction of quantum codes with asymptotically non-zero rate and relative distance.
Ashikhmin, A., Litsyn, S., Tsfasman, M. A.   +2 more
openaire   +2 more sources

Locally Decodable Quantum Codes [PDF]

, 2008
We study a quantum analogue of locally decodable error-correcting codes. A q-query locally decodable quantum code encodes n classical bits in an m-qubit state, in such a way that each of the encoded bits can be recovered with high probability by a ...
Briët, Jop, de Wolf, Ronald
core   +5 more sources

ON OPTIMAL QUANTUM CODES [PDF]

International Journal of Quantum Information, 2004
We present families of quantum error-correcting codes which are optimal in the sense that the minimum distance is maximal. These maximum distance separable (MDS) codes are defined over q-dimensional quantum systems, where q is an arbitrary prime power. It is shown that codes with parameters 〚n, n - 2d + 2, d〛q exist for all 3≤n≤q and 1≤d≤n/2+1.
Grassl, M., Beth, T., Rötteler, M.
openaire   +2 more sources

Quantum optical coherence can survive photon losses: a continuous-variable quantum erasure correcting code [PDF]

, 2010
A fundamental requirement for enabling fault-tolerant quantum information processing is an efficient quantum error-correcting code (QECC) that robustly protects the involved fragile quantum states from their environment.
AK Majumdar, Alexander Huck, AM Lance, AM Steane, AR Calderbank, C Wittmann, CH Bennett, D Elser, DG Cory, E Knill, Gerd Leuchs, J Chiaverini, J Niset, J Niset, J Niset, Julien Niset, LM Duan, M Grassl, MA Nielsen, Metin Sabuncu, Mikael Lassen, MM Wilde, Nicolas J. Cerf, P Van Loock, PW Shor, R Laflamme, S Braunstein, S Lloyd, SL Braunstein, T Aoki, TB Pittmann, Ulrik L. Andersen, Z-S Yuan   +32 more
core   +3 more sources

Quantum message-passing algorithm for optimal and efficient decoding [PDF]

Quantum, 2022
Recently, Renes proposed a quantum algorithm called belief propagation with quantum messages (BPQM) for decoding classical data encoded using a binary linear code with tree Tanner graph that is transmitted over a pure-state CQ channel \cite{renes_2017 ...
Christophe Piveteau, Joseph M. Renes
doaj   +1 more source

Quantum Goethals-Preparata codes [PDF]

2008 IEEE International Symposium on Information Theory, 2008
Submitted to the 2008 IEEE International Symposium on Information ...
Grassl, Markus, Roetteler, Martin
openaire   +2 more sources