The DOI matches its Crossref record; 61 of the 61 references it cites were found in a registry or an index; 12 of the 32 sources its claims cite were checked for support.
Towards violations of Local Friendliness with quantum computers
Open accessAbstract
Local Friendliness (LF) inequalities follow from seemingly reasonable assumptions about reality: (i) ``absoluteness of observed events'' (e.g., every observed event happens for all observers) and (ii) ``local agency'' (e.g., free choices can be made uncorrelated with other events outside their future light cone). Extended Wigner's Friend Scenario (EWFS) thought experiments show that textbook quantum mechanics violates these inequalities. Thus, experimental evidence of these violations would make these two assumptions incompatible. In [Nature Physics 16, 1199 (2020)], the authors experimentally implemented an EWFS, using a photonic qubit to play the role of each of the ``friends'' and measured violations of LF. One may question whether a photonic qubit is a physical system that counts as an ``observer'' and thereby question whether the experiment's outcome is significant. Intending to measure increasingly meaningful violations, we propose using a statistical measure called the ``branch factor'' to quantify the ``observerness'' of the system. We then encode the EWFS as a quantum circuit such that the components of the circuit that define the friend are quantum systems of increasing branch factor. We run this circuit on quantum simulators and hardware devices, observing LF violations as the system sizes scale. As errors in quantum computers reduce the significance of the violations, better quantum computers can produce better violations. Our results extend the state of the art in proof-of-concept experimental violations from branch factor 0.0 to branch factor 16.0. This is an initial result in an experimental program for measuring LF violations at increasingly meaningful branch factors using increasingly more powerful quantum processors and networks. We introduce this program as a fundamental science application for near-term and developing quantum technology.
Overview
CoChat Summary
## TL;DR
The paper proposes and demonstrates an experimental program for testing Local Friendliness (LF) violations with quantum computers, using the branch factor to quantify how “observer-like” the friend system is. It reports LF violations on simulators and hardware, extending proof-of-concept violations from branch factor 0.0 to branch factor 16.0.
## Key findings
- The paper uses the semi-Brukner LF inequality, stated as
\(-\langle A_1B_2\rangle + \langle A_1B_3\rangle - \langle A_3B_2\rangle - \langle A_3B_3\rangle - 2 \le 0\),
and reports a theoretical maximum left-hand side of 0.82843 in Table 1.
- Under a depolarizing-noise model, the paper derives that to preserve a violation the prepared friend state must have fidelity greater than 93.66%; equivalently, it states \(X \ge 8 - 6q\) and that the minimum fidelity supporting violation is 93.66%.
- On real hardware, the paper reports that ibm_torino obtained a violation at branch factor 4, while Quantinuum H1-1 obtained a violation at branch factor 16; the other IBM devices shown (ibm_osaka, ibm_sherbrooke) did not show violations beyond branch factor 0.
- The authors state that their results extend proof-of-concept experimental violations from branch factor 0.0 to branch factor 16.0.
## Methods
- The paper studies Extended Wigner’s Friend Scenarios (EWFS) and focuses on the three-setting, two-party semi-Brukner inequality; it also analyzes a simplified single-friend variant where Bob has no friend register beyond a single qubit.
- It implements EWFS as quantum circuits using GHZ friend states, and also discusses controlled-random-unitary and Dicke-state friends as alternative branch-factor constructions; experiments are run on noiseless simulators, noisy simulators/emulators, and real quantum hardware.
- To infer friend outcomes under noise, the paper uses a majority-vote measurement strategy and validates branch-factor preparation via fidelity estimates, depolarizing-noise modeling, and circuit compilation/transpilation to IBM and Quantinuum hardware.
## Limitations
- The paper explicitly states that the LF violations shown are not loophole-free; it notes, for example, that the experiments do not use speed-of-light separation to isolate the relevant parties.
- It acknowledges that the results are limited by noise and hardware errors, which reduce the significance of the violations and restrict the maximum branch factor on current devices.
- Evident from the text: the strongest hardware result is still a proof-of-concept demonstration, and the paper says that better quantum computers will be needed to reach larger, more meaningful branch factors.
Model-written summary. Check it against the paper before relying on it.
Integrity signals
Registry
Cites
Statistics
Figures
![Figure 1 Conceptual rendering of the Wigner's Friend scenario. A system is sent into Charlie's sealed lab. Alice has different measurement settings labeled by x to observe the sealed lab that contains her friend Charlie and his measurement outcome c . Alice's measurement outcome has the value labeled a . Figure replicated and modified with permission from the authors from [3].](https://figures.cochat.ai/paper-figures/70af1fd6edb141889a188ce41b29d472/towards-violations-of-local-friendliness-with-quantum-computers-figure-1.png)
![Figure 2 Conceptual rendering of an Extended Wigner's Friend Scenario (EWFS). A system is split and sent into two sealed labs. Alice has different measurement settings labeled by x to observe the sealed lab that contains her friend Charlie and his measurement outcome c . Similarly, Bob has measurement settings labeled by y for the sealed lab containing Debbie and her measurement outcome d . Alice's measurement outcome has the value labeled a , and Bob's has the value labeled b . Figure replicated with permission from the authors from [3].](https://figures.cochat.ai/paper-figures/9eead84eb14a407cb22ce2c7518b992f/towards-violations-of-local-friendliness-with-quantum-computers-figure-2.png)

![Figure 4 A program designed to test Local Friendliness violations on a progressively larger scale increases the significance of the observers used as friends. Our work gives the first experimental violations of Local Friendliness with friends larger than a photonic qubit. In [30], the authors estimate the size of a QPU needed to perform experiments using a human-level artificial intelligence simulated on a QPU as the friend observer at approximately 10 19 logical qubits and logical depth of 10 14 operations. We mark this as a white dot as it is a theoretical target while our work gives experimental results (black dot).](https://figures.cochat.ai/paper-figures/2d7270119c66427293691f70cc57c69a/towards-violations-of-local-friendliness-with-quantum-computers-figure-4.png)









![Figure 14 The calibrations coupling map for the CNOT readout error of CNOT gates for the ibm_torino device. Lighter colors indicate a higher CNOT error, while darker shades indicate a lower CNOT error. When targeting this device, we aim to maintain a chain-like orientation for our initial layout and also pick a layout that optimizes for the lowest readout error. Specifically, we assign nodes labeled 43 to Debbie (highlighted in green), 45 to Alice (highlighted in red), and 44 to Bob (highlighted in blue). The remaining nodes [46, 47, 48, 49, 50, 51, 52, 37, 33, 32, 31] (highlighted in yellow)represent the size of Charlie's system for progressively higher qubit systems. The nodes with the outer layer highlight indicate the qubit layout used for our experiments. This image was produced with device readout assignment error data obtained via the IBM Quantum Platform on 8-3-2024.](https://figures.cochat.ai/paper-figures/1633d122b5b54dc6adb321292104fcf6/towards-violations-of-local-friendliness-with-quantum-computers-figure-14.png)
Verification
Claims the paper makes
10 Valid · 4 Not valid · 19 Not checked · 91 Own results and interpretations
A result the paper states — it cites no source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“In fact, we can show that the semi-Brukner inequality still holds even when we remove Debbie from the scenario entirely.”
§ Towards violations of Local Friendliness with quantum computers > 2.3 EWFS scenarios with one friend
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
A result the paper reports from its own data — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“Our results extend the state of the art in proof-of-concept experimental violations from branch factor 0.0 to branch factor 16.0.”
§ Towards violations of Local Friendliness with quantum computers > Abstract
plainstates a cause- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
A result the paper states — it cites no source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“X valid ≥ 1 q X + 8(q -1)”
§ Towards violations of Local Friendliness with quantum computers > 4.1 Noisy Friends: preparing branch factors under noise
plainstates an association- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
- Rests on 2 assumptions not shown here.
A result the paper reports from its own data — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“With small depolarizing noise, we still obtain violations for a few qubits; see Figure 13.”
§ Towards violations of Local Friendliness with quantum computers > Dicke states
plainstates a cause- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
A result the paper states — it cites no source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“Again, using the max value of 2.82843 for X, we see that the minimum single-qubit and two-qubit fidelities should satisfy (1 -p 1 ) n (1 -p 2 ) m ≥ 2/2.82843 ≈ 0.707.”
§ Towards violations of Local Friendliness with quantum computers > 4.1 Noisy Friends: preparing branch factors under noise
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
- Rests on an assumption not shown here.
54 more claims
Create a free account to see all 124 claims and to verify the 9 references still open.
- It may state two separate claims as one. 23
- Probably not a substantial claim. 47
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
Each contradiction between two passages listed here was confirmed by an independent check.
Rated major: it would touch a result — a value a result rests on, reported and recomputed p-values on opposite sides of the significance level, two passages that conflict with no sign which is right, or a cited work retracted before this paper was published.
In the paper
“The maximum value for X in the Semi-Brukner inequality is 2.82843 (See Table 1).Solving for the minimum fidelity that supports this gives 93.66%.”
§ Towards violations of Local Friendliness with quantum computers > 4.1 Noisy Friends: preparing branch factors under noise
Reported 0.9366 · recomputed 0.707106
Rated minor: it would not touch a result — a value no result rests on, a p-value that stays on the same side of the significance level, or a conflict that is clerical, resolved elsewhere in the paper, or outside its own findings.
In the paper
§ Towards violations of Local Friendliness with quantum computers > 4.3.1 Validation of branch factor preparation
“IBM Torino has a single and two-qubit gate errors that are sufficiently low to show violations up to branch factor 9,”
§ Towards violations of Local Friendliness with quantum computers > B.1 Running EWFS on IBM quantum hardware
“The IBM Torino device supports valid LF violations up to branch factor 7, while the H1 device could theoretically support much larger violations.”
Citations
Cites
Quantum supremacy using a programmable superconducting processor
Arute, F., Arya, K., Babbush, R., Bacon, D., Bardin, J. C., Barends, R., Biswas, R., Boixo, S., Brandao, F. G. S. L., Buell, D. A., et al. (2019) · Nature · doi:10.1038/s41586-019-1666-5 · Cited by 7,720 · cited 2×
“The measurements from the validation runs can be verified using cross-entropy benchmarking following [55].”
Quantum internet: a vision for the road ahead
Wehner, S., Elkouss, D., & Hanson, R. (2018) · Science · doi:10.1126/science.aam9288 · Cited by 2,467
Significant-Loophole-Free Test of Bell’s Theorem with Entangled Photons
Giustina, M., Versteegh, M. A. M., Wengerowsky, S., Handsteiner, J., Hochrainer, A., Phelan, K., Steinlechner, F., Kofler, J., Larsson, J.-Å., Abellán, C., et al. (2015) · Physical Review Letters · doi:10.1103/physrevlett.115.250401 · Cited by 1,529 · cited 1×
“4 5 6 7 8 9 Charlie size (number of qubits)”
Random numbers certified by Bell’s theorem
Pironio, S., Acín, A., Massar, S., de la Giroday, A. B., Matsukevich, D. N., Maunz, P., Olmschenk, S., Hayes, D., Luo, L., Manning, T. A., et al. (2010) · Nature · doi:10.1038/nature09008 · Cited by 1,420 · cited 1×
“We note that before being derived in [3], the LF inequalities were obtained under a different context regarding device-independent settings [26, 27, 28] in this thesis [29] (Appendix-A) under the name of “partially deterministic polytopes”.”
Rovelli, C. (1996) · International Journal of Theoretical Physics · doi:10.1007/bf02302261 · Cited by 1,381 · cited 1×
“There are also other proposals for refuting AOE [10, 11, 12, 13, 14, 15, 16].”
Hameroff, S., & Penrose, R. (2014) · Physics of Life Reviews · doi:10.1016/j.plrev.2013.08.002 · Cited by 983 · cited 1×
“4.”
Cooling of a levitated nanoparticle to the motional quantum ground state
Delić, U., Reisenbauer, M., Dare, K., Grass, D., Vuletić, V., Kiesel, N., & Aspelmeyer, M. (2020) · Science · doi:10.1126/science.aba3993 · Cited by 646
Zurek, W. H. (2009) · Nature Physics · doi:10.1038/nphys1202 · Cited by 564 · cited 1×
“• More objectivity [35] (e.g. redundancy and consensus via Quantum Darwinism [36]).”
Quantum computing with neutral atoms
Henriet, L., Beguin, L., Signoles, A., Lahaye, T., Browaeys, A., Reymond, G.-O., & Jurczak, C. (2020) · Quantum · doi:10.22331/q-2020-09-21-327 · Cited by 550 · cited 1×
“For example, many neutral atom platforms can natively execute global CZ gates [63, 64].”
Remarks on the mind-body question
Wigner, E. P. (1995) · Philosophical Reflections and Syntheses · doi:10.1007/978-3-642-78374-6_20 · Cited by 486 · cited 3×
“In this work, we: 1. propose how quantum computers (and related quantum technology like quantum networks) can be used to build increasingly more meaningful (larger and loophole-free) tests of Local Friendliness and 2. use small quantum computers to give experimental evidence (with loopholes) of…”
Cited by
Operational criteria for quantum advantage in latency-constrained nonlocal games
Li, C.-H., Kikura, S., Goban, A., Yamasaki, H., & Sunami, S. (2026) · doi:10.48550/arxiv.2604.07451 · Cited by 1
“As such, while some mathematical formulations and analysis techniques are similar, several foundational analyses for the Bell tests may not directly apply to the analysis of quantum advantage in LCTC tasks, such as loop-hole analyses and the strictness of the no-signaling condition [3, 6, 9, 122].”
Emergence of Classicality in Wigner's Friend ScenariosPreprint
Rivlin, T., Engineer, S., & Baumann, V. (2025) · arXiv (Cornell University) · doi:10.48550/arxiv.2507.21221 · Cited by 5
“( These results should be compared with [23], which implements Wigner’s Friend scenarios on a quantum circuit with a similar number of qubits.)”
Quantum observers can communicate across multiverse branches
Violaris, M. (2026) · arXiv · doi:10.48550/arxiv.2601.08102
“…also growing interest in the scientific community to extend beyond such toy models and implement increasingly realistic Wigner’s-friend–type experiments on quantum information processing platforms, including ex-6 plicit proposals towards encoding an observer within a quantum computer [12, 26, 27].”
Extended Wigner's Friend Scenarios with Agent-like Observers on Quantum ComputersPreprint
Laux, J., & Cavalcanti, E. G. (2026) · arXiv (Cornell University) · doi:10.48550/arxiv.2609.12527
“The closest comparison is the quantum-computer implementation of Zeng et al. [9], where the friend is made more observer-like by increasing a figure of merit called “branch factor”.”
InfluentialClosing the Objectivity Loophole in Bell Tests on a Public Quantum Computer
Bednorz, A., Batle, J. A. I., Białecki, T., & Korbicz, J. K. (2026) · Advanced Quantum Technologies · doi:10.1002/qute.70420 · Cited by 1
“Motivated by the objectivity research, in the hereby paper, we rerun Bell tests on IBMQ and IonQ quantum platforms, simulating 3 observers (friends) at each side, with the requirement that the result +1 or − 1 must be unanimous among the party to be assigned, otherwise we set 0 .”
Metadata
- Authors
- Zeng, W. J., Labib, F., & Russo, V.
- Affiliations
- Unitary Foundation
- Venue
- Quantum
- Published
- 2025-09-05
- Volume
- 9
- Pages
- 1851
- ISSN
- 2521-327X (ISSN-L)
- OpenAlex
- W4414019682
- Semantic Scholar
- 8806d6cea51d191b13c249de925b73162516a150
- Cited by
- 0
- References
- 53
- FWCI
- 0.00
- Type
- journal article
- Language
- en
- Open access
- gold
- doi.org
- Locations
- Quantum (publishedVersion, cc-by)
- arXiv (Cornell University) (submittedVersion, cc-by)
- DOAJ (DOAJ: Directory of Open Access Journals) (submittedVersion, cc-by-sa)
- arXiv (Cornell University) (cc-by)
- Funders
- Australian Research Council (DP250102162)
- Topics
- Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum Mechanics and Applications
- Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum Information and Cryptography
- Physical Sciences › Computer Science › Artificial Intelligence › Quantum Computing Algorithms and Architecture
- Keywords
- Wigner's friend, quantum computing hardware, quantum simulators, quantum circuits, quantum foundations, local agency, photonic qubits
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
The claim verdicts this report counts are experimental: their accuracy is not yet measured.
A language model drew the claims from the paper on 2026-10-10, under version 3 of the claim definition (model deepseek-v4.1-flash, prompt extract-v3).
A second model labelled each claim on 2026-10-10 (model jev-1.13-20260917, definition revision gold-guideline-v0.2).
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Towards violations of Local Friendliness with quantum computers. https://app.cochat.ai/papers/10.22331/q-2025-09-05-1851
- The paper
- Zeng, W. J., Labib, F., & Russo, V. (2025). Towards violations of Local Friendliness with quantum computers. Quantum. https://doi.org/10.22331/q-2025-09-05-1851
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.