default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNoah Linden
2020 – today
- 2024
[j8]Benjamin D. M. Jones, Noah Linden, Paul Skrzypczyk:
The Hadamard gate cannot be replaced by a resource state in universal quantum computation. Quantum 8: 1470 (2024)- 2023
- [c4]Harry Buhrman, Noah Linden, Laura Mancinska
, Ashley Montanaro, Maris Ozols:
Quantum Majority Vote. ITCS 2023: 29:1-29:1 - 2022
- [j7]Noah Linden, Ronald de Wolf:
Average-Case Verification of the Quantum Fourier Transform Enables Worst-Case Phase Estimation. Quantum 6: 872 (2022) - 2021
- [j6]Noah Linden, Ronald de Wolf:
Lightweight Detection of a Small Number of Large Errors in a Quantum Circuit. Quantum 5: 436 (2021) - [j5]Dong An, Noah Linden, Jin-Peng Liu, Ashley Montanaro, Changpeng Shao, Jiasu Wang:
Quantum-accelerated multilevel Monte Carlo methods for stochastic differential equations in mathematical finance. Quantum 5: 481 (2021) - 2020
- [i6]Cezar-Mihail Alexandru, Ella Bridgett-Tomkinson, Noah Linden, Joseph MacManus, Ashley Montanaro, Hannah Morris:
Quantum speedups of some general-purpose numerical optimisation algorithms. CoRR abs/2004.06521 (2020) - [i5]Dong An, Noah Linden, Jin-Peng Liu, Ashley Montanaro, Changpeng Shao, Jiasu Wang:
Quantum-accelerated multilevel Monte Carlo methods for stochastic differential equations in mathematical finance. CoRR abs/2012.06283 (2020)
2010 – 2019
- 2016
- [i4]Dominic J. Moylett, Noah Linden, Ashley Montanaro:
Quantum speedup of the Travelling Salesman Problem for bounded-degree graphs. CoRR abs/1612.06203 (2016) - 2013
- [c3]Noah Linden, Frantisek Matús, Mary Beth Ruskai, Andreas J. Winter:
The Quantum Entropy Cone of Stabiliser States. TQC 2013: 270-284 - [i3]Noah Linden, Mary Beth Ruskai, Andreas J. Winter:
The Quantum Entropy Cone of Stabiliser States. CoRR abs/1302.5453 (2013) - 2012
- [j4]Josh Cadney, Noah Linden, Andreas J. Winter:
Infinitely Many Constrained Inequalities for the von Neumann Entropy. IEEE Trans. Inf. Theory 58(6): 3657-3663 (2012) - [i2]Noah Linden, Milán Mosonyi, Andreas J. Winter:
The structure of Renyi entropic inequalities. CoRR abs/1212.0248 (2012) - 2011
- [i1]Josh Cadney, Noah Linden, Andreas J. Winter:
Infinitely many constrained inequalities for the von Neumann entropy. CoRR abs/1107.0624 (2011)
2000 – 2009
- 2008
- [j3]Sean Clark, Richard Jozsa, Noah Linden:
Generalized clifford groups and simulation of associated quantum circuits. Quantum Inf. Comput. 8(1): 106-126 (2008) - 2006
- [c2]Harry Buhrman, Richard Cleve, Monique Laurent, Noah Linden, Alexander Schrijver, Falk Unger:
New Limits on Fault-Tolerant Quantum Computation. FOCS 2006: 411-419 - [c1]Ben Ibinson, Noah Linden, Andreas J. Winter:
All Inequalities for the Relative Entropy. ISIT 2006: 237-241 - 2005
- [j2]Noah Linden, Sandu Popescu, Benjamin Schumacher, Michael Westmoreland:
Reversibility of Local Transformations of Multiparticle Entanglement. Quantum Inf. Process. 4(3): 241-250 (2005) - 2003
- [j1]Richard Jozsa, Masato Koashi, Noah Linden, Sandu Popescu, Stuart Presnell, Dan J. Shepherd, Andreas J. Winter:
Entanglement cost of generalised measurements. Quantum Inf. Comput. 3(5): 405-422 (2003)
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.
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.
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.
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 2025-03-27 23:34 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:
