Compare Papers
Paper 1
All the stabilizer codes of distance 3
Sixia Yu, Juergen Bierbrauer, Ying Dong, Qing Chen, C. H. Oh
- Year
- 2009
- Journal
- arXiv preprint
- DOI
- arXiv:0901.1968
- arXiv
- 0901.1968
We give necessary and sufficient conditions for the existence of stabilizer codes $[[n,k,3]]$ of distance 3 for qubits: $n-k\ge \lceil\log_2(3n+1)\rceil+ε_n$ where $ε_n=1$ if $n=8\frac{4^m-1}3+\{\pm1,2\}$ or $n=\frac{4^{m+2}-1}3-\{1,2,3\}$ for some integer $m\ge1$ and $ε_n=0$ otherwise. Or equivalently, a code $[[n,n-r,3]]$ exists if and only if $n\leq (4^r-1)/3, (4^r-1)/3-n\notin\lbrace 1,2,3\rbrace$ for even $r$ and $n\leq 8(4^{r-3}-1)/3, 8(4^{r-3}-1)/3-n\not=1$ for odd $r$. Given an arbitrary length $n$ we present an explicit construction for an optimal quantum stabilizer code of distance 3 that saturates the above bound.
Open paperPaper 2
Proceedings 9th Workshop on Quantum Physics and Logic
Ross Duncan, Prakash Panangaden
- Year
- 2014
- Journal
- arXiv preprint
- DOI
- arXiv:1407.8427
- arXiv
- 1407.8427
This volume contains the proceedings of the ninth workshop on Quantum Physics and Logic (QPL2012) which took place in Brussels from the 10th to the 12th of October 2012. QPL2012 brought together researchers working on mathematical foundations of quantum physics, quantum computing, and spatio-temporal causal structures. The particular focus was on the use of logical tools, ordered algebraic and category-theoretic structures, formal languages, semantical techniques, and other computer science methods for the study of physical behaviour in general.
Open paper