Gaining confidence on the correct realization of arbitrary quantum computations

Jose Carrasco, Marc Langer, Antoine Neven, Barbara Kraus.

We present verification protocols to gain confidence in the correct performance of the realization of an arbitrary universal quantum computation. The derivation of the protocols is based on the fact that matchgate computations, which are classically efficiently simulable, become universal if supplemented with additional resources. We combine tools from weak simulation, randomized compiling, and classical statistics to derive verification circuits. These circuits have the property that (i) they strongly resemble the original circuit and (ii) cannot only be classically efficiently simulated in the ideal, i.e. error free, scenario, but also in the realistic situation where errors are present. In fact, in one of the protocols we apply exactly the same circuit as in the original computation, however, to a slightly modified input state.

Cite as BibTeX
@misc{carrasco2023gaining,
      title={Gaining confidence on the correct realization of arbitrary quantum computations}, 
      author={Jose Carrasco and Marc Langer and Antoine Neven and Barbara Kraus},
      year={2023},
      eprint={2308.11368},
      archivePrefix={arXiv},
      primaryClass={quant-ph}
}

Leave a comment

AncoraThemes © 2024. All Rights Reserved.

QCFD © 2024. All Rights Reserved. PRIVACY POLICY

European Union Flag

The QCFD (Quantum Computational Fluid Dynamics) project is funded under the European Union’s Horizon Programme (HORIZON-CL4-2021-DIGITAL-EMERGING-02-10), Grant Agreement 101080085 QCFD.