Qubits’ mapping and routing for NISQ on variability of quantum gates
| Autor: | Xutao Yu, Zaichen Zhang, Ze-Tong Li, Fan-Xu Meng |
|---|---|
| Rok vydání: | 2020 |
| Předmět: |
Heuristic (computer science)
Computer science P versus NP problem Statistical and Nonlinear Physics 01 natural sciences 010305 fluids & plasmas Theoretical Computer Science Electronic Optical and Magnetic Materials Computer Science::Hardware Architecture Computer Science::Emerging Technologies Quantum gate Controlled NOT gate Modeling and Simulation Qubit 0103 physical sciences Signal Processing Quantum operation Quantum algorithm Electrical and Electronic Engineering 010306 general physics Algorithm Hardware_LOGICDESIGN Quantum computer |
| Zdroj: | Quantum Information Processing. 19 |
| ISSN: | 1573-1332 1570-0755 |
| Popis: | Rapid development has taken place in quantum algorithms, but few of them can be implemented directly on the quantum computer because of the coupling constraint and high error rates of quantum computer operations. Transforming a circuit into an executable one on the quantum computer with the highest fidelity is an NP problem. Therefore, the algorithm tackling the mapping and routing problem of qubits is needed. Following the policy of VQA, a heuristic algorithm to solve the problem is proposed. The algorithm uses the error score derived from quantum operation’s error rate as the heuristic cost. Combining SWAP gates, physical CNOT gates, remote CNOT gates and inverse CNOT gates, the algorithm transforms the input circuit into an executable output circuit on the quantum computer with lower error score in acceptable execution time and moves forward from local optimal to global optimal. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full text from SpringerLink