43 citations · 62 across the 6 of their papers we have counts for
6 papers · 1 filter
Robustness of Quantum Signal Processing and Resource-aware Polynomial Design
Thiago O. Maciel, Giancarlo Camilo, Allan Tosta +3
Quantum signal processing (QSP) realizes operator functions through polynomial transformations of a finite degree. In addition to function approximation errors, realistic implement…
Compilation-informed probabilistic logical-error cancellation
Giancarlo Camilo, Thiago O. Maciel, Allan Tosta +4
The potential of quantum computers to outperform classical ones in practically useful tasks remains challenging in the near term due to scaling limitations and high error rates of…
Quantum optimization with exact geodesic transport
André J. Ferreira-Martins, Renato M. S. Farias, Giancarlo Camilo +6
We introduce an architecture for variational quantum algorithms that can be efficiently trained via parameter updates along exact geodesics on the Riemannian state manifold. This f…
A competitive NISQ and qubit-efficient solver for the LABS problem
Marco Sciorilli, Giancarlo Camilo, Thiago O. Maciel +3
Pauli Correlation Encoding (PCE) is as a qubit-efficient variational approach to combinatorial optimization problems. The method offers a polynomial reduction in qubit count and a…
Quantum encoder for fixed Hamming-weight subspaces
Renato M. S. Farias, Thiago O. Maciel, Giancarlo Camilo +3
We present an exact -qubit computational-basis amplitude encoder of real- or complex-valued data vectors of components into a subspace of fixed Hamming weight $…
Towards large-scale quantum optimization solvers with few qubits
Marco Sciorilli, Lucas Borges, Taylor L. Patti +4
We introduce a variational quantum solver for combinatorial optimizations over binary variables using only qubits, with tunable . The number of parame…