Generation of time-domain-multiplexed two-dimensional cluster state
Open accessThe DOI matches its Crossref record; 54 of the 54 references it cites were found in a registry or an index.
Abstract
Generating large-scale cluster states: The development of a practical quantum computer requires universality, scalability, and fault tolerance. Although much progress is being made in circuit platforms in which arrays of qubits are addressed and manipulated individually, scale-up of such systems is experimentally challenging. Asavanant et al. and Larsen et al. explore an alternative route: measurement-based quantum computation, which is a platform based on the generation of large-scale cluster states. As these are optically prepared and easier to handle (one simply performs local measurements on each individual component of the cluster state), such a platform is readily scalable and fault tolerant. The topology of the cluster state ensures that the approach meets the requirements for quantum computation. Science , this issue p. 373 , p. 369
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.
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
The cited source says what the claim attributes to it.
In the citing paper
“Two-dimensional cluster states, which are necessary universal resource for CV computation, have been demonstrated in experiments over several thousands of nodes [247,248], highlighting the scaling potential of the CV approach especially for MBQC (see figure 34).”
From 2022 Roadmap on integrated quantum photonics (2022) · cites this paper as [247]
The cited source says what the claim attributes to it.
In the citing paper
“Using time-domain multiplexing, large one- and two-dimensional cluster states have been deterministically generated21–23 with programmable linear operations implemented by projective measurements24,25”
From Quantum computational advantage with a programmable photonic processor (2022) · cites this paper as [23]
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
Quantum computation and quantum information
Law, J. (2001) · ACM SIGSOFT Software Engineering Notes · doi:10.1145/505482.505499 · Cited by 18,842
Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer
Shor, P. W. (1997) · SIAM Journal on Computing · doi:10.1137/s0097539795293172 · Cited by 8,472
Raussendorf, R., & Briegel, H. J. (2001) · Physical Review Letters · doi:10.1103/physrevlett.86.5188 · Cited by 4,477
Persistent 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
Albash, T., & Lidar, D. A. (2018) · Reviews of Modern Physics · doi:10.1103/revmodphys.90.015002 · Cited by 1,546
Encoding a qubit in an oscillator
Gottesman, D., Kitaev, A., & Preskill, J. (2001) · Physical Review A · doi:10.1103/physreva.64.012310 · Cited by 1,532
Zwanenburg, F. A., Dzurak, A. S., Morello, A., Simmons, M. Y., Hollenberg, L. C. L., Klimeck, G., Rogge, S., Coppersmith, S. N., & Eriksson, M. A. (2013) · Reviews of Modern Physics · doi:10.1103/revmodphys.85.961 · Cited by 1,210
Enhanced sensitivity of the LIGO gravitational wave detector by using squeezed states of light
Aasi, J., Abadie, J., Abbott, B. P., Abbott, R., Abbott, T. D., Abernathy, M. R., Adams, C., Adams, T., Addesso, P., Adhikari, R. X., et al. (2013) · Nature Photonics · doi:10.1038/nphoton.2013.177 · Cited by 1,204
Quantum Computation Over Continuous Variables
Lloyd, S., & Braunstein, S. L. (1999) · Physical Review Letters · doi:10.1103/physrevlett.82.1784 · Cited by 1,145
Vahlbruch, H., Mehmet, M., Danzmann, K., & Schnabel, R. (2016) · Physical Review Letters · doi:10.1103/physrevlett.117.110801 · Cited by 901
Cited by
Items 601–616 of 616
Anisotropic wavevector-dependent damping of thickness-quantized magnonsPreprint
Azevedo, T., Serha, R. O., Kunz, Y., Schweizer, M. R., Vasyuchka, V. I., Weiler, M., Chumak, A. V., Hillebrands, B., Kostylev, M., & Serga, A. A. (2026) · arXiv (Cornell University) · doi:10.48550/arxiv.2609.39612
“The approach relies on parametric excitation, a versatile mechanism for generating and amplifying bosonic modes, with applications from quantum photonics to magnonics [16–19].”
Polynomial-time local-unitary equivalence of graph statesPreprint
Zhang, Y. (2026) · arXiv (Cornell University) · doi:10.48550/arxiv.2610.00527
“The fixed-level standard-form reduction [38, Lemma 18] expresses K as G ω followed by complementations on W , for some ω ∈ Ω.”
Efficient detection of spectral cluster statesPreprint
Kalash, M., Han, U. N., Roh, C., Passos, M. H. M., Ra, Y. S., & Chekhova, M. V. (2026) · arXiv (Cornell University) · doi:10.48550/arxiv.2610.09745
“In our proof-of-principle experiment, we focus on the dual-rail CV cluster state 30–33 , a scalable resource for measurement-based quantum computation supporting deterministic and programmable multimode Gaussian operations.”
Photonic Chips for Universal Quantum Computing: Retrospective and ProspectivePreprint
Wang, W., Fang, M., Yu, H., Li, S., Tang, Z., Cai, H., Chin, L.-K., van Loock, P., Su, D., & Liu, A.-Q. 刘. (2026) · arXiv (Cornell University) · doi:10.48550/arxiv.2610.11321
Exponential-SWAP gate between bosonic motional modes of trapped ionsPreprint
Koh, E. J. W., Zhang, R., & Matsukevich, D. (2026) · arXiv (Cornell University) · doi:10.48550/arxiv.2610.23208
Methods for Secure Communication with Continuous Quantum Variables
Alderton, A. (2026) · Apollo (University of Cambridge) · doi:10.17863/cam.135787
Kalalshnikov, D., Chudakov, A. V., Severin, V., Poshevkina, A., Finochenko, A., Kuznetsov, K. G., Левченко, А. А., Serebryannikov, E. E., А., Ф. А., & Sharapova, P. (2026) · CyberLeninK (CyberLeninka) · doi:10.24412/cl-35039-2026-26-325
Graphical Rigidity of Continuous Variable Graph States under Gaussian Local TransformationsPreprint
Ciliberto, G., & Grosshans, F. (2026) · arXiv (Cornell University) · doi:10.48550/arxiv.2610.31933
“The i R GSs experimentally demonstrated in different research groups 3 [14, 15, 17, 18] are based on bicolorable graphs — Larsen et al. even specify the parity of time delays to ensure this property.”
InfluentialFukui, K., Matsuura, T., Chin, Y., Kiryu, S., Hoshi, T., Takase, K., & Asavanant, W. (2026) · arXiv (Cornell University) · doi:10.48550/arxiv.2610.32838
Self-citationDistributed Inner-Product Estimation for Continuous-Variable Quantum StatesPreprint
Tang, J., Zheng, C., Miao, Y., Yu, X., & Zhang, Z. (2026) · arXiv (Cornell University) · doi:10.48550/arxiv.2610.40141
Stellar Representation of Gottesman Kitaev Preskill States on the Double Discrete CylinderPreprint
Zlotak, A., Fabre, N., & Murenzi, R. (2026) · arXiv (Cornell University) · doi:10.48550/arxiv.2610.37831
Loss-aware optimization of realistic GKP gid statesPreprint
Matulík, M., & Marek, P. (2026) · arXiv (Cornell University) · doi:10.48550/arxiv.2610.41388
Time-Domain Multiplexing for Resource-Efficient Heralded GKP State PreparationPreprint
Hu, K.-M., He, J.-J., Zhu, Y., Du, P.-L., Yang, L., Tang, H., & Jin, X.-M. (2026) · arXiv (Cornell University) · doi:10.48550/arxiv.2610.41341
“Temporal multiplexing has enabled large continuous-variable cluster states [20], including two-dimensional resources [21, 22], as well as programmable GBS with photon-number-resolving detection [23].”
Interpretable Quantum Photonic Generative ModelsPreprint
Le, D. C., & Kyriienko, O. (2026) · arXiv (Cornell University) · doi:10.48550/arxiv.2611.05354
A Correlation-Aware GKP Decoder for Fault-Tolerant Continuous-Variable Photonic Quantum Computers
Matsuo, R., & Kadomoto, J. (2026) · ACM/IEEE Design Automation Conference (DAC) · doi:10.1145/3770743.3804026
“A key advantage of the CV photonic architecture is its ability to integrate a large number of qubits without physically scaling the system, by exploiting time-domain multiplexing (TDM) [2, 3, 24].”
Progress of on-chip optical quantum computing: a review
Phat, B., Yang, M., Luan, D., & Gao, W. (2026) · Photonics Insights · doi:10.3788/pi.2026.r15
Metadata
- Authors
- Asavanant, W., Shiozawa, Y., Yokoyama, S., Charoensombutamon, B., Emura, H., Alexander, R. N., Takeda, S., Yoshikawa, J.-I., Menicucci, N. C., Yonezawa, H., & Furusawa, A.
- Affiliations
- The University of Tokyo (JP)
- Centre for Quantum Computation and Communication Technology (AU)
- University of New Mexico (US)
- Institute of Engineering Innovation, School of Engineering, the University of Tokyo (JP)
- Corresponding author
- Furusawa, Akira
- ORCID
- Venue
- Science
- Published
- 2019-10-18
- Volume
- 366
- Issue
- 6463
- Pages
- 373-376
- ISSN
- 0036-8075 (ISSN-L)
- 1095-9203
- OpenAlex
- W2920934058
- Cited by
- 476
- References
- 53
- Citations by year
- 2026: 49 · 2025: 67 · 2024: 74 · 2023: 72 · 2022: 68 · 2021: 86 · 2020: 51 · 2019: 8
- FWCI
- 24.30
- Type
- journal article
- Language
- en
- Open access
- green
- arxiv.org
- Locations
- Science (publishedVersion)
- PubMed (publishedVersion)
- arXiv (Cornell University) (submittedVersion)
- RMIT Research Repository (RMIT University Library) (submittedVersion)
- Figshare (submittedVersion, cc-by)
- Funders
- National Science Foundation (PHY-1630114)
- Japan Society for the Promotion of Science
- JSPS KAKENHI (18H05207)
- Australian Research Council Centre of Excellence for Quantum Computation and Communication Technology (CE170100012)
- UTokyo Foundation
- Nichia Corporation
- Advanced Leading Graduate Course for Photon Science
- Program of Excellence in Photon Science
- Topics
- Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum Information and Cryptography
- Physical Sciences › Computer Science › Artificial Intelligence › Quantum Computing Algorithms and Architecture
- Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum many-body systems
- Keywords
- continuous-variable cluster states, time-domain multiplexing, measurement-based quantum computation, fault-tolerant quantum computing, square lattice
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
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.