Distribution of nonlocality on quantum random circuits

In this work we explore how different types of resources are distributed among the states generated by quantum random circuits. We focus on multipartite nonlocality, but we also analyze quantum correlations by appealing to different entanglement and nonclassicality measures. We analyze the violation of Mermin and Svetlichny inequalities in order to get a glance at the distribution of nonlocality and genuine multipartite nonlocality. Next, we compare universal vs nonuniversal sets of gates, to gain insight into the problem of explaining quantum advantage. By comparing the results obtained with ideal (noiseless) vs noisy intermediate-scale quantum devices, we lay the basis of a certification protocol, which aims to quantify how robust is the resources distribution among the states that a given device can generate. We have implemented our nonlocality-based benchmark on actual quantum processors with different architectures, in order to assess up to which point they are capable of reproducing the ideal results.

Authors

Institutions

Publication Details

Journal
Physical review. A/Physical review, A
Published
2025-10-23
DOI
https://doi.org/10.1103/8nbw-bvj2
Primary Topic
Quantum Computing Algorithms and Architecture
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Distribution of nonlocality on quantum random circuits

Karl J. Friston
Physical review. A/Physical review, A
Quantum Computing Algorithms and Architecture
article

Distribution of nonlocality on quantum random circuits

Karl J. Friston
article en

Abstract

In this work we explore how different types of resources are distributed among the states generated by quantum random circuits. We focus on multipartite nonlocality, but we also analyze quantum correlations by appealing to different entanglement and nonclassicality measures. We analyze the violation of Mermin and Svetlichny inequalities in order to get a glance at the distribution of nonlocality and genuine multipartite nonlocality. Next, we compare universal vs nonuniversal sets of gates, to gain insight into the problem of explaining quantum advantage. By comparing the results obtained with ideal (noiseless) vs noisy intermediate-scale quantum devices, we lay the basis of a certification protocol, which aims to quantify how robust is the resources distribution among the states that a given device can generate. We have implemented our nonlocality-based benchmark on actual quantum processors with different architectures, in order to assess up to which point they are capable of reproducing the ideal results.

Physical review. A/Physical review, AVol. 112(6)
University of Cagliari (IT), Instituto de Física La Plata (AR), Technical University of Munich (DE)
Openalex Percentile: Top 79%
Quantum Computing Algorithms and Architecture
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Distribution of nonlocality on quantum random circuits — Karl J. Friston · Physical review. A/Physical review, A (2025) | TGRS Research Map | TGRS