default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJonathan Allcock
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j5]Pei Yuan
, Jonathan Allcock, Shengyu Zhang:
Does Qubit Connectivity Impact Quantum Circuit Complexity? IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 43(2): 520-533 (2024)- [j4]Yanghepu Li, Shengming Ma, Jonathan Allcock, Tianyu Zhang, Xiong Xu, Sainan Huai, Shengyu Zhang:
A Parametric EDA Method for Coplanar Waveguide Channel Recognition and Air-Bridge Construction in Quantum Chip Design. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 43(10): 3004-3014 (2024) - [c3]Maoli Liu, Zhuohua Li, Kechao Cai, Jonathan Allcock, Shengyu Zhang, John C. S. Lui:
Quantum BGP with Online Path Selection via Network Benchmarking. INFOCOM 2024: 1401-1410 - [i6]Jonathan Allcock, João F. Doriguello, Gábor Ivanyos, Miklos Santha:
Beyond Bell sampling: stabilizer state learning and quantum pseudorandomness lower bounds on qudits. CoRR abs/2405.06357 (2024) - 2023
- [j3]Shi-Xin Zhang, Jonathan Allcock, Zhou-Quan Wan, Shuo Liu, Jiace Sun, Hao Yu, Xing-Han Yang, Jiezhong Qiu, Zhaofeng Ye, Yu-Qin Chen, Chee-Kong Lee, Yicong Zheng, Shao-Kai Jian, Hong Yao, Chang-Yu Hsieh, Shengyu Zhang:
TensorCircuit: a Quantum Software Framework for the NISQ Era. Quantum 7: 912 (2023) - [i5]Jonathan Allcock, Jinge Bao, João F. Doriguello, Alessandro Luongo, Miklos Santha:
Constant-depth circuits for Uniformly Controlled Gates and Boolean functions with application to quantum memory circuits. CoRR abs/2308.08539 (2023) - [i4]Jonathan Allcock, Jinge Bao, Aleksandrs Belovs, Troy Lee, Miklos Santha:
On the quantum time complexity of divide and conquer. CoRR abs/2311.16401 (2023) - 2022
- [j2]Maoli Liu, Jonathan Allcock, Kechao Cai, Shengyu Zhang, John C. S. Lui:
Quantum Networks with Multiple Service Providers: Transport Layer Protocols and Research Opportunities. IEEE Netw. 36(5): 56-62 (2022) - [c2]Lei Xie, Jidong Zhai, Zhenxing Zhang, Jonathan Allcock, Shengyu Zhang, Yicong Zheng:
Suppressing ZZ crosstalk of Quantum computers through pulse and scheduling co-optimization. ASPLOS 2022: 499-513 - [c1]Jonathan Allcock, Yassine Hamoudi, Antoine Joux, Felix Klingelhöfer, Miklos Santha:
Classical and Quantum Algorithms for Variants of Subset-Sum via Dynamic Programming. ESA 2022: 6:1-6:18 - 2021
- [i3]Jonathan Allcock, Yassine Hamoudi, Antoine Joux, Felix Klingelhöfer, Miklos Santha:
Classical and quantum dynamic programming for Subset-Sum and variants. CoRR abs/2111.07059 (2021) - 2020
- [j1]Jonathan Allcock, Chang-Yu Hsieh:
A quantum extension of SVM-perf for training nonlinear SVMs in almost linear time. Quantum 4: 342 (2020) - [i2]Jonathan Allcock, Chang-Yu Hsieh:
Quantum algorithm for training nonlinear SVMs in almost linear time. CoRR abs/2006.10299 (2020)
2010 – 2019
- 2018
- [i1]Jonathan Allcock, Chang-Yu Hsieh, Iordanis Kerenidis, Shengyu Zhang:
Quantum algorithms for feedforward neural networks. CoRR abs/1812.03089 (2018)
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-23 20:35 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:
