Pith. Sign in

RECORD

Are all Gaussian states also cluster states? Essential diagnostic tools for continuous-variable one-way quantum computing

PaperPDF from arXiv

data files

Paper breakdownThe authors' claims, conditions and measurements, as JSON Signed receiptProof this review has not been altered
X Bluesky LinkedIn Reddit Hacker News
Carlos González-Arciniegas, Paulo Nussenzveig, Marcelo Martinelli, Olivier Pfister

Quantum Physics · Submitted 13 Dec 2019

abstract compiled · 2026-09-23 · no language-model review

The authors' main claim By a detailed analysis of the structure of Gaussian states, we derive an algorithm that reveals hidden entanglement in an arbitrary Gaussian state and optimizes its use for one-way quantum computing.

how it is stated · asserted 1.00 read the record →

Comment (0) Read on arXiv ↗
Cite ▾
arXiv ID1912.06463 (version 6)
Pith IDBJPGTH3P, Pith's permanent record of this paper and its review
CitationCarlos Gonz\'alez-Arciniegas, Marcelo Martinelli, Olivier Pfister, Paulo Nussenzveig. "Are all Gaussian states also cluster states? Essential diagnostic tools for continuous-variable one-way quantum computing." arXiv:1912.06463 (2019). https://pith.science/paper/BJPGTH3P
Claim paper

The compiled record

The paper's own sentences, arranged. Each label is drawn from a closed vocabulary; the number beside it is the probability the classifier gave that label. Numbers in the tables are the authors', checked by code. No sentence in this record was written by a model.

Open the compiled record

Compiled by classifier-1.13.0 via TypeSafe API, question bank abstract-p1-20260923, 2026-09-23: 1 request, 4,902 input tokens.

What the abstract itself states, as probabilities: claims first 0.06 · states limitation 0.21 · human participants 0.02 · controlled comparison 0.06 · randomized assignment 0.01 · states quantitative result 0.06 · compares with prior results 0.75 · mentions code or data availability 0.03.

The abstract, sentence by sentence

arXiv listing abstract v6. Results and the main claim are underlined; .

Continuous-variable (CV) cluster states are a universal quantum computing platform that has experimentally out-scaled qubit platforms by orders of magnitude. Room-temperature implementation of CV cluster states has been achieved with quantum optics by using multimode squeezed Gaussian states. It has also been proven that fault tolerance thresholds for CV quantum computing can be reached at realistic squeezing levels. In this paper, we show that standard approaches to design and characterize CV cluster states can miss entanglement present in the system. Such hidden entanglement may be used to increase the power of a quantum computer but it can also, if undetected, hinder the successful implementation of a quantum algorithm. By a detailed analysis of the structure of Gaussian states, we derive an algorithm that reveals hidden entanglement in an arbitrary Gaussian state and optimizes its use for one-way quantum computing.

background contribution method result interpretation main claim

What the classifier reports for each sentence. The number is the probability it gave the label.
#sentencerolethe authors' own workstates the main conclusionstrength
s0 Continuous-variable (CV) cluster states are a universal quantum computing platform that has experimentally out-scaled qubit platforms by orders of magnitude. background 1.00 0.05 0.02 asserted 1.00
s1 Room-temperature implementation of CV cluster states has been achieved with quantum optics by using multimode squeezed Gaussian states. background 1.00 0.07 0.02 asserted 1.00
s2 It has also been proven that fault tolerance thresholds for CV quantum computing can be reached at realistic squeezing levels. background 1.00 0.05 0.03 asserted 1.00
s3 In this paper, we show that standard approaches to design and characterize CV cluster states can miss entanglement present in the system. gap 0.47 0.85 0.41 asserted 0.95
s4 Such hidden entanglement may be used to increase the power of a quantum computer but it can also, if undetected, hinder the successful implementation of a quantum algorithm. interpretation 0.95 0.14 0.09 hedged possibility 1.00
s5 By a detailed analysis of the structure of Gaussian states, we derive an algorithm that reveals hidden entanglement in an arbitrary Gaussian state and optimizes its use for one-way quantum computing. contribution 0.89 0.96 0.81 asserted 1.00

What kind of paper the classifier reports this is: method or tool 1.00 · evidence from proof or derivation 1.00.

What was examined, and what was not

sources read
  • arXiv listing abstract v6
not examined
  • full text
  • figures and tables
  • references and citing sentences
  • relations to other papers
levels run
  • P abstract
not run
  • S sections
  • T body sentences
  • C citations
  • R cross-paper relations

Every quoted sentence on this record is the authors'. Every label is from Pith's closed vocabulary, with the probability shown beside it. Every number in the measurements table is the authors', checked by code. Record as JSON

The paper
Original abstract

Continuous-variable (CV) cluster states are a universal quantum computing platform that has experimentally out-scaled qubit platforms by orders of magnitude. Room-temperature implementation of CV cluster states has been achieved with quantum optics by using multimode squeezed Gaussian states. It has also been proven that fault tolerance thresholds for CV quantum computing can be reached at realistic squeezing levels. In this paper, we show that standard approaches to design and characterize CV cluster states can miss entanglement present in the system. Such hidden entanglement may be used to increase the power of a quantum computer but it can also, if undetected, hinder the successful implementation of a quantum algorithm. By a detailed analysis of the structure of Gaussian states, we derive an algorithm that reveals hidden entanglement in an arbitrary Gaussian state and optimizes its use for one-way quantum computing.

Human review

How Pith checks papers → · Full audit of this paper →

How the literature uses it

2 arXiv papers cite this in 8 sentences

Each citing sentence is taken from the citing paper's LaTeX source and typed by Pith's classifier. A label appears at probability 0.8 or more (0.95 for support), a contest at 0.7 or more; the quoted words are the citing authors'. How each label was checked · JSON

Discussion

Know something about this paper? Leave a comment, or highlight any passage above to comment on it.