activity
20102023
most citedQuantum Approximate Optimization of Non-Planar Graph Problems on a Planar Superconducting Processor

469 citations · 1.9k across the 19 of their papers we have counts for

collaborators

21 papers

quant-ph2023★ 11 cited

Optimal, hardware native decomposition of parameterized multi-qubit Pauli gates

P. V. Sriluckshmy, Vicente Pina-Canelles, Mario Ponce +3

We show how to efficiently decompose a parameterized multi-qubit Pauli (PMQP) gate into native parameterized two-qubit Pauli (P2QP) gates minimizing both the circuit depth and the…

quant-ph2023★ 15 cited

Low-depth simulations of fermionic systems on square-grid quantum hardware

Manuel G. Algaba, P. V. Sriluckshmy, Martin Leib +1

We present a general strategy for mapping fermionic systems to quantum hardware with square qubit connectivity which yields low-depth quantum circuits, counted in the number of nat…

quant-ph2022★ 14 cited

Co-Design quantum simulation of nanoscale NMR

Manuel G. Algaba, Mario Ponce-Martinez, Carlos Munuera-Javaloy +7

Quantum computers have the potential to efficiently simulate the dynamics of nanoscale NMR systems. In this work we demonstrate that a noisy intermediate-scale quantum computer can…

quant-ph2020★ 33 cited

Quantum algorithms with local particle number conservation: noise effects and error correction

Michael Streif, Martin Leib, Filip Wudarski +2

Quantum circuits with local particle number conservation (LPNC) restrict the quantum computation to a subspace of the Hilbert space of the qubit register. In a noiseless or fault-t…

quant-ph2020★ 45 cited

Beating classical heuristics for the binary paint shop problem with the quantum approximate optimization algorithm

Michael Streif, Sheir Yarkoni, Andrea Skolik +2

The binary paint shop problem (BPSP) is an APX-hard optimization problem of the automotive industry. In this work, we show how to use the Quantum Approximate Optimization Algorithm…

quant-ph2020★ 8 cited

Forbidden subspaces for level-1 QAOA and IQP circuits

Michael Streif, Martin Leib

We present a thorough investigation of problems that can be solved exactly with the level-1 Quantum Approximate Optimization Algorithm (QAOA). To this end we implicitly define a cl…