1 of 23

Error Mitigation with Quantum Subspace Expansion

João Carlos de Andrade Getelina

Funding:

arXiv:2404.09132

(soon to be published APL Quantum)

2 of 23

Collaborators

Prachi Sharma

Peter Orth

Tom Iadecola

Yongxin Yao

3 of 23

Outline

  • Introduction:
    • Motivation and background to subspace methods;
    • Quantum subspace expansion;
  • Methodology:
    • Integrating VQE with QSE;
    • Models and methods;
  • Results and discussion:
    • Our main findings;
    • What’s next?

4 of 23

Motivation

  • Ground-state preparation (NISQ): VQE and QITE;
  • Increasing acc. circuit depth (noiseless);
  • Mitigation techniques (ZNE and PEC) depth;
  • Improving acc. with the same overhead cost?

Quantum Subspace Expansion

5 of 23

Krylov subspace methods

  • General outlook:

  • Finding (a few) useful eigenpairs of matrices;
  • Ex: Arnoldi iteration (general) and Lanczos (Hermitian);
  • Requires orthogonalization schemes;

6 of 23

Quantum subspace expansion

  • Applying the same idea of KSE in a quantum setup:

  • Problem: QPUs only give us bitstring counts;
  • Generalized eigenvalue problem:

7 of 23

Quantum subspace expansion

  • QLanczos: [Nat. Phys. 16, 205 (2020)]

  • Unsuitable for NISQ (Hadamard test);
  • FGKS: taking each term of as a subspace vector;
  • Amounts to exp. val. of Pauli strings;
  • Goal: balance CPU and QPU cost;

[Phys. Rev. A 104, L050401 (2021)]

8 of 23

Outline

  • Introduction:
    • Motivation and background to subspace methods;
    • Quantum subspace expansion;
  • Methodology:
    • Integrating VQE with QSE;
    • Models and methods;
  • Results and discussion:
    • Our main findings;
    • What’s next?

9 of 23

Variational quantum eigensolver

  • Variational principle of QM:
  • HVA: apply unitaries like Hamiltonian terms;
  • Considering simple 1D and 2D spin models:

10 of 23

VQE under HVA

11 of 23

Accuracy of noisy VQE simulations

  • How does one improve accuracy with VQE?

Adding layers

More noise

Worst acc.

  • Improving HVA acc. w/o increasing quantum overhead?

QSE: more measurements of the same circuit

  • Key parameters: circuit depth and expansion order

12 of 23

Pairing VQE and QSE

  1. CPU: Find optimal parameters under HVA;
  2. QPU: Build circuit based on step 1;
  3. QPU: Measure Pauli strings of the FGKS;
  4. CPU: Get and and solve GEP;

13 of 23

Pairing VQE and QSE

  • FGKS ex: 3-site 1D TFIM

14 of 23

Pairing VQE and QSE

  • Subspace basis transformation:
  • Eigenbasis of overlap matrix:
  • Get corresponding GS:

15 of 23

Outline

  • Introduction:
    • Motivation and background to subspace methods;
    • Quantum subspace expansion;
  • Methodology:
    • Integrating VQE with QSE;
    • Models and methods;
  • Results and discussion:
    • Our main findings;
    • What’s next?

16 of 23

Pauli groups scaling

  • Ex: 2D TFIM;
  • Greedy alg.: largest degree first

17 of 23

Fidelity and energy convergence

Compare KS with FGKS:

18 of 23

Shot noise sims.

  • Proxying quality of expanded state (recall):

  • GEP no longer bounded;
  • Sing. val. cutoff: biased;
  • Trace criterion (unbiased);
  • L=1, K=2, 4x4 TFIM

19 of 23

Pairing VQE and QSE

  • Subspace basis transformation:
  • Eigenbasis of overlap matrix:
  • Get corresponding GS:

20 of 23

5-qubit MFIM

  • Opt. lvl 1 vs. 3;
  • Ent. gate parameter:

  • QEM: TREX

21 of 23

16-qubit MFIM

  • L=1, K=1
  • 14672 Pauli strings
  • 83 self-commuting groups
  • QEM: ZNE + DD + PT + TREX
  • Evaluate w.r.t. noise-scaled and

22 of 23

Overview

  • VQE + QSE improves acc. with little cost;
  • Suitable method for NISQ;
  • Larger systems: requires combining other QEMs;
  • Ref. state computed only classically so far;

23 of 23

What’s next?

  • Noisy ref. state;
  • Co-optimized VQE;
  • Ranking Pauli groups;
  • Testing other QEMs;
  • Trying different ref. states (e.g., QITE);