Saved in:
| Main Authors: | , , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2405.16067 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866913362728714240 |
|---|---|
| author | Dang, Yu-Hang Dhamapurkar, Shyam Zhu, Xiao-Long Zhou, Zheng-Yang Guan, Hao-Yu Deng, Xiu-Hao |
| author_facet | Dang, Yu-Hang Dhamapurkar, Shyam Zhu, Xiao-Long Zhou, Zheng-Yang Guan, Hao-Yu Deng, Xiu-Hao |
| contents | In quantum computing, the connectivity of qubits placed on two-dimensional chips limits the scalability and functionality of solid-state quantum computers. This paper presents two approaches to constructing complex quantum networks from simple qubit arrays, specifically grid lattices. The first approach utilizes a subset of qubits as tunable couplers, effectively yielding a range of non-trivial graph-based Hamiltonians. The second approach employs dynamic graph engineering by periodically activating and deactivating couplers, enabling the creation of effective quantum walks with longer-range couplings. Numerical simulations verify the effective dynamics of these approaches. In terms of these two approaches, we explore implementing various graphs, including cubes and fullerenes, etc, on two-dimensional lattices. These techniques facilitate the realization of analog quantum simulation, particularly continuous-time quantum walks discussed in detail in this manuscript, for different computational tasks on superconducting quantum chips despite their inherent low dimensional simple architecture. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2405_16067 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Weaving Complex Graph on simple low-dimensional qubit lattices Dang, Yu-Hang Dhamapurkar, Shyam Zhu, Xiao-Long Zhou, Zheng-Yang Guan, Hao-Yu Deng, Xiu-Hao Quantum Physics In quantum computing, the connectivity of qubits placed on two-dimensional chips limits the scalability and functionality of solid-state quantum computers. This paper presents two approaches to constructing complex quantum networks from simple qubit arrays, specifically grid lattices. The first approach utilizes a subset of qubits as tunable couplers, effectively yielding a range of non-trivial graph-based Hamiltonians. The second approach employs dynamic graph engineering by periodically activating and deactivating couplers, enabling the creation of effective quantum walks with longer-range couplings. Numerical simulations verify the effective dynamics of these approaches. In terms of these two approaches, we explore implementing various graphs, including cubes and fullerenes, etc, on two-dimensional lattices. These techniques facilitate the realization of analog quantum simulation, particularly continuous-time quantum walks discussed in detail in this manuscript, for different computational tasks on superconducting quantum chips despite their inherent low dimensional simple architecture. |
| title | Weaving Complex Graph on simple low-dimensional qubit lattices |
| topic | Quantum Physics |
| url | https://arxiv.org/abs/2405.16067 |