Efficient arbitrary simultaneously entangling gates on a trapped-ion quantum computer
Here, the authors devise an exact protocol that simultaneously entangles arbitrary pairs of qubits on a trapped-ion quantum computer. The protocol requires classical computational resources polynomial in the system size, and very little overhead in the quantum control compared to a single-pair case.
Guardado en:
Autores principales: | Nikodem Grzesiak, Reinhold Blümel, Kenneth Wright, Kristin M. Beck, Neal C. Pisenti, Ming Li, Vandiver Chaplin, Jason M. Amini, Shantanu Debnath, Jwo-Sy Chen, Yunseong Nam |
---|---|
Formato: | article |
Lenguaje: | EN |
Publicado: |
Nature Portfolio
2020
|
Materias: | |
Acceso en línea: | https://doaj.org/article/6f9742a46b9d4a99997a7aa04353923b |
Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
Ejemplares similares
-
Power-optimal, stabilized entangling gate between trapped-ion qubits
por: Reinhold Blümel, et al.
Publicado: (2021) -
Entanglement concentration for arbitrary four-particle linear cluster states
por: Ting-Ting Song, et al.
Publicado: (2017) -
Universal separability criterion for arbitrary density matrices from causal properties of separable and entangled quantum states
por: Gleb A. Skorobagatko
Publicado: (2021) -
High-fidelity entangling gate for double-quantum-dot spin qubits
por: John M. Nichol, et al.
Publicado: (2017) -
Nearest centroid classification on a trapped ion quantum computer
por: Sonika Johri, et al.
Publicado: (2021)