Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Chinese Control Conference (CCC)

Quantum switching limited by nearest-neighboring coupling

Min Jiang, Yiming Zhou, Min Wan

Published Jul 29, 2010• 0 citations
OpenAlex

Abstract

In this paper, we propose a quantum switching architecture under the nearest coupling limitation. In order to reduce implementation time steps, an efficient quantum shear sorting (QSS) algorithm is developed. With use of QSS algorithm, the running complexity of the improved quantum switching architecture is polynomial time even under nearest coupling interaction and the implementation complexity is better. Our improved switching is extremely simple to implement by existing quantum computer candidates.

Related papers

Quantum switching based on the nearest neighbor hamiltonian

Min Jiang, Xu Huang, Yiming Zhou

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.

Tsinghua Science & Technology•Feb 1, 2011•0 citations

Quantum switching and quantum merge sorting

Sheng-Tzong Cheng, Chun-Yen Wang

This paper proposes a quantum switching architecture that can dynamically permute each input quantum data to its destination port to avoid using the fully connected networks. In addition, in order to reduce the execution time of the quantum switching, an efficient quantum merge sorting (QMS) algorithm that provides a parallel quantum computation is also developed. The quantum switching utilizes the QMS algorithm as a subroutine so that the total running time can be reduced to polylogarithmic time. Furthermore, to evaluate the feasibility of the quantum switching, we also define three different kinds of performance factors that can be used to estimate the complexity in implementation and the time delay in execution for quantum instruments. From the evaluation results, it can be seen that the proposed quantum switching is feasible in practice.

IEEE Transactions on Circuits and Systems I Fundamental Theory and Applications•Feb 1, 2006•57 citations

An efficient conversion of quantum circuits to a linear nearest neighbor architecture

Yuichi Hirata, Masaki Nakanishi, Shigeru Yamashita +1 more

Several promising implementations of quantum computation rely on a Linear Nearest Neighbor (LNN) architecture, which arranges quantum bits on a line, and allows neighbor interactions only. Therefore, several specific circuits have been designed on an LNN architecture. However, a general and efficient conversion method for an arbitrary circuit has not been established. Therefore, this paper gives an efficient conversion technique to convert quantum circuits to an LNN architecture. When a quantum circuit is converted to an LNN architecture, the objective is to reduce the size of the additional circuit added by the conversion and the time complexity of the conversion. The proposed method requires less additional circuitry and time complexity compared with naive techniques. To develop the method, we introduce two key theorems that may be interesting on their own. In addition, the proposed method also achieves less overhead than some known circuits designed from scratch on an LNN architecture.

Quantum Information and Computation•Jan 1, 2011•61 citations

Quantum K nearest neighbor algorithm

Jiang Jing-ping

A novel quantum learning method is presented,which combines quantum computation with classical K-nearest-neighbor,called quantum K-nearest-neighbor.Its steps are introduced in detail.Further,in order to save to running time of quantum counting subroutine,the fired K is revised to the changeable K.Under the framework of Boosting algorithm,a strong classifier is build,which consists of three weak classifiers,each trained by the quantum k-varying nearest neighbor,to improve the performance of classification.In this algorithm,the time complexity of classical K-nearest-neighbor algorithm is reduced from O(N) to O(N) by means of the power of quantum algorithms.

Systems engineering and electronics•Jan 1, 2008•7 citations

A Quantum Cellular Automata architecture with nearest neighbor interactions using one quantum gate type

Dimitris Ntalaperas, Nikos Konofaos

We propose an architecture based on Quantum cellular Automata which allows the use of only one type of quantum gates per computational step in order to perform nearest neighbor interactions. The model is built in partial steps, each one of them analyzed using nearest neighbor interactions, starting with single qubit operations and continuing with two qubit ones. The effectiveness of the model is tested and valuated by developing a quantum circuit implementing the Quantum Fourier Transform. The important outcome of this validation was that the operations are performed in a local and controlled manner thus reducing the error rate of each computational step.

arXiv:1610.06426•Oct 20, 2016•0 citations

Mapping quantum circuits on 3D nearest-neighbor architectures

Azim Farghadan, Naser Mohammadzadeh

Abstract In some quantum technologies, an interaction is only allowed between physically adjacent qubits, hence the nearest-neighbor requirement is needed. In such technologies, quantum gates are limited to operate on adjacent qubits. To make a quantum circuit compliant with the nearest-neighbor requirement, SWAP gates are inserted into the circuit to move the interacting qubits of a gate to be adjacent to each other. The mapping of qubits on the physical environment has an important role on reducing the number of SWAP gates and thus the circuit latency. Focusing on this issue, in this paper, a method is proposed that maps a quantum circuit onto a 3D physical hardware such as a 3D optical lattice. A new methodology for this mapping problem is proposed based on a complex network spectral clustering algorithm and graph theory, which are suitable for very large scale networks. It includes three steps: finding the order of qubit mapping, placing physical qubits, and routing. Simulation results show that the proposed mapping approach not only decreases the average number of SWAP gates by about 37% but also improves the average runtime by about 87% for the 2D architecture compared to PAQCS. Moreover, it reduces the average number of SWAP gates for the 3D architecture by 17.1% compared to the best studies in the literatures.

Quantum Science and Technology•Apr 9, 2019•11 citations
In this paper, we propose a quantum switching architecture under the nearest coupling limitation. In order to reduce implementation time steps, an efficient quantum shear sorting (QSS) algorithm is developed. With use of QSS algorithm, the running complexity of the improved quantum switching architecture is polynomial time even under nearest coupling interaction and the implementation complexity is better. Our improved switching is extremely simple to implement by existing quantum computer candidates.
This paper proposes a quantum switching architecture that can dynamically permute each input quantum data to its destination port to avoid using the fully connected networks. In addition, in order to reduce the execution time of the quantum switching, an efficient quantum merge sorting (QMS) algorithm that provides a parallel quantum computation is also developed. The quantum switching utilizes the QMS algorithm as a subroutine so that the total running time can be reduced to polylogarithmic time. Furthermore, to evaluate the feasibility of the quantum switching, we also define three different kinds of performance factors that can be used to estimate the complexity in implementation and the time delay in execution for quantum instruments. From the evaluation results, it can be seen that the proposed quantum switching is feasible in practice.
Several promising implementations of quantum computation rely on a Linear Nearest Neighbor (LNN) architecture, which arranges quantum bits on a line, and allows neighbor interactions only. Therefore, several specific circuits have been designed on an LNN architecture. However, a general and efficient conversion method for an arbitrary circuit has not been established. Therefore, this paper gives an efficient conversion technique to convert quantum circuits to an LNN architecture. When a quantum circuit is converted to an LNN architecture, the objective is to reduce the size of the additional circuit added by the conversion and the time complexity of the conversion. The proposed method requires less additional circuitry and time complexity compared with naive techniques. To develop the method, we introduce two key theorems that may be interesting on their own. In addition, the proposed method also achieves less overhead than some known circuits designed from scratch on an LNN architecture.
A novel quantum learning method is presented,which combines quantum computation with classical K-nearest-neighbor,called quantum K-nearest-neighbor.Its steps are introduced in detail.Further,in order to save to running time of quantum counting subroutine,the fired K is revised to the changeable K.Under the framework of Boosting algorithm,a strong classifier is build,which consists of three weak classifiers,each trained by the quantum k-varying nearest neighbor,to improve the performance of classification.In this algorithm,the time complexity of classical K-nearest-neighbor algorithm is reduced from O(N) to O(N) by means of the power of quantum algorithms.
We propose an architecture based on Quantum cellular Automata which allows the use of only one type of quantum gates per computational step in order to perform nearest neighbor interactions. The model is built in partial steps, each one of them analyzed using nearest neighbor interactions, starting with single qubit operations and continuing with two qubit ones. The effectiveness of the model is tested and valuated by developing a quantum circuit implementing the Quantum Fourier Transform. The important outcome of this validation was that the operations are performed in a local and controlled manner thus reducing the error rate of each computational step.
Abstract In some quantum technologies, an interaction is only allowed between physically adjacent qubits, hence the nearest-neighbor requirement is needed. In such technologies, quantum gates are limited to operate on adjacent qubits. To make a quantum circuit compliant with the nearest-neighbor requirement, SWAP gates are inserted into the circuit to move the interacting qubits of a gate to be adjacent to each other. The mapping of qubits on the physical environment has an important role on reducing the number of SWAP gates and thus the circuit latency. Focusing on this issue, in this paper, a method is proposed that maps a quantum circuit onto a 3D physical hardware such as a 3D optical lattice. A new methodology for this mapping problem is proposed based on a complex network spectral clustering algorithm and graph theory, which are suitable for very large scale networks. It includes three steps: finding the order of qubit mapping, placing physical qubits, and routing. Simulation results show that the proposed mapping approach not only decreases the average number of SWAP gates by about 37% but also improves the average runtime by about 87% for the 2D architecture compared to PAQCS. Moreover, it reduces the average number of SWAP gates for the 3D architecture by 17.1% compared to the best studies in the literatures.