Filter your results
- 29
- 17
- 20
- 18
- 7
- 1
- 29
- 21
- 8
- 1
- 2
- 8
- 9
- 2
- 2
- 8
- 8
- 2
- 3
- 1
- 1
- 45
- 1
- 41
- 12
- 11
- 7
- 6
- 4
- 2
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 46
- 7
- 7
- 6
- 6
- 5
- 4
- 4
- 3
- 3
- 3
- 2
- 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
46 Results
|
|
sorted by
|
|
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
Conference papers
hal-03911595v1
|
||
|
On the Spectral Properties of Symmetric Functions2017
Preprints, Working Papers, ...
hal-01505075v1
|
||
On variational expressions for quantum relative entropiesLetters in Mathematical Physics, 2017, 107 (12), pp.2239-2265
Journal articles
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⟩
Conference papers
hal-01895430v1
|
||
|
Tight Approximation Guarantees for Concave Coverage ProblemsSTACS 2021, Mar 2021, Saarbücken, Germany
Conference papers
hal-03113321v1
|
||
Entanglement Sampling and ApplicationsIEEE Transactions on Information Theory, 2015, 61 (2), pp.1093-1112
Journal articles
hal-01995218v1
|
|||
|
Generalised entropy accumulation2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS), Oct 2022, Denver, United States. ⟨10.1109/FOCS54457.2022.00085⟩
Conference papers
hal-03750961v1
|
||
|
A subpolynomial-time algorithm for the free energy of one-dimensional quantum systems in the thermodynamic limit2022
Preprints, Working Papers, ...
hal-03852131v1
|
||
|
Larger Corner-Free Sets from Combinatorial DegenerationsITCS 2022 - 13th Innovations in Theoretical Computer Science Conference, Jan 2022, Berkeley, United States. pp.1-2410, ⟨10.4230/LIPIcs.ITCS.2022.48⟩
Conference papers
hal-03581653v1
|
||
|
Sequential Algorithms for Testing Closeness of DistributionsNeurIPS 2021, Dec 2021, Virtual, France
Conference papers
hal-03481048v1
|
||
|
Computing conditional entropies for quantum correlationsNature Communications, 2021, ⟨10.1038/s41467-020-20018-1⟩
Journal articles
hal-03129978v1
|
||
|
Entropy accumulation with improved second-order2018
Preprints, Working Papers, ...
hal-01925985v1
|
||
|
Practical device-independent quantum cryptography via entropy accumulationNature Communications, 2018, 9 (1), ⟨10.1038/s41467-017-02307-4⟩
Journal articles
hal-01992050v1
|
||
Quantum-Proof Randomness Extractors via Operator Space TheoryIEEE Transactions on Information Theory, 2017, 63 (4), pp.2480-2503
Journal articles
hal-01995219v1
|
|||
|
Defining quantum divergences via convex optimizationQuantum, 2021, 5, pp.1-26. ⟨10.22331/q-2021-01-26-387⟩
Journal articles
hal-03110737v1
|
||
|
The height of scaled attachment random recursive trees21st International Meeting on Probabilistic, Combinatorial, and Asymptotic Methods in the Analysis of Algorithms (AofA'10), 2010, Vienna, Austria. pp.129-142, ⟨10.46298/dmtcs.2788⟩
Conference papers
hal-01185586v1
|
||
|
Quantum expander codesJournées codage et cryptographie 2017, Apr 2017, La Bresse, France
Conference papers
hal-01671485v1
|
||
|
Multiple-Access Channel Coding with Non-Signaling CorrelationsIEEE Transactions on Information Theory, 2023, pp.1-51. ⟨10.1109/TIT.2023.3301719⟩
Journal articles
hal-04206096v1
|
||
|
On Adaptivity in Quantum TestingTransactions on Machine Learning Research Journal, 2023
Journal articles
hal-04107265v1
|
||
|
Bounds on Lyapunov Exponents via Entropy AccumulationIEEE Transactions on Information Theory, 2021, 67 (1), pp.10-24. ⟨10.1109/TIT.2020.3026959⟩
Journal articles
hal-03130062v1
|
||
|
Constant overhead quantum fault tolerance with quantum expander codesCommunications of the ACM, 2021, 64 (1), pp.106-114. ⟨10.1145/3434163⟩
Journal articles
hal-03135932v1
|
||
|
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
Conference papers
hal-01715012v1
|
||
|
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
Conference papers
hal-03702410v1
|
||
Universal recovery map for approximate Markov chainsProceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences, 2016, 472 (2186), pp.20150623
Journal articles
hal-01995214v1
|
|||
|
Semidefinite programming hierarchies for quantum error correction2019
Preprints, Working Papers, ...
hal-01990447v1
|
||
|
Longest path distance in random circuitsCombinatorics, Probability and Computing, 2012, 21 (6), pp.856-881. ⟨10.1017/S0963548312000260⟩
Journal articles
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⟩
Conference papers
hal-03581661v1
|
||
Decoupling with Random Quantum CircuitsCommunications in Mathematical Physics, 2015, 340 (3), pp.867-900
Journal articles
hal-01995217v1
|
|||
Quantum Conditional Mutual Information and Approximate Markov ChainsCommunications in Mathematical Physics, 2015, 340 (2), pp.575-611
Journal articles
hal-01992096v1
|
|||
|
Device-independent lower bounds on the conditional von Neumann entropy2022
Preprints, Working Papers, ...
hal-03581631v1
|
- 1
- 2