Certification of continuous-variable gates using average channel-fidelity witnesses
Renato M. S. Farias, Leandro Aolita

TL;DR
This paper develops practical, Gaussian-measurement-based witnesses for certifying the fidelity of continuous-variable quantum gates, including Gaussian and non-Gaussian types, with applications in validating quantum technologies.
Contribution
It introduces a broad framework for certifying continuous-variable quantum gates using average channel-fidelity witnesses that are experimentally feasible and efficient.
Findings
Witnesses provide tight lower bounds on fidelity.
Method applies efficiently to multiple modes and non-Gaussian gates.
Improved measurement scheme enhances efficiency for Gaussian states.
Abstract
We introduce witnesses for the average channel fidelity between a known target gate and an arbitrary unknown channel, for continuous-variable (CV) systems. These are observables whose expectation value yields a tight lower bound to the average channel fidelity in question, thus constituting a practical tool for certification of experimental CV gates. Our framework applies to a broad class of target gates. Here, we focus on three specific types of targets: multi-mode Gaussian unitary channels, single-mode coherent state amplifiers, and the single-mode (non-Gaussian) cubic phase gate, which is a crucial ingredient for CV universal quantum computation. Our witnesses are experimentally-friendly as they rely exclusively on Gaussian measurements, even for the non-Gaussian-target case. Moreover, in all three cases, they can be measured efficiently in the estimation error and failure…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
\WarningFilter
revtex4-1Repair the float
Certification of continuous-variable gates using average channel-fidelity witnesses
Renato M. S. Farias
Instituto de Física, Universidade Federal do Rio de Janeiro, P. O. Box 68528, Rio de Janeiro, Rio de Janeiro 21941-972, Brazil
Leandro Aolita
Instituto de Física, Universidade Federal do Rio de Janeiro, P. O. Box 68528, Rio de Janeiro, Rio de Janeiro 21941-972, Brazil
Quantum Research Centre, Technology Innovation Institute, Abu Dhabi, UAE
Abstract
We introduce witnesses for the average channel fidelity between a known target gate and an arbitrary unknown channel, for continuous-variable (CV) systems. These are observables whose expectation value yields a tight lower bound to the average channel fidelity in question, thus constituting a practical tool for certification of experimental CV gates. Our framework applies to a broad class of target gates. Here, we focus on three specific types of targets: multi-mode Gaussian unitary channels, single-mode coherent state amplifiers, and the single-mode (non-Gaussian) cubic phase gate, which is a crucial ingredient for CV universal quantum computation. Our witnesses are experimentally-friendly as they rely exclusively on Gaussian measurements, even for the non-Gaussian-target case. Moreover, in all three cases, they can be measured efficiently in the estimation error and failure probability , as well as in the number of modes for the Gaussian-target case. To end up with, our approach for the Gaussian-target case relies on an improved measurement scheme for Gaussian state-fidelity witnesses, which is polynomially and exponentially more efficient in and , respectively, than previous schemes. The latter constitutes an interesting byproduct result on its own. Our findings are relevant to the experimental validation of many-body quantum technologies.
I Introduction
The validation of experimentally implemented gates is one of the major current bottlenecks in the development of many-body quantum simulators as well as universal quantum computers. In principle, an arbitrary unknown channel can be fully characterized with quantum process tomography Chuang and Nielsen (1997); Poyatos et al. (1997); Mohseni et al. (2008). However, this is in practice not a feasible option for multi-partite or high-dimensional single-partite systems Bendersky and Paz (2013); Namiki (2016): It requires the tomographic reconstruction of the channel’s output state either for a large number of different input states López et al. (2010); Schmiegelow et al. (2011) or for the input system in a maximally entangled state with an ancilla Altepeter et al. (2003); Bai and Chiribella (2018). In either case, quantum state tomography of a single output state requires already a number of measurements that scales very unfavorably with the system dimension. This is specially problematic for continuous-variable (CV) systems Lvovsky and Raymer (2009).
For the case of state preparations, several techniques have been put forward for validation or benchmarking in order to avoid full quantum state tomography Namiki et al. (2008); Cramer et al. (2010); Gross et al. (2010); Tóth et al. (2010); Flammia and Liu (2011); da Silva et al. (2011); Moroder et al. (2012); Flammia et al. (2012); Reich et al. (2013); Aolita et al. (2015); Bai and Chiribella (2018); Gluza et al. (2018); Liu et al. (2019). However, in contrast, certification of quantum gates is a much less explored field. For discrete-variable systems, a remarkable technique for characterizing average gate-error rates in circuits with variable (random) components is randomized benchmarking Emerson et al. (2005); Knill et al. (2008); Dankert et al. (2009); Magesan et al. (2011); Cross et al. (2016). However, this does not allow one to certify a single target circuit with fixed components. Moreover, for CV systems the problem is less understood Lvovsky and Raymer (2009); Aolita et al. (2015); Bai and Chiribella (2018); Roth et al. (2018); Sharma and Wilde (2018).
Here, we derive experimentally-friendly observables on CV systems whose expectation value yields a tight lower bound to the average channel fidelity Braunstein et al. (1999); Nielsen (2002); Pirandola et al. (2015) between a known target gate and an arbitrary unknown channel. We refer to these as average channel-fidelity witnesses, in analogy to state-fidelity witnesses Aolita et al. (2015); Gluza et al. (2018); Liu et al. (2019). The method extends to a wide spectrum of target gates. In particular, here, we explicitly present efficiently-measurable witnesses for three classes of targets: multi-mode Gaussian unitary channels Ferraro et al. (2005); Cerf et al. (2007); Weedbrook et al. (2011), single-mode coherent state amplifiers Hammerer et al. (2005); Namiki et al. (2008); Pooser et al. (2009); Ferreyrol et al. (2010); Zavatta et al. (2011); Chiribella and Xie (2013), and the single-mode (non-Gaussian) cubic phase gate Gottesman et al. (2001); Gu et al. (2009); Weedbrook et al. (2011). Importantly, the latter is highly relevant for computations, since, together with Gaussian channels, it is enough for CV universal quantum computing Lloyd and Braunstein (1999). Our witnesses are highly experimentally-friendly in that they can be measured by probing the channel with simple Gaussian states (coherent states) as inputs and making Gaussian measurements (homodyne detection) Ferraro et al. (2005); Cerf et al. (2007); Weedbrook et al. (2011) at the output, even for the non-Gaussian target gates considered. Moreover, in all three cases, the estimation of their expectation value is efficient in all relevant parameters: its sample complexity (i.e. number of experimental runs required) scales polynomially in the inverse estimation error and logarithmically in the inverse failure probability , as well as polynomially in the number of modes for the Gaussian-target case. Such scaling in represents an exponential improvement with respect to previous estimation methods Aolita et al. (2015), and is possible thanks to an estimation protocol known as median-of-means Nemirovsky and Yudin (1983); Jerrum et al. (1986). Furthermore, our measurement scheme for witnesses of Gaussian target gates exploits state-fidelity witnesses for Gaussian target states Aolita et al. (2015). To measure the latter, we use an enhanced method Gluza et al. (2018) based on importance sampling [see, e.g., Refs. Owen and Zhou (2000); Tokdar and Kass (2010)], which (apart from the already mentioned improvement on ) is polynomially more efficient in than previous methods Aolita et al. (2015). This is interesting in its own right beyond the scope of channel certification.
The paper is organized as follows: in Sec. II we introduce the notation and background. In Sec. III we state our main theorems. The estimation protocols are detailed in Sec. IV. To end up with, our conclusions are left for Sec. V.
II Background and Notation
For an -mode CV state described by a density matrix , each mode can be described by a pair of bosonic field operators , where is the -th creation (annihilation) operator, and . The field operators satisfy the usual commutation relations , where is the Kronecker delta. The multi-mode number operator, , is defined as the sum of all single-mode number operators, i.e. . Operators and are, respectively, the -th mode’s position- and momentum-like quadrature field operators in the quantum optical convention, i.e. . The quadrature field operators can be arranged in a quadrature vector, , such as
[TABLE]
We can define the first-moment vector, , as
[TABLE]
where is the trace operation. We can define a second-moment matrix with elements composed of bilinear combinations of quadrature operators:
[TABLE]
The , symmetric covariance matrix is defined as
[TABLE]
The combination of and contain all information necessary to characterize a Gaussian state Wick (1950). If is the covariance matrix of an arbitrary pure Gaussian state, the combination of the Williamson’s Theo. Williamson (1936) with the Euler Decomposition Braunstein (2005); ”Arvind et al. (1995) guarantees that there is a symplectic matrix such that
[TABLE]
with , with being orthogonal matrices and being a positive diagonal matrix such that
[TABLE]
where is the set of single-mode squeezing matrices, and is the -th single-mode squeezing parameter. The matrix is said to perform a symplectic diagonalization of Williamson (1936); Ferraro et al. (2005); Weedbrook et al. (2011), and it is equivalent to a corresponding unitary operation in Hilbert space. Equations 5 and 6 are also valid for Gaussian unitary channels.
The state fidelity between a pure target state and a state preparation is
[TABLE]
where the last equality holds because is a pure state. is an excellent figure of merit for how good is the preparation of a desired state Nielsen (2002); Uhlmann (2000). Here, we use the average channel fidelity. This is well known from, e.g., the field of quantum teleportation, where it is used as a practical figure of merit for how good is a teleportation channel Braunstein et al. (1999); Nielsen (2002); Pirandola et al. (2015). Moreover, we chose not to certify states using diamond norm Nielsen (2002) as a figure of merit because, even though more reliable, diamond norm estimation is much more resource-intensive.
Consider an ensemble composed of a finite set of pure input states and a prior probability distribution p over . For instance, may correspond to a finite-precision resolution of some bounded-energy continuous set of coherent states in phase space. The average channel fidelity between an arbitrary unknown channel and a unitary target gate with respect to is then defined as
[TABLE]
where is the state fidelity of Eq. (7), with and playing, respectively, the roles of and . Equation (8) thus represents the average fidelity between the outputs of the ideal target channel and its real implementation over the ensemble under consideration. Operationally, is obtained by drawing an input state according to , calculating the corresponding output states fidelity, and then averaging.
Clearly, definition (8) generalizes straightforwardly to the case where is a continuous set with uncountably many elements. Here we restrict to the case of finite input-state sets because we have in mind a scenario where the elements in are sampled with a classical computer. However, the method can also be applied to infinite input-state sets as long as one counts on a practical mechanism to sample from them.
It is also important to note that certification via average-fidelity witnesses, if sucessful, demonstrates the experimental gate is close to the ideal gate with respect to actions on the input ensemble, independent of which states compose the ensemble.
III Average channel-fidelity witnesses
Here we state our main theorems: namely, the sample complexities of estimating for multi-mode Gaussian unitary target channels as well as single-mode coherent state amplifiers and cubic phase gates. The core of our general procedure to estimate consists of sampling an input from according to the prior distribution , and, then, for each drawn, estimating a lower bound to by measuring a state-fidelity witness for as target state on the output. For these reasons, before the average channel-fidelity witnesses we present an improved measurement scheme for the state-fidelity witnesses for multi-mode Gaussian target states originally derived in Aolita et al. (2015).
III.1 Improved estimation of state-fidelity witness for pure multi-mode Gaussian target states
Following Ref. Gluza et al. (2018), we present the generic notion of fidelity witness as follows.
Definition 1** (Fidelity witness).**
An observable is a fidelity witness for if, for , it holds that
; 2. 2.
.
Fidelity witnesses for arbitrary pure Gaussian target states
[TABLE]
where is the -mode vacuum state and is an arbitrary Gaussian unitary, were first presented in Ref. Aolita et al. (2015) as
[TABLE]
Here, is the identity operator on the -mode Hilbert space and is the multimode number operator defined in Sec. II. Therefore, the fidelity lower bound in this case is such that
[TABLE]
can also be written in terms of first-moment vectors and second-moment matrices Aolita et al. (2015):
[TABLE]
where is the trace operation over matrices, and and are, respectively, the first-moment vector and second-moment matrix of . We note that, even though Eq. (12) depends on first and second moments of the prepared state, there is not assumption that is a Gaussian state (see Ref. Aolita et al. (2015) for details).
Next, we characterize the number of measurements required to estimate up to statistical error and failure probability , i.e. to obtain an estimate of such that , where denotes probability. Based on physical grounds, we make the following two assumptions on the experimental state: that it is prepared following an identical and independent procedure from run to run (the i.i.d. assumption), and that finite-order statistical moments are bounded. In fact, we will only explicitly need to assume that all fourth-order moments are bounded, i.e. , and that all single-mode mode energies are upper-bounded by the maximal single-mode energy , i.e. . The number of measurements required is formally given by the following theorem, proven in App. A.1. We use the Bachmann-Landau asymptotic upper-bound notation .
Theorem 2** (Sample complexity of certifying pure Gaussian target states).**
Let be an arbitrary, known -mode pure Gaussian target state with maximum single-mode squeezing parameter and first-moment vector . Let describe an arbitrary, unknown i.i.d preparation with maximum single-mode energy and fourth-order moments upper-bounded by . Then, the total number of measurements required to estimate up to error at most and failure probability at most scales as
[TABLE]
where and is the Euclidean vector norm.
Theo. 2 is the basis of the certification method for multi-mode Gaussian target gates in the next subsection. Still, it is itself interesting for state certification, beyond the scope of channel certification. This is due to the fact that the scaling in Eq. (13) significantly outperforms the one of previous protocols in two aspects. First, while in our case the sample complexity scales logarithmically with , that of Ref. Aolita et al. (2015) scales as , which is approximately equal to for approaching [math]. Thus our scaling is exponentially better in for the most relevant regime. This is due to the fact that, while in Ref. Aolita et al. (2015) estimation errors are assessed with Chebyshev’s bound, the proof here uses the median-of-means estimation protocol combined with the Chernoff bound Chernoff (1952) (see App. A.1 for details). Second, the worst-case scaling of the sample complexity of Ref. Aolita et al. (2015) with the number of modes is , whereas Eq. (13) scales at worst as . This corresponds to a polynomial improvement in the number of modes. This is possible thanks to an enhanced measurement scheme, based on importance sampling Owen and Zhou (2000), similar to that used in Ref. Gluza et al. (2018) for fermions. The details of this scheme are given in Sec. IV.1.
III.2 Average channel-fidelity witness for Gaussian unitary target channels
Here, the task in hand is to certify an arbitrary quantum Gaussian unitary channel, . We consider a protocol that consists in probing an experimental channel with an ensemble , where is a set of pure input states .We can use the fidelity witness in Eq. (12) to derive a general lower-bound for the average channel fidelity between and , , as
[TABLE]
where and are, respectively, the first-moment vector and covariance matrix of target output states , and and are, respectively, the first-moment vector and second-moment matrix of experimental output states . For simplicity, dependencies on were omitted in Eq. (LABEL:eq:fidelityChannels).
The lower bound in (LABEL:eq:fidelityChannels) depends on the choice of ensemble . We choose to be
[TABLE]
where is a -mode coherent state, with being the -th single-mode coherent state. As in Sec. III.1, the characterization of the number of measurements required to estimate up to error and failure probability is done via an empirical estimate such that . We again assume i.i.d. preparations and bounded moments up to fourth order, i.e. . The theorem below, proven in App. A.2, summarizes our results.
Theorem 3** (Sample complexity of certifying Gaussian unitary channels).**
Let be an arbitrary, known target Gaussian unitary with maximum single-mode squeezing parameter and maximum single-mode energy . Let be the experimentally implemented channel, with maximum single-mode energy and fourth-order moments upper-bounded by . In addition, let , defined in Eq. (15), be the probe ensemble used. Then, the total number of measurements required to estimate up to error at most and failure probability at most scales as
[TABLE]
where .
This choice of ensemble was made for two reasons. First, coherent states are easily accessible in the laboratory, which makes easier the life of a experimentalist trying to certify a real device. Second, by choosing a set fully composed of coherent states we arrive at a sample complexity that is independent of any choice of coherent amplitudes . Third, due to the fact that the covariance matrices of and are equal (both proportional to the identity matrix ), the sample complexity of our certification protocol does not depend on the choice of prior distribution. However, it is important to state that different prior distributions will render different values of , as clearly seen in Eq. (LABEL:eq:fidelityChannels). Thus, even though the sample complexity is independent of the ensemble in Eq. (15), the choices of ensemble and prior distribution are still relevant. Furthermore, we note that, since , Theo. 3 displays the same sample complexity as Theo. 2. Lastly, if is only composed of linear optical elements, then . This measurement scheme is detailed in Sec. IV.2.
We would also like to restate that if the protocol is successful, it is only demonstrated that the experimental gate is close to the ideal gate w.r.t. actions on the input ensemble. However, we stick to the aforementioned choice of ensemble because using an input ensemble composed of more complex (non-)Gaussian states creates an overhead in complexity that defeats the purpose of requesting the least amount of resources from an experimental perspective (e.g. an overhead of resources and time dedicated to producing and certifying an ensemble of squeezed stated before certifying the action of the experimental gate such ensemble). The same argument is valid for the ensemble chosen to certify the cubic phase gate in Sec. III.3.2.
III.3 Single-mode target channels
In this subsection we consider two single-mode channel applications: the coherent state amplifier and the cubic phase gate.
III.3.1 Coherent-state amplifier
An ideal noiseless amplifier transforms a coherent state into an amplified coherent state as Zavatta et al. (2011); Chiribella and Xie (2013); Bai and Chiribella (2018)
[TABLE]
where is the gain of the amplifier. However, arbitrary quantum states cannot be perfectly amplified deterministically without the addition of noise Caves (1982). Transformation (17) is therefore unphysical if deterministic, but it can be implemented as a non-deterministic (non-unitary) transformation Ralph and Lund (2008). There are several experimental implementations Ferreyrol et al. (2010); Xiang et al. (2010) of such probabilistic channel Xiang et al. (2010); Usuga et al. (2010); Ferreyrol et al. (2010); Zavatta et al. (2011); Kocsis et al. (2012).
Here, our goal is to lower-bound the closeness of an experimental implementation to the ideal, non-physical transformation (17). In order to certify the experimental realization of such channel Chiribella and Xie (2013); Bai and Chiribella (2018); Namiki et al. (2008); Hammerer et al. (2005) we can use the fact that, for each experimental run, the state fidelity witness (10) can be written as
[TABLE]
where is the single-mode displacement operator. We then write the fidelity lower bound as
[TABLE]
Writing as the output state of the ideal transformation, we can use (19) to lower-bound the average channel fidelity as
[TABLE]
where is the average channel-fidelity lower bound for the ideal coherent state amplifier. Analogously to the previous sections, we characterize the number of measurements required to approximate by an estimate up to and . It is assumed here that fourth-order statistical moments are bounded, i.e. . For the set we can define
[TABLE]
The Theorem below summarizes our results.
Theorem 4** (Sample complexity of certifying the coherent state amplifier).**
For , let be the experimentally implemented coherent-state amplifier channel, with forth-order moments upper-bounded by . In addition, let be the probe ensemble used, with bound defined in (21). Then, the maximum number of measurements required to estimate up to error and failure probability scales as
[TABLE]
As in the previous cases, (22) does not depend on the prior distribution. This measurement scheme is detailed in Sec. IV.3.1.
III.3.2 Cubic phase gate
Our framework can also be applied to certify non-Gaussian channels. Here, we show how to certify the non-Gaussian single-mode cubic phase gate, which generates the ideal, unnormalizible cubic phase state when applied to the zero-momentum eigenstate Gottesman et al. (2001). Experimental progress has been made in recent years regarding the preparation of the cubic phase state Yukawa et al. (2013); Miyata et al. (2016); Takeda and Furusawa (2017), thus justifying the need for efficient certification protocols for both the cubic phase state Liu et al. (2019) and the cubic phase gate. As stated in Sec. I, this is a non-Gaussian element that is sufficient to provide, together with all Gaussian channels, universal quantum computation using continuous-variable degrees of freedom Gottesman et al. (2001); Yukawa et al. (2013); Marshall et al. (2015); Takeda and Furusawa (2017). For , the cubic phase gate is defined as
[TABLE]
We probe an experimental implementation of the cubic phase gate with the same ensemble defined in Sec. III.3.2, i.e. target output states are
[TABLE]
For each experimental realization, the fidelity witness is Liu et al. (2019)
[TABLE]
which is demonstrated in App. B. The state fidelity is then lower-bounded by as
[TABLE]
which is also demonstrated in App. B. Furthermore, it is demonstrated in the App. C how can be expressed in terms of observables that are accessible directly by homodyne detection. Averaging over several experimental runs, we can use Eq. (26) to lower-bound the average channel fidelity of the process as
[TABLE]
In order to estimate up to and , we assume that statistical moments are bounded up to eighth order. Precisely, we assume that . For the set we define the bound
[TABLE]
Then, our results for the sample complexity are presented in the Theorem below.
Theorem 5** (Sample complexity of certifying the cubic phase gate).**
For , let be the single-mode cubic phase gate, and let be the experimentally implemented channel. Let be the probe ensemble, with bound defined in (28). Moments of eighth order are assumed to be upper-bounded by . Then,
[TABLE]
is the maximum number of measurements required to estimate up to error and failure probability .
As it was true for the estimation of average channel-fidelity witnesses of Gaussian unitary channels and the coherent state amplifier, choosing coherent states as input yields a sample complexity that does not depend on the choice of prior distribution. Section IV.3.2 presents the respective measurement scheme.
IV Measurement Schemes
In the following subsections we show how to use importance sampling techniques to estimate the fidelity lower bounds presented in Sec. III. For clearance, we present the measurement scheme for pure Gaussian target states before the measurement scheme for Gaussian unitary target channels. Then, we present the measurement scheme for the single-mode applications.
IV.1 Pure Gaussian target states
We start from (12). Note that the third overlap term on its right-hand side (r.h.s.) is a known quantity, since and are known. Thus, we must estimate the remaining overlaps, and . Each overlap is written as the expectation value of an estimator which is dependent on quadrature measurements and associated with a joint probability distribution. By sampling relevant quadratures from the joint probability distribution and measuring them via homodyne detection, one can directly obtain the expectation value of the estimator, and consequently obtain an estimation for each overlap without full knowledge of and . Next subsections we define the two estimators suitable to estimate each overlap as well as their associated probability distribution p.
IV.1.1 First-moment estimator
Let us first focus on the overlap involving first-moment vectors. We can define a probability distribution such that
[TABLE]
where is the squared Frobenius norm of . Thus, we use the definition of trace operation to write
[TABLE]
where we have used the fact that for all relevant to the summation. Since each element of is associated with a bilinear combination of field quadratures, each pair corresponds to observables that can be measured with homodyne detection. Each target state defines a fixed prior distribution and it defines the observables that are most relevant to the estimation of . Furthermore, from the definition of first-moment vectors presented in (2), can be expressed as
[TABLE]
where is the probability distribution of measuring eigenvalue given the -th observable ( if is odd, if is even), and is the projector onto the eigenstate with eigenvalue of the -th quadrature measurement. Now, substituting (30) and (32) into (31), we have
[TABLE]
where we defined the estimator with possible values
[TABLE]
Notation denotes the expectation value of a random variable, and is the joint probability of measuring observables corresponding to pair and obtaining as result.
Equation (33) tells us that it is possible to understand the overlap as the expectation value of a single unbounded random variable . Even though each possible value is accessible by multiplying measurement result by its associated constant , an infinite number of measurements would be necessary to estimate , as . In App. A.1.1 we show the sample complexity of estimating , which is part of the result in Theo. 2.
IV.1.2 Second-moment estimator
Again, it follows from the definition of the trace operation that
[TABLE]
where was defined in (30). Analogously to (32), we can use (3) to write each matrix element as
[TABLE]
where is the probability distribution of measuring observales given by the pair and obtaining eigenvalue . It is possible to write the r.h.s. of (35) as the expectation value of the estimator , i.e.
[TABLE]
where can assume the possible values
[TABLE]
and . Since is a matrix composed of expectation values with of them involving non-commuting observables, in App. D we go through a discussion about how to measure . In App. A.1.2 we show the sample complexity of estimating , which complements the results in App. A.1.1 in order to prove Theo. 2.
Protocol 1: To illustrate how we envision the measurement protocol working in practice, we give present step-by-step heuristics as follows:
One defines a target pure state . One wants to certify how close the experimental implementation is from ; 2. 2.
Defining an error , a probability of success , and upper-bounds for single-mode energy and fourth-order moments , the experimentalist knows that it will need to accumulate a number of measurement results that at most equates Eq. (13); 3. 3.
From one is able to sample observables according to the prior distribution in order to measure via homodyne detection; 4. 4.
From the experimental statistics accumulated, the experimentalist is able to obtain eigenvalues according to the conditional distribution for second moments as well as eigenvalues according to for first moments; 5. 5.
At last, the experimentalist classicaly process the measurement results according to median-of-means protocol and evaluate the estimators and defined, respectively, in Eqs. (37) and (33) (see App. A).
Since the step-by-steps from the above protocol changes very little for all the other case studies mentioned in this pap1er, from now own we refer to this Section when it comes to the measurement scheme’s pseudo-algorithm.
IV.2 Gaussian unitary target channels
There are two terms in Eq. (LABEL:eq:fidelityChannels) that are dependent of the experimental channel. For the overlap involving first moments, it is possible to define the estimator , similarly to Eq. (34), with possible values
[TABLE]
where there are implicit dependencies on the set of input states, . From now on, the superscript refers to channels, and we do not explicitly write the dependencies on for simplicity. Nevertheless, the second integral on the r.h.s. of Eq. (LABEL:eq:fidelityChannels) can be rewritten as
[TABLE]
where
[TABLE]
and . We see that depends on the prior distribution . As for the estimation of second moments, the estimator is defined as in Eq. (38), but now with implicit dependencies on input states , with possible values
[TABLE]
Thus, the third mean overlap on the r.h.s. of (LABEL:eq:fidelityChannels) can be rewritten as
[TABLE]
where
[TABLE]
and . Here, we see that also depends on , as expected. In App. A.2 we show how the estimation of and leads to the sample complexity in Theo. 3.
IV.3 Single-mode target channels
Here we state the measurement schemes for the two single-mode applications considered in Sec. III.3.
IV.3.1 Coherent-state amplification channel
By combining (19) and (20), the average channel-fidelity lower-bound can be written as
[TABLE]
where sets of observables and coefficients are such that
[TABLE]
Since the first sum in (IV.3.1) is a completely defined by the ensemble , the certification of the coherent state amplifier relies on the estimation of the four expectation values from the remaining sum. We show below how to write (IV.3.1) as the expectation value of a single unbounded random variable. First, we can rewrite each as , where if , and otherwise. We can also define the probability distribution as
[TABLE]
Each quadrature operator can be expressed in its respective diagonal basis as
[TABLE]
where is the projection of the -th quadrature operator onto the eigenstate with eigenvalue . We can also define
[TABLE]
as the conditional probability distribution of, given input state , choosing to measure the -th observable and obtaining eigenvalue as result. Thus, . As in the case of Gaussian unitary target channels, an estimator , with possible values
[TABLE]
can be defined. We rewrite the second sum on the r.h.s. of (IV.3.1) as
[TABLE]
where
[TABLE]
In App. A.3 we show that the estimation of yields the sample complexity in Theo. 4.
IV.3.2 Cubic phase gate
Here, we follow the same mathematical steps as in Sec. IV.3.1. From (26) and (27), the average channel-fidelity lower-bound can be rewritten as
[TABLE]
where the sets of coefficients and observables are such that
[TABLE]
Now, the conditional probability distribution is a function of the coefficients :
[TABLE]
Analogously to (48), each quadrature operator can expressed in its respective diagonal basis as
[TABLE]
and the conditional probability distribution is such that
[TABLE]
The joint probability of probing the experimental channel with coherent state , choosing to measure observable , and having as measurement result is therefore . Defining the estimator with possible values
[TABLE]
we can finally rewrite the second sum on the r.h.s. of (IV.3.2) as
[TABLE]
where
[TABLE]
In App. A.3 we show that the estimation of yields the sample complexity in Theo. 5.
V Conclusions and Outlook
We derived efficiently-measurable witnesses for the average channel fidelity between an arbitrary, unknown experimental gate and an ideal, known gate, for three important classes of target gates: multi-mode Gaussian unitary channels, single-mode coherent state amplifiers, and the single-mode (non-Gaussian) cubic phase gate. Our witnesses are experimentally-friendly in that they can be measured by probing the channel with simple Gaussian states (coherent states) as inputs and making Gaussian measurements (homodyne detection) at the output, even for the non-Gaussian case considered. Moreover, in all three cases, the estimation of their expectation value is efficient in all relevant parameters: its sample complexity (i.e. the total number of measurements required) scales polynomially in the inverse estimation error and logarithmically in the inverse failure probability of the estimation, as well as polynomially in the number of modes for the Gaussian-target case. Such scaling in represents an exponential improvement with respect to previous estimation methods Aolita et al. (2015).
For the case Gaussian unitary target channels, our channel-fidelity witness exploits state-fidelity witnesses for Gaussian target states Aolita et al. (2015). Interestingly, to measure the latter, we develop an enhanced method, based on importance sampling Gluza et al. (2018), which (apart from the already mentioned improvement on ) is polynomially more efficient in than previous methods Aolita et al. (2015). Furtheremore, the resulting sample complexity for the certification of -mode Gaussian target states displays the same scaling as the estimation of the average channel-fidelity lower bound for arbitrary Gaussian unitary channels probed by -mode coherent states. This is a byproduct technical contribution interesting in its own right for certifying state preparations (instead of channels).
Our findings are relevant for the certification of experimental many-body quantum technologies in the continuous-variable domain. Particularly promising prospects may for instance be the certification of the forthcoming first non-Gaussian resources, such as single mode non-Gaussian states and channels, with important implications Liu et al. (2019) for universal quantum computing.
VI Acknowledgements
We acknowledge financial support from the Brazilian agencies CNPq (PQ grant No. 311416/2015-2 and INCT-IQ), FAPERJ (JCNE- 26/202.701/2018), CAPES (PROCAD2013), and the Serrapilheira Institute (grant number Serra-1709-17173).
Appendix A Sample Complexities and Proofs of Theorems
In this appendix we show how to use the median-of-means estimation protocol in order to estimate all the expectation values defined in Sec. IV and prove the sample complexities presented in Sec. III.
First, we define the general framework of the median-of-means protocol Nemirovsky and Yudin (1983); Jerrum et al. (1986). Let be a random variable with variance , and let be the estimation error. We divide the experimental data points in batches of size such that each batch has independent copies of Y. Note that . Then, we calculate the empirical mean for every batch as
[TABLE]
where , and represents the parameters of the -th experimental realization. The median-of-means estimator is then computed by calculating the median empirical mean among all batches, i.e.
[TABLE]
By using the Chernoff inequality Chernoff (1952), one can show (see, e.g., Ref. Huang and Kueng (2020)) that the probability the median-of-means estimator diverges from by more than follows
[TABLE]
where is the maximum failure probability. Hence, using the fact that , we are able to write as
[TABLE]
In the following subsections we apply the results above to each random variable defined in Sec. IV, to prove the theorems in Sec. III.
A.1 Pure Gaussian target states
A.1.1 First-moment estimator
In Sec. IV.1.1, was written as the expectation value , which is measurement-dependent. However, a certifier is constrained by a finite number of state preparations, i.e. by a finite number of measurements. What is actually accessible to the certifier is , which is an empirical estimation of and is defined as
[TABLE]
with being the number of batches, and
[TABLE]
where is the -th experimental realization, and is the total number of measurements required to estimate with statistical confidence. Now, from Eq. (63) gives us an upper bound for the probability that and differ by more than an error . As mentioned previously, the upper bound is called the maximum failure probability. Equation (64) enables us to write in terms of and as
[TABLE]
Equation (67) already displays the scaling in and presented in Theo. 2. In App. E.1 we demonstrate how to upper-bound by
[TABLE]
where and was defined in Sec. III.1. Thus, substituting Eq. (68) into Eq. (67), we see that
[TABLE]
which is the sample complexity of the estimation of the first moments presented in Theo. 2.
A.1.2 Second-moment estimator
Following the same steps as in the previous subsection, we define the median-of-means estimator as
[TABLE]
with
[TABLE]
where , and is the number of measurements required to estimate as with statistical confidence. Analogously to Eqs. (63) and (64), we have
[TABLE]
We leave the demonstration of how to upper-bound to App. E.2. Here, we present the end result:
[TABLE]
where was defined in Sec. III.1. Hence, substituting Eq. (73) into Eq. (72), we have
[TABLE]
which is the sample complexity as that of the second moments in Theo. 2.
A.2 Gaussian unitary target channels
Similarly to App. A.1, we can use the framework presented in Eqs. (62) - (64) to upper-bound , the number of measurements required to estimate , as
[TABLE]
where estimator was defined in Eq. (39). When we choose the set of input states to be composed of -mode coherent states , is upper-bounded as
[TABLE]
where , and were defined in Sec. III.2. It is demonstrated in App. F that (76) does not depend on the choice of prior probability distribution . Thus, substituting (76) into (75), we have
[TABLE]
which is the sample complexity for first moments presented in Theo. 3.
As for the second moments, the number of measurements required is such that
[TABLE]
where estimator was defined in (42). Under the choice of set , can be upper-bounded as
[TABLE]
where was defined in Sec. III.2. As for (76), App. F shows that (79) also does not depend on . Thus, substituting Eq. (79) into Eq. (78), we see that
[TABLE]
which, combined with (77), is the sample complexity presented in Theo. 3.
A.3 Single-mode applications
First, for the coherent-state amplifier, the median-of-means estimator is given by
[TABLE]
with
[TABLE]
where is the number of sampling trials required, and . Then,
[TABLE]
In App. G we show that is upper-bounded as
[TABLE]
with and defined in Sec. III.3.1. Hence,
[TABLE]
which is the sample complexity obtained in Theo. 4.
As for the cubic phase gate, the median-of-means estimator is
[TABLE]
with
[TABLE]
where is the number of measurements required and . Moreover,
[TABLE]
We let the demonstration of how to upper-bound to App. H. Here, we present the results:
[TABLE]
where and were defined in Sec. III.3.2. Therefore,
[TABLE]
which is the sample complexity displayed in Theo. 5.
Appendix B Fidelity witness of cubic phase gate
The action of the target gate on a given single-mode coherent state is such that
[TABLE]
where , and were defined in the main text. The fidelity between and the output of an experimental channel is
[TABLE]
where we have used the cyclicity of the trace operation again. We then have
[TABLE]
where the witness was defined in (25). Moreover, from Baker-Hausdorff Lemma we see that . This leads to
[TABLE]
Therefore,
[TABLE]
where we have used the fact that . Then, we arrive at (26) by substituting (95) into (93).
Appendix C Scheme for cubic-phase-gate certification
It is useful to write the observables that appear on the first expectation value on the r.h.s. of (26) as
[TABLE]
where we have used the relations
[TABLE]
Thus, substituting (96) into (26), we have
[TABLE]
where we have used the relation . As in (54), if we encode all observables that appear in (98) in a set and all their respective coefficients in a set , then we arrive at
[TABLE]
We get the average channel-fidelity witness (IV.3.2) by substituting (99) into (27).
Appendix D Scheme for Gaussian state certification
Following the definition of given in (3), it is indispensable to separate the elements into two categories Aspuru-Guzik and Walther (2012); Aolita et al. (2015):
: Single-mode observables and , plus two-body observables , , and that can be measured by simultaneously homodyning modes and independently. Here, can be expressed as
[TABLE]
where is the possible measured eigenvalue, and . 2. 2.
: Single-mode observables of the form . As single-mode field quadratures and do not commute, it is necessary to indirectly estimate this kind of bilinear observable by using the relation
[TABLE]
To estimate the first term on the r.h.s of (101), a certifier can homodyne, in a single setting, each mode independently in a rotated quadrature , while and can be estimated as mentioned in the category above. Thus, in this case, we can write
[TABLE]
where is the eigenvalue of observable , and .
Appendix E Upper bounds in Gaussian-state witnesses
E.1 First Moments
Here we show that can be expressed as the product of the Frobenius norm of as well as the Euclidean norm of and the trace of :
[TABLE]
From (3), we can write as
[TABLE]
where is maximum single-mode energy of a preparation state among all modes. Moreover, the combination of (5) and (6) with the Cauchy-Schwarz inequality Steele (2004) leads to
[TABLE]
where , and with being the maximum single-mode squeezing parameter among all modes of a target state . Therefore, substituting (104) and (105) into (103), we arrive at (68).
E.2 Second Moments
The demonstration of the upper bound of is straightforward:
[TABLE]
where was defined in the main text, and we have used (105) in the last step.
Appendix F Upper bounds in Gaussian-channel witnesses
Analogously to App. E, we start upper-bounding from
[TABLE]
Respectively, and are upper-bounded by (104) and (105). The squared norm can be upper-bounded as
[TABLE]
where is the -th maximum single-mode energy as a function of the input states , and
[TABLE]
is the maximum single-mode energy among all modes and input states. Substituting (104), (105) and (108) into (107), and considering normalized distributions, we arrive at (76).
Regarding , we use (106) to start from
[TABLE]
Consider that
[TABLE]
with being the maximum expectation value w.r.t. , among all and . Then, substituting (105) and (111) into (110), we get (80).
Appendix G Upper bounds in coherent-state-amplifier witness
From (46) to (52), we can write as
[TABLE]
We can upper-bound as
[TABLE]
We can also write the bound
[TABLE]
then it is straightforward to see that
[TABLE]
Appendix H Upper bounds in cubic-phase-gate witness
From (54) to (60), we can write as
[TABLE]
Again, we can upper-bound as
[TABLE]
We can also see that
[TABLE]
where was defined in (28). Then, substituting (117) and (118) into (116), we have
[TABLE]
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1Chuang and Nielsen (1997) I. L. Chuang and M. A. Nielsen, Journal of Modern Optics 44 , 2455 (1997) . · doi ↗
- 2Poyatos et al. (1997) J. F. Poyatos, J. I. Cirac, and P. Zoller, Phys. Rev. Lett. 78 , 390 (1997) . · doi ↗
- 3Mohseni et al. (2008) M. Mohseni, A. T. Rezakhani, and D. A. Lidar, Phys. Rev. A 77 , 032322 (2008) . · doi ↗
- 4Bendersky and Paz (2013) A. Bendersky and J. P. Paz, Phys. Rev. A 87 , 012122 (2013) . · doi ↗
- 5Namiki (2016) R. Namiki, Phys. Rev. A 93 , 052336 (2016).
- 6López et al. (2010) C. C. López, A. Bendersky, J. P. Paz, and D. G. Cory, Phys. Rev. A 81 , 062113 (2010) . · doi ↗
- 7Schmiegelow et al. (2011) C. T. Schmiegelow, A. Bendersky, M. A. Larotonda, and J. P. Paz, Phys. Rev. Lett. 107 , 100502 (2011) . · doi ↗
- 8Altepeter et al. (2003) J. B. Altepeter, D. Branning, E. Jeffrey, T. C. Wei, P. G. Kwiat, R. T. Thew, J. L. O’Brien, M. A. Nielsen, and A. G. White, Phys. Rev. Lett. 90 , 193601 (2003) . · doi ↗
