Fermionic Averaged Circuit Eigenvalue Sampling
Fuente:
arXiv
Guardado en:
| Autores principales: | , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2025
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866918431402491904 |
|---|---|
| author | Chapman, Adrian Flammia, Steven T. |
| author_facet | Chapman, Adrian Flammia, Steven T. |
| contents | Fermionic averaged circuit eigenvalue sampling (FACES) is a protocol to simultaneously learn the averaged error rates of many fermionic linear optical (FLO) gates simultaneously and self-consistently from a suitable collection of FLO circuits. It is highly flexible, allowing for the in situ characterization of FLO-averaged gate-dependent noise under natural assumptions on a family of continuously parameterized one- and two-qubit gates. We rigorously show that our protocol has an efficient sampling complexity, owing in-part to useful properties of the Kravchuk transformations that feature in our analysis. We support our conclusions with numerical results. As FLO circuits become universal with access to certain resource states, we expect our results to inform noise characterization and error mitigation techniques on universal quantum computing architectures which naturally admit a fermionic description. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2504_01936 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Fermionic Averaged Circuit Eigenvalue Sampling Chapman, Adrian Flammia, Steven T. Quantum Physics Fermionic averaged circuit eigenvalue sampling (FACES) is a protocol to simultaneously learn the averaged error rates of many fermionic linear optical (FLO) gates simultaneously and self-consistently from a suitable collection of FLO circuits. It is highly flexible, allowing for the in situ characterization of FLO-averaged gate-dependent noise under natural assumptions on a family of continuously parameterized one- and two-qubit gates. We rigorously show that our protocol has an efficient sampling complexity, owing in-part to useful properties of the Kravchuk transformations that feature in our analysis. We support our conclusions with numerical results. As FLO circuits become universal with access to certain resource states, we expect our results to inform noise characterization and error mitigation techniques on universal quantum computing architectures which naturally admit a fermionic description. |
| title | Fermionic Averaged Circuit Eigenvalue Sampling |
| topic | Quantum Physics |
| url | https://arxiv.org/abs/2504.01936 |