Filtrer vos résultats
- 6
- 3
- 1
- 4
- 2
- 2
- 1
- 1
- 9
- 6
- 1
- 2
- 2
- 2
- 4
- 10
- 10
- 6
- 10
- 8
- 6
- 3
- 2
10 résultats
|
|
|
triés par
|
|
|
Quantum expander codesJournées codage et cryptographie 2017, Apr 2017, La Bresse, France
Communication dans un congrès
hal-01671485v1
|
||
|
|
Constant overhead quantum fault-tolerance with quantum expander codesFOCS 2018 - 59th Annual IEEE Symposium on Foundations of Computer Science, Oct 2018, Paris, France. pp.743-754, ⟨10.1109/FOCS.2018.00076⟩
Communication dans un congrès
hal-01895430v1
|
||
|
|
Numerical study of hypergraph product codes2018
Pré-publication, Document de travail
hal-01895436v1
|
||
|
|
Combining hard and soft decoders for hypergraph product codesQuantum, 2021, 5 (432), ⟨10.22331/q-2021-04-15-432⟩
Article dans une revue
hal-03108332v1
|
||
|
|
Constant overhead quantum fault tolerance with quantum expander codesCommunications of the ACM, 2021, 64 (1), pp.106-114. ⟨10.1145/3434163⟩
Article dans une revue
hal-03135932v2
|
||
|
|
Efficient decoding of random errors for quantum expander codesJournées Informatique Quantique 2017, Nov 2017, Bordeaux, France. pp.521-534
Communication dans un congrès
hal-01671491v1
|
||
|
|
Efficient decoding of random errors for quantum expander codes2017
Pré-publication, Document de travail
hal-01671348v1
|
||
Combining Hard and Soft Decoders for Hypergraph Product CodesQEC19 - 5th International Conference on Quantum Error Correction, Jul 2019, London, United Kingdom
Communication dans un congrès
hal-02429542v1
|
|||
|
|
Constant time decoding of quantum expander codes and application to fault-tolerant quantum computationComputational Complexity [cs.CC]. Sorbonne Université, 2019. English. ⟨NNT : 2019SORUS575⟩
Thèse
tel-03364419v3
|
||
|
|
Efficient decoding of random errors for quantum expander codes8th colloquium of the GDR IQFA - Ingénierie Quantique, des Aspects Fondamentaux aux Applications, Nov 2017, Nice, France
Poster de conférence
hal-01671496v1
|