Fast Quantum Characterization via Riemannian Optimization
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.
Authors
- Prabhat Mishra (ORCID: https://orcid.org/0000-0003-3653-6221)
- Daniel Volya (ORCID: https://orcid.org/0000-0001-5026-5646)
- А. В. Никитин (ORCID: https://orcid.org/0000-0002-4448-9835)
Institutions
- University of Florida (US)
Publication Details
- Published
- 2024-09-15
- DOI
- https://doi.org/10.1109/qce60285.2024.00151
- Primary Topic
- Quantum Computing Algorithms and Architecture
- Type
- article
- Field-Weighted Citation Impact
- 0.00
Funders
- National Science Foundation