default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNicolas Delfosse
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i21]Nicolas Delfosse, Edwin Tham:
Low-cost noise reduction for Clifford circuits. CoRR abs/2407.06583 (2024)- 2023
- [j8]Aleksander Kubica
, Nicolas Delfosse:
Efficient color code decoders in d≥2 dimensions from toric code decoders. Quantum 7: 929 (2023) - [i20]Nicolas Delfosse, Adam Paetznick:
Spacetime codes of Clifford circuits. CoRR abs/2304.05943 (2023) - 2022
- [j7]Nicolas Delfosse, Ben W. Reichardt, Krysta M. Svore:
Beyond Single-Shot Fault-Tolerant Quantum Error Correction. IEEE Trans. Inf. Theory 68(1): 287-301 (2022) - [j6]Nicolas Delfosse, Vivien Londe, Michael E. Beverland:
Toward a Union-Find Decoder for Quantum LDPC Codes. IEEE Trans. Inf. Theory 68(5): 3187-3199 (2022) - [c6]Poulami Das, Christopher A. Pattison, Srilatha Manne, Douglas M. Carmean, Krysta M. Svore, Moinuddin K. Qureshi, Nicolas Delfosse:
AFS: Accurate, Fast, and Scalable Error-Decoding for Fault-Tolerant Quantum Computers. HPCA 2022: 259-273 - [i19]Nicholas Connolly, Vivien Londe, Anthony Leverrier, Nicolas Delfosse:
Fast erasure decoder for a class of quantum LDPC codes. CoRR abs/2208.01002 (2022) - 2021
- [j5]Nicolas Delfosse, Matthew B. Hastings:
Union-Find Decoders For Homological Product Codes. Quantum 5: 406 (2021) - [j4]Nicolas Delfosse, Naomi H. Nickerson:
Almost-linear time decoding algorithm for topological codes. Quantum 5: 595 (2021) - [i18]Nicolas Delfosse, Vivien Londe, Michael E. Beverland:
Toward a Union-Find decoder for quantum LDPC codes. CoRR abs/2103.08049 (2021) - [i17]Christopher A. Pattison, Michael E. Beverland, Marcus P. da Silva, Nicolas Delfosse:
Improved quantum error correction using soft information. CoRR abs/2107.13589 (2021) - [i16]Nicolas Delfosse, Michael E. Beverland, Maxime A. Tremblay:
Bounds on stabilizer measurement circuits and obstructions to local implementations of quantum LDPC codes. CoRR abs/2109.14599 (2021) - [i15]Maxime A. Tremblay, Nicolas Delfosse, Michael E. Beverland:
Constant-overhead quantum error correction with thin planar connectivity. CoRR abs/2109.14609 (2021) - 2020
- [j3]Rui Chao, Michael E. Beverland, Nicolas Delfosse, Jeongwan Haah:
Optimization of the surface code design for Majorana-based qubits. Quantum 4: 352 (2020) - [i14]Poulami Das, Christopher A. Pattison, Srilatha Manne, Douglas M. Carmean, Krysta M. Svore, Moinuddin K. Qureshi, Nicolas Delfosse:
A Scalable Decoder Micro-architecture for Fault-Tolerant Quantum Computing. CoRR abs/2001.06598 (2020) - [i13]Nicolas Delfosse:
Hierarchical decoding to reduce hardware requirements for quantum computing. CoRR abs/2001.11427 (2020) - [i12]Nicolas Delfosse, Ben W. Reichardt, Krysta M. Svore:
Beyond single-shot fault-tolerant quantum error correction. CoRR abs/2002.05180 (2020) - [i11]Nicolas Delfosse, Ben W. Reichardt:
Short Shor-style syndrome sequences. CoRR abs/2008.05051 (2020)
2010 – 2019
- 2018
- [i10]Hendrik Poulsen Nautrup, Nicolas Delfosse, Vedran Dunjko, Hans J. Briegel, Nicolai Friis:
Optimizing Quantum Error Correction Codes with Reinforcement Learning. CoRR abs/1812.08451 (2018) - 2017
- [i9]Nicolas Delfosse, Gilles Zémor:
Linear-Time Maximum Likelihood Decoding of Surface Codes over the Quantum Erasure Channel. CoRR abs/1703.01517 (2017) - 2016
- [i8]Nicolas Delfosse, Pavithran Iyer, David Poulin:
Generalized surface codes and packing of logical qubits. CoRR abs/1606.07116 (2016) - [i7]Nicolas Delfosse, Pavithran Iyer, David Poulin:
A linear-time benchmarking tool for generalized surface codes. CoRR abs/1611.04256 (2016) - 2014
- [c5]Nicolas Delfosse, Jean-Pierre Tillich:
A decoding algorithm for CSS codes using the X/Z correlations. ISIT 2014: 1071-1075 - [c4]Nicolas Delfosse, Zhentao Li, Stéphan Thomassé:
A Note on the Minimum Distance of Quantum LDPC Codes. MFCS (2) 2014: 239-250 - [i6]Nicolas Delfosse, Jean-Pierre Tillich:
A decoding algorithm for CSS codes using the X/Z correlations. CoRR abs/1401.6975 (2014) - [i5]Nicolas Delfosse, Zhentao Li, Stéphan Thomassé:
A note on the minimum distance of quantum LDPC codes. CoRR abs/1404.6441 (2014) - 2013
- [j2]Nicolas Delfosse, Gilles Zémor:
Upper bounds on the rate of low density stabilizer codes for the quantum erasure channel. Quantum Inf. Comput. 13(9-10): 793-826 (2013) - [j1]Alain Couvreur, Nicolas Delfosse, Gilles Zémor:
A Construction of Quantum LDPC Codes From Cayley Graphs. IEEE Trans. Inf. Theory 59(9): 6087-6098 (2013) - [c3]Nicolas Delfosse:
Tradeoffs for reliable quantum information storage in surface codes and color codes. ISIT 2013: 917-921 - [i4]Nicolas Delfosse:
Tradeoffs for reliable quantum information storage in surface codes and color codes. CoRR abs/1301.6588 (2013) - [i3]Nicolas Delfosse:
Decoding color codes by projection onto surface codes. CoRR abs/1308.6207 (2013) - 2012
- [i2]Nicolas Delfosse, Gilles Zémor:
Upper Bounds on the Rate of Low Density Stabilizer Codes for the Quantum Erasure Channel. CoRR abs/1205.7036 (2012) - [i1]Alain Couvreur, Nicolas Delfosse, Gilles Zémor:
A Construction of Quantum LDPC Codes from Cayley Graphs. CoRR abs/1206.2656 (2012) - 2011
- [c2]Alain Couvreur, Nicolas Delfosse, Gilles Zémor:
A construction of quantum LDPC codes from Cayley graphs. ISIT 2011: 643-647 - 2010
- [c1]Nicolas Delfosse, Gilles Zémor:
Quantum erasure-correcting codes and percolation on regular tilings of the hyperbolic plane. ITW 2010: 1-5
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:21 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:
