2,751 research outputs found
Graphical calculus for Gaussian pure states
We provide a unified graphical calculus for all Gaussian pure states,
including graph transformation rules for all local and semi-local Gaussian
unitary operations, as well as local quadrature measurements. We then use this
graphical calculus to analyze continuous-variable (CV) cluster states, the
essential resource for one-way quantum computing with CV systems. Current
graphical approaches to CV cluster states are only valid in the unphysical
limit of infinite squeezing, and the associated graph transformation rules only
apply when the initial and final states are of this form. Our formalism applies
to all Gaussian pure states and subsumes these rules in a natural way. In
addition, the term "CV graph state" currently has several inequivalent
definitions in use. Using this formalism we provide a single unifying
definition that encompasses all of them. We provide many examples of how the
formalism may be used in the context of CV cluster states: defining the
"closest" CV cluster state to a given Gaussian pure state and quantifying the
error in the approximation due to finite squeezing; analyzing the optimality of
certain methods of generating CV cluster states; drawing connections between
this new graphical formalism and bosonic Hamiltonians with Gaussian ground
states, including those useful for CV one-way quantum computing; and deriving a
graphical measure of bipartite entanglement for certain classes of CV cluster
states. We mention other possible applications of this formalism and conclude
with a brief note on fault tolerance in CV one-way quantum computing.Comment: (v3) shortened title, very minor corrections (v2) minor corrections,
reference added, new figures for CZ gate and beamsplitter graph rules; (v1)
25 pages, 11 figures (made with TikZ
Noise analysis of single-qumode Gaussian operations using continuous-variable cluster states
We consider measurement-based quantum computation that uses scalable
continuous-variable cluster states with a one-dimensional topology. The
physical resource, known here as the dual-rail quantum wire, can be generated
using temporally multiplexed offline squeezing and linear optics or by using a
single optical parametric oscillator. We focus on an important class of quantum
gates, specifically Gaussian unitaries that act on single modes, which gives
universal quantum computation when supplemented with multi-mode operations and
photon-counting measurements. The dual-rail wire supports two routes for
applying single-qumode Gaussian unitaries: the first is to use traditional
one-dimensional quantum-wire cluster-state measurement protocols. The second
takes advantage of the dual-rail quantum wire in order to apply unitaries by
measuring pairs of qumodes called macronodes. We analyze and compare these
methods in terms of the suitability for implementing single-qumode Gaussian
measurement-based quantum computation.Comment: 25 pages, 9 figures, more accessible to general audienc
Truncated generalized averaged Gauss quadrature rules
Generalized averaged Gaussian quadrature formulas may yield higher accuracy than Gauss quadrature formulas that use the same moment information. This makes them attractive to use when moments or modified moments are cumbersome to evaluate. However, generalized averaged Gaussian quadrature formulas may have nodes outside the convex hull of the support of the measure defining the associated Gauss rules. It may therefore not be possible to use generalized averaged Gaussian quadrature formulas with integrands that only are defined on the convex hull of the support of the measure. Generalized averaged Gaussian quadrature formulas are determined by symmetric tridiagonal matrices. This paper investigates whether removing some of the last rows and columns of these matrices gives quadrature rules whose nodes live in the convex hull of the support of the measure
- …