activity
20032026
most citedUltrastrong coupling regimes of light-matter interaction

1.1k citations · 7.3k across the 119 of their papers we have counts for

collaborators
Showing 2019 · quant-phShow all

6 papers · 2 filters

quant-ph2019★ 38 cited

Implementation of a Hybrid Classical-Quantum Annealing Algorithm for Logistic Network Design

Yongcheng Ding, Xi Chen, Lucas Lamata +2

The logistic network design is an abstract optimization problem that, under the assumption of minimal cost, seeks the optimal configuration of the supply chain's infrastructures an…

quant-ph2019★ 6 cited

Quantum Advantage in Cryptography with a Low-Connectivity Quantum Annealer

Feng Hu, Lucas Lamata, Chao Wang +3

The application in cryptography of quantum algorithms for prime factorization fostered the interest in quantum computing. However, quantum computers, and particularly quantum annea…

quant-ph2019★ 41 cited

Digital-analog quantum algorithm for the quantum Fourier transform

Ana Martin, Lucas Lamata, Enrique Solano +1

Quantum computers will allow calculations beyond existing classical computers. However, current technology is still too noisy and imperfect to construct a universal digital quantum…

quant-ph2019★ 24 cited

Reinforcement learning for semi-autonomous approximate quantum eigensolver

F. Albarrán-Arriagada, J. C. Retamal, E. Solano +1

The characterization of an operator by its eigenvectors and eigenvalues allows us to know its action over any quantum state. Here, we propose a protocol to obtain an approximation…

quant-ph2019★ 63 cited

Towards Pricing Financial Derivatives with an IBM Quantum Computer

Ana Martin, Bruno Candelas, Ángel Rodríguez-Rozas +6

Pricing interest-rate financial derivatives is a major problem in finance, in which it is crucial to accurately reproduce the time-evolution of interest rates. Several stochastic d…

quant-ph2019★ 13 cited

Towards Prediction of Financial Crashes with a D-Wave Quantum Computer

Yongcheng Ding, Javier Gonzalez-Conde, Lucas Lamata +7

Prediction of financial crashes in a complex financial network is known to be an NP-hard problem, which means that no known algorithm can guarantee to find optimal solutions effici…