Certifying nonstabilizerness in quantum processors
Fuente:
arXiv
Gespeichert in:
| Hauptverfasser: | , , , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2024
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866918457917833216 |
|---|---|
| author | Wagner, Rafael Peres, Filipa C. R. Cruzeiro, Emmanuel Zambrini Galvão, Ernesto F. |
| author_facet | Wagner, Rafael Peres, Filipa C. R. Cruzeiro, Emmanuel Zambrini Galvão, Ernesto F. |
| contents | Nonstabilizerness, also known as magic, is a crucial resource for quantum computation. The growth in complexity of quantum processing units (QPUs) demands robust and scalable techniques for characterizing this resource. We introduce the notion of set magic: a set of states has this property if at least one state in the set is a non-stabilizer state. We show that certain two-state overlap inequalities, recently introduced as witnesses of basis-independent coherence, are also witnesses of multi-qubit set magic. We also show it is possible to certify the presence of magic across multiple QPUs without the need for entanglement between them and reducing the demands on each individual QPU. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2404_16107 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Certifying nonstabilizerness in quantum processors Wagner, Rafael Peres, Filipa C. R. Cruzeiro, Emmanuel Zambrini Galvão, Ernesto F. Quantum Physics Nonstabilizerness, also known as magic, is a crucial resource for quantum computation. The growth in complexity of quantum processing units (QPUs) demands robust and scalable techniques for characterizing this resource. We introduce the notion of set magic: a set of states has this property if at least one state in the set is a non-stabilizer state. We show that certain two-state overlap inequalities, recently introduced as witnesses of basis-independent coherence, are also witnesses of multi-qubit set magic. We also show it is possible to certify the presence of magic across multiple QPUs without the need for entanglement between them and reducing the demands on each individual QPU. |
| title | Certifying nonstabilizerness in quantum processors |
| topic | Quantum Physics |
| url | https://arxiv.org/abs/2404.16107 |