default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDWim van Dam
Person information
- affiliation: University of California, Santa Barbara, CA, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[c18]Wim van Dam
, Mariia Mykhailova, Mathias Soeken:
Using Azure Quantum Resource Estimator for Assessing Performance of Fault Tolerant Quantum Computation. SC Workshops 2023: 1412-1419- 2021
- [j13]Jahan Claes, Wim van Dam:
Instance Independence of Single Layer Quantum Approximate Optimization Algorithm on Mixed-Spin Models at Infinite Size. Quantum 5: 542 (2021) - [c17]Wim van Dam, Karim Eldefrawy, Nicholas Genise, Natalie Parham:
Quantum Optimization Heuristics with an Application to Knapsack Problems. QCE 2021: 160-170
2010 – 2019
- 2019
- [e2]Wim van Dam, Laura Mancinska:
14th Conference on the Theory of Quantum Computation, Communication and Cryptography, TQC 2019, June 3-5, 2019, University of Maryland, College Park, Maryland, USA. LIPIcs 135, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2019, ISBN 978-3-95977-112-2 [contents] - 2018
- [c16]Wim van Dam, Raymond Wong:
Two-qubit Stabilizer Circuits with Recovery I: Existence. TQC 2018: 7:1-7:15 - [c15]Wim van Dam, Raymond Wong:
Two-qubit Stabilizer Circuits with Recovery II: Analysis. TQC 2018: 8:1-8:21 - 2016
- [c14]Andrew M. Childs, Wim van Dam, Shih-Han Hung, Igor E. Shparlinski:
Optimal Quantum Algorithm for Polynomial Interpolation. ICALP 2016: 16:1-16:13 - 2015
- [i8]Andrew M. Childs, Wim van Dam, Shih-Han Hung, Igor E. Shparlinski:
Optimal quantum algorithm for polynomial interpolation. CoRR abs/1509.09271 (2015) - 2014
- [c13]Wim van Dam, Siladitya Dey:
Hidden Subgroup Quantum Algorithms for a Class of Semi-Direct Product Groups. TQC 2014: 110-117 - 2013
- [j12]Wim van Dam:
Implausible consequences of superstrong nonlocality. Nat. Comput. 12(1): 9-12 (2013) - [j11]Richard Cleve, Wim van Dam, Michael Nielsen, Alain Tapp:
Quantum entanglement and the communication complexity of the inner product function. Theor. Comput. Sci. 486: 11-19 (2013) - 2011
- [e1]Wim van Dam, Vivien M. Kendon, Simone Severini:
Theory of Quantum Computation, Communication, and Cryptography - 5th Conference, TQC 2010, Leeds, UK, April 13-15, 2010, Revised Selected Papers. Lecture Notes in Computer Science 6519, Springer 2011, ISBN 978-3-642-18072-9 [contents] - 2010
- [j10]Dave Bacon, Wim van Dam:
Recent progress in quantum algorithms. Commun. ACM 53(2): 84-93 (2010) - [i7]Wim van Dam, Qingqing Yuan:
Quantum Online Memory Checking. CoRR abs/1002.2970 (2010)
2000 – 2009
- 2009
- [c12]Wim van Dam, Qingqing Yuan:
Quantum Online Memory Checking. TCQ 2009: 10-19 - 2008
- [j9]Dorit Aharonov, Wim van Dam, Julia Kempe, Zeph Landau, Seth Lloyd, Oded Regev:
Adiabatic Quantum Computation Is Equivalent to Standard Quantum Computation. SIAM Rev. 50(4): 755-787 (2008) - [c11]Wim van Dam, Igor E. Shparlinski:
Classical and Quantum Algorithms for Exponential Congruences. TQC 2008: 1-10 - 2007
- [j8]Dorit Aharonov, Wim van Dam, Julia Kempe, Zeph Landau, Seth Lloyd, Oded Regev:
Adiabatic Quantum Computation is Equivalent to Standard Quantum Computation. SIAM J. Comput. 37(1): 166-194 (2007) - [j7]Wim van Dam, Frédéric Magniez, Michele Mosca, Miklos Santha:
Self-Testing of Universal and Fault-Tolerant Sets of Quantum Gates. SIAM J. Comput. 37(2): 611-629 (2007) - [c10]Andrew M. Childs, Wim van Dam:
Quantum algorithm for a generalized hidden shift problem. SODA 2007: 1225-1232 - 2006
- [j6]Dave Bacon, Andrew M. Childs, Wim van Dam:
Optimal measurements for the dihedral hidden subgroup problem. Chic. J. Theor. Comput. Sci. 2006 (2006) - [j5]Wim van Dam, Sean Hallgren, Lawrence Ip:
Quantum Algorithms for Some Hidden Shift Problems. SIAM J. Comput. 36(3): 763-778 (2006) - 2005
- [j4]Wim van Dam, Richard D. Gill, Peter Grünwald:
The statistical strength of nonlocality proofs. IEEE Trans. Inf. Theory 51(8): 2812-2835 (2005) - [c9]Dave Bacon, Andrew M. Childs, Wim van Dam:
From optimal measurement to efficient quantum algorithms for the hidden subgroup problem over semidirect product groups. FOCS 2005: 469-478 - 2004
- [c8]Dorit Aharonov, Wim van Dam, Julia Kempe, Zeph Landau, Seth Lloyd, Oded Regev:
Adiabatic Quantum Computation is Equivalent to Standard Quantum Computation. FOCS 2004: 42-51 - 2003
- [c7]Wim van Dam, Sean Hallgren, Lawrence Ip:
Quantum algorithms for some hidden shift problems. SODA 2003: 489-498 - 2002
- [j3]Wim van Dam:
Quantum Algorithms for Weighing Matrices and Quadratic Residues. Algorithmica 34(4): 413-428 (2002) - 2001
- [j2]André Berthiaume, Wim van Dam, Sophie Laplante:
Quantum Kolmogorov Complexity. J. Comput. Syst. Sci. 63(2): 201-221 (2001) - [c6]Wim van Dam, Michele Mosca, Umesh V. Vazirani:
How Powerful is Adiabatic Quantum Computation?. FOCS 2001: 279-287 - 2000
- [j1]Harry Buhrman, Richard Cleve, Wim van Dam:
Quantum Entanglement and Communication Complexity. SIAM J. Comput. 30(6): 1829-1841 (2000) - [c5]André Berthiaume, Wim van Dam, Sophie Laplante:
Quantum Kolmogorov Complexity. CCC 2000: 240-249 - [c4]Wim van Dam, Frédéric Magniez, Michele Mosca, Miklos Santha:
Self-testing of universal and fault-tolerant sets of quantum gates. STOC 2000: 688-696 - [i6]Wim van Dam:
Quantum Algorithms for Weighing Matrices and Quadratic Residues. CoRR quant-ph/0008059 (2000) - [i5]Wim van Dam, Sean Hallgren:
Efficient Quantum Algorithms for Shifted Quadratic Character Problems. CoRR quant-ph/0011067 (2000)
1990 – 1999
- 1999
- [c3]Harry Buhrman, Wim van Dam:
Quantum Bounded Query Complexity. CCC 1999: 149- - [i4]Harry Buhrman, Wim van Dam:
Quantum Bounded Query Complexity. CoRR quant-ph/9903035 (1999) - [i3]Wim van Dam, Frédéric Magniez, Michele Mosca, Miklos Santha:
Self-Testing of Universal and Fault-Tolerant Sets of Quantum Gates. CoRR quant-ph/9904108 (1999) - 1998
- [c2]Wim van Dam:
Quantum Oracle Interrogation: Getting All Information for Almost Half the Price. FOCS 1998: 362-367 - [c1]Richard Cleve, Wim van Dam, Michael Nielsen, Alain Tapp:
Quantum Entanglement and the Communication Complexity of the Inner Product Function. QCQC 1998: 61-74 - [i2]Wim van Dam:
Quantum Oracle Interrogation: Getting all information for almost half the price. CoRR quant-ph/9805006 (1998) - [i1]Wim van Dam:
Two Classical Queries versus One Quantum Query. CoRR quant-ph/9806090 (1998)
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 21:24 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:
