default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAnthony Leverrier
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j11]Aurélie Denys
, Anthony Leverrier:
The 2T-qutrit, a two-mode bosonic qutrit. Quantum 7: 1032 (2023)- [j10]Anthony Leverrier, Gilles Zémor:
Decoding Quantum Tanner Codes. IEEE Trans. Inf. Theory 69(8): 5100-5115 (2023) - [c13]Anthony Leverrier, Gilles Zémor:
Efficient decoding up to a constant fraction of the code length for asymptotically good quantum codes. SODA 2023: 1216-1244 - [i22]Anthony Leverrier:
Information reconciliation for discretely-modulated continuous-variable quantum key distribution. CoRR abs/2310.17548 (2023) - 2022
- [j9]Anthony Leverrier, Vivien Londe, Gilles Zémor:
Towards local testability for quantum coding. Quantum 6: 661 (2022) - [j8]Anthony Leverrier, Simon Apers, Christophe Vuillot:
Quantum XYZ Product Codes. Quantum 6: 766 (2022) - [c12]Anthony Leverrier, Gilles Zémor:
Quantum Tanner codes. FOCS 2022: 872-883 - [i21]Anthony Leverrier, Gilles Zémor:
Quantum Tanner codes. CoRR abs/2202.13641 (2022) - [i20]Anthony Leverrier, Gilles Zémor:
Efficient decoding up to a constant fraction of the code length for asymptotically good quantum codes. CoRR abs/2206.07571 (2022) - [i19]Nicholas Connolly, Vivien Londe, Anthony Leverrier, Nicolas Delfosse:
Fast erasure decoder for a class of quantum LDPC codes. CoRR abs/2208.01002 (2022) - [i18]Anthony Leverrier, Gilles Zémor:
A parallel decoder for good quantum LDPC codes. CoRR abs/2208.05537 (2022) - [i17]Anthony Leverrier, Gilles Zémor:
Quantum Tanner codes. Electron. Colloquium Comput. Complex. TR22 (2022) - [i16]Anthony Leverrier, Gilles Zémor:
Efficient decoding up to a constant fraction of the code length for asymptotically good quantum codes. Electron. Colloquium Comput. Complex. TR22 (2022) - 2021
- [j7]Omar Fawzi, Antoine Grospellier, Anthony Leverrier:
Constant overhead quantum fault tolerance with quantum expander codes. Commun. ACM 64(1): 106-114 (2021) - [j6]Antoine Grospellier, Lucien Grouès, Anirudh Krishna, Anthony Leverrier:
Combining hard and soft decoders for hypergraph product codes. Quantum 5: 432 (2021) - [j5]Aurélie Denys, Peter J. Brown, Anthony Leverrier:
Explicit asymptotic secret key rate of continuous-variable quantum key distribution with an arbitrary modulation. Quantum 5: 540 (2021) - [c11]Anthony Leverrier, Vivien Londe, Gilles Zémor:
Towards Local Testability for Quantum Coding. ITCS 2021: 65:1-65:11 - 2020
- [c10]Omar Fawzi, Lucien Grouès, Anthony Leverrier:
Linear programming decoder for hypergraph product quantum codes. ITW 2020: 1-5 - [i15]Antoine Grospellier, Lucien Grouès, Anirudh Krishna, Anthony Leverrier:
Combining hard and soft decoders for hypergraph product codes. CoRR abs/2004.11199 (2020)
2010 – 2019
- 2019
- [j4]Vivien Londe, Anthony Leverrier:
Golden codes: quantum LDPC codes from regular tessellations of hyperbolic 4-manifolds. Quantum Inf. Comput. 19(5&6): 361-391 (2019) - [i14]Anthony Leverrier, Vivien Londe, Gilles Zémor:
Towards local testability for quantum coding. CoRR abs/1911.03069 (2019) - 2018
- [c9]Omar Fawzi, Antoine Grospellier, Anthony Leverrier:
Constant Overhead Quantum Fault-Tolerance with Quantum Expander Codes. FOCS 2018: 743-754 - [c8]Omar Fawzi, Antoine Grospellier, Anthony Leverrier:
Efficient decoding of random errors for quantum expander codes. STOC 2018: 521-534 - [i13]Omar Fawzi, Antoine Grospellier, Anthony Leverrier:
Constant overhead quantum fault-tolerance with quantum expander codes. CoRR abs/1808.03821 (2018) - 2017
- [c7]André Chailloux, Anthony Leverrier:
Relativistic (or 2-Prover 1-Round) Zero-Knowledge Protocol for \mathsf NP Secure Against Quantum Adversaries. EUROCRYPT (3) 2017: 369-396 - [i12]Omar Fawzi, Antoine Grospellier, Anthony Leverrier:
Efficient decoding of random errors for quantum expander codes. CoRR abs/1711.08351 (2017) - [i11]Vivien Londe, Anthony Leverrier:
Golden codes: quantum LDPC codes built from regular tessellations of hyperbolic 4-manifolds. CoRR abs/1712.08578 (2017) - 2016
- [j3]Marc Kaplan, Gaëtan Leurent, Anthony Leverrier, María Naya-Plasencia:
Quantum Differential and Linear Cryptanalysis. IACR Trans. Symmetric Cryptol. 2016(1): 71-94 (2016) - [c6]Marc Kaplan, Gaëtan Leurent, Anthony Leverrier, María Naya-Plasencia:
Breaking Symmetric Cryptosystems Using Quantum Period Finding. CRYPTO (2) 2016: 207-237 - [i10]Marc Kaplan, Gaëtan Leurent, Anthony Leverrier, María Naya-Plasencia:
Breaking Symmetric Cryptosystems using Quantum Period Finding. CoRR abs/1602.05973 (2016) - [i9]Kaushik Chakraborty, André Chailloux, Anthony Leverrier:
Robust Relativistic Bit Commitment. CoRR abs/1608.03398 (2016) - 2015
- [j2]Eleni Diamanti, Anthony Leverrier:
Distributing Secret Keys with Quantum Continuous Variables: Principle, Security and Implementations. Entropy 17(9): 6072-6092 (2015) - [j1]Anthony Leverrier, Raúl García-Patrón:
Analysis of circuit imperfections in BosonSampling. Quantum Inf. Comput. 15(5&6): 489-512 (2015) - [c5]Anthony Leverrier, Jean-Pierre Tillich, Gilles Zémor:
Quantum Expander Codes. FOCS 2015: 810-824 - [i8]Anthony Leverrier, Jean-Pierre Tillich, Gilles Zémor:
Quantum Expander Codes. CoRR abs/1504.00822 (2015) - [i7]Kaushik Chakraborty, André Chailloux, Anthony Leverrier:
Arbitrarily long relativistic bit commitment. CoRR abs/1507.00239 (2015) - [i6]Marc Kaplan, Gaëtan Leurent, Anthony Leverrier, María Naya-Plasencia:
Quantum Differential and Linear Cryptanalysis. CoRR abs/1510.05836 (2015) - 2013
- [c4]Tobias Fritz, Anthony Leverrier, Ana Belén Sainz:
Probabilistic models on contextuality scenarios. QPL 2013: 63-70 - 2011
- [c3]Anthony Leverrier, Philippe Grangier:
Long Distance Quantum Key Distribution with Continuous Variables. TQC 2011: 143-152 - [i5]Paul Jouguet, Sébastien Kunz-Jacques, Anthony Leverrier:
Long Distance Continuous-Variable Quantum Key Distribution with a Gaussian Modulation. CoRR abs/1110.0100 (2011)
2000 – 2009
- 2009
- [c2]David Elkouss, Anthony Leverrier, Romain Alléaume, Joseph Jean Boutros:
Efficient reconciliation protocol for discrete-variable quantum key distribution. ISIT 2009: 1879-1883 - [i4]Romain Alléaume, Norbert Lütkenhaus, Renato Renner, Philippe Grangier, Thierry Debuisschert, Gregoire Ribordy, Nicolas Gisin, Philippe Painchault, Thomas Pornin, Louis Salvail, Michel Riguidel, Andrew J. Shields, Thomas Länger, Momtchil Peev, Mehrdad Dianati, Anthony Leverrier, Andreas Poppe, Jan Bouda, Cyril Branciard, Mark Godfrey, John G. Rarity, Harald Weinfurter, Anton Zeilinger, Christian Monyk:
Quantum key distribution and cryptography: a survey. Classical and Quantum Information Assurance Foundations and Practice 2009 - [i3]David Elkouss, Anthony Leverrier, Romain Alléaume, Joseph Boutros:
Efficient reconciliation protocol for discrete-variable quantum key distribution. CoRR abs/0901.2140 (2009) - 2008
- [c1]Anthony Leverrier, Romain Alléaume, Joseph Boutros, Gilles Zémor, Philippe Grangier:
Multidimensional reconciliation for continuous-variable quantum key distribution. ISIT 2008: 1020-1024 - 2007
- [i2]Anthony Leverrier, Romain Alléaume, Joseph Boutros, Gilles Zémor, Philippe Grangier:
Multidimensional reconciliation for continuous-variable quantum key distribution. CoRR abs/0712.3823 (2007) - [i1]Romain Alléaume, Jan Bouda, Cyril Branciard, Thierry Debuisschert, Mehrdad Dianati, Nicolas Gisin, Mark Godfrey, Philippe Grangier, Thomas Länger, Anthony Leverrier, Norbert Lütkenhaus, Philippe Painchault, Momtchil Peev, Andreas Poppe, Thomas Pornin, John G. Rarity, Renato Renner, Gregoire Ribordy, Michel Riguidel, Louis Salvail, Andrew J. Shields, Harald Weinfurter, Anton Zeilinger:
SECOQC White Paper on Quantum Key Distribution and Cryptography. CoRR abs/quant-ph/0701168 (2007)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:19 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
