Continuous-Variable Quantum Computation
Continuous-variable quantum computation processes bosonic modes through their quadratures, using operations such as displacements, squeezing, mode coupling and measurement. Gaussian states and operations form a useful tractable sector: first and second moments describe the quantum state completely. Universal polynomial computation needs resources outside that sector, together with assumptions about available controls, energy and approximation accuracy.
A mode is an infinite-dimensional system, not an unlimited store of freely readable information. Real inputs have finite energy, measurements have finite resolution, and a numerical cutoff must be justified. Bosonic and encoded computation models instead studies finite logical systems encoded inside oscillators.
Helpful background. Continuous-variable systems introduces quadrature and Fock representations. Gaussian states and Wigner functions explains covariance matrices and the uncertainty condition.
Quadratures, energy and finite cutoffs
Section titled “Quadratures, energy and finite cutoffs”This page uses and
Thus and the vacuum variances are . A covariance quoted in a convention with vacuum variance or must be rescaled before it is combined with formulas here.
Order the quadratures of modes as
with
The first moments and covariance are
and a physical covariance satisfies
These moment data characterize a Gaussian state, but not a general state. Higher moments can distinguish two non-Gaussian states with identical and .
Quadratures, number operators, and polynomial Hamiltonians are unbounded. Use a common domain for the products appearing in a calculation, and a self-adjoint generator for each unitary evolution. The Schwartz space suffices for the Gaussian and cubic-phase examples below. Generalized quadrature eigenvectors and ideal homodyne projectors belong to a rigged-Hilbert-space description; infinitely squeezed cluster states and ideal grid combs are not normalizable finite-energy preparations.
For finite second moments, the total number operator and its expectation are
Mean energy controls a useful but limited cutoff bound. If projects onto total photon numbers , Markov’s inequality gives
This bounds discarded state weight. It also yields a useful state comparison: if the actual tail weight is and , then
One way to see the bound is to project a purification: its normalized overlap with the original is , giving pure-state trace distance ; partial trace cannot increase that distance. Applying the same channel and measurement to both states then changes any output event probability by at most . This does not bound the error of a different, truncated propagator, or the expectation of an unbounded observable.
Gaussian gates and channels
Section titled “Gaussian gates and channels”A Gaussian unitary has affine Heisenberg action
It propagates moments by
Composition follows physical time order. If map 1 is followed by map 2, then
For one mode, our rotation matrix is the Heisenberg action of . It and a -squeezer are represented by
For two modes, the controlled-phase gate
leaves both quadratures fixed and sends
Displacements, rotations, squeezers, passive mode mixing, and controlled-phase gates all have affine symplectic descriptions. Their physical costs can differ greatly.
A Gaussian channel has affine data :
Complete positivity in this convention requires
Gaussian Channels explains the condition and its dilation. For vacuum pure loss, and , giving . The vacuum-noise term is essential for complete positivity.
Measurements and conditional states
Section titled “Measurements and conditional states”Ideal homodyne at phase measures . Its outcome has a density . A measurable bin has probability ; a density at one real value is not an event probability. Homodyne and heterodyne detection explains the physical measurement.
For Gaussian inputs and fixed Gaussian measurements, the conditional mean is affine in the outcome and the conditional covariance does not depend on it. For example, write a joint Gaussian covariance and mean as
and measure all commuting quadratures in a chosen measured vector with invertible covariance . The unmeasured subsystem has
Here denotes the measured quadrature submatrix, not both conjugate quadratures measured sharply on one mode. Additional Gaussian detector noise is included in the measured covariance.
Affine displacement feedforward, with fixed covariance-transforming operations, preserves a joint Gaussian description. Arbitrary outcome-dependent rotations, squeezers or nonlinear displacements need not leave the outcome-forgotten state Gaussian. For instance, displacing a fresh vacuum by or according to the sign of an independent homodyne result produces a two-component Gaussian mixture. Its fourth cumulant is , nonzero for , even though each selected branch is Gaussian.
This does not automatically make the adaptive process hard to simulate: one may sample a record and propagate its conditional Gaussian state. But the averaged state can no longer be represented by a single covariance matrix. Selecting a branch, forgetting its outcome, and accepting a finite postselection window are different operations.
Gaussian closure and a cubic-phase example
Section titled “Gaussian closure and a cubic-phase example”Gaussian preparation, fixed Gaussian gates and channels, Gaussian measurements and affine displacement feedforward admit efficient classical propagation under finite, efficiently computable descriptions and controlled precision. Bartlett and colleagues give sufficient simulation conditions; Mari and Eisert give related positive-Wigner conditions. These are scoped simulation results. Gaussian states can still be entangled, and positivity of a Wigner function alone is not an unconditional guarantee of efficient simulation for every operation set or encoding.
The cubic-phase unitary
leaves the affine symplectic class. On the Schwartz domain these identities follow by differentiating the phase in the position representation. Photon counting also supplies a non-Gaussian measurement. The Lloyd–Braunstein construction combines suitable nonquadratic interactions with Gaussian controls to generate polynomial Hamiltonians through commutators; it additionally needs appropriate strengths, signs or inverses and a valid approximation scheme. Presence of any one non-Gaussian element is not itself a complete universality proof or efficient compiler.
Apply to vacuum. Its normalized wavefunction is
Although its position density is unchanged, its momentum distribution is not Gaussian. Direct differentiation with gives
Thus , a non-Gaussian witness. The covariance is , and the mean photon number is . The output is pure because the operation is unitary, but , whereas a pure one-mode Gaussian state has determinant . A Gaussian state with these same moments would therefore be a different, mixed state. Higher moments carry information lost by a covariance-only description.
Cluster nullifiers and finite squeezing
Section titled “Cluster nullifiers and finite squeezing”Let be a real symmetric weighted adjacency matrix with zero diagonal. A nonzero diagonal would require additional single-mode quadratic phase gates. Prepare independently momentum-squeezed modes and apply the commuting entanglers
The output quadratures satisfy
The corresponding nullifiers are
If the input modes are independent and momentum squeezed by , then
and distinct nullifiers have zero covariance. The formal zero-nullifier graph state requires and is not a normalizable finite-energy state. Finite nullifier variance is a logical noise source, not merely an experimental inconvenience.
Continuous-variable measurement-based computation consumes such a graph by homodyne or non-Gaussian measurements, propagates real records, and applies feedforward or a tracked displacement frame. A Gaussian cluster with homodyne and affine feedforward implements Gaussian logical transformations. Universal CV cluster computation needs a declared non-Gaussian state, gate, or measurement and a specified approximation criterion.
Two coupled squeezed modes
Section titled “Two coupled squeezed modes”Take two independent momentum-squeezed vacua with , so
Apply . In the order ,
One checks . The symplectic eigenvalues remain , and , as required for this pure Gaussian state. Coupling increases the total mean photon number from to .
The nullifiers and commute. They have variance each and zero covariance. This does not require simultaneous sharp measurement of both quadratures of either individual mode: one possible joint measurement first undoes the controlled-phase gate and then homodynes the two input momenta. It consumes the tested copy and requires that additional inverse interaction. Separate local measurements can estimate individual nullifier statistics on different copies, but do not supply paired joint outcomes by themselves.
The two-mode example correlates with . Contours satisfy and ; the difference has standard deviation . This is a two-variable marginal, not the full four-quadrature state.
Because the joint nullifier distribution is Gaussian with diagonal covariance, its two outcomes are independent. A joint window has probability
This tests the prepared resource state; it is not a logical algorithm’s success probability or an error-correction threshold.
Approximation, noise and computational cost
Section titled “Approximation, noise and computational cost”Finite squeezing uses finite energy. For momentum squeezing, , while . The variance reduction relative to vacuum is decibels. Loss adds vacuum fluctuations and changes both resource-state correlations and any induced logical channel.
A finite cutoff cannot approximate oscillator operations uniformly on all states. One channel metric restricts the input mean occupation:
The reference system allows entangled inputs; is measured here in total photon-number units. This definition sets a comparison task, not an automatic convergence theorem. A concrete algorithm still needs a target, an input restriction, an error tolerance and a bound or convergence study. Unbounded-generator synthesis does not inherit a finite-dimensional Solovay–Kitaev estimate unchanged.
Costs include mode count, squeezing and energy, Gaussian operations, non-Gaussian preparation yield, measurement resolution, feedforward and postselection. Gaussian gate counts alone do not give laboratory runtime. Continuous-variable platforms treats sources, loss and detectors. GKP codes explains encoded qubit protection; an unencoded non-Gaussian gate is not already fault tolerant.
Exercises
Section titled “Exercises”Translate a Quadrature Convention
Section titled “Translate a Quadrature Convention”An author uses , vacuum covariance , and reports
Translate the state into this page’s convention, compute its mean photon number in both conventions, and identify one convention-invariant squeezing quantity.
Solution
The conventions are related by
First moments scale once and covariances twice:
The vacuum covariance correspondingly becomes . In the first convention,
In the page convention,
The ratio of a quadrature variance to the vacuum variance is invariant. Therefore a squeezing value in decibels is also invariant after the state and vacuum reference are translated together. A coefficient multiplying an unbounded gate generator would need its own dimensional translation and is not inferred here.
Compose an Affine Gaussian Circuit
Section titled “Compose an Affine Gaussian Circuit”Begin in vacuum. Apply a -squeezer with , then rotate by using
and finally displace by . Find the final mean, covariance, purity determinant, mean photon number, and probability that an ideal -homodyne result lies in .
Solution
The squeeze matrix is
The total linear map is because the squeeze occurs first. The input mean is zero, and the final displacement occurs last, so
Starting from ,
Its determinant is , as expected for a pure one-mode Gaussian state. The energy is
The outcome is normal with mean and variance . The interval is symmetric about the mean, so
Reversing the matrix product would describe a different physical circuit.
Derive Three-Mode Line-Cluster Nullifiers
Section titled “Derive Three-Mode Line-Cluster Nullifiers”Prepare three independent momentum-squeezed vacua with . Apply unit-weight controlled phases on edges and . Derive the three nullifiers, their covariance, the input and output mean photon numbers, and the preparation operations.
Solution
The two entanglers commute because they are functions of quadratures. Their Heisenberg action is
while every is unchanged. Hence
The input momenta are independent, so
Each input mode has mean photon number , giving
For these inputs, each unit edge adds one mean photon. With two edges,
The abstract preparation uses three modes, three squeezers, and two controlled-phase gates. It has no non-Gaussian resource and does not by itself implement a universal computation.
Propagate a Squeezed State through Pure Loss
Section titled “Propagate a Squeezed State through Pure Loss”A zero-mean one-mode state has . Send it through a vacuum pure-loss channel with transmissivity . Find the output covariance, determinant, mean photon number, and remaining squeezing.
Solution
For vacuum pure loss,
Therefore
The determinant is
so the output is mixed. Its mean photon number is
The final variance remains below the vacuum value , so some squeezing survives. The vacuum environment supplies the added noise; the mean occupation is reduced by the factor .
Separate Gaussian Closure from Universality
Section titled “Separate Gaussian Closure from Universality”Classify the following three model claims:
- Gaussian input states, Gaussian gates and channels, homodyne with fixed settings, and affine displacement feedforward.
- The same model with photon counting added.
- Gaussian controls plus an available cubic interaction.
Explain whether each model remains within Gaussian closure, and what additional assumptions a universality claim needs.
Solution
The first model remains in Gaussian closure. With efficiently computable parameters and controlled arithmetic precision, its means, covariances and Gaussian outcome distributions admit efficient classical propagation. This does not make the states classical, but the declared operation set is not universal for arbitrary continuous-variable transformations.
Photon counting is a non-Gaussian measurement, so the second model leaves Gaussian closure. That fact alone does not give a universal gate set, efficient state preparation, useful postselection rate, fault tolerance, or an advantage result.
The third model meets the ideal algebraic premise used to generate polynomial Hamiltonians only after specifying available strengths, signs or inverses, common domains, energy-limited inputs, approximation accuracy, continuous-parameter precision, and commutator construction costs. Even then, algebraic universality does not supply an efficient compiler, physical implementation, or fault tolerance.
Bound a Fock-Space Truncation from Mean Energy
Section titled “Bound a Fock-Space Truncation from Mean Energy”Use the cubic-phase example’s output energy . Bound the probability outside a cutoff retaining levels through , and find the smallest cutoff parameter guaranteed by the same inequality to make the tail at most . Also bound the trace distance to the normalized projected state, and explain why this does not prove convergence of a truncated gate implementation.
Solution
Retaining levels means . Markov’s bound gives
For a guarantee of at most ,
so
For , the trace distance is at most . At , the same bound is , not . A sufficient choice for trace-distance tolerance is instead . These conservative guarantees compare the state with its normalized projection. Replacing the actual evolution by a truncated Hamiltonian is a separate approximation, requiring its own convergence check.
Count a Twenty-Five-Mode Cluster Wire
Section titled “Count a Twenty-Five-Mode Cluster Wire”Prepare a path of twenty-five independent momentum-squeezed vacua with , join nearest neighbors by unit-weight controlled phases, measure the first twenty-four modes by homodyne, and retain one output. Count the model-level resources and compute the energy before and after entangling.
Solution
The path has twenty-five vertices and twenty-four edges. Its preparation uses twenty-five modes and squeezers and twenty-four controlled-phase gates. A path’s edges can be colored with two colors, so the entangling preparation has two gate layers if disjoint gates are parallel and shared-mode gates are not. The measurement stage consumes twenty-four modes, produces twenty-four real records, and leaves one quantum output. A fully sequential dependency declaration permits worst-case adaptive measurement depth twenty-four.
Each squeezed input has mean photon number , hence
Every unit path edge adds one mean photon for these input variances. Therefore
There is no non-Gaussian resource. Because no injected logical input, homodyne angles, or feedforward gains were given, these counts license only a Gaussian resource state and its measurement count, not a particular logical channel or fidelity. Physical loss, detector bandwidth, feedforward latency and actual hardware parallelism have not been specified by these ideal counts.
Decode a thresholded homodyne result
Section titled “Decode a thresholded homodyne result”Start in vacuum, squeeze by , then displace it by . Measure and output bit one exactly when the result is nonnegative. Find the output probability, mean photon number before measurement and squeezing in decibels. Compare its error against target bit one with a Fock-tail bound at .
Solution
The operations give and . Hence and
The error is , also the total-variation distance to a point mass at one. The quantum state before measurement is Gaussian; thresholding its classical record produces a discrete Bernoulli output.
Its mean photon number is . The squeezing is dB. Markov’s bound gives , which concerns a different measurement and is not the decoded bit-error probability. A normalized projection at that cutoff has trace-distance bound ; this loose guarantee also differs from the actual ideal program error.
References
Section titled “References”- S. D. Bartlett, B. C. Sanders, S. L. Braunstein, and K. Nemoto, “Efficient Classical Simulation of Continuous Variable Quantum Information Processes,” Physical Review Letters 88, 097904 (2002), doi:10.1103/PhysRevLett.88.097904.
- M. Gu, C. Weedbrook, N. C. Menicucci, T. C. Ralph, and P. van Loock, “Quantum computing with continuous-variable clusters,” Physical Review A 79, 062318 (2009), doi:10.1103/PhysRevA.79.062318.
- S. Lloyd and S. L. Braunstein, “Quantum Computation over Continuous Variables,” Physical Review Letters 82, 1784–1787 (1999), doi:10.1103/PhysRevLett.82.1784.
- A. Mari and J. Eisert, “Positive Wigner Functions Render Classical Simulation of Quantum Computation Efficient,” Physical Review Letters 109, 230503 (2012), doi:10.1103/PhysRevLett.109.230503.
- N. C. Menicucci, P. van Loock, M. Gu, C. Weedbrook, T. C. Ralph, and M. A. Nielsen, “Universal Quantum Computation with Continuous-Variable Cluster States,” Physical Review Letters 97, 110501 (2006), doi:10.1103/PhysRevLett.97.110501.
- M. E. Shirokov, “Energy-constrained diamond norms and their use in quantum information theory,” arXiv:1706.00361 (2017), arXiv:1706.00361 — channel comparison with an input energy constraint.
- C. Weedbrook et al., “Gaussian quantum information,” Reviews of Modern Physics 84, 621–669 (2012), doi:10.1103/RevModPhys.84.621.