We suggest a technique for constructing lower (existence) bounds for the fault-tolerant threshold to scalable quantum computation applicable to degenerate quantum codes with sublinear distance scaling. We give explicit analytic expressions combining probabilities of erasures, depolarizing errors, and phenomenological syndrome measurement errors for quantum low-density parity-check codes with logarithmic or larger distances. These threshold estimates are parametrically better than the existing analytical bound based on percolation
International audienceThe threshold theorem is a fundamental result in the theory of fault-tolerant ...
International audienceThe threshold theorem is a fundamental result in the theory of fault-tolerant ...
We study the performance of medium-length quantum LDPC (QLDPC) codes in the depolarizing channel. On...
We suggest a technique for constructing lower (existence) bounds for the fault-tolerant threshold to...
We suggest a technique for constructing lower (existence) bounds for the fault-tolerant threshold to...
We suggest a technique for constructing lower (existence) bounds for the fault-tolerant threshold to...
We study analytically and numerically decoding properties of finite-rate hypergraph-product quantum ...
The threshold theorem is a fundamental result in the theory of fault-tolerant quantum computation st...
Vast numbers of qubits will be needed for large-scale quantum computing due to the overheads associa...
A quantum computer can only solve classically intractable problems like factoring large integers if ...
We study analytically and numerically decoding properties of finite-rate hypergraph-product quantum ...
It has been show by E.Knill (quant-ph/9610011) and D.Aharonov (quant-ph/9611025) that once elementar...
International audienceThe threshold theorem is a fundamental result in the theory of fault-tolerant ...
International audienceThe threshold theorem is a fundamental result in the theory of fault-tolerant ...
International audienceThe threshold theorem is a fundamental result in the theory of fault-tolerant ...
International audienceThe threshold theorem is a fundamental result in the theory of fault-tolerant ...
International audienceThe threshold theorem is a fundamental result in the theory of fault-tolerant ...
We study the performance of medium-length quantum LDPC (QLDPC) codes in the depolarizing channel. On...
We suggest a technique for constructing lower (existence) bounds for the fault-tolerant threshold to...
We suggest a technique for constructing lower (existence) bounds for the fault-tolerant threshold to...
We suggest a technique for constructing lower (existence) bounds for the fault-tolerant threshold to...
We study analytically and numerically decoding properties of finite-rate hypergraph-product quantum ...
The threshold theorem is a fundamental result in the theory of fault-tolerant quantum computation st...
Vast numbers of qubits will be needed for large-scale quantum computing due to the overheads associa...
A quantum computer can only solve classically intractable problems like factoring large integers if ...
We study analytically and numerically decoding properties of finite-rate hypergraph-product quantum ...
It has been show by E.Knill (quant-ph/9610011) and D.Aharonov (quant-ph/9611025) that once elementar...
International audienceThe threshold theorem is a fundamental result in the theory of fault-tolerant ...
International audienceThe threshold theorem is a fundamental result in the theory of fault-tolerant ...
International audienceThe threshold theorem is a fundamental result in the theory of fault-tolerant ...
International audienceThe threshold theorem is a fundamental result in the theory of fault-tolerant ...
International audienceThe threshold theorem is a fundamental result in the theory of fault-tolerant ...
We study the performance of medium-length quantum LDPC (QLDPC) codes in the depolarizing channel. On...