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
Showing 2020 · quant-phShow all

5 papers · 2 filters

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…

quant-ph2020★ 341 cited

Layerwise learning for quantum neural networks

Andrea Skolik, Jarrod R. McClean, Masoud Mohseni +2

With the increased focus on quantum circuit learning for near-term applications on quantum devices, in conjunction with unique challenges presented by cost function landscapes of p…

quant-ph2020★ 469 cited

Quantum Approximate Optimization of Non-Planar Graph Problems on a Planar Superconducting Processor

Matthew P. Harrigan, Kevin J. Sung, Matthew Neeley +83

We demonstrate the application of the Google Sycamore superconducting qubit quantum processor to combinatorial optimization problems with the quantum approximate optimization algor…