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

arXiv:2109.10873 · Physical Review A

Parametrized process characterization with reduced resource requirements

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

Published May 5, 2022• 0 citations
arXivHTMLPDF

Abstract

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.

DOI
10.1103/physreva.105.052408

Related papers

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•1 citation

Two Unitary Quantum Process Tomography Algorithms Robust to Systematic Errors

François Verdeil, Yannick Deville

Quantum process tomography (QPT) methods aim at identifying a given quantum process. QPT is a major quantum information processing tool, since it especially allows one to characterize the actual behavior of quantum gates, which are the building blocks of quantum computers. The present paper focuses on the estimation of a unitary process. This class is of particular interest because quantum mechanics postulates that the evolution of any closed quantum system is described by a unitary transformation. Unitary processes have significantly fewer parameters than general quantum processes (22nqb vs. 24nqb−22nqb real independent parameters for nqb qubits). By assuming that the process is unitary we develop two methods that scale better with the size of the system. In the present paper, we stay as close as possible to the standard setup of QPT: the operator has to prepare copies of different input states. The properties those states have to satisfy in order for our method to achieve QPT are very mild. Therefore, we choose to operate with copies of 2nqb initially unknown pure input states. In order to perform QPT without knowing the input states, we perform measurements on half the copies of each state, and let the other half be transformed by the system before measuring them (each copy is only measured once). This setup has the advantage of removing the issue of systematic (i.e., same on all the copies of a state) errors entirely because it does not require the process input to take predefined values. We develop a straightforward analytical solution that first estimates the states from the averaged measurements and then finds the unitary matrix (representing the process) coherent with those estimates by using our analytical solution to an extended version of Wahba’s problem. This estimate may then be used as an initial point for a fine tuning algorithm that maximizes the likelihood of the measurements. Simulation results show the effectiveness of the proposed methods.

International Workshop on Bayesian Inference and Maximum Entropy Methods in Science and Engineering (MaxEnt)•Dec 12, 2022•0 citations

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

Md. Zubair, Md. Sazid-Al-Emon, Mohammad Obaidur Rahman +1 more

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.

AVS Quantum Science•Feb 23, 2026•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.

Advanced Quantum Technologies•Feb 1, 2026•1 citation

Two-Qubit Unitary Quantum Process Tomography by Multiple-Delay Output Measurements for One Unknown Input Pure State Value

François Verdeil, Yannick Deville, Alain Deville

Quantum process tomography (QPT) methods aim at identifying a given quantum process. QPT is a major quantum information processing tool, since it especially allows one to characterize the actual behavior of quantum gates, which are the building blocks of quantum computers. The present paper focuses on the estimation of a two-qubit unitary process. This class is of particular interest because quantum mechanics postulates that the evolution of any closed quantum system is described by a unitary transformation. Usual QPT methods can be hard to implement in practice because they require the user to prepare copies of a set of known quantum states. In contrast, the proposed methods only require the user to be able to provide copies of a single unknown input state which can be estimated along with the process. However, we need to be able to make measurements of the state of the system after 5 different time delays ∆t, 2∆t, 3∆t, 4∆t, 5∆t(one measurement per copy). We detail a least square approach which exploits tools used in the aerospace community. A slower but more precise maximum likelihood method is also introduced. It uses a simple parametrization of unitary matrices.

IEEE Statistical Signal Processing Workshop (SSP)•Jul 11, 2021•4 citations

Unitary quantum process tomography with unreliable pure input states

François Verdeil, Yannick Deville

Quantum process tomography (QPT) methods aim at identifying a given quantum process. QPT is a major quantum information processing tool, since it allows one to characterize the actual behavior of quantum gates, which are the building blocks of quantum computers. The present paper focuses on the estimation of a unitary process. This class is of particular interest because quantum mechanics postulates that the evolution of any closed quantum system is described by a unitary transformation. The standard approach of QPT is to measure copies of a particular set of predetermined (generally pure) states after they have been modified by the process to be identified. The main problem with this setup is that preparing an input state and setting it precisely to a predetermined value is challenging and thus yields errors. These errors can be decomposed into a sum of centered errors (i.e., whose average on all the copies is zero) and systematic errors that are the same for all the copies. The latter is often the main source of error in QPT. The algorithm we introduce works for any input states that make QPT theoretically possible (i.e., unless there are several solutions due to, e.g., a lack of diversity in the input states). The fact that we do not require the input states to be precisely set to predetermined values means that we can use a trick to remove the issue of systematic errors by considering that some states' copies are unknown but measured before they go through the process to be identified. We achieve this by splitting the copies of each input state into several groups and measuring the copies of the $k\mathrm{th}$ group after they have successively been transferred through $k$ instances of the process to be identified (each copy of each input state is used for only a single measurement). Using this approach, we can compute estimates of the measured states before and after they go through the process without using the knowledge we might have about the initial states. We test our algorithm with simulated data, and we assess its performance with a cnot gate on a trapped-ions qubit quantum computer.

arXiv:2306.07867•Physical Review A•Dec 11, 2023•2 citations
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χ\ensuremath{\chi}\ensuremathχ 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.
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.
Quantum process tomography (QPT) methods aim at identifying a given quantum process. QPT is a major quantum information processing tool, since it especially allows one to characterize the actual behavior of quantum gates, which are the building blocks of quantum computers. The present paper focuses on the estimation of a unitary process. This class is of particular interest because quantum mechanics postulates that the evolution of any closed quantum system is described by a unitary transformation. Unitary processes have significantly fewer parameters than general quantum processes (22nqb vs. 24nqb−22nqb real independent parameters for nqb qubits). By assuming that the process is unitary we develop two methods that scale better with the size of the system. In the present paper, we stay as close as possible to the standard setup of QPT: the operator has to prepare copies of different input states. The properties those states have to satisfy in order for our method to achieve QPT are very mild. Therefore, we choose to operate with copies of 2nqb initially unknown pure input states. In order to perform QPT without knowing the input states, we perform measurements on half the copies of each state, and let the other half be transformed by the system before measuring them (each copy is only measured once). This setup has the advantage of removing the issue of systematic (i.e., same on all the copies of a state) errors entirely because it does not require the process input to take predefined values. We develop a straightforward analytical solution that first estimates the states from the averaged measurements and then finds the unitary matrix (representing the process) coherent with those estimates by using our analytical solution to an extended version of Wahba’s problem. This estimate may then be used as an initial point for a fine tuning algorithm that maximizes the likelihood of the measurements. Simulation results show the effectiveness of the proposed methods.
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.
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.
Quantum process tomography (QPT) methods aim at identifying a given quantum process. QPT is a major quantum information processing tool, since it especially allows one to characterize the actual behavior of quantum gates, which are the building blocks of quantum computers. The present paper focuses on the estimation of a two-qubit unitary process. This class is of particular interest because quantum mechanics postulates that the evolution of any closed quantum system is described by a unitary transformation. Usual QPT methods can be hard to implement in practice because they require the user to prepare copies of a set of known quantum states. In contrast, the proposed methods only require the user to be able to provide copies of a single unknown input state which can be estimated along with the process. However, we need to be able to make measurements of the state of the system after 5 different time delays ∆t, 2∆t, 3∆t, 4∆t, 5∆t(one measurement per copy). We detail a least square approach which exploits tools used in the aerospace community. A slower but more precise maximum likelihood method is also introduced. It uses a simple parametrization of unitary matrices.
Quantum process tomography (QPT) methods aim at identifying a given quantum process. QPT is a major quantum information processing tool, since it allows one to characterize the actual behavior of quantum gates, which are the building blocks of quantum computers. The present paper focuses on the estimation of a unitary process. This class is of particular interest because quantum mechanics postulates that the evolution of any closed quantum system is described by a unitary transformation. The standard approach of QPT is to measure copies of a particular set of predetermined (generally pure) states after they have been modified by the process to be identified. The main problem with this setup is that preparing an input state and setting it precisely to a predetermined value is challenging and thus yields errors. These errors can be decomposed into a sum of centered errors (i.e., whose average on all the copies is zero) and systematic errors that are the same for all the copies. The latter is often the main source of error in QPT. The algorithm we introduce works for any input states that make QPT theoretically possible (i.e., unless there are several solutions due to, e.g., a lack of diversity in the input states). The fact that we do not require the input states to be precisely set to predetermined values means that we can use a trick to remove the issue of systematic errors by considering that some states' copies are unknown but measured before they go through the process to be identified. We achieve this by splitting the copies of each input state into several groups and measuring the copies of the kthk\mathrm{th}kth group after they have successively been transferred through kkk instances of the process to be identified (each copy of each input state is used for only a single measurement). Using this approach, we can compute estimates of the measured states before and after they go through the process without using the knowledge we might have about the initial states. We test our algorithm with simulated data, and we assess its performance with a cnot gate on a trapped-ions qubit quantum computer.