The DOI matches its Crossref record; 5 of the 5 references it cites were found in a registry or an index.
QUANTUM COMPUTATION BY MEASUREMENTS
Abstract
We first consider various methods for the indirect implementation of unitary gates. We apply these methods to rederive the universality of 4-qubit measurements based on a scheme much simpler than Nielsen's original construction [quant-ph/0108020]. Then, we prove the universality of simple discrete sets of 2-qubit measurements, again using a scheme simplifying the initial construction [quant-ph/0111122]. Finally, we show how to use a single 4-qubit measurement to achieve universal quantum computation, and outline a proof for the universality of almost all maximally entangling 4-qubit measurements.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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?
Since quantum computing can be cast into single-qubit operations and two-qubit projections, the problem of making nonlinear gates can be approached via complete discrimination of multi-qubit bases.
“Since quantum computing can be cast into the shape of single-qubit operations and two-qubit projections (Nielsen 2003;Leung 2004), we can approach the problem of making nonlinear gates via complete discrimination of multi-qubit bases.”
From Linear optical quantum computing with photonic qubits (2007) · cites this paper as Leung 2004
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
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
Elementary gates for quantum computation
Barenco, A., Bennett, C. H., Cleve, R., DiVincenzo, D. P., Margolus, N., Shor, P., Sleator, T., Smolin, J. A., & Weinfurter, H. (1995) · Physical Review A · doi:10.1103/physreva.52.3457 · Cited by 4,311
Gottesman, D., & Chuang, I. L. (1999) · Nature · doi:10.1038/46503 · Cited by 1,860
DiVincenzo, D. P. (1995) · Science · doi:10.1126/science.270.5234.255 · Cited by 1,651
Two-bit gates are universal for quantum computation
DiVincenzo, D. P. (1995) · Physical Review A · doi:10.1103/physreva.51.1015 · Cited by 1,069
Flagged first, then by citations
Research works printed but not linked: 8
- 10.1103/PhysRevLett.75.346 · DOI · Paper page
- 10.1098/rspa.1995.0065 · DOI · Paper page
- 10.1103/PhysRevA.62.052316 · DOI · Paper page
- Knill E., Nature, 409, 26
- 10.1103/PhysRevA.67.050303 · DOI
- 10.1103/PhysRevLett.86.5188 · DOI · Paper page
- 10.1103/PhysRevLett.86.910 · DOI · Paper page
- Nielsen M. A., 2000, Quantum computation and quantum information
Cited by
Sorted by citations
Linear optical quantum computing with photonic qubits
Kok, P., Munro, W. J., Nemoto, K., Ralph, T. C., Dowling, J. P., & Milburn, G. J. (2007) · Reviews of Modern Physics · doi:10.1103/revmodphys.79.135 · Cited by 2,904
Ultracold atomic gases in optical lattices: mimicking condensed matter physics and beyond
Lewenstein, M., Sanpera, A., Ahufinger, V., Damski, B., Sen(De), A., & Sen, U. (2007) · Advances in Physics · doi:10.1080/00018730701223200 · Cited by 2,104
Measurement-based quantum computation
Briegel, H. J., Browne, D. E., Dür, W., Raussendorf, R., & Van den Nest, M. (2009) · Nature Physics · doi:10.1038/nphys1157 · Cited by 1,090
Symmetry analyzer for nondestructive Bell-state detection using weak nonlinearities
Barrett, S. D., Kok, P., Nemoto, K., Beausoleil, R. G., Munro, W. J., & Spiller, T. P. (2005) · Physical Review A · doi:10.1103/physreva.71.060302 · Cited by 300
Universal Resources for Measurement-Based Quantum Computation
Van den Nest, M., Miyake, A., Dür, W., & Briegel, H. J. (2006) · Physical Review Letters · doi:10.1103/physrevlett.97.150504 · Cited by 238
Danos, V., Kashefi, E., & Panangaden, P. (2007) · Journal of the ACM · doi:10.1145/1219092.1219096 · Cited by 195
Fundamentals of universality in one-way quantum computation
Nest, M. V. D., Dür, W., Miyake, A., & Briegel, H. J. (2007) · New Journal of Physics · doi:10.1088/1367-2630/9/6/204 · Cited by 97
Computation by measurements: A unifying picture
Aliferis, P., & Leung, D. W. (2004) · Physical Review A · doi:10.1103/physreva.70.062314 · Cited by 75
Self-citationClassical simulability, entanglement breaking, and quantum computation thresholds
Virmani, S., Huelga, S. F., & Plenio, M. B. (2005) · Physical Review A · doi:10.1103/physreva.71.042328 · Cited by 51
Metadata
- Authors
- LEUNG, D. W.
- Affiliations
- Institute of Quantum Information, MSC 107-81, Caltech, Pasadena, CA 91125, USA
- Venue
- International Journal of Quantum Information
- Publisher
- World Scientific Pub Co Pte Lt
- Published
- 2004-03
- Volume
- 02
- Issue
- 01
- Pages
- 33-43
- ISSN
- 0219-7499
- 1793-6918
- Cited by
- 85
- References
- 5
- Language
- en
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
