The DOI matches its Crossref record; 9 of the 9 references it cites were found in a registry or an index.
Graphical calculus for Gaussian pure states
Open accessAbstract
We provide a unified graphical calculus for all Gaussian pure states, including graph transformation rules for all local and semilocal 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 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.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
A scheme for efficient quantum computation with linear optics
Knill, E., Laflamme, R., & Milburn, G. J. (2001) · Nature · doi:10.1038/35051009 · Cited by 5,880
Quantum information with continuous variables
Braunstein, S. L., & van Loock, P. (2005) · Reviews of Modern Physics · doi:10.1103/revmodphys.77.513 · Cited by 3,858
Unconditional Quantum Teleportation
Furusawa, A., Sørensen, J. L., Braunstein, S. L., Fuchs, C. A., Kimble, H. J., & Polzik, E. S. (1998) · Science · doi:10.1126/science.282.5389.706 · Cited by 3,005 · cited 2×
“Z 1 corresponds to the 9 Alternatively, the same state can be generated by interfering a ˆ q -squeezed state Z = ie 2 α with a ˆ p -squeezed state Z = ie − 2 α at a 50:50 beamsplitter [3, 47, 48]—i.e., by applying Eq.”
BackgroundInfluentialPersistent Entanglement in Arrays of Interacting Particles
Briegel, H. J., & Raussendorf, R. (2001) · Physical Review Letters · doi:10.1103/physrevlett.86.910 · Cited by 1,950 · cited 1×
“The invention of one-way quantum computing (QC) [1] launched an intensive research effort into this new method of QC that eliminates unitary evolution and relies solely on adaptive measurements on a highly entangled state of many qubits called a cluster state [2].”
Method(2008) · doi:10.1007/978-3-540-28574-8 · Cited by 1,386
Resource-Efficient Linear Optical Quantum Computation
Browne, D. E., & Rudolph, T. (2005) · Physical Review Letters · doi:10.1103/physrevlett.95.010501 · Cited by 790 · cited 1×
“It was, however, believed that CV cluster states would be convenient for demonstrating the basic principles of one-way QC since generating such states in the optical context was easier than making ordinary cluster states from optical qubits [7, 8].”
BackgroundOptical Quantum Computation Using Cluster States
Nielsen, M. A. (2004) · Physical Review Letters · doi:10.1103/physrevlett.93.040503 · Cited by 614
Efficient Classical Simulation of Continuous Variable Quantum Information Processes
Bartlett, S. D., Sanders, B. C., Braunstein, S. L., & Nemoto, K. (2002) · Physical Review Letters · doi:10.1103/physrevlett.88.097904 · Cited by 425
Graphical description of the action of local Clifford transformations on graph states
Van den Nest, M., Dehaene, J., & De Moor, B. (2004) · Physical Review A · doi:10.1103/physreva.69.022316 · Cited by 335 · cited 3×
“A similar connection between complete graphs and star graphs is known for qubit cluster states [33, 34].”
BackgroundMethod
Cited by
Weedbrook, C., Pirandola, S., García-Patrón, R., Cerf, N. J., Ralph, T. C., Shapiro, J. H., & Lloyd, S. (2012) · Reviews of Modern Physics · doi:10.1103/revmodphys.84.621 · Cited by 3,664
Ultra-large-scale continuous-variable cluster states multiplexed in the time domain
Yokoyama, S., Ukai, R., Armstrong, S. C., Sornphiphatphong, C., Kaji, T., Suzuki, S., Yoshikawa, J.-I., Yonezawa, H., Menicucci, N. C., & Furusawa, A. (2013) · Nature Photonics · doi:10.1038/nphoton.2013.287 · Cited by 547
Self-citationGeneration of time-domain-multiplexed two-dimensional cluster state
Asavanant, W., Shiozawa, Y., Yokoyama, S., Charoensombutamon, B., Emura, H., Alexander, R. N., Takeda, S., Yoshikawa, J.-I., Menicucci, N. C., Yonezawa, H., et al. (2019) · Science · doi:10.1126/science.aay2645 · Cited by 476
Self-citationChen, M., Menicucci, N. C., & Pfister, O. (2014) · Physical Review Letters · doi:10.1103/physrevlett.112.120505 · Cited by 468
Self-citationDeterministic generation of a two-dimensional cluster state
Larsen, M. V., Guo, X., Breum, C. R., Neergaard-Nielsen, J. S., & Andersen, U. L. (2019) · Science · doi:10.1126/science.aay4354 · Cited by 433
Metadata
- Authors
- Menicucci, N. C., Flammia, S. T., & van Loock, P.
- Venue
- Physical Review A
- Publisher
- American Physical Society (APS)
- Published
- 2011-04-28
- Volume
- 83
- Issue
- 4
- ISSN
- 0556-2791 (ISSN-L)
- 1050-2947
- 1094-1622
- OpenAlex
- W2081393745
- Cited by
- 181
- References
- 9
- FWCI
- 10.64
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Graphical calculus for Gaussian pure states. https://app.cochat.ai/papers/10.1103/physreva.83.042335
- The paper
- Menicucci, N. C., Flammia, S. T., & van Loock, P. (2011). Graphical calculus for Gaussian pure states. Physical Review A. https://doi.org/10.1103/physreva.83.042335
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.