output
20162025
most citedA density-matrix renormalization group algorithm for simulating quantum circuits with a finite fidelity

69 citations

39 papers

cs.LG2025

Achieving Skilled and Reliable Daily Probabilistic Forecasts of Wind Power at Subseasonal-to-Seasonal Timescales over France

Eloi Lindas, Yannig Goude, Philippe Ciais

In a growing renewable based energy system, accurate and reliable wind power forecasts are crucial for grid stability, balancing supply and demand and market risk management. Even…

eess.SP2025★ 3 cited

Towards Accurate Forecasting of Renewable Energy : Building Datasets and Benchmarking Machine Learning Models for Solar and Wind Power in France

Eloi Lindas, Yannig Goude, Philippe Ciais

Accurate prediction of non-dispatchable renewable energy sources is essential for grid stability and price prediction. Regional power supply forecasts are usually indirect through…

cs.CV2024

Privacy-Preserving Adaptive Re-Identification without Image Transfer

Hamza Rami, Jhony H. Giraldo, Nicolas Winckler +1

Re-Identification systems (Re-ID) are crucial for public safety but face the challenge of having to adapt to environments that differ from their training distribution. Furthermore,…

cs.CR2024

CROSSCON: Cross-platform Open Security Stack for Connected Devices

Bruno Crispo, Marco Roveri, Sandro Pinto +8

The proliferation of Internet of Things (IoT) embedded devices is expected to reach 30 billion by 2030, creating a dynamic landscape where diverse devices must coexist. This presen…

quant-ph2023★ 11 cited

Optimal Hadamard gate count for Clifford synthesis of Pauli rotations sequences

Vivien Vandaele, Simon Martiel, Simon Perdrix +1

The Clifford gate set is commonly used to perform universal quantum computation. In such setup the gate is typically much more expensive to implement in a fault-tolerant wa…

quant-ph2022★ 1 cited

A graph-state based synthesis framework for Clifford isometries

Timothée Goubault de Brugière, Simon Martiel, Christophe Vuillot

We tackle the problem of Clifford isometry compilation, i.e, how to synthesize a Clifford isometry into an executable quantum circuit. We propose a simple framework for synthesis t…

cs.DC2022★ 2 cited

Node-Type-Based Load-Balancing Routing for Parallel Generalized Fat-Trees

John Gliksberg, Jean-Noel Quintin, Pedro Javier Garcia

High-Performance Computing (HPC) clusters are made up of a variety of node types (usually compute, I/O, service, and GPGPU nodes) and applications don't use nodes of a different ty…

cs.DC2022★ 3 cited

High-Quality Fault-Resiliency in Fat-Tree Networks (Extended Abstract)

John Gliksberg, Antoine Capra, Alexandre Louvet +2

Coupling regular topologies with optimized routing algorithms is key in pushing the performance of interconnection networks of HPC systems. In this paper we present Dmodc, a fast d…

quant-ph2022★ 11 cited

QuDiet: A Classical Simulation Platform for Qubit-Qudit Hybrid Quantum Systems

Turbasu Chatterjee, Arnav Das, Subhayu Kumar Bala +3

In the recent years, numerous research advancements have extended the limit of classical simulation of quantum algorithms. Although, most of the state-of-the-art classical simulato…

quant-ph2022★ 69 cited

A density-matrix renormalization group algorithm for simulating quantum circuits with a finite fidelity

Thomas Ayral, Thibaud Louvet, Yiqing Zhou +3

We develop a density-matrix renormalization group (DMRG) algorithm for the simulation of quantum circuits. This algorithm can be seen as the extension of time-dependent DMRG from t…

cs.LG2022

FFCNN: Fast FPGA based Acceleration for Convolution neural network inference

F. Keddous, H-N. Nguyen, A. Nakib

We present a new efficient OpenCL-based Accelerator for large scale Convolutional Neural Networks called Fast Inference on FPGAs for Convolution Neural Network (FFCNN). FFCNN is ba…

quant-ph2022

Open Source Variational Quantum Eigensolver Extension of the Quantum Learning Machine (QLM) for Quantum Chemistry

Mohammad Haidar, Marko J. Rančić, Thomas Ayral +2

Quantum Chemistry (QC) is one of the most promising applications of Quantum Computing. However, present quantum processing units (QPUs) are still subject to large errors. Therefore…

cs.DC2022★ 58 cited

Enabling Dynamic and Intelligent Workflows for HPC, Data Analytics, and AI Convergence

Jorge Ejarque, Rosa M. Badia, Loïc Albertin +34

The evolution of High-Performance Computing (HPC) platforms enables the design and execution of progressively larger and more complex workflow applications in these systems. The co…

quant-ph2022★ 16 cited

Gaussian Elimination versus Greedy Methods for the Synthesis of Linear Reversible Circuits

Timothée Goubault de Brugière, Marc Baboulin, Benoît Valiron +2

Linear reversible circuits represent a subclass of reversible circuits with many applications in quantum computing. These circuits can be efficiently simulated by classical compute…

quant-ph2022★ 9 cited

Decoding techniques applied to the compilation of CNOT circuits for NISQ architectures

Timothée Goubault de Brugière, Marc Baboulin, Benoît Valiron +2

Current proposals for quantum compilers require the synthesis and optimization of linear reversible circuits and among them CNOT circuits. Since these circuits represent a signific…

quant-ph2022★ 35 cited

Reducing the Depth of Linear Reversible Quantum Circuits

Timothée Goubault de Brugière, Marc Baboulin, Benoît Valiron +2

In quantum computing the decoherence time of the qubits determines the computation time available and this time is very limited when using current hardware. In this paper we minimi…

quant-ph2021★ 19 cited

Qurzon: A Prototype for a Divide and Conquer Based Quantum Compiler

Turbasu Chatterjee, Arnav Das, Shah Ishmam Mohtashim +2

When working with algorithms on quantum devices, quantum memory becomes a crucial bottleneck due to low qubit count in NISQ-era devices. In this context, the concept of `divide and…

quant-ph2021★ 15 cited

Unraveling correlated material properties with noisy quantum computers: Natural orbitalized variational quantum eigensolving of extended impurity models within a slave-boson approach

Pauline Besserve, Thomas Ayral

We propose a method for computing space-resolved correlation properties of the two-dimensional Hubbard model within a quantum-classical embedding strategy that uses a Noisy, Interm…

cs.CV2021★ 2 cited

Using Synthetic Corruptions to Measure Robustness to Natural Distribution Shifts

Alfred Laugros, Alice Caplier, Matthieu Ospici

Synthetic corruptions gathered into a benchmark are frequently used to measure neural network robustness to distribution shifts. However, robustness to synthetic corruption benchma…

quant-ph2021★ 25 cited

Phase polynomials synthesis algorithms for NISQ architectures and beyond

Vivien Vandaele, Simon Martiel, Timothée Goubault de Brugière

We present a framework for the synthesis of phase polynomials that addresses both cases of full connectivity and partial connectivity for NISQ architectures. In most cases, our alg…

cs.LG2021★ 68 cited

Latent Space Data Assimilation by using Deep Learning

Mathis Peyron, Anthony Fillion, Selime Gürol +4

Performing Data Assimilation (DA) at a low cost is of prime concern in Earth system modeling, particularly at the time of big data where huge quantities of observations are availab…

cs.CL2021

User-friendly automatic transcription of low-resource languages: Plugging ESPnet into Elpis

Oliver Adams, Benjamin Galliot, Guillaume Wisniewski +11

This paper reports on progress integrating the speech recognition toolkit ESPnet into Elpis, a web front-end originally designed to provide access to the Kaldi automatic speech rec…

quant-ph2021★ 32 cited

Quantum Divide and Compute: Exploring The Effect of Different Noise Sources

Thomas Ayral, François-Marie Le Régent, Zain Saleem +2

Our recent work (Ayral et al., 2020 IEEE Computer Society Annual Symposium on VLSI (ISVLSI)) showed the first implementation of the Quantum Divide and Compute (QDC) method, which a…

quant-ph2021★ 50 cited

Benchmarking quantum co-processors in an application-centric, hardware-agnostic and scalable way

Simon Martiel, Thomas Ayral, Cyril Allouche

Existing protocols for benchmarking current quantum co-processors fail to meet the usual standards for assessing the performance of High-Performance-Computing platforms. After a sy…