activity
20222025
most citedUnconditionally separating noisy from bounded polynomial threshold circuits of constant depth

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

collaborators

5 papers

quant-ph2025

Quantum Bayesian Networks Can Speed up Reinforcement Learning in Partially Observable Environments

Gilberto Cunha, Alexandra Ramôa, André Sequeira +2

Reinforcement learning (RL) provides a principled framework for decision-making in partially observable environments, which can be modeled as Markov decision processes and compactl…

quant-ph2024★ 2 cited

Unconditionally separating noisy from bounded polynomial threshold circuits of constant depth

Min-Hsiu Hsieh, Leandro Mendes, Michael de Oliveira +1

The rapid evolution of quantum devices fuels concerted efforts to experimentally establish quantum advantage over classical computing. Many demonstrations of quantum advantage, how…

quant-ph2024

Bridging Resource Theory and Quantum Key Distribution: Geometric Analysis and Statistical Testing

Andrea D'Urbano, Michael de Oliveira, Luís Soares Barbosa

Discerning between quantum and classical correlations is of great importance. Bell polytopes are well established as a fundamental tool. In this paper, we extend this line of inqui…

quant-ph2024

Heuristic-free Verification-inspired Quantum Benchmarking

Johannes Frank, Elham Kashefi, Dominik Leichtle +1

In this paper, we introduce a new approach to quantum benchmarking inspired by quantum verification motivating new paradigms of quantum benchmarking. Our proposed benchmark not onl…

quant-ph2022★ 2 cited

Quantum advantage in temporally flat measurement-based quantum computation

Michael de Oliveira, Luís S. Barbosa, Ernesto F. Galvão

Several classes of quantum circuits have been shown to provide a quantum computational advantage under certain assumptions. The study of ever more restricted classes of quantum cir…