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:1003.2444 · Physical Review A

Progress toward scalable tomography of quantum maps using twirling-based methods and information hierarchies

Cecilia C. López, Ariel Bendersky, Juan Pablo Paz, David G. Cory

Published Jun 11, 2010• 27 citations
arXivHTMLPDF

Abstract

We present in a unified manner the existing methods for scalable partial quantum process tomography. We focus on two main approaches: the one presented in Bendersky et al. [Phys. Rev. Lett. 100, 190403 (2008)] and the ones described, respectively, in Emerson et al. [Science 317, 1893 (2007)] and L\'opez et al. [Phys. Rev. A 79, 042328 (2009)], which can be combined together. The methods share an essential feature: They are based on the idea that the tomography of a quantum map can be efficiently performed by studying certain properties of a twirling of such a map. From this perspective, in this paper we present extensions, improvements, and comparative analyses of the scalable methods for partial quantum process tomography. We also clarify the significance of the extracted information, and we introduce interesting and useful properties of the $\ensuremath{\chi}$-matrix representation of quantum maps that can be used to establish a clearer path toward achieving full tomography of quantum processes in a scalable way.

DOI
10.1103/physreva.81.062113

Related papers

Selective and efficient quantum process tomography

Ariel Bendersky, Fernando Pastawski, Juan Pablo Paz

In this paper we describe in detail and generalize a method for quantum process tomography that was presented by Bendersky et al. [Phys. Rev. Lett. 100, 190403 (2008)]. The method enables the efficient estimation of any element of the $\ensuremath{\chi}$ matrix of a quantum process. Such elements are estimated as averages over experimental outcomes with a precision that is fixed by the number of repetitions of the experiment. Resources required implementing it scale polynomially with the number of qubits of the system. The estimation of all diagonal elements of the $\ensuremath{\chi}$ matrix can be efficiently done without any ancillary qubits. In turn, the estimation of all the off-diagonal elements requires an extra clean qubit. The key ideas of the method, which is based on efficient estimation by random sampling over a set of states forming a 2-design, are described in detail. Efficient methods for preparing and detecting such states are explicitly shown.

arXiv:0906.3002•Physical Review A•Sep 24, 2009•47 citations

Selective and efficient quantum process tomography in arbitrary finite dimension

Ignacio Perito, Augusto J. Roncaglia, Ariel Bendersky

The characterization of quantum processes is a key tool in quantum information processing tasks for several reasons: on one hand, it allows one to acknowledge errors in the implementations of quantum algorithms; on the other, it allows one to characterize unknown processes occurring in nature. Bendersky, Pastawski, and Paz [A. Bendersky, F. Pastawski, and J. P. Paz, Phys. Rev. Lett. 100, 190403 (2008); Phys. Rev. A 80, 032116 (2009)] introduced a method to selectively and efficiently measure any given coefficient from the matrix description of a quantum channel. However, this method heavily relies on the construction of maximal sets of mutually unbiased bases (MUBs), which are known to exist only when the dimension of the Hilbert space is the power of a prime number. In this article, we lift the requirement on the dimension by presenting two variations of the method that work on arbitrary finite dimensions: one uses tensor products of maximal sets of MUBs, and the other uses a dimensional cutoff of a higher prime power dimension.

arXiv:1808.01258•Physical Review A•Dec 3, 2018•8 citations

Efficiently Learning Global Quantum Channels with Local Tomography

Zidu Liu, Dominik S. Wild

Scalable characterization of quantum processors is crucial for mitigating noise and imperfections. While randomized measurement protocols enable efficient access to local observables, inferring a globally consistent description of multi-qubit processes remains challenging. Here we introduce a local-to-global reconstruction framework for one-dimensional multi-qubit states and channels. The method is efficient provided that correlations, as quantified by the conditional mutual information, decay exponentially. In particular, we prove that under this assumption, the required number of samples scales polynomially with the system size and the desired global reconstruction error. Our approach is based on combining local shadow tomography with locally optimal recovery maps obtained by convex optimization. We supplement these rigorous guarantees by studying the performance of the protocol numerically for a system evolving under a local Lindbladian and a noisy, shallow circuit. By employing a tensor networ representation, we reconstruct channels acting on up to 50 qubits and accurately recover global diagnostics such as the process fidelity, the Choi state purity, and Pauli-weight-resolved process matrix elements. Our work thus extends the powerful toolbox local shadow tomography to scalable channel characterization with access to global properties.

quant-pharXiv:2603.07037•PRX Quantum•Mar 10, 2026•2 citations

Selective and Efficient Quantum Process Tomography with Single Photons

Christian Tomás Schmiegelow, M. A. Larotonda, Juan Pablo Paz

We present the results of the first photonic implementation of a new method for quantum process tomography. The method {originally presented by A. Bendersky et al. [Phys. Rev. Lett. 100, 190403 (2008)10.1103/PhysRevLett.100.190403]} enables the estimation of any element of the chi-matrix that characterizes a quantum process using resources that scale polynomially with the number of qubits. It is based on the idea of mapping the estimation of any chi-matrix element onto the average fidelity of a quantum channel and estimating the latter by sampling randomly over a special set of states called a 2-design. With a heralded single photon source we fully implement such algorithm and perform process tomography on a number of channels affecting the polarization qubit. The method is compared with other existing ones, and its advantages are discussed.

arXiv:1002.4436•Physical Review Letters•Mar 24, 2010•28 citations

Gaining Information About a Quantum Channel Via Twirling

Easwar Magesan

Finding correctable encoding that protects against a quantum process is in general a difficult task. Two main obstacles are that an exponential number of experiments are needed to gain complete information about the quantum process, and known algorithmic methods for finding correctable encodings involve operations on exponentially large matrices. \n \nIn this thesis we discuss how useful partial information of a quantum channel can be systematically extracted by averaging the channel under the action of a set of unitaries in a process known as twirling. We show that in some cases it is possible to find correctable encodings for the channel using the partial information obtained via twirling. \n \nWe investigate the particular case of twirling over the set of Pauli operators and qubit permutations, and show that the resulting quantum operation can be characterized experimentally in a scalable \nmanner. A post-processing scheme for finding \nunitarily correctable codes for these twirled channels is presented which does \nnot involve exponentially large matrices. A test for non-Markovian noise using such a twirling process is also discussed.

•Jul 31, 2008•8 citations

Scalable protocol for identification of correctable codes

M. Silva, Easwar Magesan, David W. Kribs +1 more

The task of finding a correctable encoding that protects against some physical quantum process is in general hard. Two main obstacles are that an exponential number of experiments are needed to gain complete information about the quantum process, and known algorithmic methods for finding correctable encodings involve operations on exponentially large matrices. However, we show that in some cases it is possible to find such encodings with only partial information about the quantum process. Such useful partial information can be systematically extracted by averaging the channel under the action of a set of unitaries in a process known as twirling. In this paper we prove that correctable encodings for a twirled channel are also correctable for the original channel. We investigate the particular case of twirling over the set of Pauli operators and qubit permutations, and show that the resulting quantum operation can be characterized experimentally in a scalable manner. We also provide a postprocessing scheme for finding unitarily correctable codes for these twirled channels which does not involve exponentially large matrices, and which is robust against uncertainties in the experimental estimates.

arXiv:0710.1900•Physical Review A•Jul 24, 2008•74 citations
We present in a unified manner the existing methods for scalable partial quantum process tomography. We focus on two main approaches: the one presented in Bendersky et al. [Phys. Rev. Lett. 100, 190403 (2008)] and the ones described, respectively, in Emerson et al. [Science 317, 1893 (2007)] and L'opez et al. [Phys. Rev. A 79, 042328 (2009)], which can be combined together. The methods share an essential feature: They are based on the idea that the tomography of a quantum map can be efficiently performed by studying certain properties of a twirling of such a map. From this perspective, in this paper we present extensions, improvements, and comparative analyses of the scalable methods for partial quantum process tomography. We also clarify the significance of the extracted information, and we introduce interesting and useful properties of the \ensuremathχ\ensuremath{\chi}\ensuremathχ-matrix representation of quantum maps that can be used to establish a clearer path toward achieving full tomography of quantum processes in a scalable way.
In this paper we describe in detail and generalize a method for quantum process tomography that was presented by Bendersky et al. [Phys. Rev. Lett. 100, 190403 (2008)]. The method enables the efficient estimation of any element of the $\ensuremath{\chi}$ matrix of a quantum process. Such elements are estimated as averages over experimental outcomes with a precision that is fixed by the number of repetitions of the experiment. Resources required implementing it scale polynomially with the number of qubits of the system. The estimation of all diagonal elements of the $\ensuremath{\chi}$ matrix can be efficiently done without any ancillary qubits. In turn, the estimation of all the off-diagonal elements requires an extra clean qubit. The key ideas of the method, which is based on efficient estimation by random sampling over a set of states forming a 2-design, are described in detail. Efficient methods for preparing and detecting such states are explicitly shown.
The characterization of quantum processes is a key tool in quantum information processing tasks for several reasons: on one hand, it allows one to acknowledge errors in the implementations of quantum algorithms; on the other, it allows one to characterize unknown processes occurring in nature. Bendersky, Pastawski, and Paz [A. Bendersky, F. Pastawski, and J. P. Paz, Phys. Rev. Lett. 100, 190403 (2008); Phys. Rev. A 80, 032116 (2009)] introduced a method to selectively and efficiently measure any given coefficient from the matrix description of a quantum channel. However, this method heavily relies on the construction of maximal sets of mutually unbiased bases (MUBs), which are known to exist only when the dimension of the Hilbert space is the power of a prime number. In this article, we lift the requirement on the dimension by presenting two variations of the method that work on arbitrary finite dimensions: one uses tensor products of maximal sets of MUBs, and the other uses a dimensional cutoff of a higher prime power dimension.
Scalable characterization of quantum processors is crucial for mitigating noise and imperfections. While randomized measurement protocols enable efficient access to local observables, inferring a globally consistent description of multi-qubit processes remains challenging. Here we introduce a local-to-global reconstruction framework for one-dimensional multi-qubit states and channels. The method is efficient provided that correlations, as quantified by the conditional mutual information, decay exponentially. In particular, we prove that under this assumption, the required number of samples scales polynomially with the system size and the desired global reconstruction error. Our approach is based on combining local shadow tomography with locally optimal recovery maps obtained by convex optimization. We supplement these rigorous guarantees by studying the performance of the protocol numerically for a system evolving under a local Lindbladian and a noisy, shallow circuit. By employing a tensor networ representation, we reconstruct channels acting on up to 50 qubits and accurately recover global diagnostics such as the process fidelity, the Choi state purity, and Pauli-weight-resolved process matrix elements. Our work thus extends the powerful toolbox local shadow tomography to scalable channel characterization with access to global properties.
We present the results of the first photonic implementation of a new method for quantum process tomography. The method {originally presented by A. Bendersky et al. [Phys. Rev. Lett. 100, 190403 (2008)10.1103/PhysRevLett.100.190403]} enables the estimation of any element of the chi-matrix that characterizes a quantum process using resources that scale polynomially with the number of qubits. It is based on the idea of mapping the estimation of any chi-matrix element onto the average fidelity of a quantum channel and estimating the latter by sampling randomly over a special set of states called a 2-design. With a heralded single photon source we fully implement such algorithm and perform process tomography on a number of channels affecting the polarization qubit. The method is compared with other existing ones, and its advantages are discussed.
Finding correctable encoding that protects against a quantum process is in general a difficult task. Two main obstacles are that an exponential number of experiments are needed to gain complete information about the quantum process, and known algorithmic methods for finding correctable encodings involve operations on exponentially large matrices. \n \nIn this thesis we discuss how useful partial information of a quantum channel can be systematically extracted by averaging the channel under the action of a set of unitaries in a process known as twirling. We show that in some cases it is possible to find correctable encodings for the channel using the partial information obtained via twirling. \n \nWe investigate the particular case of twirling over the set of Pauli operators and qubit permutations, and show that the resulting quantum operation can be characterized experimentally in a scalable \nmanner. A post-processing scheme for finding \nunitarily correctable codes for these twirled channels is presented which does \nnot involve exponentially large matrices. A test for non-Markovian noise using such a twirling process is also discussed.
The task of finding a correctable encoding that protects against some physical quantum process is in general hard. Two main obstacles are that an exponential number of experiments are needed to gain complete information about the quantum process, and known algorithmic methods for finding correctable encodings involve operations on exponentially large matrices. However, we show that in some cases it is possible to find such encodings with only partial information about the quantum process. Such useful partial information can be systematically extracted by averaging the channel under the action of a set of unitaries in a process known as twirling. In this paper we prove that correctable encodings for a twirled channel are also correctable for the original channel. We investigate the particular case of twirling over the set of Pauli operators and qubit permutations, and show that the resulting quantum operation can be characterized experimentally in a scalable manner. We also provide a postprocessing scheme for finding unitarily correctable codes for these twirled channels which does not involve exponentially large matrices, and which is robust against uncertainties in the experimental estimates.