Want to take part in these discussions? Sign in if you have an account, or apply for one below
Vanilla 1.1.10 is a product of Lussumo. More Information: Documentation, Community Support.
added this pointer:
added pointer to
added this pointer:
added pointer to:
added these references on operator algebraic formulation of quantum error correction in the Heisenberg picture:
Cédric Bény, Achim Kempf, David W. Kribs, Generalization of Quantum Error Correction via the Heisenberg Picture, Phys. Rev. Lett. 98, 100502 – Published 7 March 2007 (doi:10.1103/PhysRevLett.98.100502, arXiv:quant-ph/0608071)
Cédric Bény, Achim Kempf, David W. Kribs, Quantum Error Correction of Observables, Phys. Rev. A 76, 042303 (2007) (arXiv:0705.1574)
added pointer to:
and added a quote from this article to the Idea-section
added pointer to:
John Preskill, Reliable Quantum Computers, Proc. Roy. Soc. Lond. A454 (1998) 385-410 (arXiv:quant-ph/9705031)
Dorit Aharonov, Michael Ben-Or, Fault-Tolerant Quantum Computation With Constant Error Rate, SIAM J. Comput., 38(4), 1207–1282. (arXiv:quant-ph/9906129, doi:10.1137/S0097539799359385)
Added pointer to:
S. B. Bravyi, Alexei Kitaev, Quantum codes on a lattice with boundary (arXiv:quant-ph/9811052)
Michael Freedman, David A. Meyer, Projective Plane and Planar Quantum Codes, Found. Comput. Math. 1, 325–332 (2001) (arXiv:quant-ph/9810055, doi:10.1007/s102080010013)
added pointer to:
that last article (CDCW 21) comments on the perspective of practical usefulness of holographic codes (finally, I kept looking for this in vain).
I have added the following quote from the article to the Idea-section of the entry:
There are a number of reasons to suspect that holographic codes may be of practical use for quantum computing.
Holographic codes can admit erasure thresholds comparable to that of the widely-studied surfacecode, and likewise for their threshold against Pauli errors. Their holographic structure also naturally leads to an organization of encoded qubits into a hierarchy of levels of protection from errors, which could be useful for applications which call for many qubits withvarying levels of protection. In particular, this is reminiscent of many schemes for magic state distillation – and indeed, the concatenated codes utilized for magic state distillation share a similar hierarchical structure to holographic codes. The layered structure of holographic codes is also reminiscent of memory architectures in classical computers, where it is useful to have different levels of short- and long-term memory. Although these codes have some notable drawbacks, in particular holographic stabilizer codes require nonlocal stabilizer generators, other codes such as concatenated codes suffer similar drawbacks and have still proven to be useful. Conversely, the stringent requirement of non-local stabilizer generators allows holographic codes to protect many more qubits than a topological code and in fact attain a finite nonzero encoding rate, which is typically not possible for topological codes. Nonetheless, many open questions remain about the usefulness of holographic codes for fault-tolerant quantum computing.
added pointer to:
added pointer to:
added pointer to
with this quote:
$[$ holographic codes $]$ could be promising candidates to circumvent our results and could possibly realise a universal set of unitary implementations of logical operators.
1 to 16 of 16