default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDax Enshan Koh
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i17]Nikhil Bansal, Wai-Keong Mok, Kishor Bharti, Dax Enshan Koh, Tobias Haug:
Pseudorandom density matrices. CoRR abs/2407.11607 (2024)- [i16]Dax Enshan Koh, Kaavya Kumar, Siong Thye Goh:
Quantum Volunteer's Dilemma. CoRR abs/2409.05708 (2024) - 2023
- [i15]Tobias Haug
, Kishor Bharti, Dax Enshan Koh:
Pseudorandom unitaries are neither real nor sparse nor noise-robust. CoRR abs/2306.11677 (2023) - [i14]Rahul Arvind, Kishor Bharti, Jun Yong Khoo, Dax Enshan Koh, Jian Feng Kong:
A quantum tug of war between randomness and symmetries on homogeneous spaces. CoRR abs/2309.05253 (2023) - 2022
- [j5]Dax Enshan Koh, Sabee Grewal:
Classical Shadows With Noise. Quantum 6: 776 (2022) - [j4]Amara Katabarwa, Sukin Sim, Dax Enshan Koh, Pierre-Luc Dallaire-Demers:
Connecting geometry and performance of two-qubit parameterized quantum circuits. Quantum 6: 782 (2022) - [i13]Kaifeng Bu, Roy J. Garcia, Arthur Jaffe, Dax Enshan Koh, Lu Li:
Complexity of quantum circuits via sensitivity, magic, and coherence. CoRR abs/2204.12051 (2022) - [i12]Lu Li, Kaifeng Bu, Dax Enshan Koh, Arthur Jaffe, Seth Lloyd:
Wasserstein Complexity of Quantum Circuits. CoRR abs/2208.06306 (2022) - 2021
- [i11]Kaifeng Bu, Dax Enshan Koh, Lu Li, Qingxian Luo, Yaobo Zhang:
On the statistical complexity of quantum circuits. CoRR abs/2101.06154 (2021) - [i10]Kaifeng Bu, Dax Enshan Koh, Lu Li, Qingxian Luo, Yaobo Zhang:
Effects of quantum resources on the statistical complexity of quantum circuits. CoRR abs/2102.03282 (2021) - 2020
- [j3]Alexander M. Dalzell, Aram Wettroth Harrow, Dax Enshan Koh, Rolando L. La Placa:
How many qubits are needed for quantum computational supremacy? Quantum 4: 264 (2020) - [i9]Dax Enshan Koh, Sabee Grewal:
Classical Shadows with Noise. CoRR abs/2011.11580 (2020)
2010 – 2019
- 2019
- [i8]Kaifeng Bu, Dax Enshan Koh:
Efficient classical simulation of Clifford circuits with nonstabilizer input states. CoRR abs/1902.11257 (2019) - 2018
- [c2]Adam Bouland, Joseph F. Fitzsimons, Dax Enshan Koh:
Complexity Classification of Conjugated Clifford Circuits. CCC 2018: 21:1-21:25 - [i7]Jacob D. Biamonte, Mauro E. S. Morales, Dax Enshan Koh:
Quantum Supremacy Lower Bounds by Entanglement Scaling. CoRR abs/1808.00460 (2018) - 2017
- [j2]Dax Enshan Koh:
Further extensions of Clifford circuits and their classical simulation complexities. Quantum Inf. Comput. 17(3&4): 262-282 (2017) - [j1]Dax Enshan Koh, Mark D. Penney, Robert W. Spekkens:
Computing quopit Clifford circuit amplitudes by the sum-over-paths technique. Quantum Inf. Comput. 17(13&14): 1081-1095 (2017) - [i6]Dax Enshan Koh, Murphy Yuezhen Niu, Theodore J. Yoder:
Quantum simulation from the bottom up: the case of rebits. CoRR abs/1708.09355 (2017) - [i5]Adam Bouland, Joseph F. Fitzsimons, Dax Enshan Koh:
Quantum Advantage from Conjugated Clifford Circuits. CoRR abs/1709.01805 (2017) - 2016
- [i4]Dax Enshan Koh:
Further extensions of Clifford circuits and their classical simulation complexities. Electron. Colloquium Comput. Complex. TR16 (2016) - [i3]Zi-Wen Liu, Christopher Perry, Yechao Zhu, Dax Enshan Koh, Scott Aaronson:
Doubly infinite separation of quantum information and communication. Electron. Colloquium Comput. Complex. TR16 (2016) - 2015
- [i2]Zi-Wen Liu, Christopher Perry, Yechao Zhu, Dax Enshan Koh, Scott Aaronson:
Doubly infinite separation of quantum information and communication. CoRR abs/1507.03546 (2015) - [i1]Dax Enshan Koh:
Further extensions of Clifford circuits and their classical simulation complexities. CoRR abs/1512.07892 (2015) - 2012
- [c1]Dax Enshan Koh, Michael J. W. Hall, Setiawan, James E. Pope, Artur Ekert, Alastair Kay, Valerio Scarani:
The Effects of Free Will on Randomness Expansion. TQC 2012: 98-106
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-22 20:17 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:
