Borja Requena
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Borja Requena has a total of 78 co-authors. Here are the top co-authors by number of shared publications:
- Gorka Muñoz-Gil
University of Innsbruck
4 shared publications - Maciej Lewenstein
ICFO
4 shared publications - Carlo Manzo
Facultat de Ciències, Tecnologia i Enginyeries, Universitat de Vic – Universitat Central de Catalunya (UVic-UCC), Vic, Spain
2 shared publications - Diego Krapf
Colorado State University
2 shared publications - Giovanni Volpe
University of Gothenburg
2 shared publications - Jose Alberto Conejero
Universitat Politècnica de València
2 shared publications
Latest Publications
- Open Access
- 2 June 2026
- Published by Springer Nature in Research Square
Intrinsically disordered N-terminal and structured DNA-binding domains jointly regulate progesterone receptor transcriptional condensates
Transcriptional condensates (TCs) are dynamic, membrane-less assemblies of proteins and nucleic acids that form at specific genomic loci to control gene expression. The primary drivers of TC formation and function are long stretches of polypeptide chains that lack well-defined ternary structure, known as the intrinsically disordered regions (IDRs) of Transcription Factors (TFs). However, the role of well-structured domains such as the DNA-binding domain (DBD) in condensate formation and downstream regulation remains poorly understood. Here, we investigated whether the DBD of the Progesterone Receptor (PR), a model TF regulated by hormone binding, contributes to the formation of PR TCs. By combining Single Particle Tracking (SPT) with deep-learning-based single-trajectory analysis, we demonstrated that both the IDR and the DBD are required for the formation of PR condensates. Furthermore, transcriptomic analysis showed that mutations of either of the two domains result in the expression of a distinct set of genes, with functional assays corroborating these findings and linking domain-specific transcription to differential effects on cell proliferation and migration. Together, our results show that domains beyond IDRs also play a role in TC formation and function and uncover domain-specific regulation of transcriptional and oncogenic programs.
- 2 June 2026
- Published by Springer Nature in Research Square
Open AccessIntrinsically disordered N-terminal and structured DNA-binding domains jointly regulate progesterone receptor transcriptional condensates
Transcriptional condensates (TCs) are dynamic, membrane-less assemblies of proteins and nucleic acids that form at specific genomic loci to control gene expression. The primary drivers of TC formation and function are long stretches of polypeptide chains that lack well-defined ternary structure, known as the intrinsically disordered regions (IDRs) of Transcription Factors (TFs). However, the role of well-structured domains such as the DNA-binding domain (DBD) in condensate formation and downstream regulation remains poorly understood. Here, we investigated whether the DBD of the Progesterone Receptor (PR), a model TF regulated by hormone binding, contributes to the formation of PR TCs. By combining Single Particle Tracking (SPT) with deep-learning-based single-trajectory analysis, we demonstrated that both the IDR and the DBD are required for the formation of PR condensates. Furthermore, transcriptomic analysis showed that mutations of either of the two domains result in the expression of a distinct set of genes, with functional assays corroborating these findings and linking domain-specific transcription to differential effects on cell proliferation and migration. Together, our results show that domains beyond IDRs also play a role in TC formation and function and uncover domain-specific regulation of transcriptional and oncogenic programs.
- Top Cited PapersOpen Access
- 22 July 2025
- Published by Springer Nature in Nature Communications
- Vol. 16 (1) , 1-17
Quantitative evaluation of methods to analyze motion changes in single-particle experiments
The analysis of live-cell single-molecule imaging experiments can reveal valuable information about the heterogeneity of transport processes and interactions between cell components. These characteristics are seen as motion changes in the particle trajectories. Despite the existence of multiple approaches to carry out this type of analysis, no objective assessment of these methods has been performed so far. Here, we report the results of a competition to characterize and rank the performance of these methods when analyzing the dynamic behavior of single molecules. To run this competition, we implemented a software library that simulates realistic data corresponding to widespread diffusion and interaction models, both in the form of trajectories and videos obtained in typical experimental conditions. The competition constitutes the first assessment of these methods, providing insights into the current limitations of the field, fostering the development of new approaches, and guiding researchers to identify optimal tools for analyzing their experiments.
- 22 July 2025
- Published by Springer Nature in Nature Communications
- Vol. 16 (1) , 1-17
Top Cited PapersOpen AccessQuantitative evaluation of methods to analyze motion changes in single-particle experiments
The analysis of live-cell single-molecule imaging experiments can reveal valuable information about the heterogeneity of transport processes and interactions between cell components. These characteristics are seen as motion changes in the particle trajectories. Despite the existence of multiple approaches to carry out this type of analysis, no objective assessment of these methods has been performed so far. Here, we report the results of a competition to characterize and rank the performance of these methods when analyzing the dynamic behavior of single molecules. To run this competition, we implemented a software library that simulates realistic data corresponding to widespread diffusion and interaction models, both in the form of trajectories and videos obtained in typical experimental conditions. The competition constitutes the first assessment of these methods, providing insights into the current limitations of the field, fostering the development of new approaches, and guiding researchers to identify optimal tools for analyzing their experiments.
- Open Access
- 1 April 2025
- Published by Verein zur Forderung des Open Access Publizierens in den Quantenwissenschaften in Quantum
- Vol. 9, 1682
Early Fault-Tolerant Quantum Algorithms in Practice: Application to Ground-State Energy Estimation
We investigate the feasibility of early fault-tolerant quantum algorithms focusing on ground-state energy estimation problems. In particular, we examine the computation of the cumulative distribution function (CDF) of the spectral measure of a Hamiltonian and the identification of its discontinuities. Scaling these methods to larger system sizes reveals three key challenges: the smoothness of the CDF for large supports, the lack of tight lower bounds on the overlap with the true ground state, and the difficulty of preparing high-quality initial states. To address these challenges, we propose a signal processing approach to find these estimates automatically, in the regime where the quality of the initial state is unknown. Rather than aiming for exact ground-state energy, we advocate for improving classical estimates by targeting the low-energy support of the initial state. Additionally, we provide quantitative resource estimates, demonstrating a constant factor improvement in the number of samples required to detect a specified change in CDF. Our numerical experiments, conducted on a 26-qubit fully connected Heisenberg model, leverage a truncated density-matrix renormalization group (DMRG) initial state with a low bond dimension. The results show that the predictions from the quantum algorithm align closely with the DMRG-converged energies at larger bond dimensions while requiring several orders of magnitude fewer samples than theoretical estimates suggest. These findings underscore that CDF-based quantum algorithms are a practical and resource-efficient alternative to quantum phase estimation, particularly in resource-constrained scenarios.
- 1 April 2025
- Published by Verein zur Forderung des Open Access Publizierens in den Quantenwissenschaften in Quantum
- Vol. 9, 1682
Open AccessEarly Fault-Tolerant Quantum Algorithms in Practice: Application to Ground-State Energy Estimation
We investigate the feasibility of early fault-tolerant quantum algorithms focusing on ground-state energy estimation problems. In particular, we examine the computation of the cumulative distribution function (CDF) of the spectral measure of a Hamiltonian and the identification of its discontinuities. Scaling these methods to larger system sizes reveals three key challenges: the smoothness of the CDF for large supports, the lack of tight lower bounds on the overlap with the true ground state, and the difficulty of preparing high-quality initial states. To address these challenges, we propose a signal processing approach to find these estimates automatically, in the regime where the quality of the initial state is unknown. Rather than aiming for exact ground-state energy, we advocate for improving classical estimates by targeting the low-energy support of the initial state. Additionally, we provide quantitative resource estimates, demonstrating a constant factor improvement in the number of samples required to detect a specified change in CDF. Our numerical experiments, conducted on a 26-qubit fully connected Heisenberg model, leverage a truncated density-matrix renormalization group (DMRG) initial state with a low bond dimension. The results show that the predictions from the quantum algorithm align closely with the DMRG-converged energies at larger bond dimensions while requiring several orders of magnitude fewer samples than theoretical estimates suggest. These findings underscore that CDF-based quantum algorithms are a practical and resource-efficient alternative to quantum phase estimation, particularly in resource-constrained scenarios.
- Open Access
- 10 February 2023
- Published by American Physical Society (APS) in Physical Review Research
- Vol. 5 (1) , 013097
Certificates of quantum many-body properties assisted by machine learning
Computationally intractable tasks are often encountered in physics and optimization. They usually comprise a cost function to be optimized over a so-called feasible set, which is specified by a set of constraints. This may yield, in general, to difficult and nonconvex optimization tasks. A number of standard methods are used to tackle such problems: variational approaches focus on parametrizing a subclass of solutions within the feasible set. In contrast, relaxation techniques have been proposed to approximate it from outside, thus complementing the variational approach to provide ultimate bounds to the global optimal solution. In this paper, we propose a novel approach combining the power of relaxation techniques with deep reinforcement learning in order to find the best possible bounds within a limited computational budget. We illustrate the viability of the method in two paradigmatic problems in quantum physics and quantum information processing: finding the ground state energy of many-body quantum systems, and building energy-based entanglement witnesses of quantum local Hamiltonians. We benchmark our approach against other classical optimization algorithms such as breadth-first search or Monte Carlo, and we characterize the effect of transfer learning. We find the latter may be indicative of phase transitions with a completely autonomous approach. Finally, we provide tools to tackle other common applications in the field of quantum information processing with our method.
- 10 February 2023
- Published by American Physical Society (APS) in Physical Review Research
- Vol. 5 (1) , 013097
Open AccessCertificates of quantum many-body properties assisted by machine learning
Computationally intractable tasks are often encountered in physics and optimization. They usually comprise a cost function to be optimized over a so-called feasible set, which is specified by a set of constraints. This may yield, in general, to difficult and nonconvex optimization tasks. A number of standard methods are used to tackle such problems: variational approaches focus on parametrizing a subclass of solutions within the feasible set. In contrast, relaxation techniques have been proposed to approximate it from outside, thus complementing the variational approach to provide ultimate bounds to the global optimal solution. In this paper, we propose a novel approach combining the power of relaxation techniques with deep reinforcement learning in order to find the best possible bounds within a limited computational budget. We illustrate the viability of the method in two paradigmatic problems in quantum physics and quantum information processing: finding the ground state energy of many-body quantum systems, and building energy-based entanglement witnesses of quantum local Hamiltonians. We benchmark our approach against other classical optimization algorithms such as breadth-first search or Monte Carlo, and we characterize the effect of transfer learning. We find the latter may be indicative of phase transitions with a completely autonomous approach. Finally, we provide tools to tackle other common applications in the field of quantum information processing with our method.
- Top Cited PapersOpen Access
- 29 October 2021
- Published by Springer Nature in Nature Communications
- Vol. 12 (1) , 1-16
Objective comparison of methods to decode anomalous diffusion
Deviations from Brownian motion leading to anomalous diffusion are found in transport dynamics from quantum physics to life sciences. The characterization of anomalous diffusion from the measurement of an individual trajectory is a challenging task, which traditionally relies on calculating the trajectory mean squared displacement. However, this approach breaks down for cases of practical interest, e.g., short or noisy trajectories, heterogeneous behaviour, or non-ergodic processes. Recently, several new approaches have been proposed, mostly building on the ongoing machine-learning revolution. To perform an objective comparison of methods, we gathered the community and organized an open competition, the Anomalous Diffusion challenge (AnDi). Participating teams applied their algorithms to a commonly-defined dataset including diverse conditions. Although no single method performed best across all scenarios, machine-learning-based approaches achieved superior performance for all tasks. The discussion of the challenge results provides practical advice for users and a benchmark for developers.
- 29 October 2021
- Published by Springer Nature in Nature Communications
- Vol. 12 (1) , 1-16
Top Cited PapersOpen AccessObjective comparison of methods to decode anomalous diffusion
Deviations from Brownian motion leading to anomalous diffusion are found in transport dynamics from quantum physics to life sciences. The characterization of anomalous diffusion from the measurement of an individual trajectory is a challenging task, which traditionally relies on calculating the trajectory mean squared displacement. However, this approach breaks down for cases of practical interest, e.g., short or noisy trajectories, heterogeneous behaviour, or non-ergodic processes. Recently, several new approaches have been proposed, mostly building on the ongoing machine-learning revolution. To perform an objective comparison of methods, we gathered the community and organized an open competition, the Anomalous Diffusion challenge (AnDi). Participating teams applied their algorithms to a commonly-defined dataset including diverse conditions. Although no single method performed best across all scenarios, machine-learning-based approaches achieved superior performance for all tasks. The discussion of the challenge results provides practical advice for users and a benchmark for developers.
- Open Access
- 12 October 2020
- Published by Springer Nature in Scientific Reports
- Vol. 10 (1) , 1-23
Shopper intent prediction from clickstream e-commerce data with minimal browsing information
We address the problem of user intent prediction from clickstream data of an e-commerce website via two conceptually different approaches: a hand-crafted feature-based classification and a deep learning-based classification. In both approaches, we deliberately coarse-grain a new clickstream proprietary dataset to produce symbolic trajectories with minimal information. Then, we tackle the problem of trajectory classification of arbitrary length and ultimately, early prediction of limited-length trajectories, both for balanced and unbalanced datasets. Our analysis shows that k-gram statistics with visibility graph motifs produce fast and accurate classifications, highlighting that purchase prediction is reliable even for extremely short observation windows. In the deep learning case, we benchmarked previous state-of-the-art (SOTA) models on the new dataset, and improved classification accuracy over SOTA performances with our proposed LSTM architecture. We conclude with an in-depth error analysis and a careful evaluation of the pros and cons of the two approaches when applied to realistic industry use cases.
- 12 October 2020
- Published by Springer Nature in Scientific Reports
- Vol. 10 (1) , 1-23
Open AccessShopper intent prediction from clickstream e-commerce data with minimal browsing information
We address the problem of user intent prediction from clickstream data of an e-commerce website via two conceptually different approaches: a hand-crafted feature-based classification and a deep learning-based classification. In both approaches, we deliberately coarse-grain a new clickstream proprietary dataset to produce symbolic trajectories with minimal information. Then, we tackle the problem of trajectory classification of arbitrary length and ultimately, early prediction of limited-length trajectories, both for balanced and unbalanced datasets. Our analysis shows that k-gram statistics with visibility graph motifs produce fast and accurate classifications, highlighting that purchase prediction is reliable even for extremely short observation windows. In the deep learning case, we benchmarked previous state-of-the-art (SOTA) models on the new dataset, and improved classification accuracy over SOTA performances with our proposed LSTM architecture. We conclude with an in-depth error analysis and a careful evaluation of the pros and cons of the two approaches when applied to realistic industry use cases.