SearcharxivSearch

arXiv subjects

Dimitri Jordan Kenne

Publications and source records attributed to Dimitri Jordan Kenne.

4 recordsLinked to original sources

Establishing Baselines for Photonic Quantum Machine Learning: Insights from an Open, Collaborative Initiative

The Perceval Challenge is an open, reproducible benchmark designed to assess the potential of photonic quantum computing for machine learning. Focusing on a reduced and hardware-feasible version of the MNIST digit classification task or near-term photonic processors, it offers a concrete framework to evaluate how photonic quantum circuits learn and generalize from limited data. Conducted over more than three months, the challenge attracted 64 teams worldwide in its first phase. After an initial selection, 11 finalist teams were granted access to GPU resources for large-scale simulation and photonic hardware execution through cloud service. The results establish the first unified baseline of photonic machine-learning performance, revealing complementary strengths between variational, hardware-native, and hybrid approaches. This challenge also underscores the importance of open, reproducible experimentation and interdisciplinary collaboration, highlighting how shared benchmarks can accelerate progress in quantum-enhanced learning. All implementations are publicly available in a single shared repository (https://github.com/Quandela/HybridAIQuantum-Challenge), supporting transparent benchmarking and cumulative research. Beyond this specific task, the Perceval Challenge illustrates how systematic, collaborative experimentation can map the current landscape of photonic quantum machine learning and pave the way toward hybrid, quantum-augmented AI workflows.

quant-ph

Multidimensional pseudo-Leja sequences

The one-dimensional pseudo Leja sequences introduced in \cite{bialas2012pseudo}, as an alternative to Leja sequences, provides us with good interpolation nodes for the approximation of holomorphic functions. We propose a definition of multidimensional pseudo Leja sequences associated to a compact set $K$ of the complex space $\mathbb{C}^p$ which generalises both the one-dimensional version and the multidimensional Leja sequences. We show that these sequences can be used to calculate the transfinite diameter of $K$. We also present a relation to the pluricomplex Green function associated to $K$. Subsequently, we show that the intertwinning of pseudo Leja sequences is still a pseudo Leja sequence. We give a method to compute pseudo Leja sequences with the help of discrete meshes.

math.CV

A new estimate of the transfinite diameter of Bernstein sets

Let $K \subset \mathbb{C}^n$ be a compact set satisfying the following Bernstein inequality: for any $m \in \{ 1,..., n\}$ and for any $n$-variate polynomial $P$ of degree $\mbox{deg}(P)$ we have \begin{align*} \max_{z\in K}\left|\frac{\partial P}{\partial z_m}(z)\right| \le M\ \mbox{deg}(P) \max_{z\in K}|P(z)| \ \mbox{ for } z = (z_1, \dots, z_n). \end{align*} for some constant $M= M(K)>0$ depending only on $K$. We show that the transfinite diameter of $K$, denoted $δ(K)$, verifies the following lower estimate \begin{align*} δ(K) \ge \frac{1}{n M}, \end{align*} which is optimal in the one-dimensional case. In addition, we show that if $K$ is a Cartesian product of compact planar sets then \begin{align*} δ(K) \ge \frac{1}{M}. \end{align*}

math.CV