NRNicolas Robles
Nicolas Robles
*This is an algorithmically generated author record based on publicly available information.
Research Subjects
Research Interests
Nicolas Robles has a total of 15 co-authors. Here are the top co-authors by number of shared publications:
- Arindam Roy
Department of Mathematics and Statistics, University of North Carolina at Charlotte, Charlotte, USA
2 shared publications - Alexandru Zaharescu
Department of Mathematics, University of Illinois Urbana-Champaign, Urbana, USA
1 shared publication - Amita Malik
Department of Mathematics, The Pennsylvania State University, McAllister Building, University Park 16802, PA, USA
1 shared publication - Amol Deshmukh
IBM Quantum, Yorktown Heights, NY, US
1 shared publication - Antonio Mezzacapo
IBM T.J. Watson Research Center
1 shared publication - Christa Zoufal
IBM Quantum, IBM Research Europe-Zurich, Zurich, Switzerland.
1 shared publication
Latest Publications
- Open Access
Expressivity of Variational Quantum Machine Learning on the Boolean Cube
Categorical data plays an important part in machine learning research and appears in a variety of applications. Models that can express large classes of real-valued functions on the Boolean cube are useful for problems involving discrete-valued data types, including those which are not Boolean. To this date, the commonly used schemes for embedding classical data into variational quantum machine learning models encode continuous values. Here we investigate quantum embeddings for encoding Boolean-valued data into parameterized quantum circuits used for machine learning tasks. We narrow down representability conditions for functions on the $n$-dimensional Boolean cube with respect to previously known results, using two quantum embeddings: a phase embedding and an embedding based on quantum random access codes. We show that for any real-valued function on the $n$-dimensional Boolean cube, there exists a variational linear quantum model based on a phase embedding using $n$ qubits that can represent it and an ensemble of such models using $d < n$ qubits that can express any function with degree at most $d$. Additionally, we prove that variational linear quantum models that use the quantum random access code embedding can express functions on the Boolean cube with degree $ d\leq \lceil\frac{n}{3}\rceil$ using $\lceil\frac{n}{3}\rceil$ qubits, and that an ensemble of such models can represent any function on the Boolean cube with degree $ d\leq \lceil\frac{n}{3}\rceil$. Furthermore, we discuss the potential benefits of each embedding and the impact of serial repetitions. Lastly, we demonstrate the use of the embeddings presented by performing numerical simulations and experiments on IBM quantum processors using the Qiskit machine learning framework.Open AccessExpressivity of Variational Quantum Machine Learning on the Boolean Cube
Categorical data plays an important part in machine learning research and appears in a variety of applications. Models that can express large classes of real-valued functions on the Boolean cube are useful for problems involving discrete-valued data types, including those which are not Boolean. To this date, the commonly used schemes for embedding classical data into variational quantum machine learning models encode continuous values. Here we investigate quantum embeddings for encoding Boolean-valued data into parameterized quantum circuits used for machine learning tasks. We narrow down representability conditions for functions on the $n$-dimensional Boolean cube with respect to previously known results, using two quantum embeddings: a phase embedding and an embedding based on quantum random access codes. We show that for any real-valued function on the $n$-dimensional Boolean cube, there exists a variational linear quantum model based on a phase embedding using $n$ qubits that can represent it and an ensemble of such models using $d < n$ qubits that can express any function with degree at most $d$. Additionally, we prove that variational linear quantum models that use the quantum random access code embedding can express functions on the Boolean cube with degree $ d\leq \lceil\frac{n}{3}\rceil$ using $\lceil\frac{n}{3}\rceil$ qubits, and that an ensemble of such models can represent any function on the Boolean cube with degree $ d\leq \lceil\frac{n}{3}\rceil$. Furthermore, we discuss the potential benefits of each embedding and the impact of serial repetitions. Lastly, we demonstrate the use of the embeddings presented by performing numerical simulations and experiments on IBM quantum processors using the Qiskit machine learning framework. - Open Access
- 7 June 2022
- Published by Verein zur Forderung des Open Access Publizierens in den Quantenwissenschaften in Quantum
- Vol. 6, 730
A variational quantum algorithm for the Feynman-Kac formula
We propose an algorithm based on variational quantum imaginary time evolution for solving the Feynman-Kac partial differential equation resulting from a multidimensional system of stochastic differential equations. We utilize the correspondence between the Feynman-Kac partial differential equation (PDE) and the Wick-rotated Schrödinger equation for this purpose. The results for a dimensional Feynman-Kac system obtained through the variational quantum algorithm are then compared against classical ODE solvers and Monte Carlo simulation. We see a remarkable agreement between the classical methods and the quantum variational method for an illustrative example on six and eight qubits. In the non-trivial case of PDEs which are preserving probability distributions – rather than preserving the -norm – we introduce a proxy norm which is efficient in keeping the solution approximately normalized throughout the evolution. The algorithmic complexity and costs associated to this methodology, in particular for the extraction of properties of the solution, are investigated. Future research topics in the areas of quantitative finance and other types of PDEs are also discussed.- 7 June 2022
- Published by Verein zur Forderung des Open Access Publizierens in den Quantenwissenschaften in Quantum
- Vol. 6, 730
Open AccessA variational quantum algorithm for the Feynman-Kac formula
We propose an algorithm based on variational quantum imaginary time evolution for solving the Feynman-Kac partial differential equation resulting from a multidimensional system of stochastic differential equations. We utilize the correspondence between the Feynman-Kac partial differential equation (PDE) and the Wick-rotated Schrödinger equation for this purpose. The results for a dimensional Feynman-Kac system obtained through the variational quantum algorithm are then compared against classical ODE solvers and Monte Carlo simulation. We see a remarkable agreement between the classical methods and the quantum variational method for an illustrative example on six and eight qubits. In the non-trivial case of PDEs which are preserving probability distributions – rather than preserving the -norm – we introduce a proxy norm which is efficient in keeping the solution approximately normalized throughout the evolution. The algorithmic complexity and costs associated to this methodology, in particular for the extraction of properties of the solution, are investigated. Future research topics in the areas of quantitative finance and other types of PDEs are also discussed. - 17 July 2020
- Published by Cambridge University Press (CUP) in Journal of the Australian Mathematical Society
- Vol. 111 (1) , 1-18
UNEXPECTED AVERAGE VALUES OF GENERALIZED VON MANGOLDT FUNCTIONS IN RESIDUE CLASSES
In order to study integers with few prime factors, the average of $\unicode[STIX]{x1D6EC}_{k}=\unicode[STIX]{x1D707}\ast \log ^{k}$ has been a central object of research. One of the more important cases, $k=2$ , was considered by Selberg [‘An elementary proof of the prime-number theorem’, Ann. of Math. (2)50 (1949), 305–313]. For $k\geq 2$ , it was studied by Bombieri [‘The asymptotic sieve’, Rend. Accad. Naz. XL (5)1(2) (1975/76), 243–269; (1977)] and later by Friedlander and Iwaniec [‘On Bombieri’s asymptotic sieve’, Ann. Sc. Norm. Super. Pisa Cl. Sci. (4)5(4) (1978), 719–756], as an application of the asymptotic sieve. Let $\unicode[STIX]{x1D6EC}_{j,k}:=\unicode[STIX]{x1D707}_{j}\ast \log ^{k}$ , where $\unicode[STIX]{x1D707}_{j}$ denotes the Liouville function for $(j+1)$ -free integers, and $0$ otherwise. In this paper we evaluate the average value of $\unicode[STIX]{x1D6EC}_{j,k}$ in a residue class $n\equiv a\text{ mod }q$ , $(a,q)=1$ , uniformly on $q$ . When $j\geq 2$ , we find that the average value in a residue class differs by a constant factor from the expected value. Moreover, an explicit formula of Weil type for $\unicode[STIX]{x1D6EC}_{k}(n)$ involving the zeros of the Riemann zeta function is derived for an arbitrary compactly supported ${\mathcal{C}}^{2}$ function.- 17 July 2020
- Published by Cambridge University Press (CUP) in Journal of the Australian Mathematical Society
- Vol. 111 (1) , 1-18
UNEXPECTED AVERAGE VALUES OF GENERALIZED VON MANGOLDT FUNCTIONS IN RESIDUE CLASSES
In order to study integers with few prime factors, the average of $\unicode[STIX]{x1D6EC}_{k}=\unicode[STIX]{x1D707}\ast \log ^{k}$ has been a central object of research. One of the more important cases, $k=2$ , was considered by Selberg [‘An elementary proof of the prime-number theorem’, Ann. of Math. (2)50 (1949), 305–313]. For $k\geq 2$ , it was studied by Bombieri [‘The asymptotic sieve’, Rend. Accad. Naz. XL (5)1(2) (1975/76), 243–269; (1977)] and later by Friedlander and Iwaniec [‘On Bombieri’s asymptotic sieve’, Ann. Sc. Norm. Super. Pisa Cl. Sci. (4)5(4) (1978), 719–756], as an application of the asymptotic sieve. Let $\unicode[STIX]{x1D6EC}_{j,k}:=\unicode[STIX]{x1D707}_{j}\ast \log ^{k}$ , where $\unicode[STIX]{x1D707}_{j}$ denotes the Liouville function for $(j+1)$ -free integers, and $0$ otherwise. In this paper we evaluate the average value of $\unicode[STIX]{x1D6EC}_{j,k}$ in a residue class $n\equiv a\text{ mod }q$ , $(a,q)=1$ , uniformly on $q$ . When $j\geq 2$ , we find that the average value in a residue class differs by a constant factor from the expected value. Moreover, an explicit formula of Weil type for $\unicode[STIX]{x1D6EC}_{k}(n)$ involving the zeros of the Riemann zeta function is derived for an arbitrary compactly supported ${\mathcal{C}}^{2}$ function.- 1 May 2018
- Published by Elsevier in Journal of Mathematical Analysis and Applications
- Vol. 461 (2) , 1771-1785
Zeros of normalized combinations of ξ()(s) on Re(s)=1/2
- 1 May 2018
- Published by Elsevier in Journal of Mathematical Analysis and Applications
- Vol. 461 (2) , 1771-1785
Zeros of normalized combinations of ξ()(s) on Re(s)=1/2
- Open Access
- 22 August 2014
- Published by Springer Nature in The Ramanujan Journal
- Vol. 38 (2) , 383-422
On a class of functions that satisfies explicit formulae involving the Möbius function
- 22 August 2014
- Published by Springer Nature in The Ramanujan Journal
- Vol. 38 (2) , 383-422
Open AccessOn a class of functions that satisfies explicit formulae involving the Möbius function