Generalized collective quantum tomography: algorithm design, optimization, and validation

• URL: http://arxiv.org/abs/2510.25466v1
• Date: Wed, 29 Oct 2025 12:39:28 GMT
• Title: Generalized collective quantum tomography: algorithm design, optimization, and validation
• Authors: Shuixin Xiao, Yuanlong Wang, Zhibo Hou, Aritra Das, Ian R. Petersen, Farhad Farokhi, Guo-Yong Xiang, Jie Zhao, Daoyi Dong,
• Abstract summary: Quantum tomography is a fundamental technique for characterizing, benchmarking, and verifying quantum states and devices.<n>We develop three algorithms for collective quantum state, detector and process tomography, respectively.<n>Our algorithms achieve lower MSEs and approach the collective MSE bound by effectively leveraging purity information.
• Score: 13.05360072107315
• License: http://creativecommons.org/licenses/by-nc-sa/4.0/
• Abstract: Quantum tomography is a fundamental technique for characterizing, benchmarking, and verifying quantum states and devices. It plays a crucial role in advancing quantum technologies and deepening our understanding of quantum mechanics. Collective quantum state tomography, which estimates an unknown state \r{ho} through joint measurements on multiple copies $\rho\otimes\cdots\otimes\rho$ of the unknown state, offers superior information extraction efficiency. Here we extend this framework to a generalized setting where the target becomes $S_1\otimes\cdots\otimes S_n$, with each $S_i$ representing identical or distinct quantum states, detectors, or processes from the same category. We formulate these tasks as optimization problems and develop three algorithms for collective quantum state, detector and process tomography, respectively, each accompanied by an analytical characterization of the computational complexity and mean squared error (MSE) scaling. Furthermore, we develop optimal solutions of these optimization problems using sum of squares (SOS) techniques with semi-algebraic constraints. The effectiveness of our proposed methods is demonstrated through numerical examples. Additionally, we experimentally demonstrate the algorithms using two-copy collective measurements, where entangled measurements directly provide information about the state purity. Compared to existing methods, our algorithms achieve lower MSEs and approach the collective MSE bound by effectively leveraging purity information.

Related papers

• Optimal Quantum Likelihood Estimation [0.0]
  A hybrid quantum-classical algorithm is a computational scheme in which quantum circuits are used to extract information.<n>We improve the performance of a hybrid algorithm through principled, information-theoretic optimization.
  arXiv  Detail & Related papers  (2025-08-31T12:51:44Z)
• Simultaneous estimations of quantum state and detector through multiple quantum processes [4.782967012381978]
  We introduce a framework, in two different bases, that utilizes multiple quantum processes to simultaneously identify a quantum state and a detector.<n>We prove that the mean squared error (MSE) scales as $O(1/N) $ for both QST and QDT, where $N $ denotes the total number of state copies.
  arXiv  Detail & Related papers  (2025-02-17T13:02:36Z)
• Optimal Overlapping Tomography [6.868087671163721]
  We present protocols for overlapping tomography that are optimal with respect to the number of measurement settings.<n>Results will find applications in learning noise and interaction patterns in quantum computers as well as characterising fermionic systems in quantum chemistry.
  arXiv  Detail & Related papers  (2024-08-11T08:59:08Z)
• Quantum Subroutine for Variance Estimation: Algorithmic Design and Applications [80.04533958880862]
  Quantum computing sets the foundation for new ways of designing algorithms. New challenges arise concerning which field quantum speedup can be achieved. Looking for the design of quantum subroutines that are more efficient than their classical counterpart poses solid pillars to new powerful quantum algorithms.
  arXiv  Detail & Related papers  (2024-02-26T09:32:07Z)
• A two-stage solution to quantum process tomography: error analysis and optimal design [6.648667887733229]
  We propose a two-stage solution for both trace-preserving and non-trace-preserving quantum process tomography. Our algorithm exhibits a computational complexity of $O(MLd2)$ where $d$ is the dimension of the quantum system. Numerical examples and testing on IBM quantum devices are presented to demonstrate the performance and efficiency of our algorithm.
  arXiv  Detail & Related papers  (2024-02-14T05:45:11Z)
• Quantum algorithms: A survey of applications and end-to-end complexities [88.57261102552016]
  The anticipated applications of quantum computers span across science and industry.<n>We present a survey of several potential application areas of quantum algorithms.<n>We outline the challenges and opportunities in each area in an "end-to-end" fashion.
  arXiv  Detail & Related papers  (2023-10-04T17:53:55Z)
• Automatic and effective discovery of quantum kernels [41.61572387137452]
  Quantum computing can empower machine learning models by enabling kernel machines to leverage quantum kernels for representing similarity measures between data.<n>We present an approach to this problem, which employs optimization techniques, similar to those used in neural architecture search and AutoML.<n>The results obtained by testing our approach on a high-energy physics problem demonstrate that, in the best-case scenario, we can either match or improve testing accuracy with respect to the manual design approach.
  arXiv  Detail & Related papers  (2022-09-22T16:42:14Z)
• Improved Quantum Algorithms for Fidelity Estimation [77.34726150561087]
  We develop new and efficient quantum algorithms for fidelity estimation with provable performance guarantees. Our algorithms use advanced quantum linear algebra techniques, such as the quantum singular value transformation. We prove that fidelity estimation to any non-trivial constant additive accuracy is hard in general.
  arXiv  Detail & Related papers  (2022-03-30T02:02:16Z)
• Markov Chain Monte-Carlo Enhanced Variational Quantum Algorithms [0.0]
  We introduce a variational quantum algorithm that uses Monte Carlo techniques to place analytic bounds on its time-complexity. We demonstrate both the effectiveness of our technique and the validity of our analysis through quantum circuit simulations for MaxCut instances.
  arXiv  Detail & Related papers  (2021-12-03T23:03:44Z)
• Benchmarking Small-Scale Quantum Devices on Computing Graph Edit Distance [52.77024349608834]
  Graph Edit Distance (GED) measures the degree of (dis)similarity between two graphs in terms of the operations needed to make them identical. In this paper we present a comparative study of two quantum approaches to computing GED.
  arXiv  Detail & Related papers  (2021-11-19T12:35:26Z)
• Near-term Efficient Quantum Algorithms for Entanglement Analysis [5.453850739960517]
  Entanglement plays a crucial role in quantum physics and is the key resource in quantum information processing. This work proposes three near-term efficient algorithms exploiting the hybrid quantum-classical technique to address this difficulty.
  arXiv  Detail & Related papers  (2021-09-22T15:15:58Z)
• Detailed Account of Complexity for Implementation of Some Gate-Based Quantum Algorithms [55.41644538483948]
  In particular, some steps of the implementation, as state preparation and readout processes, can surpass the complexity aspects of the algorithm itself. We present the complexity involved in the full implementation of quantum algorithms for solving linear systems of equations and linear system of differential equations.
  arXiv  Detail & Related papers  (2021-06-23T16:33:33Z)
• Fast and robust quantum state tomography from few basis measurements [65.36803384844723]
  We present an online tomography algorithm designed to optimize all the aforementioned resources at the cost of a worse dependence on accuracy. The protocol is the first to give provably optimal performance in terms of rank and dimension for state copies, measurement settings and memory. Further improvements are possible by executing the algorithm on a quantum computer, giving a quantum speedup for quantum state tomography.
  arXiv  Detail & Related papers  (2020-09-17T11:28:41Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.