Alex Bredariol Grilo
27
Documents
Présentation
<a name="bio"></a>Bio
---------------------
Since October 2020, I have been a CNRS researcher at LIP6 (CNRS/Sorbonne Université). Previously, I was a post-doc at CWI and QuSoft, a research fellow at the Simons Institute (UC Berkeley) and a PhD student at Université Paris Diderot, where I was affiliated to IRIF. I got my Master's and Bachelor's degree from University of Campinas.
<a name="bio"></a>Contact
-------------------------
Alex (dot) Bredariol-Grilo (at) lip6 (dot) fr
<a name="research"></a>Research interests
-----------------------------------------
- Quantum computing
- Interactive proof systems and PCPs
- Complexity theory
- Cryptography
<a name="research"></a>
<a name="research"></a><a name="research"></a><a name="employment"></a>Employment
----------------------------------------------------------
- CNRS researcher - LIP6 (Sorbonne Université/CNRS)
From 10/2020 to present
- Post-doc - CWI and QuSoft
From 06/2018 to 09/2020
Supervisors: [Ronald de Wolf](https://homepages.cwi.nl/~rdewolf/), [Stacey Jeffery](https://homepages.cwi.nl/~jeffery/) and [Christian Schaffner](https://homepages.cwi.nl/~schaffne/)(informal)
- Research Fellow - Simons Institute, UC Berkeley
From 01/2020 to 05/2020
- Lecturer (ATER) - Université Paris Diderot
From 09/2017 to 04/2018
<a name="education"></a>Education
---------------------------------
- PhD in Computer Science - Université Paris Diderot, France
From 09/2014 to 04/2018
Title: Quantum proofs, the Local Hamiltonian problem and applications
Advisor: [Iordanis Kerenidis](http://www.irif.fr/~jkeren)
- MSc. in Computer Science - University of Campinas (Unicamp), Brazil
From 03/2012 to 04/2014
Title: Quantum Computing and Theoretical Computer Science
Advisor: [Prof. Arnaldo Vieira Moura](http://www.ic.unicamp.br/~arnaldo)
- BSc. in Computer Science - University of Campinas (Unicamp), Brazil
From 03/2007 to 07/2011
Publications
Towards the Impossibility of Quantum Public Key Encryption with Classical Keys from One-Way FunctionsIACR Communications in Cryptology, 2024, ⟨10.62056/ahvr-11zn4⟩
Article dans une revue
hal-04540950v1
|
|
QMA-Hardness of Consistency of Local Density Matrices with Applications to Quantum Zero-KnowledgeSIAM Journal on Computing, 2022, 51 (4), pp.1400-1450. ⟨10.1137/21M140729X⟩
Article dans une revue
hal-03773541v1
|
|
Quantum hardness of learning shallow classical circuitsSIAM Journal on Computing, 2021, 50 (3), pp.972-1013. ⟨10.1137/20M1344202⟩
Article dans une revue
hal-03043254v1
|
|
Learning-with-errors problem is easy with quantum samplesPhysical Review A, 2019, 99 (3), ⟨10.1103/PhysRevA.99.032314⟩
Article dans une revue
hal-03032826v1
|
|
QMA with Subset State WitnessesChicago Journal of Theoretical Computer Science, 2016, 2016 (4), pp.1-17. ⟨10.4086/cjtcs.2016.004⟩
Article dans une revue
hal-03043238v1
|
Public-Key Encryption with Quantum KeysTheory of Cryptography - 21st International Conference, {TCC} 2023, Taipei, Taiwan, November 29 - December 2, 2023, Proceedings, Part {IV}, Nov 2023, Taipei (Taiwan), Taiwan. pp.198-227, ⟨10.1007/978-3-031-48624-1_8⟩
Communication dans un congrès
hal-04514071v1
|
|
Quantum security of subset cover problems4th Conference on Information-Theoretic Cryptography (ITC 2023), Jun 2023, Aahrus, Denmark. pp.9:1--9:17, ⟨10.4230/LIPIcs.ITC.2023.9⟩
Communication dans un congrès
hal-03832954v1
|
|
Quantum learning algorithms imply circuit lower bounds2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS), Feb 2022, Denver, United States. pp.562-573, ⟨10.1109/FOCS52979.2021.00062⟩
Communication dans un congrès
hal-03836332v1
|
|
Oblivious Transfer is in MiniQCryptAdvances in Cryptology - EUROCRYPT 2021 - 40th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Oct 2021, Zagreb, Croatia. pp.531-561, ⟨10.1007/978-3-030-77886-6_18⟩
Communication dans un congrès
hal-03033900v1
|
|
Two combinatorial MA-complete problems12th Innovations in Theoretical Computer Science Conference (ITCS 2021), Jan 2021, Online, France. pp.36:1--36:20, ⟨10.4230/LIPIcs.ITCS.2021.36⟩
Communication dans un congrès
hal-03130966v1
|
|
Tight adaptive reprogramming in the QROMAdvances in Cryptology - ASIACRYPT 2021 - 27th International Conference on the Theory and Application of Cryptology and Information Security, Dec 2021, Singapore, Singapore. pp.637-667, ⟨10.1007/978-3-030-92062-3_22⟩
Communication dans un congrès
hal-02997744v1
|
|
Secure Multi-party Quantum Computation with a Dishonest MajorityAdvances in Cryptology - EUROCRYPT 2020 - 39th Annual International Conference on the Theory and Applications of Cryptographic Techniques, May 2020, Zagreb, Croatia. pp.729-758, ⟨10.1007/978-3-030-45727-3_25⟩
Communication dans un congrès
hal-02968389v1
|
|
QMA-Hardness of Consistency of Local Density Matrices with Applications to Quantum Zero-KnowledgeIEEE 61st Annual Symposium on Foundations of Computer Science (FOCS), Nov 2020, Virtual, United States. ⟨10.1109/FOCS46700.2020.00027⟩
Communication dans un congrès
hal-03123358v1
|
|
Non-interactive classical verification of quantum computationTheory of Cryptography - 18th International Conference, TCC 2020, Nov 2020, Durham, United States. pp.153--180, ⟨10.1007/978-3-030-64381-2_6⟩
Communication dans un congrès
hal-03043284v1
|
|
A Simple Protocol for Verifiable Delegation of Quantum Computation in One Round46th International Colloquium on Automata, Languages, and Programming, ICALP 2019, Jul 2019, Patras, Greece. pp.28:1--28:13, ⟨10.4230/LIPIcs.ICALP.2019.28⟩
Communication dans un congrès
hal-03033187v1
|
|
Stoquastic PCP vs. Randomness2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS), Nov 2019, Baltimore, United States. pp.1000-1023, ⟨10.1109/FOCS.2019.00065⟩
Communication dans un congrès
hal-03032845v1
|
|
Verifier-on-a-Leash: New Schemes for Verifiable Delegated Quantum Computation, with Quasilinear ResourcesAdvances in Cryptology - EUROCRYPT 2019 - 38th Annual International Conference on the Theory and Applications of Cryptographic Techniques, May 2019, Darmstadt, Germany. pp.247-277, ⟨10.1007/978-3-030-17659-4_9⟩
Communication dans un congrès
hal-03033171v1
|
|
Perfect Zero Knowledge for Quantum Multiprover Interactive Proofs2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS), Nov 2019, Baltimore, United States. pp.611-635, ⟨10.1109/FOCS.2019.00044⟩
Communication dans un congrès
hal-03032834v1
|
|
Pointer Quantum PCPs and Multi-Prover Games41st International Symposium on Mathematical Foundations of Computer Science, MFCS 2016, Aug 2016, Kraków, Poland. pp.21:1--21:14, ⟨10.4230/LIPIcs.MFCS.2016.21⟩
Communication dans un congrès
hal-03043224v1
|
|
QMA with Subset State WitnessesMathematical Foundations of Computer Science 2015 - 40th International Symposium, MFCS 2015, Aug 2015, Milan, Italy. pp.163-174, ⟨10.1007/978-3-662-48054-0_14⟩
Communication dans un congrès
hal-03032854v1
|
Encryption with Quantum Public Keys2023
Pré-publication, Document de travail
hal-04022634v1
|
|
Trainability and Expressivity of Hamming-Weight Preserving Quantum Circuits for Machine Learning2023
Pré-publication, Document de travail
hal-04225039v1
|
|
Post-Quantum Zero-Knowledge with Space-Bounded Simulation2022
Pré-publication, Document de travail
hal-03812841v1
|
|
On-State Commutativity of Measurements and Joint Distributions of Their Outcomes2021
Pré-publication, Document de travail
hal-03123361v1
|
|
Quantum statistical query learning2020
Pré-publication, Document de travail
hal-03043275v1
|
|
StoqMA vs. MA: the power of error reduction2020
Pré-publication, Document de travail
hal-02968357v1
|
|
|
Quantum proofs, the local Hamiltonian problem and applicationsComputer Arithmetic. Université Sorbonne Paris Cité, 2018. English. ⟨NNT : 2018USPCC051⟩
Thèse
tel-02152364v1
|