Filtrer vos résultats
- 30
- 20
- 21
- 19
- 9
- 1
- 31
- 23
- 9
- 1
- 7
- 7
- 9
- 2
- 2
- 8
- 8
- 2
- 3
- 1
- 1
- 49
- 1
- 44
- 16
- 15
- 7
- 6
- 4
- 3
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 50
- 8
- 7
- 6
- 6
- 5
- 4
- 4
- 3
- 3
- 3
- 3
- 3
- 2
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
50 résultats
|
|
|
triés par
|
Decoupling with Random Quantum CircuitsCommunications in Mathematical Physics, 2015, 340 (3), pp.867-900
Article dans une revue
hal-01995217v1
|
|||
Quantum Conditional Mutual Information and Approximate Markov ChainsCommunications in Mathematical Physics, 2015, 340 (2), pp.575-611
Article dans une revue
hal-01992096v1
|
|||
|
|
Longest path distance in random circuitsCombinatorics, Probability and Computing, 2012, 21 (6), pp.856-881. ⟨10.1017/S0963548312000260⟩
Article dans une revue
hal-00773368v1
|
||
|
|
A lower bound on the space overhead of fault-tolerant quantum computation13th Innovations in Theoretical Computer Science Conference (ITCS 2022), Jan 2022, Berkeley, United States. ⟨10.4230/LIPIcs.ITCS.2022.68⟩
Communication dans un congrès
hal-03581661v1
|
||
|
|
Bounds on Lyapunov Exponents via Entropy AccumulationIEEE Transactions on Information Theory, 2021, 67 (1), pp.10-24. ⟨10.1109/TIT.2020.3026959⟩
Article dans une revue
hal-03130062v1
|
||
|
|
Robustness of classifiers to uniform $\ell_p$ and Gaussian noiseTwenty-first International Conference on Artificial Intelligence and Statistics, Apr 2018, Playa Blanca, Spain. pp.1280-1288
Communication dans un congrès
hal-01715012v1
|
||
Universal recovery map for approximate Markov chainsProceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences, 2016, 472 (2186), pp.20150623
Article dans une revue
hal-01995214v1
|
|||
|
|
Semidefinite programming hierarchies for quantum error correction2019
Pré-publication, Document de travail
hal-01990447v1
|
||
|
|
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
|
||
|
|
Beating the Sum-Rate Capacity of the Binary Adder Channel with Non-Signaling CorrelationsISIT 2022 - IEEE International Symposium on Information Theory, Jun 2022, Espoo, Finland
Communication dans un congrès
hal-03702410v1
|
||
|
|
On the Spectral Properties of Symmetric Functions2017
Pré-publication, Document de travail
hal-01505075v1
|
||
On variational expressions for quantum relative entropiesLetters in Mathematical Physics, 2017, 107 (12), pp.2239-2265
Article dans une revue
hal-01992082v1
|
|||
|
|
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
|
||
|
|
On Rejection Sampling in Lyubashevsky's Signature SchemeASIACRYPT 2022 - 28th Annual International Conference on the Theory and Application of Cryptology and Information Security, Dec 2022, Taipei, Taiwan
Communication dans un congrès
hal-03911595v1
|
||
|
|
Efficient decoding of random errors for quantum expander codes2017
Pré-publication, Document de travail
hal-01671348v1
|
||
|
|
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
|
||
|
|
Semidefinite programming lower bounds on the squashed entanglement2022
Pré-publication, Document de travail
hal-03750963v1
|
||
|
|
Asymptotic Equipartition Theorems in von Neumann algebras2023
Pré-publication, Document de travail
hal-03931577v1
|
||
Approximation algorithms for classical-quantum channel coding2019 IEEE International Symposium on Information Theory (ISIT), Jul 2019, Paris, France. pp.2569-2573, ⟨10.1109/ISIT.2019.8849617⟩
Communication dans un congrès
hal-03142775v1
|
|||
|
|
Tight Approximation Bounds for Maximum Multi-CoverageIPCO 2020 - 21st International Conference on Integer Programming and Combinatorial Optimization, Jun 2020, London, United Kingdom. pp.66-77, ⟨10.1007/978-3-030-45771-6_6⟩
Communication dans un congrès
hal-03130103v1
|
||
Algorithmic Aspects of Optimal Channel CodingIEEE Transactions on Information Theory, 2018, 64 (2), pp.1038-1045
Article dans une revue
hal-01992092v1
|
|||
|
|
Quasi-polynomial time algorithms for free quantum games in bounded dimension48th International Colloquium on Automata, Languages, and Programming (ICALP 2021), Jul 2021, Glasgow, United Kingdom. ⟨10.4230/LIPIcs.ICALP.2021.82⟩
Communication dans un congrès
hal-03130069v1
|
||
Analysis of classifiers’ robustness to adversarial perturbationsMachine Learning, 2018, 107 (3), pp.481-508
Article dans une revue
hal-01992078v1
|
|||
|
|
Device-independent lower bounds on the conditional von Neumann entropy2022
Pré-publication, Document de travail
hal-03581631v1
|
||
La mécanique quantique comme garant de sécurité pour l’échange de clé secrèteInterstices, 2021
Article dans une revue
hal-03131347v1
|
|||
|
|
Linear programming decoder for hypergraph product quantum codesIEEE ITW 2020 - IEEE Information theory workshop 2020, Apr 2021, Riva del Garda / Virtual, Italy. ⟨10.1109/ITW46852.2021.9457611⟩
Communication dans un congrès
hal-03135797v1
|
||
Efficient optimization of the quantum relative entropyJournal of Physics A: Mathematical and Theoretical, 2018, 51 (15), pp.154003
Article dans une revue
hal-01995215v1
|
|||
|
|
Adversarial vulnerability for any classifierNeuroIPS 2018, Dec 2018, Montreal, Canada
Communication dans un congrès
hal-01990465v1
|
||
Universal Adversarial Perturbations2017 IEEE Conference on Computer Vision and Pattern Recognition (CVPR), Jul 2017, Honolulu, France. pp.86-94
Communication dans un congrès
hal-01992067v1
|
|||
Quantum Bilinear OptimizationSIAM Journal on Optimization, 2016, 26 (3), pp.1529-1564
Article dans une revue
hal-01995213v1
|
- 1
- 2