activity
20222026
most citedDoes provable absence of barren plateaus imply classical simulability?

78 citations · 109 across the 9 of their papers we have counts for

collaborators

9 papers

quant-ph2026

Tensor Networks with Belief Propagation Cannot Feasibly Simulate Google's Quantum Echoes Experiment

Pablo Bermejo, Benjamin Villalonga, Brayden Ware +2

In the recent quantum echoes experiment, Google Quantum AI showed that out-of-time-order correlators (OTOCs) for random-circuit time evolution can be measured using a quantum proce…

cs.AI2025★ 1 cited

The Denario project: Deep knowledge AI agents for scientific discovery

Francisco Villaescusa-Navarro, Boris Bolliet, Pablo Villanueva-Domingo +33

We present Denario, an AI multi-agent system designed to serve as a scientific research assistant. Denario can perform many different tasks, such as generating ideas, checking the…

quant-ph2024★ 3 cited

Quantum-inspired clustering with light

Miguel Varga, Pablo Bermejo, Rubén Pellicer-Guridi +2

This article introduces a novel approach to perform the simulation of a single qubit quantum algorithm using laser beams. Leveraging the polarization states of photonic qubits, and…

quant-ph2023★ 78 cited

Does provable absence of barren plateaus imply classical simulability?

M. Cerezo, Martin Larocca, Diego García-Martín +9

A large amount of effort has recently been put into understanding the barren plateau phenomenon. In this perspective article, we face the increasingly loud elephant in the room and…

quant-ph2023★ 3 cited

Hacking Cryptographic Protocols with Advanced Variational Quantum Attacks

Borja Aizpurua, Pablo Bermejo, Josu Etxezarreta Martinez +1

Here we introduce an improved approach to Variational Quantum Attack Algorithms (VQAA) on crytographic protocols. Our methods provide robust quantum attacks to well-known cryptogra…

quant-ph2023★ 12 cited

Improving Gradient Methods via Coordinate Transformations: Applications to Quantum Machine Learning

Pablo Bermejo, Borja Aizpurua, Roman Orus

Machine learning algorithms, both in their classical and quantum versions, heavily rely on optimization algorithms based on gradients, such as gradient descent and alike. The overa…

quant-ph2022★ 5 cited

Variational Quantum Continuous Optimization: a Cornerstone of Quantum Mathematical Analysis

Pablo Bermejo, Roman Orus

Here we show how universal quantum computers based on the quantum circuit model can handle mathematical analysis calculations for functions with continuous domains, without any dig…

quant-ph2022★ 7 cited

Variational Quantum Non-Orthogonal Optimization

Pablo Bermejo, Roman Orus

Current universal quantum computers have a limited number of noisy qubits. Because of this, it is difficult to use them to solve large-scale complex optimization problems. In this…

quant-ph2022

Variational Quantum and Quantum-Inspired Clustering

Pablo Bermejo, Roman Orus

Here we present a quantum algorithm for clustering data based on a variational quantum circuit. The algorithm allows to classify data into many clusters, and can easily be implemen…