Efficient graph-diagonal characterization of noisy states distributed over quantum networks via Bell sampling
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , , , , , , , , |
|---|---|
| Format: | Preprint |
| Publié: |
2025
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866915659412144128 |
|---|---|
| author | Wang, Zherui Jerry Casapao, Joshua Carlo A. Benchasattabuse, Naphan Maity, Ananda G. Tura, Jordi Soeda, Akihito Hajdušek, Michal Van Meter, Rodney Elkouss, David |
| author_facet | Wang, Zherui Jerry Casapao, Joshua Carlo A. Benchasattabuse, Naphan Maity, Ananda G. Tura, Jordi Soeda, Akihito Hajdušek, Michal Van Meter, Rodney Elkouss, David |
| contents | Graph states are an important class of entangled states that serve as a key resource for distributed information processing and communication in quantum networks. In this work, we propose a protocol that utilizes a Bell sampling subroutine to characterize the diagonal elements in the graph basis of noisy graph states distributed across a network. Our approach offers significant advantages over direct diagonal estimation using unentangled single-qubit measurements in terms of scalability. Specifically, we prove that estimating the full vector of diagonal elements requires a sample complexity that scales linearly with the number of qubits ($\mathcal{O}(n)$), providing an exponential reduction in resource overhead compared to the best known $\mathcal{O}(2^n)$ scaling of direct estimation. Furthermore, we demonstrate that global properties, such as state fidelity, can be estimated with a sample complexity independent of the network size. Finally, we present numerical results indicating that the estimation in practice is more efficient than the derived theoretical bounds. Our work thus establishes a promising technique for efficiently estimating noisy graph states in large networks under realistic experimental conditions. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2512_06650 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Efficient graph-diagonal characterization of noisy states distributed over quantum networks via Bell sampling Wang, Zherui Jerry Casapao, Joshua Carlo A. Benchasattabuse, Naphan Maity, Ananda G. Tura, Jordi Soeda, Akihito Hajdušek, Michal Van Meter, Rodney Elkouss, David Quantum Physics Graph states are an important class of entangled states that serve as a key resource for distributed information processing and communication in quantum networks. In this work, we propose a protocol that utilizes a Bell sampling subroutine to characterize the diagonal elements in the graph basis of noisy graph states distributed across a network. Our approach offers significant advantages over direct diagonal estimation using unentangled single-qubit measurements in terms of scalability. Specifically, we prove that estimating the full vector of diagonal elements requires a sample complexity that scales linearly with the number of qubits ($\mathcal{O}(n)$), providing an exponential reduction in resource overhead compared to the best known $\mathcal{O}(2^n)$ scaling of direct estimation. Furthermore, we demonstrate that global properties, such as state fidelity, can be estimated with a sample complexity independent of the network size. Finally, we present numerical results indicating that the estimation in practice is more efficient than the derived theoretical bounds. Our work thus establishes a promising technique for efficiently estimating noisy graph states in large networks under realistic experimental conditions. |
| title | Efficient graph-diagonal characterization of noisy states distributed over quantum networks via Bell sampling |
| topic | Quantum Physics |
| url | https://arxiv.org/abs/2512.06650 |