default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMaarten Van den Nest
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2016
[j8]Juan Bermejo-Vega, Cedric Yen-Yu Lin, Maarten Van den Nest:
Normalizer circuits and a Gottesman-Knill theorem for infinite-dimensional systems. Quantum Inf. Comput. 16(5&6): 361-422 (2016)- 2014
- [j7]Juan Bermejo-Vega, Maarten Van den Nest:
Classical simulations of Abelian-group normalizer circuits with intermediate measurements. Quantum Inf. Comput. 14(3-4): 181-216 (2014) - [j6]Richard Jozsa, Maarten Van den Nest:
Classical simulation complexity of extended Clifford circuits. Quantum Inf. Comput. 14(7-8): 633-648 (2014) - [i7]Juan Bermejo-Vega, Cedric Yen-Yu Lin, Maarten Van den Nest:
Normalizer circuits and a Gottesman-Knill theorem for infinite-dimensional systems. CoRR abs/1409.3208 (2014) - [i6]Juan Bermejo-Vega, Cedric Yen-Yu Lin, Maarten Van den Nest:
The computational power of normalizer circuits over black-box groups. CoRR abs/1409.4800 (2014) - 2013
- [j5]Xiaotong Ni, Maarten Van den Nest:
Commuting quantum circuits: efficient classical simulations versus hardness results. Quantum Inf. Comput. 13(1-2): 54-72 (2013) - [j4]Maarten Van den Nest:
Efficient classical simulations of quantum fourier transforms and normalizer circuits over Abelian groups. Quantum Inf. Comput. 13(11-12): 1007-1037 (2013) - [i5]Richard Jozsa, Maarten Van den Nest:
Classical simulation complexity of extended Clifford circuits. CoRR abs/1305.6190 (2013) - [i4]Martin Schwarz, Maarten Van den Nest:
Simulating Quantum Circuits with Sparse Output Distributions. CoRR abs/1310.6749 (2013) - [i3]Martin Schwarz, Maarten Van den Nest:
Simulating Quantum Circuits with Sparse Output Distributions. Electron. Colloquium Comput. Complex. TR13 (2013) - 2012
- [i2]Juan Bermejo-Vega, Maarten Van den Nest:
A Gottesman-Knill theorem for all finite Abelian groups. CoRR abs/1210.3637 (2012) - 2011
- [j3]Maarten Van den Nest:
Simulating quantum computers with probabilistic methods. Quantum Inf. Comput. 11(9&10): 784-812 (2011) - 2010
- [j2]Maarten Van den Nest:
Classical simulation of quantum computation, the gottesman-Knill theorem, and slightly beyond. Quantum Inf. Comput. 10(3&4): 258-271 (2010) - [i1]Maarten Van den Nest:
Matchgate computations and linear threshold gates. CoRR abs/1005.1143 (2010)
2000 – 2009
- 2008
- [j1]David Gross, Maarten Van den Nest:
The LU-LC conjecture, diagonal local operations and quadratic forms over GF(2). Quantum Inf. Comput. 8(3): 263-281 (2008)
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-04-24 23:10 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:
