arXiv subjects

Enrique Solano

Publications and source records attributed to Enrique Solano.

At least 91 records · Page 5Linked to original sources

arXiv2021

Quantized Three-Ion-Channel Neuron Model for Neural Action Potentials

The Hodgkin-Huxley model describes the conduction of the nervous impulse through the axon, whose membrane's electric response can be described employing multiple connected electric circuits containing capacitors, voltage sources, and conductances. These conductances depend on previous depolarizing membrane voltages, which can be identified with a memory resistive element called memristor. Inspired by the recent quantization of the memristor, a simplified Hodgkin-Huxley model including a single ion channel has been studied in the quantum regime. Here, we study the quantization of the complete Hodgkin-Huxley model, accounting for all three ion channels, and introduce a quantum source, together with an output waveguide as the connection to a subsequent neuron. Our system consists of two memristors and one resistor, describing potassium, sodium, and chloride ion channel conductances, respectively, and a capacitor to account for the axon's membrane capacitance. We study the behavior of both ion channel conductivities and the circuit voltage, and we compare the results with those of the single channel, for a given quantum state of the source. It is remarkable that, in opposition to the single-channel model, we are able to reproduce the voltage spike in an adiabatic regime. Arguing that the circuit voltage is a quantum variable, we find a purely quantum-mechanical contribution in the system voltage's second moment. This work represents a complete study of the Hodgkin-Huxley model in the quantum regime, establishing a recipe for constructing quantum neuron networks with quantum state inputs. This paves the way for advances in hardware-based neuromorphic quantum computing, as well as quantum machine learning, which might be more efficient resource-wise.

q-bio.NC↗

arXiv2021

Entangled Quantum Memristors

We propose the interaction of two quantum memristors via capacitive and inductive coupling in feasible superconducting circuit architectures. In this composed system the input gets correlated in time, which changes the dynamic response of each quantum memristor in terms of its pinched hysteresis curve and their nontrivial entanglement. In this sense, the concurrence and memristive dynamics follow an inverse behavior, showing maximal values of entanglement when the hysteresis curve is minimal and vice versa. Moreover, the direction followed in time by the hysteresis curve is reversed whenever the quantum memristor entanglement is maximal. The study of composed quantum memristors paves the way for developing neuromorphic quantum computers and native quantum neural networks, on the path towards quantum advantage with current NISQ technologies.

quant-ph↗

arXiv2021

Quantum Pattern Recognition in Photonic Circuits

This paper proposes a machine learning method to characterize photonic states via a simple optical circuit and data processing of photon number distributions, such as photonic patterns. The input states consist of two coherent states used as references and a two-mode unknown state to be studied. We successfully trained supervised learning algorithms that can predict the degree of entanglement in the two-mode state as well as perform the full tomography of one photonic mode, obtaining satisfactory values in the considered regression metrics.

quant-ph↗

arXiv2021

Supporting FAIR Principles in the Astrophysics Community: the European Experience

FAIR principles have the intent to act as a guideline for those wishing to enhance the reusability of their data holdings and put specific emphasis on enhancing the ability of machines to automatically find and use the data, in addition to supporting its reuse by individuals. Interoperability, one core of these principles, especially when dealing with automated systems' ability to interface with each other, requires open standards to avoid restrictions that negatively impact the user's experience. Open-ness of standards is best supported when the governance itself is open and includes a wide range of community participation. In this contribution we report our experience with the FAIR principles, interoperable systems and open governance in astrophysics. We report on activities that have matured within the ESCAPE project with a focus on interfacing the EOSC architecture and Interoperability Framework.

astro-ph.IM↗

arXiv2021

Digitized Adiabatic Quantum Factorization

Quantum integer factorization is a potential quantum computing solution that may revolutionize cryptography. Nevertheless, a scalable and efficient quantum algorithm for noisy intermediate-scale quantum computers looks far-fetched. We propose an alternative factorization method, within the digitized-adiabatic quantum computing paradigm, by digitizing an adiabatic quantum factorization algorithm enhanced by shortcuts to adiabaticity techniques. We find that this fast factorization algorithm is suitable for available gate-based quantum computers. We test our quantum algorithm in an IBM quantum computer with up to six qubits, surpassing the performance of the more commonly used factorization algorithms on the long way towards quantum advantage.

quant-ph↗

arXiv2021

J-PLUS: Searching for very metal-poor star candidates using the SPEEM pipeline

We explore the stellar content of the Javalambre Photometric Local Universe Survey (J-PLUS) Data Release 2 and show its potential to identify low-metallicity stars using the Stellar Parameters Estimation based on Ensemble Methods (SPEEM) pipeline. SPEEM is a tool to provide determinations of atmospheric parameters for stars and separate stellar sources from quasars, using the unique J-PLUS photometric system. The adoption of adequate selection criteria allows the identification of metal-poor star candidates suitable for spectroscopic follow-up. SPEEM consists of a series of machine learning models which uses a training sample observed by both J-PLUS and the SEGUE spectroscopic survey. The training sample has temperatures Teff between 4\,800 K and 9\,000 K; $\log g$ between 1.0 and 4.5, and $-3.1<[Fe/H]<+0.5$. The performance of the pipeline has been tested with a sample of stars observed by the LAMOST survey within the same parameter range. The average differences between the parameters of a sample of stars observed with SEGUE and J-PLUS, which were obtained with the SEGUE Stellar Parameter Pipeline and SPEEM, respectively, are $ΔTeff\sim 41$ K, $Δ\log g\sim 0.11$ dex, and $Δ[Fe/H]\sim 0.09$ dex. A sample of 177 stars have been identified as new candidates with $[Fe/H]<-2.5$ and 11 of them have been observed with the ISIS spectrograph at the William Herschel Telescope. The spectroscopic analysis confirms that $64\%$ of stars have $[Fe/H]<-2.5$, including one new star with $[Fe/H]<-3.0$. SPEEM in combination with the J-PLUS filter system has shown the potential to estimate the stellar atmospheric parameters (Teff, $\log g$, and [Fe/H]). The spectroscopic validation of the candidates shows that SPEEM yields a success rate of $64\%$ on the identification of very metal-poor star candidates with $[Fe/H]<-2.5$.

astro-ph.SR↗

arXiv2021

Qubit Motion as a Microscopic Model for the Dynamical Casimir Effect

The generation of photons from the vacuum by means of the movement of a mirror is known as the dynamical Casimir effect (DCE). In general, this phenomenon is effectively described by a field with time-dependent boundary conditions. Alternatively, we consider a microscopic model of the DCE capable of reproducing the effect with no time-dependent boundary conditions. Besides the field, such a model comprises a subsystem modeling the mirror's internal structure. In this work, we study the most straightforward system for the mirror: a qubit moving in a cavity and coupled to one of the bosonic modes. We find that under certain conditions on the qubit's movement that do not depend on its physical properties, a large number of photons may be generated without changing the qubit state, as should be expected for a microscopic model of the mirror.

quant-ph↗

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

Spreading the word -- current status of VO tutorials and schools

With some telescopes standing still, now more than ever simple access to archival data is vital for astronomers and they need to know how to go about it. Within European Virtual Observatory (VO) projects, such as AIDA (2008-2010), ICE (2010-2012), CoSADIE (2013-2015), ASTERICS (2015-2018) and ESCAPE (since 2019), we have been offering Virtual Observatory schools for many years. The aim of these schools are twofold: teaching (early career) researchers about the functionalities and possibilities within the Virtual Observatory and collecting feedback from the astronomical community. In addition to the VO schools on the European level, different national teams have also put effort into VO dissemination. The team at the Centre de Données astronomiques de Strasbourg (CDS) started to explore more and new ways to interact with the community: a series of blog posts on AstroBetter.com or a lunch time session at the virtual EAS meeting 2020. The Spanish VO has conducted virtual VO schools. GAVO has supported online archive workshops and maintains their Virtual Observatory Text Treasures. In this paper, we present the different formats in more detail, and report on the resulting interaction with the community as well as the estimated reach.

astro-ph.IM↗

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 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

Breaking Adiabatic Quantum Control with Deep Learning

In the era of digital quantum computing, optimal digitized pulses are requisite for efficient quantum control. This goal is translated into dynamic programming, in which a deep reinforcement learning (DRL) agent is gifted. As a reference, shortcuts to adiabaticity (STA) provide analytical approaches to adiabatic speed up by pulse control. Here, we select single-component control of qubits, resembling the ubiquitous two-level Landau-Zener problem for gate operation. We aim at obtaining fast and robust digital pulses by combining STA and DRL algorithm. In particular, we find that DRL leads to robust digital quantum control with operation time bounded by quantum speed limits dictated by STA. In addition, we demonstrate that robustness against systematic errors can be achieved by DRL without any input from STA. Our results introduce a general framework of digital quantum control, leading to a promising enhancement in quantum information processing.

quant-ph↗

arXiv2020

Shortcuts to Adiabaticity in Digitized Adiabatic Quantum Computing

Shortcuts to adiabaticity are well-known methods for controlling the quantum dynamics beyond the adiabatic criteria, where counter-diabatic (CD) driving provides a promising means to speed up quantum many-body systems. In this work, we show the applicability of CD driving to enhance the digitized adiabatic quantum computing paradigm in terms of fidelity and total simulation time. We study the state evolution of an Ising spin chain using the digitized version of the standard CD driving and its variants derived from the variational approach. We apply this technique in the preparation of Bell and Greenberger-Horne-Zeilinger states with high fidelity using a very shallow quantum circuit. We implement this proposal in the IBM quantum computer, proving its usefulness for the speed up of adiabatic quantum computing in noisy intermediate-scale quantum devices.

quant-ph↗

arXiv2020

White Paper on MAAT@GTC

MAAT is proposed as a visitor mirror-slicer optical system that will allow the OSIRIS spectrograph on the 10.4-m Gran telescopio CANARIAS (GTC) the capability to perform Integral Field Spectroscopy (IFS) over a seeing-limited FoV 14.20''x10'' with a slice width of 0.303''. MAAT@GTC will enhance the resolution power of OSIRIS by 1.6 times as compared to its 0.6'' wide long-slit. All the eleven OSIRIS grisms and volume-phase holographic gratings will be available to provide broad spectral coverage with moderate resolution (R=600 up to 4100) in the 3600 - 10000 Å wavelength range. MAAT unique observing capabilities will broaden its use to the needs of the GTC community to unveil the nature of most striking phenomena in the universe well beyond time-domain astronomy. The GTC equipped with OSIRIS+MAAT will also play a fundamental role in synergy with other facilities, some of them operating on the northern ORM at La Palma. This White Paper presents the different aspects of MAAT@GTC - including scientific and technical specifications, outstanding science cases, and an outline of the instrument concept.

astro-ph.IM↗

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

Retrieving Quantum Information with Active Learning

Active learning is a machine learning method aiming at optimal design for model training. At variance with supervised learning, which labels all samples, active learning provides an improved model by labeling samples with maximal uncertainty according to the estimation model. Here, we propose the use of active learning for efficient quantum information retrieval, which is a crucial task in the design of quantum experiments. Meanwhile, when dealing with large data output, we employ active learning for the sake of classification with minimal cost in fidelity loss. Indeed, labeling only 5% samples, we achieve almost 90% rate estimation. The introduction of active learning methods in the data analysis of quantum experiments will enhance applications of quantum technologies.

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↗