Cited by 234Quantum Computing Algorithms and ArchitectureQuantum Information and CryptographyQuantum optics and atomic interactions

Toward large-scale fault-tolerant universal photonic quantum computing

Open access
Takeda, S., Furusawa, A.·2019·APL Photonics

Abstract

Photonic quantum computing is one of the leading approaches to universal quantum computation. However, large-scale implementation of photonic quantum computing has been hindered by its intrinsic difficulties, such as probabilistic entangling gates for photonic qubits and lack of scalable ways to build photonic circuits. Here, we discuss how to overcome these limitations by taking advantage of two key ideas which have recently emerged. One is a hybrid qubit-continuous variable approach for realizing a deterministic universal gate set for photonic qubits. The other is the time-domain multiplexing technique to perform arbitrarily large-scale quantum computing without changing the configuration of photonic circuits. These ideas together will enable scalable implementation of universal photonic quantum computers in which hardware-efficient error correcting codes can be incorporated. Furthermore, all-optical implementation of such systems can increase the operational bandwidth beyond terahertz in principle, ultimately enabling large-scale fault-tolerant universal quantum computers with ultrahigh operation frequency.

Integrity signals

Registry

Crossref · 10.1063/1.5100160

Cites

131 of 131 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Claims the paper makes

We couldn’t retrieve this paper’s full text, so its claims and self-check weren’t run. The registry and citation checks still apply.

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?

  • Time-domain multiplexing offers a comparatively hardware-efficient path for building fault-tolerant quantum computers and near-term subuniversal machines showing quantum computational advantage.

    “In photonics, time-domain multiplexing offers a comparatively hardware-efficient19 path for building fault-tolerant quantum computers, but also near-term subuniversal machines showing quantum computational advantage.”

Cites

Flagged first, then by citations

Cited by

Sorted by citations

Authors
Takeda, S., & Furusawa, A.
Affiliations
The University of Tokyo (JP)
Venue
APL Photonics
Published
2019-06-01
Volume
4
Issue
6
ISSN
2378-0967 (ISSN-L)
OpenAlex
W2950216490
Cited by
234
References
131
Citations by year
2026: 22 · 2025: 39 · 2024: 46 · 2023: 40 · 2022: 32 · 2021: 32 · 2020: 18 · 2019: 5
FWCI
10.04
Type
journal article
Language
en
Open access
Locations
  • APL Photonics (publishedVersion, cc-by)
  • arXiv (Cornell University) (submittedVersion)
  • DOAJ (DOAJ: Directory of Open Access Journals) (submittedVersion, cc-by-sa)
  • arXiv (Cornell University)
Funders
Japan Society for the Promotion of Science (18K14143, 18H05207)
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Quantum Computing Algorithms and Architecture
  • Physical Sciences › Computer Science › Artificial Intelligence › Quantum Information and Cryptography
  • Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum optics and atomic interactions
Keywords
photonic quantum computing, fault tolerance, universal quantum computation, time-domain multiplexing

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