Fully scalable randomized benchmarking without motion reversal
Fuente:
arXiv
Salvato in:
| Autori principali: | , , , , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2023
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866914952130854912 |
|---|---|
| author | Hines, Jordan Hothem, Daniel Blume-Kohout, Robin Whaley, Birgitta Proctor, Timothy |
| author_facet | Hines, Jordan Hothem, Daniel Blume-Kohout, Robin Whaley, Birgitta Proctor, Timothy |
| contents | We introduce binary randomized benchmarking (BiRB), a protocol that streamlines traditional RB by using circuits consisting almost entirely of i.i.d. layers of gates. BiRB reliably and efficiently extracts the average error rate of a Clifford gate set by sending tensor product eigenstates of random Pauli operators through random circuits with i.i.d. layers. Unlike existing RB methods, BiRB does not use motion reversal circuits -- i.e., circuits that implement the identity (or a Pauli) operator -- which simplifies both the method and the theory proving its reliability. Furthermore, this simplicity enables scaling BiRB to many more qubits than the most widely-used RB methods. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2309_05147 |
| institution | arXiv |
| publishDate | 2023 |
| record_format | arxiv |
| spellingShingle | Fully scalable randomized benchmarking without motion reversal Hines, Jordan Hothem, Daniel Blume-Kohout, Robin Whaley, Birgitta Proctor, Timothy Quantum Physics We introduce binary randomized benchmarking (BiRB), a protocol that streamlines traditional RB by using circuits consisting almost entirely of i.i.d. layers of gates. BiRB reliably and efficiently extracts the average error rate of a Clifford gate set by sending tensor product eigenstates of random Pauli operators through random circuits with i.i.d. layers. Unlike existing RB methods, BiRB does not use motion reversal circuits -- i.e., circuits that implement the identity (or a Pauli) operator -- which simplifies both the method and the theory proving its reliability. Furthermore, this simplicity enables scaling BiRB to many more qubits than the most widely-used RB methods. |
| title | Fully scalable randomized benchmarking without motion reversal |
| topic | Quantum Physics |
| url | https://arxiv.org/abs/2309.05147 |