In this paper, we present a few simple constructions of quantum locally testable codes that achieve interesting parameters which were previously unknown. We introduce an operation which we give the name check product, and show how this operation gives rise to quantum locally testable codes of constant soundness and linear rate, with varying distance and locality
We initiate the systematic study of QMA algorithms in the setting of property testing, to which we r...
Quantum error correction is an indispensable ingredient for scalable quantum computing. In this Pers...
The No Low-energy Trivial States (NLTS) conjecture of Freedman and Hastings [Freedman and Hastings, ...
In this work, we continue the search for quantum locally testable codes (qLTCs) of new parameters by...
We initiate the study of quantum locally testable codes (qLTCs). Classical LTCs are very important i...
International audienceWe introduce the hemicubic codes, a family of quantum codes obtained by associ...
The study of multiprover interactive proof systems, of locally testable codes, and of property testi...
We study a quantum analogue of locally decodable error-correcting codes. A $q$-query emph{locally de...
We introduce the hemicubic codes, a family of quantum codes obtained by associating qubits with the ...
The No Low-Energy Trivial States (NLTS) conjecture of Freedman and Hastings (Quantum Information and...
International audienceTanner codes are long error correcting codes obtained from short codes and a g...
A language L has a property tester if there exists a probabilistic algorithm that given an input x o...
A locally testable code is an error-correcting code that admits very efficient probabilistic tests o...
Quantum low-density parity-check (LDPC) codes are an important class of quantum error correcting cod...
The techniques of distance verification known for general linear codes are first applied to the quan...
We initiate the systematic study of QMA algorithms in the setting of property testing, to which we r...
Quantum error correction is an indispensable ingredient for scalable quantum computing. In this Pers...
The No Low-energy Trivial States (NLTS) conjecture of Freedman and Hastings [Freedman and Hastings, ...
In this work, we continue the search for quantum locally testable codes (qLTCs) of new parameters by...
We initiate the study of quantum locally testable codes (qLTCs). Classical LTCs are very important i...
International audienceWe introduce the hemicubic codes, a family of quantum codes obtained by associ...
The study of multiprover interactive proof systems, of locally testable codes, and of property testi...
We study a quantum analogue of locally decodable error-correcting codes. A $q$-query emph{locally de...
We introduce the hemicubic codes, a family of quantum codes obtained by associating qubits with the ...
The No Low-Energy Trivial States (NLTS) conjecture of Freedman and Hastings (Quantum Information and...
International audienceTanner codes are long error correcting codes obtained from short codes and a g...
A language L has a property tester if there exists a probabilistic algorithm that given an input x o...
A locally testable code is an error-correcting code that admits very efficient probabilistic tests o...
Quantum low-density parity-check (LDPC) codes are an important class of quantum error correcting cod...
The techniques of distance verification known for general linear codes are first applied to the quan...
We initiate the systematic study of QMA algorithms in the setting of property testing, to which we r...
Quantum error correction is an indispensable ingredient for scalable quantum computing. In this Pers...
The No Low-energy Trivial States (NLTS) conjecture of Freedman and Hastings [Freedman and Hastings, ...