Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPengcheng Zhu 0002
Person information
- affiliation: Suqian College, Department of Computer Science and Technology, Suqian, China
- affiliation: Nantong University, School of Information Science and Technology, Nantong, China
Other persons with the same name
- Pengcheng Zhu (aka: Peng-Cheng Zhu) — disambiguation page
- Pengcheng Zhu 0001
![[0000-0001-9867-7041]](https://dblp.uni-trier.de/img/orcid-mark.12x12.png "0000-0001-9867-7041")
— Southeast University, National Mobile Communications Research Laboratory, Nanjing, China - Pengcheng Zhu 0003 — Shanghai University of Electric Power, Shanghai, China
- Pengcheng Zhu 0004 — Fuxi AI Lab, NetEase Inc., Hangzhou, China (and 1 more)
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j9]Zhijin Guan, Renjie Liu, Xueyun Cheng, Shiguang Feng, Pengcheng Zhu:
Suppression of Crosstalk in Quantum Circuit Based on Instruction Exchange Rules and Duration. Entropy 25(6): 855 (2023)- [j8]Mingqiang Zhu, Xueyun Cheng, Pengcheng Zhu, Liang Chen, Zhijin Guan:
Physical constraint-aware CNOT quantum circuit synthesis and optimization. Quantum Inf. Process. 22(1): 10 (2023) - [j7]Xueyun Cheng, Xinyu Chen, Kexin Cao, Pengcheng Zhu, Shiguang Feng, Zhijin Guan:
Optimization of the transmission cost of distributed quantum circuits based on merged transfer. Quantum Inf. Process. 22(5): 187 (2023) - [j6]Pengcheng Zhu, Weiping Ding, Lihua Wei, Xueyun Cheng, Zhijin Guan, Shiguang Feng:
A Variation-Aware Quantum Circuit Mapping Approach Based on Multi-Agent Cooperation. IEEE Trans. Computers 72(8): 2237-2249 (2023) - [i2]Xinyu Chen, Mingqiang Zhu, Xueyun Cheng, Pengcheng Zhu, Zhijin Guan:
Nearest neighbor synthesis of CNOT circuits on general quantum architectures. CoRR abs/2310.00592 (2023) - 2022
- [j5]Pengcheng Zhu, Shenggen Zheng, Lihua Wei, Xueyun Cheng, Zhijin Guan, Shiguang Feng:
The complexity of quantum circuit mapping with fixed parameters. Quantum Inf. Process. 21(1) (2022) - [j4]Pengcheng Zhu, Shiguang Feng, Zhijin Guan:
An Iterated Local Search Methodology for the Qubit Mapping Problem. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 41(8): 2587-2597 (2022) - [i1]Pengcheng Zhu, Shenggen Zheng, Lihua Wei, Xueyun Cheng, Zhijin Guan, Shiguang Feng:
The Complexity of Quantum Circuit Mapping with Fixed Parameters. CoRR abs/2207.08438 (2022) - 2020
- [j3]Xueyun Cheng, Zhijin Guan, Pengcheng Zhu:
Nearest Neighbor Transformation of Quantum Circuits in 2D Architecture. IEEE Access 8: 222466-222475 (2020) - [j2]Pengcheng Zhu, Xueyun Cheng, Zhijin Guan:
An exact qubit allocation approach for NISQ architectures. Quantum Inf. Process. 19(10): 391 (2020) - [j1]Pengcheng Zhu, Zhijin Guan, Xueyun Cheng:
A Dynamic Look-Ahead Heuristic for the Qubit Mapping Problem of NISQ Computers. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 39(12): 4721-4735 (2020)
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-06-27 23:18 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:
