Obserwuj
Alex Bredariol Grilo
Alex Bredariol Grilo
CNRS, LIP6, Sorbonne Université
Zweryfikowany adres z sorbonne-universite.fr - Strona główna
Tytuł
Cytowane przez
Cytowane przez
Rok
Verifier-on-a-Leash: New Schemes for Verifiable Delegated Quantum Computation, with Quasilinear Resources
A Coladangelo, AB Grilo, S Jeffery, T Vidick
Theory of Computing 20 (1), 1-87, 2024
91*2024
Oblivious transfer is in MiniQCrypt
AB Grilo, H Lin, F Song, V Vaikuntanathan
Advances in Cryptology–EUROCRYPT 2021: 40th Annual International Conference …, 2021
722021
QMA-hardness of consistency of local density matrices with applications to quantum zero-knowledge
A Broadbent, AB Grilo
SIAM Journal on Computing 51 (4), 1400-1450, 2022
69*2022
Learning with Errors is easy with quantum samples
AB Grilo, I Kerenidis, T Zijlstra
Physical Review A 99 (3), 032314, 2017
66*2017
Non-interactive classical verification of quantum computation
G Alagic, AM Childs, AB Grilo, SH Hung
Theory of Cryptography Conference, 2020 12552, 153--180, 2020
652020
Secure Multi-party Quantum Computation with a Dishonest Majority
Y Dulek, AB Grilo, S Jeffery, C Majenz, C Schaffner
Annual International Conference on the Theory and Applications of …, 2020
602020
Tight adaptive reprogramming in the QROM
AB Grilo, K Hövelmanns, A Hülsing, C Majenz
International Conference on the Theory and Application of Cryptology and …, 2021
562021
Quantum statistical query learning
S Arunachalam, AB Grilo, H Yuen
arXiv preprint arXiv:2002.08240, 2020
412020
A Simple Protocol for Verifiable Delegation of Quantum Computation in One Round
AB Grilo
46th International Colloquium on Automata, Languages, and Programming (ICALP …, 2019
31*2019
Perfect zero knowledge for quantum multiprover interactive proofs
AB Grilo, W Slofstra, H Yuen
2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS), 2019
292019
Quantum hardness of learning shallow classical circuits
S Arunachalam, AB Grilo, A Sundaram
SIAM Journal on Computing 50 (3), 972-1013, 2021
262021
Public-key encryption with quantum keys
K Barooti, AB Grilo, L Huguenin-Dumittan, G Malavolta, O Sattath, QH Vu, ...
Theory of Cryptography Conference, 198-227, 2023
25*2023
QMA with subset state witnesses
AB Grilo, I Kerenidis, J Sikora
Chicago Journal of Theoretical Computer Science 2016 (4), 2016
222016
Trainability and expressivity of hamming-weight preserving quantum circuits for machine learning
L Monbroussou, EZ Mamon, J Landman, AB Grilo, R Kukla, E Kashefi
arXiv preprint arXiv:2309.15547, 2023
202023
Stoquastic PCP vs. Randomness
D Aharonov, AB Grilo
2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS …, 2019
182019
Quantum learning algorithms imply circuit lower bounds
S Arunachalam, AB Grilo, T Gur, IC Oliveira, A Sundaram
2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS …, 2022
112022
StoqMA vs. MA: the power of error reduction
D Aharonov, AB Grilo, Y Liu
arXiv preprint arXiv:2010.02835, 2020
72020
Towards the Impossibility of Quantum Public Key Encryption with Classical Keys from One-Way Functions
S Bouaziz–Ermann, AB Grilo, D Vergnaud, QH Vu
IACR Communications in Cryptology 1 (1), 2024
5*2024
The power of shallow-depth Toffoli and qudit quantum circuits
AB Grilo, E Kashefi, D Markham, M de Oliveira
arXiv preprint arXiv:2404.18104, 2024
42024
Two combinatorial MA-complete problems
D Aharonov, AB Grilo
12th Innovations in Theoretical Computer Science Conference (ITCS 2021) 185 …, 2021
4*2021
Nie można teraz wykonać tej operacji. Spróbuj ponownie później.
Prace 1–20