output
20202026
most citedExplainable Artificial Intelligence (XAI) 2.0: A Manifesto of Open Challenges and Interdisciplinary Research Directions

544 citations

Showing 2023 · quant-phShow all

7 papers · 2 filters

quant-ph2023★ 15 cited

Optimizing edge state transfer in a Su-Schrieffer-Heeger chain via hybrid analog-digital strategies

Sebastián V. Romero, Xi Chen, Gloria Platero +1

The Su-Schrieffer-Heeger (SSH) chain, which serves as a paradigmatic model for comprehending topological phases and their associated edge states, plays an essential role in advanci…

quant-ph2023★ 4 cited

Scattering of relativistic electrons and analogies with optical phenomena: A study of longitudinal and transverse shifts at step potentials

Yue Ban, Xi Chen

We investigate the behavior of relativistic electrons encountering a potential step through analogies with optical phenomena. By accounting for the conservation of Dirac current, w…

quant-ph2023★ 7 cited

Photonic counterdiabatic quantum optimization algorithm

Pranav Chandarana, Koushik Paul, Mikel Garcia-de-Andoin +3

We propose a hybrid quantum-classical approximate optimization algorithm for photonic quantum computing, specifically tailored for addressing continuous-variable optimization probl…

quant-ph2023★ 8 cited

Optimization of Image Acquisition for Earth Observation Satellites via Quantum Computing

Antón Makarov, Márcio M. Taddei, Eneko Osaba +3

Satellite image acquisition scheduling is a problem that is omnipresent in the earth observation field; its goal is to find the optimal subset of images to be taken during a given…

quant-ph2023★ 39 cited

Efficient quantum amplitude encoding of polynomial functions

Javier Gonzalez-Conde, Thomas W. Watts, Pablo Rodriguez-Grasa +1

Loading functions into quantum computers represents an essential step in several quantum algorithms, such as quantum partial differential equation solvers. Therefore, the inefficie…

quant-ph2023★ 2 cited

Formulation of the Electric Vehicle Charging and Routing Problem for a Hybrid Quantum-Classical Search Space Reduction Heuristic

M. Garcia de Andoin, A. Bottarelli, S. Schmitt +3

Combinatorial optimization problems have attracted much interest in the quantum computing community in the recent years as a potential testbed to showcase quantum advantage. In thi…

quant-ph2023★ 14 cited

PauliComposer: Compute Tensor Products of Pauli Matrices Efficiently

Sebastián V. Romero, Juan Santos-Suárez

We introduce a simple algorithm that efficiently computes tensor products of Pauli matrices. This is done by tailoring the calculations to this specific case, which allows to avoid…