activity
20122024
most citedQuantum speed limit for physical processes

512 citations · 733 across the 15 of their papers we have counts for

collaborators

15 papers

quant-ph2024

Quantum Time-Series Learning with Evolutionary Algorithms

Vignesh Anantharamakrishnan, Márcio M. Taddei

Variational quantum circuits have arisen as an important method in quantum computing. A crucial step of it is parameter optimization, which is typically tackled through gradient-de…

quant-ph2024★ 17 cited

Quantum Optimization Methods for Satellite Mission Planning

Antón Makarov, Carlos Pérez-Herradón, Giacomo Franceschetto +5

Satellite mission planning for Earth observation satellites is a combinatorial optimization problem that consists of selecting the optimal subset of imaging requests, subject to co…

quant-ph2023★ 5 cited

Certification of quantum state functions under partial information

Leonardo Zambrano, Donato Farina, Egle Pagliaro +2

Convex functions of quantum states play a key role in quantum physics, with examples ranging from Bell inequalities to von Neumann entropy. However, in experimental scenarios, dire…

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-ph2021★ 4 cited

Local quantum overlapping tomography

Bruna G. M. Araújo, Márcio M. Taddei, Daniel Cavalcanti +1

Reconstructing the full quantum state of a many-body system requires the estimation of a number of parameters that grows exponentially with system size. Nevertheless, there are sit…

quant-ph2021★ 24 cited

Fragmented imaginary-time evolution for early-stage quantum signal processors

Thais de Lima Silva, Márcio M. Taddei, Stefano Carrazza +1

Simulating quantum imaginary-time evolution (QITE) is a major promise of quantum computation. However, the known algorithms are either probabilistic (repeat until success) with imp…