Running large quantum circuits on small quantum computers

ORAL

Abstract

With the advent of NISQ computers, the question of running quantum programs whose number of qubits exceeds the capacity of today’s small processors becomes pressing. In this work, we have implemented a recent theoretical proposal [1] consisting in splitting a large circuit into smaller fragments that can be run on smaller processors. As a test case, we have taken circuits used by the quantum approximate approximation algorithm (QAOA [2]) to solve combinatorial optimization problems. We have implemented, run and assessed the method on the IBM Poughkeepsie 20-qubit superconducting quantum processor, and have compared the obtained results with simulations in the presence of noise that we characterized via tomography.

[1] T. Peng, A. Harrow, M. Ozols, and X. Wu, arxiv: 1904.00102 (2019).
[2] E. Farhi, J. Goldstone, and S. Gutmann, arxiv: 1411.4028 (2014).

*We acknowledge support from the QuantERA ERA-NET Cofund in Quantum Technologies implemented within the European Union's Horizon 2020 Program (QuantAlgo project), and the French ANR project ANR-18-QUAN-0017 (QuantAlgo Project).

Presenters

  • Thomas Ayral

    • Atos Quantum Lab

Authors

  • François-Marie Le Régent

    • CPHT, École Polytechnique
    • Atos Quantum Lab, Argonne National Lab
  • Thomas Ayral

    • Atos Quantum Lab
  • Zain Hamid Saleem

    • Argonne National Laboratory
  • Yuri Alexeev

    • Argonne Natl Lab
    • Argonne National Laboratory
  • Martin Suchara

    • Argonne National Laboratory
    • Argonne Natl Lab