AI Chat Paper
Note: Please note that the following content is generated by AMiner AI. SciOpen does not take any responsibility related to this content.
{{lang === 'zh_CN' ? '文章概述' : 'Summary'}}
{{lang === 'en_US' ? '中' : 'Eng'}}
Chat more with AI
PDF (291.9 KB)
Collect
Submit Manuscript AI Chat Paper
Show Outline
Outline
Show full outline
Hide outline
Outline
Show full outline
Hide outline

Quantum Switching Based on the Nearest Neighbor Hamiltonian

Min JIANG( )Xu HUANGYiming ZHOU
School of Electronics & Information Engineering, Soochow University, Suzhou 215021, China
China Academy of Space Technology, Beijing 100094, China
Show Author Information

Abstract

This paper describes a quantum switching architecture for nearest neighbor coupling. An efficient quantum shear sorting (QSS) algorithm is used to reduce the number of time steps. For the QSS algorithm, the running complexity of the quantum switching architecture is polynomial in time with the nearest neighbor coupling and the implementation is less complex. The result shows that improved switching is extremely simple to implement using existing quantum computer candidates.

References

【1】
【1】
 
 
Tsinghua Science and Technology
Pages 100-105

{{item.num}}

Comments on this article

Go to comment

< Back to all reports

Review Status: {{reviewData.commendedNum}} Commended , {{reviewData.revisionRequiredNum}} Revision Required , {{reviewData.notCommendedNum}} Not Commended Under Peer Review

Review Comment

Close
Close
Cite this article:
JIANG M, HUANG X, ZHOU Y. Quantum Switching Based on the Nearest Neighbor Hamiltonian. Tsinghua Science and Technology, 2011, 16(1): 100-105. https://doi.org/10.1016/S1007-0214(11)70016-5

29

Views

0

Downloads

0

Crossref

N/A

Web of Science

0

Scopus

7

CSCD

Received: 02 November 2009
Revised: 06 April 2010
Published: 01 February 2011
© Tsinghua University Press 2011