The DOI matches its Crossref record; 15 of the 15 references it cites were found in a registry or an index.
Charge Detection Enables Free-Electron Quantum Computation
Open accessAbstract
It is known that a quantum computer operating on electron-spin qubits with single-electron Hamiltonians and assisted by single-spin measurements can be simulated efficiently on a classical computer. We show that the exponential speedup of quantum algorithms is restored if single-charge measurements are added. These enable the construction of a CNOT (controlled NOT) gate for free fermions, using only beam splitters and spin rotations. The gate is nearly deterministic if the charge detector counts the number of electrons in a mode, and fully deterministic if it only measures the parity of that number.
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
Quantum Computation and Quantum Information
Nielsen, M. A., Chuang, I., & Grover, L. K. (2002) · American Journal of Physics · doi:10.1119/1.1463744 · Cited by 21,895
Teleporting an unknown quantum state via dual classical and Einstein-Podolsky-Rosen channels
Bennett, C. H., Brassard, G., Crépeau, C., Jozsa, R., Peres, A., & Wootters, W. K. (1993) · Physical Review Letters · doi:10.1103/physrevlett.70.1895 · Cited by 13,703
Quantum computation with quantum dots
Loss, D., & DiVincenzo, D. P. (1998) · Physical Review A · doi:10.1103/physreva.57.120 · Cited by 6,840 · cited 2×
“Charge detectors play a prominent role in a variety of contexts: As which-path detectors they control the visibility of Aharonov-Bohm oscillations [12]; In combination with a beam splitter they provide a way to entangle two noninteracting particles [13]; In combination with spindependent tunneling they enable the read…”
BackgroundSelf-citationA 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
A silicon-based nuclear spin quantum computer
Kane, B. E. (1998) · Nature · doi:10.1038/30156 · Cited by 3,779
Gottesman, D., & Chuang, I. L. (1999) · Nature · doi:10.1038/46503 · Cited by 1,860
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
Bravyi, S. B., & Kitaev, A. Y. (2002) · Annals of Physics · doi:10.1006/aphy.2002.6254 · Cited by 1,033
Bell measurements for teleportation
Lütkenhaus, N., Calsamiglia, J., & Suominen, K.-A. (1999) · Physical Review A · doi:10.1103/physreva.59.3295 · Cited by 538
The Fermionic Hanbury Brown and Twiss Experiment
Henny, M., Oberholzer, S., Strunk, C., Heinzel, T., Ensslin, K., Holland, M., & Schönenberger, C. (1999) · Science · doi:10.1126/science.284.5412.296 · Cited by 411
Linear optical controlled-NOT gate in the coincidence basis
Ralph, T. C., Langford, N. K., Bell, T. B., & White, A. G. (2002) · Physical Review A · doi:10.1103/physreva.65.062324 · Cited by 346
Classical simulation of noninteracting-fermion quantum circuits
Terhal, B. M., & DiVincenzo, D. P. (2002) · Physical Review A · doi:10.1103/physreva.65.032325 · Cited by 329
Self-citationMethods for reliable teleportation
Vaidman, L., & Yoran, N. (1999) · Physical Review A · doi:10.1103/physreva.59.116 · Cited by 253 · cited 1×
“A no-go theorem [19, 20] says that such a Bell measurement can not be done deterministically (meaning with 100% success probability) without using interactions between the qubits.”
BackgroundQuantum phase gate for photonic qubits using only beam splitters and postselection
Hofmann, H. F., & Takeuchi, S. (2002) · Physical Review A · doi:10.1103/physreva.66.024308 · Cited by 192
Probabilistic manipulation of entangled photons
Koashi, M., Yamamoto, T., & Imoto, N. (2001) · Physical Review A · doi:10.1103/physreva.63.030301 · Cited by 109 · cited 5×
“In this respect it would seem that FEQC is computationally more powerful than LOQC, but we emphasize that Fig.”
BackgroundInfluential
Cited by
The computational complexity of linear optics
Aaronson, S., & Arkhipov, A. (2011) · Proceedings of the forty-third annual ACM symposium on Theory of computing · doi:10.1145/1993636.1993682 · Cited by 874
Deterministic entanglement of superconducting qubits by parity measurement and feedback
Ristè, D., Dukalski, M., Watson, C. A., de Lange, G., Tiggelman, M. J., Blanter, Y. M., Lehnert, K. W., Schouten, R. N., & DiCarlo, L. (2013) · Nature · doi:10.1038/nature12513 · Cited by 321
Metadata
- Authors
- Beenakker, C. W. J., DiVincenzo, D. P., Emary, C., & Kindermann, M.
- Venue
- Physical Review Letters
- Publisher
- American Physical Society (APS)
- Published
- 2004-07-06
- Volume
- 93
- Issue
- 2
- Pages
- 020501-020501
- ISSN
- 0031-9007 (ISSN-L)
- 1079-7114
- OpenAlex
- W2128374633
- Cited by
- 195
- References
- 15
- FWCI
- 6.96
- 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
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.