Entanglement teleportation along a regenerating hamster-wheel graph state
Fuente:
arXiv
Guardado en:
| Autores principales: | , , , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2024
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866915148833226752 |
|---|---|
| author | Kang, Haiyue Kam, John F. Mooney, Gary J. Hollenberg, Lloyd C. L. |
| author_facet | Kang, Haiyue Kam, John F. Mooney, Gary J. Hollenberg, Lloyd C. L. |
| contents | We scheme an efficient and reusable approach to quantum teleportation that allows cyclic teleportation of a two-qubit graph state around a quantum hamster wheel -- a ring of qubits entangled as a one-dimensional line prepared on the 20-qubit Quantinuum H1-1 ion-trap quantum processor. The qubits on the ring are periodically measured and reused to achieve a teleportation depth that exceeds the total number of available qubits in the quantum processor. Using the outcomes measured during teleportation, we calculate and apply byproduct operators through dynamic circuits to correct local transformations induced on the teleported state. We evaluate the quality of teleportation by tracing the preserved entanglement and fidelity of the teleported two-qubit graph state from its density matrix. In the real-machine experiments, we demonstrate that 58% of the teleported state's entanglement is sustained with a measured two-qubit negativity of $0.291\pm0.018$ after three complete revolutions around the hamster wheel, or equivalently, after hopping across 56 qubits. On the machine-specific noisy emulator, we found that the teleported state after 100 hops still sustained 45% of its entanglement. By performing teleportation along a regenerating graph state, our work is a step forward in demonstrating the feasibility of measurement-based quantum computation. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2411_13060 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Entanglement teleportation along a regenerating hamster-wheel graph state Kang, Haiyue Kam, John F. Mooney, Gary J. Hollenberg, Lloyd C. L. Quantum Physics We scheme an efficient and reusable approach to quantum teleportation that allows cyclic teleportation of a two-qubit graph state around a quantum hamster wheel -- a ring of qubits entangled as a one-dimensional line prepared on the 20-qubit Quantinuum H1-1 ion-trap quantum processor. The qubits on the ring are periodically measured and reused to achieve a teleportation depth that exceeds the total number of available qubits in the quantum processor. Using the outcomes measured during teleportation, we calculate and apply byproduct operators through dynamic circuits to correct local transformations induced on the teleported state. We evaluate the quality of teleportation by tracing the preserved entanglement and fidelity of the teleported two-qubit graph state from its density matrix. In the real-machine experiments, we demonstrate that 58% of the teleported state's entanglement is sustained with a measured two-qubit negativity of $0.291\pm0.018$ after three complete revolutions around the hamster wheel, or equivalently, after hopping across 56 qubits. On the machine-specific noisy emulator, we found that the teleported state after 100 hops still sustained 45% of its entanglement. By performing teleportation along a regenerating graph state, our work is a step forward in demonstrating the feasibility of measurement-based quantum computation. |
| title | Entanglement teleportation along a regenerating hamster-wheel graph state |
| topic | Quantum Physics |
| url | https://arxiv.org/abs/2411.13060 |