11 papers
Exponential logical-error reduction in quantum memories via optimal syndrome-measurement timing
Tobias Haug, Kishor Bharti, Leandro Aolita
Syndrome-measurements timing is usually treated as a fixed clock cycle of a quantum error-correcting code. For quantum memories, however, the intra-measurement interval is itself a…
Machine-learned syndrome post-selection for reliable quantum error correction
Tobias Haug, Askery Canabarro, Leandro Aolita
Quantum error correction can be enhanced by post-selecting out runs that are likely to produce a logical failure, but the most accurate measures for that require costly decoder-lev…
Scalable Determination of Penalization Weights for Constrained Optimizations on Approximate Solvers
Edoardo Alessandroni, Sergi Ramos-Calderer, Michel Krispin +5
Quadratic unconstrained binary optimization (QUBO) provides problem formulations for various computational problems that can be solved with dedicated QUBO solvers, which can be bas…
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 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…
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…