default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDavid Poulin
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
[j10]Jessica Lemieux, Bettina Heim, David Poulin, Krysta M. Svore, Matthias Troyer:
Efficient Quantum Walk Circuits for Metropolis-Hastings Algorithm. Quantum 4: 287 (2020)
2010 – 2019
- 2018
- [j9]Jeongwan Haah, Matthew B. Hastings, David Poulin, Dave Wecker:
Magic state distillation at intermediate size. Quantum Inf. Comput. 18(1&2): 114-140 (2018) - [c5]Maxime Tremblay
, Benjamin Bourassa, David Poulin:
Depth versus Breadth in Convolutional Polar Codes. ITW 2018: 1-5 - [i8]Maxime Tremblay, Benjamin Bourassa, David Poulin:
Depth versus Breadth in Convolutional Polar Codes. CoRR abs/1805.09306 (2018) - [i7]Benjamin Bourassa, Maxime Tremblay, David Poulin:
Convolutional Polar Codes on Channels with Memory. CoRR abs/1805.09378 (2018) - 2017
- [i6]Andrew James Ferris, Christoph Hirche, David Poulin:
Convolutional Polar Codes. CoRR abs/1704.00715 (2017) - 2016
- [i5]Nicolas Delfosse, Pavithran Iyer, David Poulin:
Generalized surface codes and packing of logical qubits. CoRR abs/1606.07116 (2016) - [i4]Nicolas Delfosse, Pavithran Iyer, David Poulin:
A linear-time benchmarking tool for generalized surface codes. CoRR abs/1611.04256 (2016) - 2015
- [j8]David Poulin, Matthew B. Hastings, Dave Wecker, Nathan Wiebe, Andrew C. Doherty, Matthias Troyer:
The Trotter step size required for accurate quantum simulation of quantum chemistry. Quantum Inf. Comput. 15(5&6): 361-384 (2015) - [j7]Pavithran Iyer, David Poulin:
Hardness of Decoding Quantum Stabilizer Codes. IEEE Trans. Inf. Theory 61(9): 5209-5223 (2015) - 2014
- [j6]Guillaume Duclos-Cianci, David Poulin:
Fault-tolerant renormalization group decoder for abelian topological codes. Quantum Inf. Comput. 14(9-10): 721-740 (2014) - [c4]Andrew James Ferris, David Poulin:
Branching MERA codes: A natural extension of classical and quantum polar codes. ISIT 2014: 1081-1085 - 2013
- [j5]Sergey Bravyi, Guillaume Duclos-Cianci, David Poulin, Martin Suchara:
Subsystem surface codes with three-qubit check operators. Quantum Inf. Comput. 13(11-12): 963-985 (2013) - [j4]Emilie Pelchat, David Poulin:
Degenerate Viterbi Decoding. IEEE Trans. Inf. Theory 59(6): 3915-3921 (2013) - [c3]Guillaume Duclos-Cianci, David Poulin:
Kitaev's Z_d-Codes Threshold Estimates. TQC 2013: 285-293 - [i3]Andrew J. Ferris, David Poulin:
Branching MERA codes: a natural extension of polar codes. CoRR abs/1312.4575 (2013) - [i2]Andrew J. Ferris, David Poulin:
Tensor Networks and Quantum Error Correction. CoRR abs/1312.4578 (2013) - 2010
- [c2]Guillaume Duclos-Cianci, David Poulin:
A renormalization group decoding algorithm for topological quantum codes. ITW 2010: 1-5 - [p1]Sergey Bravyi, David Poulin, Barbara M. Terhal:
Tradeoffs for reliable quantum information storage in 2D systems. Quantum Cryptography and Computing 2010: 125-137
2000 – 2009
- 2009
- [j3]David Poulin, Jean-Pierre Tillich, Harold Ollivier:
Quantum serial turbo codes. IEEE Trans. Inf. Theory 55(6): 2776-2798 (2009) - 2008
- [j2]David Poulin, Yeojin Chung:
On the iterative decoding of sparse quantum codes. Quantum Inf. Comput. 8(10): 987-1000 (2008) - [c1]David Poulin, Jean-Pierre Tillich, Harold Ollivier:
Quantum serial turbo-codes. ISIT 2008: 310-314 - 2006
- [j1]David W. Kribs, Raymond Laflamme, David Poulin, Maia Lesosky:
Operator quantum error correction. Quantum Inf. Comput. 6(4): 382-399 (2006) - 2005
- [i1]David Poulin, Hugo Touchette:
Comment on "Some non-conventional ideas about algorithmic complexity". CoRR abs/cs/0503034 (2005)
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-11-08 21:31 CET 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:
