arXiv subjects

Lucas Lamata

Publications and source records attributed to Lucas Lamata.

At least 37 records · Page 2Linked to original sources

arXiv2021

Spin dynamics under the influence of elliptically rotating fields: Extracting the field topology from time-averaged quantities

We focus on quantum systems that can be effectively described as a localized spin-$s$ particle subject to a static magnetic field coplanar to a coexisting elliptically rotating time-periodic field. Depending on the values taken on by the static and rotating components, the total magnetic field shows two regimes with different topological properties. Along the boundary that separates these two regimes, the total magnetic field vanishes periodically in time and the system dynamics becomes highly nonadiabatic. We derive a relation between two time-averaged quantities of the system which is linked to the topology of the applied magnetic field. Based on this finding, we propose a measurable quantity that has the ability to indicate the topology of the total magnetic field without knowing a priori the value of the static component. We also propose a possible implementation of our approach by a trapped-ion quantum system. The results presented here are independent of the initial state of the system. In particular, when the system is initialized in a Floquet state, we find some interesting properties of the quasienergy spectrum which are linked to the topological change of the total magnetic field. Throughout the paper, the theoretical results are illustrated with numerical simulations for the case of a two-level quantum system.

cond-mat.stat-mech↗

arXiv2021

One-photon Solutions to Multiqubit Multimode quantum Rabi model

General solutions to the quantum Rabi model involve subspaces with unbounded number of photons. However, for the multiqubit multimode case, we find special solutions with at most one photon for arbitrary number of qubits and photon modes. Unlike the Juddian solution, ours exists for arbitrary single qubit-photon coupling strength with constant eigenenergy. This corresponds to a horizontal line in the spectrum, while still being a qubit-photon entangled state. As a possible application, we propose an adiabatic scheme for the fast generation of arbitrary single-photon multimode W states with nonadiabatic error less than 1%. Finally, we propose a superconducting circuit design, showing the experimental feasibility of the multimode multiqubit Rabi model.

quant-ph↗

arXiv2021

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

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 and facilities based on customer demand. Key economic decisions are taken about the location, number, and size of manufacturing facilities and warehouses based on the optimal solution. Therefore, improvements in the methods to address this question, which is known to be in the NP-hard complexity class, would have relevant financial consequences. Here, we implement in the D-Wave quantum annealer a hybrid classical-quantum annealing algorithm. The cost function with constraints is translated to a spin Hamiltonian, whose ground state encodes the searched result. As a benchmark, we measure the accuracy of results for a set of paradigmatic problems against the optimal published solutions (the error is on average below $1\%$), and the performance is compared against the classical algorithm, showing a remarkable reduction in the number of iterations. This work shows that state-of-the-art quantum annealers may codify and solve relevant supply-chain problems even still far from useful quantum supremacy.

quant-ph↗

arXiv2020

Quantum Teleportation for Control of Dynamic Systems and Autonomy

The application of Quantum Teleportation for control of classical dynamic systems and autonomy is proposed in this paper. Quantum teleportation is an intrinsically quantum phenomenon, and was first introduced by teleporting an unknown quantum state via dual classical and Einstein-Podolsky-Rosen channels in 1993. In this paper, we consider the possibility of applying this quantum technique to autonomous mobile classical platforms for control and autonomy purposes for the first time in this research. First, a review of how Quantum Entanglement and Quantum Cryptography can be integrated into macroscopic mechanical systems for controls and autonomy applications is presented, as well as how quantum teleportation concepts may be applied to the classical domain. In quantum teleportation, an entangled pair of photons which are correlated in their polarizations are generated and sent to two autonomous platforms, which we call the Alice Robot and the Bob Robot. Alice has been given a quantum system, i.e. a photon, prepared in an unknown state, in addition to receiving an entangled photon. Alice measures the state of her entangled photon and her unknown state jointly and sends the information through a classical channel to Bob. Although Alice original unknown state is collapsed in the process of measuring the state of the entangled photon (due to the quantum non-cloning phenomenon), Bob can construct an accurate replica of Alice state by applying a unitary operator. This paper, and the previous investigations of the applications of hybrid classical-quantum capabilities in control of dynamical systems, are aimed to promote the adoption of quantum capabilities and its advantages to the classical domain particularly for autonomy and control of autonomous classical systems.

quant-ph↗

arXiv2020

Quantum Advantage in Cryptography with a Low-Connectivity Quantum Annealer

The application in cryptography of quantum algorithms for prime factorization fostered the interest in quantum computing. However, quantum computers, and particularly quantum annealers, can also be helpful to construct secure cryptographic keys. Indeed, finding robust Boolean functions for cryptography is an important problem in sequence ciphers, block ciphers, and hash functions, among others. Due to the super-exponential size $\mathcal{O}(2^{2^n})$ of the associated space, finding $n$-variable Boolean functions with global cryptographic constraints is computationally hard. This problem has already been addressed employing generic low-connected incoherent D-Wave quantum annealers. However, the limited connectivity of the Chimera graph, together with the exponential growth in the complexity of the Boolean function design problem, limit the problem scalability. Here, we propose a special-purpose coherent quantum annealing architecture with three couplers per qubit, designed to optimally encode the bent function design problem. A coherent quantum annealer with this tree-type architecture has the potential to solve the $8$-variable bent function design problem, which is classically unsolved, with only $127$ physical qubits and $126$ couplers. This paves the way to reach useful quantum supremacy within the framework of quantum annealing for cryptographic purposes.

quant-ph↗

arXiv2020

Digital-analog quantum algorithm for the quantum Fourier transform

Quantum computers will allow calculations beyond existing classical computers. However, current technology is still too noisy and imperfect to construct a universal digital quantum computer with quantum error correction. Inspired by the evolution of classical computation, an alternative paradigm merging the flexibility of digital quantum computation with the robustness of analog quantum simulation has emerged. This universal paradigm is known as digital-analog quantum computing. Here, we introduce an efficient digital-analog quantum algorithm to compute the quantum Fourier transform, a subroutine widely employed in several relevant quantum algorithms. We show that, under reasonable assumptions about noise models, the fidelity of the quantum Fourier transformation improves considerably using this approach when the number of qubits involved grows. This suggests that, in the Noisy Intermediate-Scale Quantum (NISQ) era, hybrid protocols combining digital and analog quantum computing could be a sensible approach to reach useful quantum supremacy.

quant-ph↗

arXiv2020

Digital-Analog Quantum Computation

Digital quantum computing paradigm offers highly-desirable features such as universality, scalability, and quantum error correction. However, physical resource requirements to implement useful error-corrected quantum algorithms are prohibitive in the current era of NISQ devices. As an alternative path to performing universal quantum computation, within the NISQ era limitations, we propose to merge digital single-qubit operations with analog multi-qubit entangling blocks in an approach we call digital-analog quantum computing (DAQC). Along these lines, although the techniques may be extended to any resource, we propose to use unitaries generated by the ubiquitous Ising Hamiltonian for the analog entangling block and we prove its universal character. We construct explicit DAQC protocols for efficient simulations of arbitrary inhomogeneous Ising, two-body, and $M$-body spin Hamiltonian dynamics by means of single-qubit gates and a fixed homogeneous Ising Hamiltonian. Additionally, we compare a sequential approach where the interactions are switched on and off (stepwise~DAQC) with an always-on multi-qubit interaction interspersed by fast single-qubit pulses (banged DAQC). Finally, we perform numerical tests comparing purely digital schemes with DAQC protocols, showing a remarkably better performance of the latter. The proposed DAQC approach combines the robustness of analog quantum computing with the flexibility of digital methods.

quant-ph↗

arXiv2020

Quantum machine learning and quantum biomimetics: A perspective

Quantum machine learning has emerged as an exciting and promising paradigm inside quantum technologies. It may permit, on the one hand, to carry out more efficient machine learning calculations by means of quantum devices, while, on the other hand, to employ machine learning techniques to better control quantum systems. Inside quantum machine learning, quantum reinforcement learning aims at developing "intelligent" quantum agents that may interact with the outer world and adapt to it, with the strategy of achieving some final goal. Another paradigm inside quantum machine learning is that of quantum autoencoders, which may allow one for employing fewer resources in a quantum device via a training process. Moreover, the field of quantum biomimetics aims at establishing analogies between biological and quantum systems, to look for previously inadvertent connections that may enable useful applications. Two recent examples are the concepts of quantum artificial life, as well as of quantum memristors. In this Perspective, we give an overview of these topics, describing the related research carried out by the scientific community.

quant-ph↗

arXiv2020

Quantum computing cryptography: Finding cryptographic Boolean functions with quantum annealing by a 2000 qubit D-wave quantum computer

As the building block in symmetric cryptography, designing Boolean functions satisfying multiple properties is an important problem in sequence ciphers, block ciphers, and hash functions. However, the search of $n$-variable Boolean functions fulfilling global cryptographic constraints is computationally hard due to the super-exponential size $\mathcal{O}(2^{2^n})$ of the space. Here, we introduce a codification of the cryptographically relevant constraints in the ground state of an Ising Hamiltonian, allowing us to naturally encode it in a quantum annealer, which seems to provide a quantum speedup. Additionally, we benchmark small $n$ cases in a D-Wave machine, showing its capacity of devising bent functions, the most relevant set of cryptographic Boolean functions. We have complemented it with local search and chain repair to improve the D-Wave quantum annealer performance related to the low connectivity. This work shows how to codify super-exponential cryptographic problems into quantum annealers and paves the way for reaching quantum supremacy with an adequately designed chip.

quant-ph↗

arXiv2019

Towards Pricing Financial Derivatives with an IBM Quantum Computer

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 dynamics have been proposed in the literature to model either the instantaneous interest rate or the instantaneous forward rate. A successful approach to model the latter is the celebrated Heath-Jarrow-Morton framework, in which its dynamics is entirely specified by volatility factors. On its multifactor version, this model considers several noisy components to capture at best the dynamics of several time-maturing forward rates. However, as no general analytical solution is available, there is a trade-off between the number of noisy factors considered and the computational time to perform a numerical simulation. Here, we employ the quantum principal component analysis to reduce the number of noisy factors required to accurately simulate the time evolution of several time-maturing forward rates. The principal components are experimentally estimated with the $5$-qubit IBMQX2 quantum computer for $2\times 2$ and $3\times 3$ cross-correlation matrices, which are based on historical data for two and three time-maturing forward rates. This manuscript is a first step towards the design of a general quantum algorithm to fully simulate on quantum computers the Heath-Jarrow-Morton model for pricing interest-rate financial derivatives. It shows indeed that practical applications of quantum computers in finance will be achievable in the near future.

quant-ph↗

arXiv2019

Experimental Implementation of a Quantum Autoencoder via Quantum Adders

Quantum autoencoders allow for reducing the amount of resources in a quantum computation by mapping the original Hilbert space onto a reduced space with the relevant information. Recently, it was proposed to employ approximate quantum adders to implement quantum autoencoders in quantum technologies. Here, we carry out the experimental implementation of this proposal in the Rigetti cloud quantum computer employing up to three qubits. The experimental fidelities are in good agreement with the theoretical prediction, thus proving the feasibility to realize quantum autoencoders via quantum adders in state-of-the-art superconducting quantum technologies.

quant-ph↗

arXiv2018

Probabilistic Eigensolver with a Trapped-Ion Quantum Processor

Quantum simulation of complex quantum systems and their properties often requires the ability to prepare initial states in an eigenstate of the Hamiltonian to be simulated. In addition, to compute the eigenvalues of a Hamiltonian is in general a non-trivial problem. Here, we propose a hybrid quantum-classical probabilistic method to compute eigenvalues and prepare eigenstates of Hamiltonians which are simulatable with a trapped-ion quantum processor.

quant-ph↗

arXiv2018

The TRAPSENSOR Facility: an Open-Ring 7-Tesla Penning Trap for Laser-Based Precision Experiments

The Penning-trap electronic-detection technique that offers the precision and sensitivity requested in mass spectrometry for fundamental studies in nuclear and particle physics has not been proven yet to be universal. This has motivated the construction of a Penning-trap facility aiming at the implementation of a novel detection method, consisting in measuring motional frequencies of singly-charged trapped ions in strong magnetic fields, through the fluorescence photons from the 4s$^2$S$_{1/2}\rightarrow $4p$^2$P$_{1/2}$ atomic transition in $^{40}$Ca$^+$. The key element of this facility is an open-ring Penning trap, built and fully characterized, which is coupled upstream to a preparation Penning trap similar to those built at Radioactive Ion Beam facilities. Motional frequency measurements of trapped ions stored in the open-ring trap have been carried out by applying external dipolar and quadrupolar fields in resonance with the ions' eigenmotions, in combination with time-of-flight identification. The infrastructure to observe the fluorescence photons from $^{40}$Ca$^+$, comprising the twelve laser beams needed in 7~Tesla, and a two-meters long system to register the image in a high-sensitive CCD sensor, has also been successfully tested by observing optically the trapped $^{40}$Ca$^+$ ions. This demonstrates the capabilities of this facility for the proposed laser-based mass-spectrometry technique, and introduces it as a unique platform to perform laser-spectroscopy experiments with implications in different fields of physics.

physics.ins-det↗

arXiv2018

A Quantum Algorithm for Solving Linear Differential Equations: Theory and Experiment

We present and experimentally realize a quantum algorithm for efficiently solving the following problem: given an $N\times N$ matrix $\mathcal{M}$, an $N$-dimensional vector $\textbf{\emph{b}}$, and an initial vector $\textbf{\emph{x}}(0)$, obtain a target vector $\textbf{\emph{x}}(t)$ as a function of time $t$ according to the constraint $d\textbf{\emph{x}}(t)/dt=\mathcal{M}\textbf{\emph{x}}(t)+\textbf{\emph{b}}$. We show that our algorithm exhibits an exponential speedup over its classical counterpart in certain circumstances. In addition, we demonstrate our quantum algorithm for a $4\times4$ linear differential equation using a 4-qubit nuclear magnetic resonance quantum information processor. Our algorithm provides a key technique for solving many important problems which rely on the solutions to linear differential equations.

quant-ph↗

arXiv2018

Nonlinear Quantum Rabi Model in Trapped Ions

We study the nonlinear dynamics of trapped-ion models far away from the Lamb-Dicke regime. This nonlinearity induces a sideband cooling blockade, stopping the propagation of quantum information along the Hilbert space of the Jaynes-Cummings and quantum Rabi models. We compare the linear and nonlinear cases of these models in the ultrastrong and deep strong coupling regimes. Moreover, we propose a scheme that simulates the nonlinear quantum Rabi model in all coupling regimes. This can be done via off-resonant nonlinear red and blue sideband interactions, yielding applications as a dynamical quantum filter.

quant-ph↗

arXiv2018

Digital-Analog Quantum Simulations with Superconducting Circuits

Quantum simulations consist in the intentional reproduction of physical or unphysical models into another more controllable quantum system. Beyond establishing communication vessels between unconnected fields, they promise to solve complex problems which may be considered as intractable for classical computers. From a historic perspective, two independent approaches have been pursued, namely, digital and analog quantum simulations. The former usually provide universality and flexibility, while the latter allows for better scalability. Here, we review recent literature merging both paradigms in the context of superconducting circuits, yielding: digital-analog quantum simulations. In this manner, we aim at getting the best of both approaches in the most advanced quantum platform involving superconducting qubits and microwave transmission lines. The discussed merge of quantum simulation concepts, digital and analog, may open the possibility in the near future for outperforming classical computers in relevant problems, enabling the reach of a quantum advantage.

quant-ph↗

arXiv2018

Analog quantum simulation of generalized Dicke models in trapped ions

We propose the analog quantum simulation of generalized Dicke models in trapped ions. By combining bicromatic laser interactions on multiple ions we can generate all regimes of light-matter coupling in these models, where here the light mode is mimicked by a motional mode. We present numerical simulations of the three-qubit Dicke model both in the weak field (WF) regime, where the Jaynes-Cummings behaviour arises, and the ultrastrong coupling (USC) regime, where rotating-wave approximation (RWA) cannot be considered. We also simulate the two-qubit biased Dicke model in the WF and USC regimes and the two-qubit anisotropic Dicke model in the USC regime and the deep-strong coupling (DSC) regime. The agreement between the mathematical models and the ion system convinces us that these quantum simulations can be implemented in the lab with current or near-future technology. This formalism establishes an avenue for the quantum simulation of many-spin Dicke models in trapped ions.

quant-ph↗

arXiv2017

Quantum simulation of the quantum Rabi model in a trapped ion

The quantum Rabi model, involving a two-level system and a bosonic field mode, is arguably the simplest and most fundamental model describing quantum light-matter interactions. Historically, due to the restricted parameter regimes of natural light-matter processes, the richness of this model has been elusive in the lab. Here, we experimentally realize a quantum simulation of the quantum Rabi model in a single trapped ion, where the coupling strength between the simulated light mode and atom can be tuned at will. The versatility of the demonstrated quantum simulator enables us to experimentally explore the quantum Rabi model in detail, including a wide range of otherwise unaccessible phenomena, as those happening in the ultrastrong and deep strong coupling regimes. In this sense, we are able to adiabatically generate the ground state of the quantum Rabi model in the deep strong coupling regime, where we are able to detect the nontrivial entanglement between the bosonic field mode and the two-level system. Moreover, we observe the breakdown of the rotating-wave approximation when the coupling strength is increased, and the generation of phonon wave packets that bounce back and forth when the coupling reaches the deep strong coupling regime. Finally, we also measure the energy spectrum of the quantum Rabi model in the ultrastrong coupling regime.

quant-ph↗