Abstract
Because of environmental variations and imperfect operations, real-world quantum computers produce different coherent errors that are difficult to estimate. Here, we propose a method whereby the twirled noise over a unitary 2t-design (a set of unitary matrices that approximate the entire unitary group) for quantum circuits can be tailored into stochastic noise. Then, we prove that local random circuits for twirling separable noisy channel over the Clifford group can be used to construct a unitary 2t-design, which is easy to implement in experiments. Moreover, we prove that our method is robust to gate-dependent and gate-independent noise. The stochastic noise can be both estimated by average fidelity and directly obtained by randomized benchmarking via unitary 2t-designs. Obtaining such tailored noise is an important guarantee for achieving fault-tolerant quantum computation.
Similar content being viewed by others
Introduction
Powerful quantum computing requires complex quantum processes as support. However, complex quantum processes also produce noise errors. Such noise error is a major obstacle to many quantum systems and requires different error correction techniques1,2 to achieve fault tolerance3,4,5,6. Many current experimental efforts are aimed at precisely controlling the quantum systems to achieve scalable quantum error correction and to demonstrate the advantages of quantum computing.
However, there are two main challenges in characterizing noise errors: (1) the noise error depends on the choice of input state, and (2) non-ideal operations and measurements used in the quantum system can cause noise errors. Quantum process tomography7,8,9 can be generally used to characterize noise errors, but it is ineffective for large numbers of qubits and is sensitive to state preparation and measurement errors (SPAM)10.
One efficient method of characterizing noise by estimating the average fidelity. Moreover, the stochastic noise can be tailored by a randomized compiling technique previously proposed in refs 11,12. However, these proposals have specific limitations that our technique circumvents. The technique in ref.11 does not consider non-Clifford gates, whereas our generalized technique does. In ref.12, the quantum gates were divided into easy and hard gate sets. They tailored the noise of an easy gate (one single-qubit gate) into stochastic Pauli noise using Pauli operators uniformly chosen from the unitary 1-design. (from the perspective of their quantum circuit design approach, the method of tailored noise is actually the unitary 2-design for twirling of the noisy channel.) In particular, the technique in ref.12 is a special case of our technique when we set t = 1. In near-term applications of quantum computation without quantum error correction, our technique of tailored noise provides a guarantee for the construction of quantum circuits. In the long term, increasingly more quantum devices are being packaged for specific functions in fault-tolerant quantum computers, and stochastic noise estimation for large-scale quantum systems is becoming more important.
In this paper, we propose a method whereby the twirled noise of a quantum channel via a unitary 2t-design can be tailored into stochastic noise. We then prove that local random circuits13,14 over the Clifford group for twirled separable noisy channel can be used to construct an exact unitary 2t-design. In addition, our method is robust against gate-dependent errors. The tailored noise via unitary 2t-designs brings three major advantages. First, we can use average fidelity15 to characterize the stochastic noise. This provides an accurate estimate of the diamond distance from the identity16,17. Second, the average fidelity of the stochastic noise can be directly estimated by randomized benchmarking18,19,20,21,22,23,24,25 via unitary 2t-designs. It can be performed in advance efficiently on a classical computer or through fast control, which imposes no extra experimental burden. Finally, the stochastic noise error as a coherent error providers more information than the Pauli stochastic error of a single qubit.
Preliminaries
We begin by considering a dtn-dimensional t-tensor product completely positive trace-preserving (CPTP) channel \({{\rm{\Lambda }}}^{\otimes t}\) for characterizing the noise, i.e.,
with \({A}_{p}^{\otimes t}\in L({{\mathbb{C}}}^{{d}^{tn}})\) being a linear operator for any dtn-dimensional input density operator \({\rho }^{\otimes t}=|\psi {\rangle }^{\otimes t}\langle \psi {|}^{\otimes t}\) shown in Fig. 1, where \(L({{\mathbb{C}}}^{{d}^{tn}})\) is with respect to the space of dtn-dimensional complex linear operators. For Fig. 1(a), the t-tensor product CPTP channel can be composed of t copies of the dn-dimensional CPTP noisy channel Λ, where we define \({\rm{\Lambda }}(\rho )={\sum }_{p=1}^{{d}^{n}}\,{A}_{p}\rho {A}_{p}^{\dagger }\) with any dn-dimensional input state \(\rho \). The above model can be used to characterize the corresponding properties of t experiments with coherent measurements. For Fig. 1(b), it is a more general model whereby the t-tensor product CPTP channel can also be composed of t different dn-dimensional CPTP noisy channels Λj for \(j\in \{1,\ldots ,t\}\), where \({{\rm{\Lambda }}}_{j}(\rho )={\sum }_{p=1}^{{d}^{n}}\,{A}_{p,j}(\rho ){A}_{p,j}^{\dagger }\) and \({A}_{p}^{\otimes t}={\otimes }_{j=1}^{t}\,{A}_{p,j}={A}_{p,1}\otimes \cdots \otimes {A}_{p,t}\).
We define the superoperator representation of the noisy channel \({{\rm{\Lambda }}}^{\otimes t}\) based on ref.26, i.e.,
where * denotes complex conjugation.
The advantage of such representation is that the cascade of any two noisy channels Λ1 and Λ2 corresponds to matrices multiplication, i.e.,
Definition of the unitary t-design
Then, we introduce a definition of the unitary t-design based on refs 27,28,29. In this paper, we use unitary 2t-design for twirling of a noisy channel according to the following definition, as defined below.
Let t be a natural number and \({\mathscr{U}}({d}^{n})\) be the set of unitary operators in a dn-dimensional Hilbert space. A finite subset \({\{{U}_{i}\}}_{i=1}^{D}\subset {\mathscr{U}}({d}^{n})\) is called a unitary t-design if
and the corresponding superoperator representation can be written as
where μHaar(·) is a uniform distribution and the integrals over \({\mathscr{U}}({d}^{n})\) are the unitarily invariant Haar measure. Let p(t,t)(U) be any polynomial that is homogeneous of degree t in the matrix elements of \(U\in {\mathscr{U}}({d}^{n})\) and homogeneous of degree t in their complex conjugate elements of U*. Therefore, a unitary t-design \({\{{U}_{i}\}}_{i=1}^{D}\) can also be written as
Local random circuits
Finally, we introduce the method of local random circuits13,14, which is an efficient scheme for constructing unitary t-design. In each step of the walk, an index i is chosen uniformly at random from the set \(\{1,\ldots ,n\}\). A two-qubit unitary operator Ui,i+1 drawn from a set of Haar measures \({\mathscr{U}}({d}^{2})\) is applied to the two neighboring qubits i and i + 1 (because of the finite number of qubits, we suppose the (n + 1)-th qubit as being equal to the 1-st qubit).
The operator Hn,t is a d2tn-dimensional quantum local Hamiltonian composed of n local subsystem operators Hi,i+1 such that
with local terms \({H}_{i,i+1}={{\mathbb{I}}}_{{d}^{2t}}-{P}_{i,i+1}\). Here, Pi,i+1 is the projector of two neighbors i, i + 1, on \({\mathscr{U}}({d}^{2t})\) such that
with \({U}^{\otimes t,t}={U}^{\otimes t}\otimes {({U}^{\ast })}^{\otimes t}\).
The properties of local random circuits are as follows:
-
(Periodic boundary conditions) The (n + 1)-th subsystem is identified with the first;
-
(Zero ground-state energy) λmin(Hn,t) = 0, with λmin(Hn,t) being the minimum eigenvalue of Hn,t;
-
(Frustration-freeness) Every state \(|\psi \rangle \) in the groundstate manifold, composed of all eigenvectors with eigenvalue zero, is such that \({H}_{i,i+1}|\psi \rangle =0\), \((i=1,2,\ldots ,n)\).
For a physical example of local random circuits, we assume \(U\in {\mathscr{U}}(4)\) and that the matrix elements of each U must be algebraic. We introduce a physical construction30 of parallel local random circuits on n qubits shown in Fig. 2. At each step, we perform with probability 1/2 either the ‘even’ unitary operation \({U}_{1,2}\otimes {U}_{3,4}\otimes \cdots \otimes {U}_{n-1,n}\) or the ‘odd’ \({U}_{2,3}\otimes {U}_{4,5}\otimes \cdots \otimes {U}_{n-2,n-1}\), where each Ui,i+1 is uniformly randomly sampled from U. Starting in an ‘even’ configuration, applying instead an ‘odd’ operation can be accomplished by a shift operation, defined over the n input and two ancilla qubits 0 and n + 1, such that
where \({S}_{i,i+1}\in {\mathscr{U}}(4)\) is the swap operation between qubits i and i + 1. Iterating the circuit in Fig. 2 therefore produces a local random circuit.
Results
We propose a method using the unitary 2t-design for twirling of the noisy channel. The analysis for noisy channels can also be used for the analysis of the noise characterizing quantum gates. Therefore, we call this method noise tailoring for quantum circuits.
Here, we divide the quantum circuit into K rounds of quantum gates. We propose a method to tailor the noise of each round into stochastic noise via unitary 2t-designs. For the near term, it is a general method for characterizing the noise in a quantum circuit without quantum error correction. For the long term, many quantum circuits are being packaged for specific functions and given corresponding parameters. We need to estimate the noise between such devices. The method via unitary 2t-designs for twirling of the noise is an efficient scheme for estimating the stochastic noise for large-scale quantum circuits.
We begin by proposing the method for twirling the noisy channel via a unitary 2t-design. We define a unitary 2t-design for the twirling of a noisy channel shown in Fig. 3. If \({\{{U}_{i}\}}_{i=1}^{D}\) is a unitary 2t-design, the twirled t-tensor product noisy channel via a unitary 2t-design is given by
where \({{\rm{\Lambda }}}^{\otimes t}({\rho }_{0}^{\otimes t})={\sum }_{p=1}^{{d}^{n}}\,{A}_{p}^{\otimes t}{\rho }_{0}^{t}{({A}_{p}^{\dagger })}^{\otimes t}\) and \({A}_{p}^{\otimes t}={\otimes }_{j=1}^{t}\,{A}_{p,j}\) with a fixed input density operator \({\rho }_{0}^{\otimes t}=(|{\psi }_{0}\rangle \,{\langle {\psi }_{0}|)}^{\otimes t}\).
Compiled quantum circuits via unitary 2t-designs
In Fig. 4(a), an original circuit is composed of K rounds of the quantum circuit and the corresponding noise. Here, \({C}_{k}^{\otimes t}\) is with respect to the k-th t-tensor product quantum circuit and \({{\rm{\Lambda }}}_{k}^{\otimes t}\) is the corresponding noise. Following the method of twirled noise using unitary 2t-designs, we can tailor the noise of each round of the quantum circuits into the stochastic noise. Compared with the division of easy and hard gates, it is a more flexible method.
We now specify how to compile the target circuit in the above form to tailor the noise into an effective stochastic noise. The k-th round of the corresponding noise can be written as
where \({A}_{k,p}^{\otimes t}\in L({{\mathbb{C}}}^{{d}^{tn}})\) is a linear operator for a fixed input dtn-dimensional input density operator \({\rho }_{0}^{\otimes t}=|{\psi }_{0}{\rangle }^{\otimes t}\langle {\psi }_{0}{|}^{\otimes t}\).
We propose a method to tailor noise using unitary 2t-designs, where the unitary operators shown in Fig. 4(b) should ideally be uniformly selected from the unitary 2t-design for each round of the target gate. Consequently, uniformly averaging over the unitary 2t-design for twirling the noise in each round reduces the noise in the k-th round to the tailored noise, i.e.
with a dtn-dimensional fixed input density operator \({\rho }_{0}^{\otimes t}\). Because the unitary operators uniformly selected from the unitary 2t-design are independent of the fixed input density operator \({\rho }_{0}^{\otimes t}\), the expected noise over D experiments is exactly the tailored noise. The superoperator representation of the tailored noise can be written as
where \({\hat{U}}_{k}^{\otimes t}={U}_{k}^{\otimes t}\otimes {({U}_{k}^{\ast })}^{\otimes t}\). From the above equality, the tailored noise is not implemented in any given K rounds of quantum gates. Instead, it is the average over unitary 2t-designs. This method can be performed in conjunction with a classical computer or with fast control. Moreover, this fast control is exactly equivalent to the control required in quantum error correction and thus does not impose an additional experimental burden.
Robustness to gate-independent and gate-dependent noise
Our first approach is that the method of unitary 2t-design for twirled noisy channel is applied to tailor the noise of each round of the quantum gates.
Theorem 1
Uniformly sampling the unitary operators from a unitary 2t-design independently in each round tailors the noise of quantum gates into stochastic noise when the noise is gate independent.
Theorem 1 establishes that the noise in each round can be exactly tailored into stochastic noise. In ref.12, the authors use a Pauli operator randomly selected from the Pauli group to tailor the noise of each round of the corresponding quantum gate, which is a method using the unitary 2-design for twirling noise. However, the above method can only be applied to quantum circuits with a single-qubit gate. Here, we propose a more general method to tailor noise using the unitary 2t-design. We can use the construction of the unitary 2t-design to tailor any independent noise for large-scale quantum circuits. Moreover, the error of the estimation caused by pseudo-randomness is avoided.
Our second approach is to give a specific construction of the unitary 2t-design.
Theorem 2
For any completely positive separable noisy channel, an exact unitary 2t-design for the twirling of channels can be constructed by local random circuits with a uniform Haar measure over the Clifford group.
A unitary 2t-design is highly similar to a spherical 2t-design31,32 in terms of the frame theory29,33. Some constructions of spherical 2t-design can be used in the unitary 2t-design to tailor noise. Therefore, choosing a reasonable construction for unitary 2t-design to characterize noise is the key to solving this problem.
Theorem 2 shows a specific construction for unitary 2t-design. Local random circuits are easier to implement in experiments and avoid errors caused by constructing a specific set of unitary operators. Roughly speaking, randomized benchmarking is a special case for estimating the average fidelity using local random circuits over the Clifford group for twirling noise.
Our third approach is to give the relationship between the gate-dependent and gate-independent noise.
Theorem 3
Let\({\hat{{\mathscr{C}}}}_{GD}^{\otimes t}\)and\({\hat{{\mathscr{C}}}}_{GI}^{\otimes t}\)be the superoperator representation of two tailored circuits with K rounds of gate-dependent and gate-independent noise, respectively. Then,
where\({{\mathbb{E}}}_{K:1}\)is with respect to expectations from K-th to first round.
Note that the diamond norm of a superoperator \({\rm{\Delta }}\) is defined as in ref.34:
Here, the \(p\to q\) induced Schatten norm is \(\parallel {\rm{\Delta }}(X){\parallel }_{1\to 1}={{\rm{\sup }}}_{X\ne 0}\,\tfrac{\parallel {\rm{\Delta }}(X){\parallel }_{p}}{\parallel X{\parallel }_{q}}\). The diamond norm is generally used as the quantity to prove the fault-tolerance thresholds35.
Theorem 3 establishes the robustness to gate-dependent and gate-independent noise in each round of the quantum circuit. In near-term applications without quantum error correction, the above theorem can be applied to characterize the noise for the entire quantum circuit. In the long term for applications with packaged quantum devices, the above theorem can be an important basis for quantum error correction. However, rigorously determining the bound would require estimating the gate-dependent noise, which is currently an open problem. In particular, if each round of a gate in a quantum circuit is an element in the set of local random circuits, the gate-dependent noise can also be tailored into the stochastic noise. For a large-scale quantum circuit that satisfies the above conditions, it can be estimated directly by the stochastic noise model.
Numerical Simulations
Tailoring experimental noise into stochastic noise using unitary 2t-designs provides several dramatic advantages, which we now illustrate via numerical simulations. In our simulation, we assume d = 2, n = 2 and t = 2 for the four-qubit quantum circuits as a physical example. Because an arbitrary two-qubit unitary gate can be decomposed in terms of three CNOT (controlled-NOT) gates and corresponding single-qubit unitary gates36,37,38,39 shown in Fig. 5, our simulations are all of four-qubit circuits with single-qubit unitary operations and CNOT gates shown in Fig. 6(a). Such circuits are universal for quantum computation.
For our simulation, we add gate-dependent noise to each gate shown in Fig. 6(b), that is, we perturb one of the eigenvectors of each gate by eiδ. For single-qubit gates the choice of eigenvector is irrelevant, while for the CNOT gate, we add the phase to the \(\mathrm{|11}\rangle \) state. We then apply unitary 4-designs composed of local random circuits to tailor the noise shown in Fig. 6(c).
We quantify the total noise in a noisy quantum circuit \({{\mathscr{C}}}_{noisy}\) of an ideal circuit \({{\mathscr{C}}}_{ideal}\) by the variational distance
between the probabilities for ideal computational basis measurements after applying \({{\mathscr{C}}}_{noisy}\) and \({{\mathscr{C}}}_{ideal}\) to a system initialized in the \(\mathrm{|0}{\rangle }^{\otimes 4}\) state. We do not maximize over states and measurements; rather, our results indicate the effect of noise under practical choices of preparations and measurements.
We perform two sets of numerical simulations to illustrate the properties. Figure 7 shows that our technique introduces an improvement as the disturbance of the noise δ decreases. For the original circuits, each data point is the variational distance of 20 cycles of 2-tensor product of two-qubit unitary operations, each composed of three CNOT gates and eight randomly selected single-qubit unitary gates. For the tailored circuits, each data point is the variational distance between \(Pr(j|{{\mathscr{C}}}_{ideal})\) and the probability \(Pr(j|{{\mathscr{C}}}_{noisy})\) averaged over 1000 randomizations of the unitary 4-designs.
We take four tests, each as shown in Fig. 7, to obtain the properties of the mean-square errors about the original and tailored circuits. Table 1 shows that our technique make the change of total noise more stable. Therefore, tailored noise via unitary 2t-designs composed of local random circuits is an efficient method to characterize noise of quantum circuits.
Conclusion
We have shown that arbitrary Markovian noise processes can be tailored into stochastic noise using unitary 2t-design for twirling noise. This technique can effectively estimate the coherent noise error for large-scale quantum circuits. Then, we proved that local random circuits over the Clifford group for twirled separable noisy channel can construct an exact unitary 2t-design. This method can be performed efficiently on a classical computer or with fast control with no additional experimental burden. Furthermore, our method of tailored noise is robust against gate-dependent errors. In particular, the gate-dependent noise in all but the final round can be tailored into stochastic noise.
A significant open problem is the construction of the unitary 2t-design. A unitary 2t-design is highly similar to a spherical 2t-design in terms of the Jamiolkowski isomorphism and the frame potential. We need to continue to study the use of spherical 2t-design to find a simpler construction method for unitary 2t-design.
Methods
Proof of Theorem 1
The average fidelity estimation is an efficient method for partially characterizing noise. The average fidelity of the k-th dtn-dimensional noise \({{\rm{\Lambda }}}_{k}^{\otimes t}\), \(k\in \{1,\ldots ,K-1\}\) can be written as
with the dtn-dimensional input state \(|\psi {\rangle }^{\otimes t}\). We can also use k-th unitary operators uniformly selected from the unitary 2t-design \({\{{U}_{k,i}\}}_{i=1}^{D}\) for twirling the noisy channel to estimate the average fidelity, i.e.,
with a fixed dtn-dimensional input state \(|{\psi }_{0}{\rangle }^{\otimes t}\). The Eq. (17) is equal to Eq. (18). It can be recognized in the experiment as the average fidelity by uniformly averaging over all unitary operators with a fixed input state instead of averaging over all input states.
From Schur’s lemma40, the k-th tailored noise can be expressed as a depolarizing channel, i.e.,
with the strength parameter
Proof of Theorem 2
We consider a completely positive noisy channel composed of a linear mapping expressed as \({{\rm{\Lambda }}}^{\otimes t}({\rho }^{\otimes t})={A}^{\otimes t}{\rho }^{\otimes t}{B}^{\otimes t}\)\(\{{A}^{\otimes t},{B}^{\otimes t}\in L({\mathscr{C}}({d}^{tn}))\}\) and local random circuits \(\{{M}_{n,t},{M}_{n,t}^{\dagger }\}\) at both ends for any dtn-dimensional input state \({\rho }^{\otimes t}\). Our approach is to prove that local random circuits with a uniform distribution over the Clifford group are exact unitary 2t-designs for the twirling of channels. Note that the generalized Pauli group \({\mathscr{P}}({d}^{tn})\), which consists of all n-fold t-tensor products of the one-qubit Pauli operators \(\{{\mathbb{I}},X,Y,Z\}\), is a normal subgroup of \({\mathscr{C}}({d}^{tn})\). Therefore, it is sufficient to consider the sympathetic group as \({\mathscr{S}}\,L({d}^{tn})={\mathscr{C}}({d}^{tn})/{\mathscr{P}}({d}^{tn})\)41.
We first define the superoperator representation of local random circuits as
with
In theory, we can prove local random circuits with uniform distribution over the Clifford group to construct an exact unitary 2t-design for the twirling of separable noisy channels as follows. In practice, we generally build parallel random unitary operators using the even and odd tensor products which we will not introduce in this paper (an introduction is given in ref.30).
For a dtn-dimensional quantum channel \({{\rm{\Lambda }}}^{\otimes t}\), we define
and
Note that \({\sum }_{i=1}^{n}\) represents the sum elements of a dtn-dimensional matrix and \({{\rm{\Lambda }}}_{i,i+1}^{\otimes t}\) is with respect to the d2t-dimensional matrix of noise between two neighboring qubits i and i + 1. Our approach is only to prove that Eqs (23) and (24) are equal. Now, we need to prove that
Following the Eqs (19) and (20), we obtain
with \(Tr[{{\rm{\Lambda }}}_{i,i+1}^{\otimes t}({{\mathbb{I}}}_{{d}^{2t}})]=Tr({A}_{i,i+1}^{\otimes t}{B}_{i,i+1}^{\otimes t})={d}^{2t}\).
We denote the elements of the Pauli group \({\mathscr{P}}({d}^{2t})\) as \({\{{P}_{j}\}}_{j=1}^{{d}^{4t}}\) consisting of all 2-fold t-tensor products of the one-qubit Pauli operators \(\{{{\mathbb{I}}}_{d},X,Y,Z\}\), where P1 is the 2-fold t-tensor product of \({{\mathbb{I}}}_{d}\). We can define \({A}_{i,i+1}^{\otimes t}={\sum }_{a=1}^{{d}^{4t}}\,{\alpha }_{a}{P}_{a}\), \({B}_{i,i+1}^{\otimes t}={\sum }_{b=1}^{{d}^{4t}}\,{\beta }_{b}{P}_{b}\), and \({\rho }_{i,i+1}^{\otimes t}={\sum }_{j=1}^{{d}^{4t}}\,{\gamma }_{j}{P}_{j}{\rho }_{i,i+1}^{\otimes t}{P}_{j}\). Then we have \(Tr[{A}_{i,i+1}^{\otimes t}({{\mathbb{I}}}_{{d}^{2t}})]={d}^{2t}{\alpha }_{1}\) and \(Tr[{B}_{i,i+1}^{\otimes t}({{\mathbb{I}}}_{{d}^{2t}})]={d}^{2t}{\beta }_{1}\). The expression of the Pauli-twirled superoperator \({{\rm{\Lambda }}}_{P}^{\otimes t}\) is given by
where \({\sum }_{j=1}^{{d}^{4t}}\,{\omega }^{{(j,a-b)}_{Sp}}={d}^{4t}{\delta }_{a,b}\).
From the above equalities, the \({\mathscr{S}}\,L({d}^{tn})\)-twirl yields
where \(Tr({\rho }_{i,i+1}^{\otimes t}){{\mathbb{I}}}_{{d}^{2t}}=\frac{1}{{d}^{4t}}\,{\sum }_{j=1}^{{d}^{4t}}\,{P}_{j}{\rho }_{i,i+1}^{\otimes t}{P}_{j}^{\dagger }\).
Now, we have the conclusion
Proof of Theorem 3
We use the superoperator representation to represent the two tailored circuits \({\hat{{\mathscr{C}}}}_{GD}^{\otimes t}\) and \({\hat{{\mathscr{C}}}}_{GI}^{\otimes t}\) with K rounds of gate-dependent and gate-independent noise. Let
Then, the tailored circuits under gate-dependent noise is
where \({\mu }_{Haar}^{\ast K}(dU)={\int }_{{\mathscr{U}}({d}^{n})}\,{\delta }_{{U}_{K}\cdots {U}_{1}}\,{\prod }_{k=K}^{1}\,{\mu }_{Haar}(d{U}_{k})\) and \({{\mathbb{E}}}_{K:1}\) is with respect to the expectation over all K rounds of the tailored noise. Similarly, we can obtain the tailored circuits under gate-independent noise using unitary 2t-designs \({\{{U}_{k,i}\}}_{i=1}^{D}\), i.e.,
If we assume \({\hat{{\mathscr{A}}}}_{K:K+1}^{\otimes t}={\hat{ {\mathcal B} }}_{0:1}^{\otimes t}={{\mathbb{I}}}_{{d}^{2tn}}\), the diamond norm of the difference between the two tailored circuits \({\hat{{\mathscr{C}}}}_{GD}^{\otimes t}\) and \({\hat{{\mathscr{C}}}}_{GI}^{\otimes t}\) can be written as
where the normalization \(\parallel {\hat{{\mathscr{A}}}}^{\otimes t}{\parallel }_{\diamond }=\parallel {\hat{ {\mathcal B} }}^{\otimes t}{\parallel }_{\diamond }=1\) which holds for all quantum channels.
Change history
15 August 2023
This article has been retracted. Please see the Retraction Notice for more detail: https://doi.org/10.1038/s41598-023-40529-3
References
Lidar, D. & Brunn, T. Quantum Error correction. (Cambridge University Press).
Aliferis, P., G., D. & Preskill, J. Quantum accuracy threshold for concatenated distance-3 codes. Quantum Info. Comput.6, 97–165 (2006).
Fortescue, B., N., S. & Byrd, M. Fault-tolerance against loss for photonic ftqec. arXiv:1405.1766v1 [quant-ph] (2014).
Varnava, M., B., D. E. & Rudolph, T. Loss tolerance in one-way quantum computation via counterfactual error correction. Phys. Rev. Lett.97, 120501 (2006).
Whiteside, A. C. & Fowler, A. G. Upper bound for loss in practical topological-cluster-state quantum computing. Phys. Rev. A90, 052316 (2014).
Blume-Kohout, R. et al. Demonstration of qubit operations below a rigorous fault tolerance threshold with gate set tomography. Nat. Commun. 8 (2017).
Chuang, I. L. & Nielsen, M. A. Prescription for experimental determination of the dynamics of a quantum black box. J. Mod. Opt.44, 2455–2467 (1997).
Poyatos, J. F., C., J. I. & Zoller, P. Complete characterization of a quantum process: the two-bit quantum gate. Phys. Rev. Lett.78, 390–393 (1997).
D’Ariano, G. M., P., M. G. A. & Sacchi, M. F. Quantum tomography. Advances in Imaging and Electron Physics128, 205–308 (2003).
Merkel, S. T. et al. Self-consistent quantum process tomography. Phys. Rev. A87, 062119 (2013).
Knill, E. Fault-tolerant postselected quantum computation: Threshold analysis. arXiv:0404104 [quant-ph] (2004).
Wallman, J. J. & Emerson, J. Noise tailoring for scalable quantum computation via randomized compiling. Phys. Rev. A94, 052325 (2016).
Brandao, F. G. S. L. & Horodecki, M. Exponential quantum speed-ups are generic. Q. Inf. Comp13, 0901 (2013).
Brandao, F. G. S. L., Harrow, A. W. & Horodecki, M. Local random quantum circuits are approximate polynomial-designs. Communications in Mathematical Physics346, 397–434 (2016).
Wallman, J. J., B., M. & Emerson, J. Robust characterization of loss rates. Phys. Rev. Lett.115, 060501 (2015).
Magesan, E., G., J. M. & Emerson, J. Characterizing quantum gates via randomized benchmarking. Phys. Rev. A85, 042311 (2012).
Wallman, J., G., C. H. R. & Flammia, S. T. Estimating the coherence of noise. New J. Phys.17, 113020 (2015).
Knill, E. et al. Randomized benchmarking of quantum gates. Phys. Rev. A77, 012307 (2007).
Magesan, E., G., J. M. & Emerson, J. Robust randomized benchmarking of quantum processes. Phys. Rev. Lett.106, 180504 (2010).
Gaebler, J. P. et al. Randomized benchmarking of multi-qubit gates. Phys. Rev. Lett.108, 260503 (2012).
Magesan, E. et al. Efficient measurement of quantum gate error by interleaved randomized benchmarking. Phys. Rev. Lett.109, 080505 (2012).
Wallman, J. J. & Flammia, S. T. Randomized benchmarking with confidence. New J. Phys.16, 043021 (2014).
Wallman, J. J., B., M. & Emerson, J. Characterization of leakage errors via randomized benchmarking. New J. Phys.18, 043021 (2016).
Helsen, J., W., J. J., F., S. T. & Wehner, S. Multi-qubit randomized benchmarking using few sample. arXiv:1701.04299v1 [quant-ph] (2017).
Proctor, T., R., K., Y., K., S., M. & Blume-Kohout, R. What randomized benchmarking actually measures. Phys. Rev. Lett.119, 130502 (2017).
Emerson, J., A., R. & Zyczkowski, K. Scalable noise estimation with random unitary operators. J. Opt. B: Quantum Semiclass. Opt.7, 347–352 (2005).
Roy, A. & Scott, A. J. Unitary designs and codes. Designs Codes and Cryptography53, 13–31 (2009).
Dankert, C., C., R., E., J. & Livine, E. Exact and approximate unitary 2-designs: Constructions and applications. Phys. Rev. A80, 012304 (2006).
Gross, D., A., K. & Eisert, J. Evenly distributed unitaries: on the structure of unitary designs. Journal of Mathematical Physics48, 2171 (2007).
Turner, P. S. & Markham, D. Derandomizing quantum circuits with measurement based unitary designs. Phys. Rev. Lett.116, 200501 (2016).
Bannai, E. & Bannai, E. A survey on spherical designs and algebraic combinatorics on spheres. European Journal of Combinatorics30, 1392–1425 (2009).
Delsarte, P., G., J. M. & Seidel, J. J. Spherical codes and designs. Geometriae Dedicata6, 68–93 (1991).
Benedetto, J. J. & Fickus, M. Finite normalized tight frames. Advances in Computational Mathematics18, 257–385 (2003).
Kueng, R., L., D. M., D., A. C. & Flammia, S. T. Comparing experiments to the fault-tolerance threshold. Phys. Rev. Lett.117, 170502 (2016).
Aharonov, D. & Ben-Or, M. Fault-tolerant quantum computation with constant error rate. SIAM Journal on Computing38, 1207–1282 (2008).
Vidal, G. & Dawson, C. M. A universal quantum circuit for two-qubit transformations with three cnot gates. Physical Review A69, 010301–1–010301–4 (2003).
Kraus, B. & Cirac, J. I. Optimal creation of entanglement using a two–qubit gate. Physical Review A63, 21–22 (2001).
Childs, A. M., Haselgrove, H. L. & Nielsen, M. A. Lower bounds on the complexity of simulating quantum gates. Physical Review A68, 162–162 (2003).
Zhang, J., Vala, J., Sastry, S. & Whaley, K. B. Geometric theory of nonlocal two-qubit operations. Physical Review A67, 645–648 (2002).
Goodman, R. & Wallach, N. R. Symmetry, representations, and invariants. (Springer).
Chau, H. F. Unconditionally secure key distribution in higher dimensions by depolarization. IEEE Transactions on Information Theory51, 1451–1468 (2005).
Acknowledgements
This research work was supported by the National Natural Science Foundation of China (Grant Nos 61372076, 61701375), the 111 Project (No. B08038), the Key Research and Development Plan of Shannxi Province (No. BBD24017290001) and Foundation of Science and Technology on Communication Networks Laboratory (KX172600031).
Author information
Authors and Affiliations
Contributions
L.Z. conceived of and designed the study and wrote the initial draft of the manuscript; Y.Y. contributed to the interpretation of the results and assisted in the preparation of the manuscript; C.Z. and C.P. critically reviewed the manuscript; and all authors contributed to the manuscript preparation.
Corresponding author
Ethics declarations
Competing Interests
The authors declare no competing interests.
Additional information
Publisher’s note: Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
This article has been retracted. Please see the retraction notice for more detail: https://doi.org/10.1038/s41598-023-40529-3"
Rights and permissions
Open Access This article is licensed under a Creative Commons Attribution 4.0 International License, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made. The images or other third party material in this article are included in the article’s Creative Commons license, unless indicated otherwise in a credit line to the material. If material is not included in the article’s Creative Commons license and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this license, visit http://creativecommons.org/licenses/by/4.0/.
About this article
Cite this article
Zhang, L., Yu, Y., Zhu, C. et al. RETRACTED ARTICLE: Noise tailoring for quantum circuits via unitary 2t-design. Sci Rep 9, 1790 (2019). https://doi.org/10.1038/s41598-018-38158-2
Received:
Accepted:
Published:
DOI: https://doi.org/10.1038/s41598-018-38158-2
Comments
By submitting a comment you agree to abide by our Terms and Community Guidelines. If you find something abusive or that does not comply with our terms or guidelines please flag it as inappropriate.