Quantum Locally Testable Codes
We initiate the study of quantum locally testable codes (qLTCs). Classical LTCs are very important in computational complexity. These codes are defined as the linear subspace satisfying a set of local constraints, with the additional requirement that their soundness, R(δ), which is the probability t...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Article |
| Language: | en_US |
| Published: |
Society for Industrial and Applied Mathematics
2016
|
| Online Access: | http://hdl.handle.net/1721.1/100818 https://orcid.org/0000-0002-2341-2521 |