Fast Quantum Process Tomography via Riemannian Gradient Descent

Daniel Volya, Andrey Nikitin, Prabhat Mishra
4/29/2024
quant-phcs.LG

No confident code implementation found for this paper.

Abstract

Constrained optimization plays a crucial role in the fields of quantum physics and quantum information science and becomes especially challenging for high-dimensional complex structure problems. One specific issue is that of quantum process tomography, in which the goal is to retrieve the underlying quantum process based on a given set of measurement data. In this paper, we introduce a modified version of stochastic gradient descent on a Riemannian manifold that integrates recent advancements in numerical methods for Riemannian optimization. This approach inherently supports the physically driven constraints of a quantum process, takes advantage of state-of-the-art large-scale stochastic objective optimization, and has superior performance to traditional approaches such as maximum likelihood estimation and projected least squares. The data-driven approach enables accurate, order-of-magnitude faster results, and works with incomplete data. We demonstrate our approach on simulations of quantum processes and in hardware by characterizing an engineered process on quantum computers.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{volya2024fast,
  title  = {Fast Quantum Process Tomography via Riemannian Gradient Descent},
  author = {Daniel Volya and Andrey Nikitin and Prabhat Mishra},
  year   = {2024},
  eprint = {2404.18840},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2404.18840v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2404.18840.svg)](https://codeofpaper.com/paper/2404.18840)

Discussion