activity
20222026
most citedQuantum Query Complexity of Boolean Functions under Indefinite Causal Order

4 citations · 6 across the 4 of their papers we have counts for

collaborators

5 papers

quant-ph2026

Efficiently Optimizing the Quantum Value of Bell Inequalities using Batched Gradient Descent

Xinyu Xu, Ping Zhu, Weikang Li +3

Exploring the world of Bell inequalities requires numerical methods that scale effectively with the number of parties, inputs, and outputs. Such methods can be used to study large-…

quant-ph2025

Quantum Nonlocality under Latency Constraints

Dawei Ding, Zhengfeng Ji, Pierre Pocreau +2

Bell inequalities are bounds on the correlations between different parties obeying a local hidden variable theory. Here, "local" refers to spacetime locality: the parties cannot co…

quant-ph2025

Classical and Quantum Query Complexity of Boolean Functions under Indefinite Causal Order

Alastair A. Abbott, Mehdi Mhalla, Pierre Pocreau

Computational models typically assume that operations are applied in a fixed sequential order. In recent years several works have looked at relaxing this assumption, considering co…

quant-ph2023★ 4 cited

Quantum Query Complexity of Boolean Functions under Indefinite Causal Order

Alastair A. Abbott, Mehdi Mhalla, Pierre Pocreau

The standard model of quantum circuits assumes operations are applied in a fixed sequential "causal" order. In recent years, the possibility of relaxing this constraint to obtain c…

quant-ph2022★ 2 cited

Improving social welfare in non-cooperative games with different types of quantum resources

Alastair A. Abbott, Mehdi Mhalla, Pierre Pocreau

We investigate what quantum advantages can be obtained in multipartite non-cooperative games by studying how different types of quantum resources can lead to new Nash equilibria an…