Noise Transfer Approach to GKP Quantum Circuits
Abstract
The choice between the Schrödinger and Heisenberg pictures can significantly impact the computational resources needed to solve a problem, even though they are equivalent formulations of quantum mechanics. Here we present a method for analysing Bosonic quantum circuits based on the Heisenberg picture that allows, under certain conditions, a useful factoring of the evolution into signal and noise contributions, in a similar way as can be done with classical communication systems. We provide examples which suggest this approach may be particular useful in analysing quantum computing systems based on the Gottesman-Kitaev-Preskill (GKP) qubits.
I Introduction
A useful technique for analysing quantum optical experiments based on Gaussian operations and measurements is the quantum noise transfer approach BAC19 which is characterised by the displacement vector and the covariance matrix WEE12 . Working in the Heisenberg picture, the signals (the displacements) and the quantum noise (the covariances) can be tracked separately, in much the same way that signals and noise are tracked, for example, in classical communication systems. A key step in such an analysis is the definition of quadrature fluctuation operators via:
(1) |
where and are real numbers representing the average values of the position and momentum quadrature displacements respectively. Also, and are the position and momentum operators for the mode in question, respectively. We use the convention that the annihilation operator for the mode is given by which can then be expanded as:
(2) |
and the classical signals (displacements) and the quantum noise operators can be independently tracked in the Heisenberg picture through various interactions and measurements in an intuitive way. In an experimental setting the noise properties of the input states can be measured directly by subtracting off the known signal and evaluating the variance of the quantum fluctuations. For example the position quadrature variance is:
(3) |
The aim of this paper is to develop an analogous approach that can describe the evolution of non-Gaussian states, such as cat states RAL03 or Gottesman-Kitaev-Preskill (GKP) states GOT01 , in a similar way. Such states are formed from a superposition of differently displaced states and hence the signal is multi-valued.
In the next section we will introduce our new decomposition into signal and fluctuation operators and show how noise properties can be analysed independently of the signal value provided certain conditions are met. We illustrate this with cat state and GKP state examples. In Section 3 we consider the Heisenberg Picture evolution of our operators with loss and feedforward as examples. In Section 4 we apply our formalism to GKP states and analyse a teleportation channel which includes the GKP error correction protocol. The goal is to evaluate the noise transfer properties of the circuits based on the first and second moments of the resource states (and the properties of the feedforward measurements) – thus providing an alternative method for analysing quantum computing circuits based on GKP qubits. Current approaches to GKP circuit evaluation are mostly based on Schrödinger picture analysis. Noise can be added to ideal GKP states MEN14 and the logical states tracked through a modular sub-system decomposition PBM20 which can be generalised to finite energy GKP states TZI20 ; BOU21 . Exact numerical models incorporating noisy elements have also been explored HIL22 . In contrast the method presented here differs by describing a way to empirically quantify the noise and signals independently and then track them through circuits via their Heisenberg evolution, offering potential advantages in the intuitive nature of the approach and the tractability of the calculations in the presence of multiple noise sources. We discuss our results and conclude in Section 5.
II Signal and fluctuation Operators
We start by defining the operators and in an analogous way to Eq.1 via:
(4) |
Because the displacements are multi-valued they must be represented by operators, specifically and . We characterise and by their moments over restricted domains around their expected displacement values in the position and momentum quadratures respectively. Specifically, given is the expectation value for values falling in the th position domain, we require that . We further require that , meaning that has zero variance in each domain. This implies . Similarly we require where is the expectation value for values falling in the th momentum domain, and hence . Assuming we have position domains and momentum domains, the full expectation values are given by
(5) | |||||
with the probability of finding a value in the th domain and the probability of finding a value in the th domain.
Our mode operators are now of the form:
(6) |
The noise properties of the input states can be measured directly by subtracting off the closest expected displacement, evaluating the variance of the quantum fluctuations around this expected value, and taking the weighted average over all expected values. These quantities can then be related to and in the following way. We can write the average position quadrature variance described above as:
This can be evaluated via
(8) |
where we have used:
(9) | |||||
and the integral is taken over the corresponding th domain whilst is the position wavefunction of the state . Similarly, the momentum quadrature variance can be written:
This can be evaluated via
(11) |
where the integral is taken over the corresponding th domain whilst is the momentum wavefunction of the state .
If the signal peaks are well localized in their expected domains then Eqs 8 and 11 will well represent the average spread of the signal peaks. Assuming Gaussian statistics we can then estimate the probability that a quadrature measurement will find a result in their expected domain via
(12) |
where is the width of the domains and .
The interpretation becomes more subtle if the variances approach the width of the domains. If this happens the probability distribution within the domain will be “clipped”, and will be changed relative to its “unclipped” value. We will observe this effect in our examples.
The next two subsections will examine the examples of cat states and GKP states. ‘Cat state’ usually refers to a superposition of differently displaced Gaussian states. The case we consider here is a symmetric superposition of 2 coherent states around the origin. The GKP state is a particular superposition of multiple displaced Gaussian states that has the feature that if qubit values “0” or “1” are encoded by the displacement values in the q-quadrature then the p-quadrature encodes the “+” and “-” diagonal states respectively. This nice feature means that a logical Hadamard gate can be enacted on the encoded states by a simple phase rotation. The specific GKP state construction we use here is a multiple, weighted superposition of squeezed states, displaced (and squeezed) in the q-direction. Example quadrature probability distributions for cat and GKP states are shown in Figs 1, 2 and 3.



II.1 Cat States
Let us us begin with perhaps the simplest non-trivial example; a superposition of two displacements of the vacuum. In particular let us consider the cat state given by:
(13) |
where is a normalization constant and are coherent states with real displacements . Consider the position quadrature variance. The wave function is
(14) |
We can take the domain for as and for is , leading to the 2 corresponding values for as
(15) | |||||
where the approximate equalities are satisfied for . The probabilities are given by
(16) | |||||
Substituting these results into our expressions for we find that provided then . This corresponds to our intuitive picture of the cat state as comprising two peaks at with widths of one unit of quantum noise. However, if falls significantly below the distributions in the two domains are only weakly peaked (if at all) and highly skewed and clipped, so the decomposition into a discrete superposition is no longer useful. This is illustrated in Fig.4.

Even though the superposition of displacements is only explicit in the position quadrature, interference effects also lead to distinct peaks in the momentum quadrature, around which we can define domains. The momentum wave function is:
(17) |
so we can define the expected value in the th domain as
(18) |
with corresponding probability
(19) |
where . Substituting these results into our expressions for we find the variances scale inversely with . This is unsurprising given the size of the domains are inversely proportional to . In particular, the ratio of domain size (equivalently peak separation) to standard deviation, , is roughly constant () for .
II.2 GKP States
We now consider the case of GKP states. A physical GKP “0” state has quadrature outcome probabilities with peaks around the values , where is any integer and the peaks are weighted by a suitable envelope function. The corresponding GKP “1” state has quadrature outcome probabilities peaked around the values , similarly weighted. The quadrature outcome probabilities for these computational states have peaks at both the “0” and “1” positions., i.e. at values . This is consistent with the observation that a logical Hadamard gate should be implemented by a delay, which takes and . Thus, the logical values of the quadrature for the “0” and “1” computational basis states correspond to “+” and “-” dual basis states, respectively.
We will consider a physical example of such a GKP state to see what the noise properties are for such a state. One such example is the squeezed state superpositions TZI20 :
where is a normalization factor and is a squeezed state with squeezed variance . The value of determines the logical state, i.e. is the logical “0” state and is the logical “1” state. We can evaluate the noise properties of these initial states using Eq. 8 and by defining the domains via: and similarly for .
In Fig.5 we plot as a function of for the computational states and the diagonal states. We find that provided then to an excellent approximation
(21) |
This is true for all logical states. This indicates that, provided the squeezing is sufficiently strong, these states behave as hoped with the superposed “spikes” giving the logical value, modulated by Gaussian noise with a variance equal to the squeezing, in both quadratures. Alternatively, given that this is an expected result for GKP states GOT01 , one can take this as indicating that our Heisenberg approach can successfully factor the operators into signal and noise parts in a consistent way for such states. However, at lower levels of squeezing (i.e. larger ) state-dependent effects are seen. For the computational states this mostly occurs due to “clipping” of the distribution by the domain boundary such that the calculated no longer aligns well with the actual variance around the spikes. On the other hand the deviation of the diagonal states from the expected behaviour is predominantly due to our approximate GKP states no longer exhibiting the expected noise symmetry between the spikes in different quadratures.

III Operator Evolution and Feedforward
Recall that our mode operators can be written in the form of Eq. 6. Using operators of this kind to represent the various input modes that interact in an optical circuit we can proceed to evolve them through beam-splitters, squeezers, and other quadratic unitaries (linear in the mode operators) in the usual way, whilst keeping track of their noise and signal properties. For example, suppose our initial mode, Eq. 6, passes through loss, such that only the fraction is transmitted. Our output mode is
(22) |
where and are the position and momentum quadrature operators of the vacuum mode introduced by the loss, respectively. By inspection we see that the expected signal values (and hence corresponding domain boundaries) have been scaled by the factor . On the other hand the variances around these expected values are now
and
where we have used that the vacuum noise is independent and has unit variance. Considering our cat state example from the previous section we see that there is no effect on the position quadrature variance as we still have . The detrimental effect of loss on position only arises from the scaling down of the expected values closer to the domain boundary at . On the other hand, given that for , , the effect on the momentum quadrature is a significant broadening of the peaks for relatively small amounts of loss. This combined with the reduction in the peak separation rapidly washes out the interference fringes entirely, especially for . This illustrates the well-known fragility of cat states to loss.
As well as optical unitary evolution, many quantum circuits involve quadrature measurements followed by feedforward to other modes in the circuit. In particular this can occur in teleportation scenarios arising in error correction GLA06 or cluster state MEN06 protocols, or both MEN14 . Feed forward of quadrature measurements can be represented in the usual way BAC19 by feeding forward some function of the measurement operator. Thus a typical output mode after a teleportation type circuit might be written formally as:
(25) |
where feedforward from an earlier position measurement () and an earlier momentum measurement (), have been incorporated. In standard teleportation, the “” functions would be linear functions of the measurement operators, i.e. and . However, in a situation where we can usefully write our measurement operators as and , we can perform error correction by shifting to the nearest “ideal” result in each domain, represented by or . Hence we now have the highly non-linear feed forward functions and and our output mode is now written formally as:
(26) |
To illustrate feed forward with error correction we will consider a simple GKP circuit.

IV GKP Error Correction
Another useful feature of GKP states is that small displacements of the state, as will naturally arise in the presence of loss or thermal noise, can be corrected by a straightforward circuit. This process is often referred to as GKP error correction. In the following we will analyse such a GKP error correction circuit.
The circuit we will consider is shown in Fig.6. It is an example of a continuous variable CZ teleportation circuit with error correction, where we assume both resource states are approximate GKP states and we neglect loss. We will label the approximate GKP input and two resource states with the subscripts “” respectively. The resource states in modes “2” and “3” are prepared in the logical “+” state, whilst the input in mode “1” is in an arbitrary GKP logical state.
IV.1 Ideal Case
The action of a continuous variable CZ gate is to displace the value of the quadrature of one mode by the value of the quadrature of the other mode, whilst leaving the quadratures unchanged MEN06 . Hence, for the circuit of Fig.6 the quadratures will evolve such that , and . Using these expressions, and the error correction feed forward relations previously introduced, we can write the expression for the output mode as:
(27) | |||||
where we have used that
(28) |
and therefore
(29) |
If we assume that the noise terms are sufficiently small that it is unlikely that the noise causes measured values to leave their nominal domains, then we can approximate the feedforward terms as
(30) |
and hence
(31) |
The logical state of the output matches that of the input as seen from the output signal terms . Notice that because the resource states are prepared in the “+” state, the term in the output signal has a known logical “0” value and so its addition to the output does not change the overall logical value. Three noise terms are also added to the output.
The circuit can be iterated by taking as the mode 1 of the next circuit and introducing new resource states at mode 2 and mode 3. The output mode and variances separate conveniently into deterministic displacement terms and noise terms (the “” terms). The error correction feature of the circuit can be seen from the fact that none of the noise terms in the output depend on the input. That is, even though there is still noise on the output, the noise does not “build up” as we iterate but rather is “refreshed” from new resource states used at each round.
IV.2 Loss Tolerance

We now consider the situation depicted in Fig.7 in which loss effects the input state and the resource states and all the elements in the error correction circuit. We use our Heisenberg approach to demonstrate that the error correction properties of the circuit are loss tolerant, provided we add an additional loss element and a linear amplifier in appropriate positions on the third rail.
As shown in Fig.7 loss is added to the input and resource states. For simplicity we use the same beamsplitter transmission value, , for all the modes. We model loss in the CZ gates by placing beamsplitters with transmission after each gate. Similarly we model detection inefficiency by placing beamsplitters with transmission before the detectors and loss in the displacement operations by placing a beamsplitter of transmission before the displacements. In order to balance the loss, the experimenter should purposely add an additional beamsplitter with transmission to the third mode before the CZ gate. Finally, to ensure the output is balanced and centred in the domains a linear amplifier of gain is applied to the third rail after the CZ gate.
To see how this works we first write the evolved operators describing the outcomes at the first and second momentum measurements as:
(32) | ||||
(33) |
Here the and are vacuum operators for the momenta and position respectively arising from the input mode and gate loss. The are vacuum operators for the momenta arising from detector inefficiency.
Consider the first momentum measurement. Using the error correction strategy and a feedforward gain of we find the feedforward operators are approximately:
(34) |
This assumes that the variance of the feedforward operators:
(35) |
is sufficiently small.
Now we consider the second momentum measurement. Using the error correction strategy and a feedforward gain of we find the feedforward operators are approximately:
(36) |
This now assumes that the variance of the feedforward operators:
(37) |
is sufficiently small.
Finally we can consider the third mode. Its momentum operator directly after the CZ gate is given by:
(38) |
After linear amplification with , passing through the displacement loss and subsequent displacement by and , the output momentum operator of the third mode is given by:
(39) |
Similarly we can write the final position operator for the third mode as:
(40) |
and hence we can write:
(41) |
Although additional noise is added compared with Eq. 31 the error correction feature of the circuit can still be seen from the fact that none of the noise terms in the output depend on the input. Again, even though there is still noise on the output, the noise does not “build up” as we iterate but rather is “refreshed” from new resource states at each round. Of course the extra noise introduced will need to be small and may require stronger squeezing of the source states.
IV.3 Logical Errors
So far we have assumed that the measurement and feedforward always corrects to the right ideal solution, for example as in Eq.IV.1. However, as we saw from Eq.12, even if the peaks are well-localized there is a non-zero probability, , that they will fall outside their nominal domain. If this happens, the wrong displacement will be fed forward. For example, for GKP states if we wrongly identify a measurement falling on the right side of a peak with the neighbouring domain the ideal “spikes” will be shifted by . Similarly, if we wrongly identify a measurement falling on the left side of a peak with the neighbouring domain the ideal “spikes” will be shifted by . After feedforward this will lead to bit-flip and/or phase flip errors in the output state.
Given this, a better approximation for the feedforward operators is:
(42) |
where the are error operators with discrete outcomes . If there is no error. This occurs with probability . Errors happen when and these occur with probabilities . The variances are the total noises on the detected quadratures, for example in the ideal case, from Eq.IV.1, we have and . The output operator can then be written more accurately as:
(43) | |||||
Notice these mistakes do not change the noise properties, however now we can also track the signal errors as the system is iterated. A logical error encoding and correction scheme is required in order to correct the signal errors GLA06 . We believe that such multi-mode codes could also be tractable to analyse using our approach, however the complexity of the error tracking required may become more challenging.
V Discussion and Conclusion
In this paper we have presented signal and noise analysis of both cat states and GKP states to highlight the generality of our approach. In particular the analysis of the preceeding section demonstrates the power and relative simplicity of this approach while also highlighting the necessity for the total noise variances to be small. Given we are grouping noise from several sources together and associating it with arbitrary logical states, it is important that we are in a regime where the noise affects different states in the same way. Fig.5 shows that this is true for GKP states provided the squeezing is of order 10 dB or higher, as was observed previously. Whilst this may seem a bit restrictive, it should be remembered that for large quantum circuits to perform faithfully they inevitably need to operate in this high fidelity regime anyway MEN14 ; BAR19 . This also applies to quantum communication applications SCH24 . Hence, we expect our approach to prove useful in tracking the flow of noise, signal and errors in quantum computing circuits employing GKP and other Bosonic qubits. Finally, we have demonstrated the power these techniques can have to develop new schemes, with a loss tolerant generalisation of the simple teleportation circuit considered allowing for general loss rates for each component.
VI Acknowledgement
TCR acknowledges useful discussions with Eli Bourassa, Ilan Tzitrin, Rafael Alexander and Joshua Guanzon. This work was partially supported by the Australian Research Council Centre of Excellence for Quantum Computation and Communication Technology (Project No.CE110001027). SNS was supported by the Sydney Quantum Academy, Sydney, NSW, Australia.
References
- (1) Hans Bachor and Timothy C. Ralph, A Guide to Experiment in Quantum Optics, (Wiley, Third Edition 2019).
- (2) Christian Weedbrook, Stefano Pirandola, Raul Garcıa-Patron, Nicolas J. Cerf, Timothy C. Ralph, Jeffrey H. Shapiro, Seth Lloyd, Gaussian Quantum Information, Rev. Mod. Phys. 84, 621 (2012).
- (3) T.C.Ralph, A.Gilchrist, G.J.Milburn, W.J.Munro and S.Glancy, Quantum Computation with Coherent Optical States, Phys. Rev. A 68, 042319 (2003).
- (4) D. Gottesman, A. Kitaev, and J. Preskil, Encoding a qubit in an oscillator, Phys. Rev. A 64, 012310 (2001).
- (5) Nicolas C. Menicucci, Fault-Tolerant Measurement-Based Quantum Computing with Continuous-Variable Cluster States, Phys. Rev. Lett. 112, 120504 (2014).
- (6) Giacomo Pantaleoni, Ben Q Baragiola, and Nicolas C Menicucci, Modular bosonic subsystem codes, Phys. Rev. Lett. 125, 040501 (2020).
- (7) Ilan Tzitrin, J. Eli Bourassa, Nicolas C. Menicucci, and Krishna Kumar Sabapathy, Progress towards practical qubit computation using approximate Gottesman-Kitaev-Preskill codes, Phys.Rev.A, 101, 032315 (2020).
- (8) J Eli Bourassa et al., Blueprint for a scalable photonic fault-tolerant quantum computer, Quantum 5, 392 (2021).
- (9) Timo Hillmann, Fernando Quijandría, Arne L. Grimsmo, and Giulia Ferrini, Performance of Teleportation-Based Error-Correction Circuits for Bosonic Codes with Noisy Measurements, PRX Quantum 3, 020334 (2022).
- (10) S. Glancy and E. Knill, Error analysis for encoding a qubit in an oscillator, Phys.Rev.A, 73, 012325 (2006).
- (11) Nicolas C. Menicucci, Peter van Loock, Mile Gu, Christian Weedbrook, Universal Quantum Computation with Continuous-Variable Cluster States, Timothy C. Ralph, Michael A. Nielsen, Phys. Rev. Lett. 97, 110501 (2006).
- (12) Ben Q. Baragiola, Giacomo Pantaleoni, Rafael N. Alexander, Angela Karanjai, and Nicolas C. Menicucci, All-Gaussian Universality and Fault Tolerance with the Gottesman-Kitaev-Preskill Code, Phys. Rev. Lett. 123, 200502 (2019).
- (13) Frank Schmidt, Daniel Miller, and Peter van Loock, Error-corrected quantum repeaters with Gottesman-Kitaev-Preskill qudits, Phys. Rev. A 109, 042427 (2024).