Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

AVS Quantum Science

PCA-based post-processing in quantum process tomography: An experimental study

Md. Zubair, Md. Sazid-Al-Emon, Mohammad Obaidur Rahman, Mahdy Rahman Chowdhury

Published Feb 23, 2026• 0 citations
Publisher

Abstract

Quantum Process Tomography (QPT) is a fundamental technique to characterize quantum operations. However, its precision gets hampered while running in real quantum hardware due to inherent noise. In our study, we propose a post-processing method using principal component analysis (PCA) to improve the fidelity of noisy gates. We first implemented the standard QPT on various gates ranging from single-qubit to three-qubit in simulation under depolarizing error scenarios and on Fake IBM_Brisbane and ran single and two-qubit gates (H, CX, and SQSCZ) on real quantum hardware (IBM_Brisbane); the three-qubit CCX is evaluated in simulation only. After that, the reconstructed Choi matrix is decomposed into real and imaginary components. Then, by applying a PCA-based approach, we show steady improvements in a variety of quantitative performance indicators in addition to process fidelity while also maintaining the physical constraints of the Choi matrix. Additionally, PCA performed better or similarly when compared to CVX-based maximum-likelihood reconstruction and linear inversion. Although PCA improves QPT reconstructions, it is unable to address the fundamental scalability issue of QPT since it cannot overcome the exponential scaling with qubit number.

DOI
10.1116/5.0285597

Related papers

Parametrized process characterization with reduced resource requirements

Vicente Leyton‐Ortega, Tyler Kharazi, Raphael C. Pooser

Quantum process tomography (QPT) is a powerful tool to characterize quantum operations, but it requires considerable resources, making it impractical for more than two-qubit systems. This work proposes an alternative approach that requires significantly fewer resources for unitary process characterization with a built-in method for state preparation and measurement error mitigation. By measuring the quantum process as rotated through the $X$ and $Y$ axes on the Bloch sphere, we can acquire enough information to reconstruct the quantum process matrix $\ensuremath{\chi}$ and measure its fidelity. We test the algorithm's performance against standard QPT using simulated and physical experiments on several IBM quantum processors and compare the resulting process matrices. We demonstrate with numerical experiments that the method can improve gate fidelity via a noise reduction in the imaginary part of the process matrix, along with a stark decrease in the number of experiments needed to perform the characterization.

arXiv:2109.10873•Physical Review A•May 5, 2022•0 citations

Advancing Quantum Process Tomography Through Quantum Compilation

Huynh Le Dan Linh, Vu Tuan Hai, Le Bin Ho

ABSTRACT Quantum process tomography (QPT) plays a central role in characterizing quantum gates and circuits, diagnosing quantum devices, calibrating hardware, and supporting quantum error correction. However, conventional QPT methods face challenges related to scalability and sensitivity to noise. In this work, we propose a QPT framework based on quantum compilation, which represents quantum processes using optimized Kraus operators and Choi matrices. By formulating QPT as a compilation and optimization problem, our approach significantly reducing measurement and computational overhead while maintaining reconstruction accuracy. We benchmark the method using numerical simulations of Haar‐random unitary gates and demonstrate a reliable process reconstruction. We further apply the framework to dephasing channels with both time‐homogeneous and time‐inhomogeneous noise, as well as to depolarizing and amplitude‐damping channels, where stable performance is observed across different noise regimes. These results indicate that quantum compilation–based QPT can serve as a practical alternative to standard QPT methods for quantum process characterization and device validation.

arXiv:2504.14958•Advanced Quantum Technologies•Feb 1, 2026•2 citations

Multipass quantum process tomography

Stancho G. Stanchev, Nikolay V. Vitanov

We introduce a method to enhance the precision and accuracy of Quantum Process Tomography (QPT) by mitigating the errors caused by state preparation and measurement (SPAM), readout and shot noise. Instead of performing QPT solely on a single gate, we propose performing QPT on a sequence of multiple applications of the same gate. The method involves the measurement of the Pauli transfer matrix (PTM) by standard QPT of the multipass process, and then deduce the single-process PTM by two alternative approaches: an iterative approach which in theory delivers the exact result for small errors, and a linearized approach based on solving the Sylvester equation. We examine the efficiency of these two approaches through simulations on IBM Quantum using IBMQ_QASM_SIMULATOR. Compared to the Randomized Benchmarking type of methods, the proposed method delivers the entire PTM rather than a single number (fidelity). Compared to standard QPT, our method delivers PTM with much higher accuracy and precision because it greatly reduces the SPAM, readout and shot noise errors. We use the proposed method to experimentally determine the PTM and the fidelity of the CNOT gate on the quantum processor IBMQ_MANILA (Falcon r5.11L).

arXiv:2402.04128•Scientific Reports•Aug 6, 2024•1 citation

Characterizing Quantum Teleportation as a Noisy Channel via Quantum Process Tomography on IBM Hardware

Bellarte, Domenico

Quantum teleportation is a fundamental primitive of quantum information theory, enabling the transfer of an unknown qubit state by means of shared entanglement and classical communication. In an ideal system the teleportation protocol implements the identity quantum channel. In real quan- tum hardware, however, the process becomes a noisy quantum channel. In this work, we reconstruct and analyze the teleportation channel using Quantum Process Tomography (QPT) on three platforms: (i) the AerSimulator (reference ideal channel), and (ii) the real IBM ibm_fez and ibm_torino quantum processors (Heron family). We compute Choi matrices, process fidelities, Choi-state purity, Pauli-noise decomposition, and CP/TP consis- tency tests. We further assess the impact of enforcing physicality (CP/TP) on the reconstructed process, providing a reproducible workflow for hardware-level channel characterization. Results highlight a strong degradation on real hardware, dominated by dephasing and depolarizing-like contributions, and show that raw linear-inversion tomography may violate complete positivity unless physical constraints are enforced.

•Dec 18, 2025•0 citations

Quantum Process Tomography with Digital Twins of Error Matrices

Tangyou Huang, Akshay Gaikwad, Ilya N. Moskalenko +19 more

Accurate and robust quantum process tomography (QPT) is crucial for verifying quantum gates and diagnosing implementation faults in experiments aimed at building universal quantum computers. However, the reliability of QPT protocols is often compromised by faulty probes, particularly state preparation and measurement (SPAM) errors, which introduce fundamental inconsistencies in traditional QPT algorithms. We propose and investigate enhanced QPT for multiqubit systems by integrating the error matrix in a digital twin of the identity process matrix, enabling statistical refinement of SPAM error learning and improving QPT precision. Through numerical simulations, we demonstrate that our approach enables highly accurate and faithful process characterization. We further validate our method experimentally in superconducting quantum processors, achieving at least an order-of-magnitude fidelity improvement over standard QPT. Our results provide a practical and precise method for assessing quantum gate fidelity and enhancing QPT on a given hardware.

arXiv:2505.07725•Physical Review Letters•Nov 13, 2025•8 citations

Multi-stage tomography based on eigenanalysis for high-dimensional dense unitary processes in gate-based quantum computers

Yannick Deville, Alain Deville

A major quantum information processing tool is Quantum Process Tomography (QPT), which consists of methods that aim at identifying, i.e. estimating, a quantum process. QPT may especially be applied to quantum gates, that are widely used as the building blocks of quantum computers, in order to experimentally characterize their actual behavior. In this paper, we address unitary processes (corresponding to isolated systems), that may be dense, i.e. that do not have sparsity constraints. The proposed approaches to QPT require one to first perform Quantum State Tomography (QST). Afterwards, the core of our QPT methods applies to a significant number of qubits and thus to a high state space dimension and to complex problems. Our methods first achieve part of QPT by performing an eigenanalysis of the density matrix of a process output estimated with QST, by taking advantage of the unitarity of the process. Our first resulting class of complete algorithms uses only one such eigendecomposition and is thus "single-stage". We then extend our approach to algorithms that are "multiple-stage", i.e. that perform several eigendecompositions. This allows one to handle high-dimensional state spaces with a reduced sensitivity to the estimation errors that result from the use of an arbitrary QST algorithm as a preprocessing step of our QPT methods. Our multi-stage methods first include two-stage versions and then dichotomic versions, with a number of stages that increases with the considered state space dimension. Simulations were successively performed with different magnitudes for QST errors / noise. They provide evidence of the relevance of all proposed methods. Their single-stage and two-stage versions are efficient up to 13 qubits when executed on a very simple platform: an 8-year old PC with only 16 GB of RAM. An even higher accuracy (Normalized Mean Square Error down to $$10^{-3}$$ ) is obtained with multi-stage methods.

arXiv:2407.13542•Discover Quantum Science•Jul 28, 2026•1 citation
Quantum Process Tomography (QPT) is a fundamental technique to characterize quantum operations. However, its precision gets hampered while running in real quantum hardware due to inherent noise. In our study, we propose a post-processing method using principal component analysis (PCA) to improve the fidelity of noisy gates. We first implemented the standard QPT on various gates ranging from single-qubit to three-qubit in simulation under depolarizing error scenarios and on Fake IBM_Brisbane and ran single and two-qubit gates (H, CX, and SQSCZ) on real quantum hardware (IBM_Brisbane); the three-qubit CCX is evaluated in simulation only. After that, the reconstructed Choi matrix is decomposed into real and imaginary components. Then, by applying a PCA-based approach, we show steady improvements in a variety of quantitative performance indicators in addition to process fidelity while also maintaining the physical constraints of the Choi matrix. Additionally, PCA performed better or similarly when compared to CVX-based maximum-likelihood reconstruction and linear inversion. Although PCA improves QPT reconstructions, it is unable to address the fundamental scalability issue of QPT since it cannot overcome the exponential scaling with qubit number.
Quantum process tomography (QPT) is a powerful tool to characterize quantum operations, but it requires considerable resources, making it impractical for more than two-qubit systems. This work proposes an alternative approach that requires significantly fewer resources for unitary process characterization with a built-in method for state preparation and measurement error mitigation. By measuring the quantum process as rotated through the XXX and YYY axes on the Bloch sphere, we can acquire enough information to reconstruct the quantum process matrix $\ensuremath{\chi}$ and measure its fidelity. We test the algorithm's performance against standard QPT using simulated and physical experiments on several IBM quantum processors and compare the resulting process matrices. We demonstrate with numerical experiments that the method can improve gate fidelity via a noise reduction in the imaginary part of the process matrix, along with a stark decrease in the number of experiments needed to perform the characterization.
ABSTRACT Quantum process tomography (QPT) plays a central role in characterizing quantum gates and circuits, diagnosing quantum devices, calibrating hardware, and supporting quantum error correction. However, conventional QPT methods face challenges related to scalability and sensitivity to noise. In this work, we propose a QPT framework based on quantum compilation, which represents quantum processes using optimized Kraus operators and Choi matrices. By formulating QPT as a compilation and optimization problem, our approach significantly reducing measurement and computational overhead while maintaining reconstruction accuracy. We benchmark the method using numerical simulations of Haar‐random unitary gates and demonstrate a reliable process reconstruction. We further apply the framework to dephasing channels with both time‐homogeneous and time‐inhomogeneous noise, as well as to depolarizing and amplitude‐damping channels, where stable performance is observed across different noise regimes. These results indicate that quantum compilation–based QPT can serve as a practical alternative to standard QPT methods for quantum process characterization and device validation.
We introduce a method to enhance the precision and accuracy of Quantum Process Tomography (QPT) by mitigating the errors caused by state preparation and measurement (SPAM), readout and shot noise. Instead of performing QPT solely on a single gate, we propose performing QPT on a sequence of multiple applications of the same gate. The method involves the measurement of the Pauli transfer matrix (PTM) by standard QPT of the multipass process, and then deduce the single-process PTM by two alternative approaches: an iterative approach which in theory delivers the exact result for small errors, and a linearized approach based on solving the Sylvester equation. We examine the efficiency of these two approaches through simulations on IBM Quantum using IBMQ_QASM_SIMULATOR. Compared to the Randomized Benchmarking type of methods, the proposed method delivers the entire PTM rather than a single number (fidelity). Compared to standard QPT, our method delivers PTM with much higher accuracy and precision because it greatly reduces the SPAM, readout and shot noise errors. We use the proposed method to experimentally determine the PTM and the fidelity of the CNOT gate on the quantum processor IBMQ_MANILA (Falcon r5.11L).
Quantum teleportation is a fundamental primitive of quantum information theory, enabling the transfer of an unknown qubit state by means of shared entanglement and classical communication. In an ideal system the teleportation protocol implements the identity quantum channel. In real quan- tum hardware, however, the process becomes a noisy quantum channel. In this work, we reconstruct and analyze the teleportation channel using Quantum Process Tomography (QPT) on three platforms: (i) the AerSimulator (reference ideal channel), and (ii) the real IBM ibm_fez and ibm_torino quantum processors (Heron family). We compute Choi matrices, process fidelities, Choi-state purity, Pauli-noise decomposition, and CP/TP consis- tency tests. We further assess the impact of enforcing physicality (CP/TP) on the reconstructed process, providing a reproducible workflow for hardware-level channel characterization. Results highlight a strong degradation on real hardware, dominated by dephasing and depolarizing-like contributions, and show that raw linear-inversion tomography may violate complete positivity unless physical constraints are enforced.
Accurate and robust quantum process tomography (QPT) is crucial for verifying quantum gates and diagnosing implementation faults in experiments aimed at building universal quantum computers. However, the reliability of QPT protocols is often compromised by faulty probes, particularly state preparation and measurement (SPAM) errors, which introduce fundamental inconsistencies in traditional QPT algorithms. We propose and investigate enhanced QPT for multiqubit systems by integrating the error matrix in a digital twin of the identity process matrix, enabling statistical refinement of SPAM error learning and improving QPT precision. Through numerical simulations, we demonstrate that our approach enables highly accurate and faithful process characterization. We further validate our method experimentally in superconducting quantum processors, achieving at least an order-of-magnitude fidelity improvement over standard QPT. Our results provide a practical and precise method for assessing quantum gate fidelity and enhancing QPT on a given hardware.
A major quantum information processing tool is Quantum Process Tomography (QPT), which consists of methods that aim at identifying, i.e. estimating, a quantum process. QPT may especially be applied to quantum gates, that are widely used as the building blocks of quantum computers, in order to experimentally characterize their actual behavior. In this paper, we address unitary processes (corresponding to isolated systems), that may be dense, i.e. that do not have sparsity constraints. The proposed approaches to QPT require one to first perform Quantum State Tomography (QST). Afterwards, the core of our QPT methods applies to a significant number of qubits and thus to a high state space dimension and to complex problems. Our methods first achieve part of QPT by performing an eigenanalysis of the density matrix of a process output estimated with QST, by taking advantage of the unitarity of the process. Our first resulting class of complete algorithms uses only one such eigendecomposition and is thus "single-stage". We then extend our approach to algorithms that are "multiple-stage", i.e. that perform several eigendecompositions. This allows one to handle high-dimensional state spaces with a reduced sensitivity to the estimation errors that result from the use of an arbitrary QST algorithm as a preprocessing step of our QPT methods. Our multi-stage methods first include two-stage versions and then dichotomic versions, with a number of stages that increases with the considered state space dimension. Simulations were successively performed with different magnitudes for QST errors / noise. They provide evidence of the relevance of all proposed methods. Their single-stage and two-stage versions are efficient up to 13 qubits when executed on a very simple platform: an 8-year old PC with only 16 GB of RAM. An even higher accuracy (Normalized Mean Square Error down to 10−310^{-3}10−3 ) is obtained with multi-stage methods.