The DOI matches its Crossref record; 16 of the 16 references it cites were found in a registry or an index.
Quantum dynamics as a physical resource
Open accessAbstract
How useful is a quantum dynamical operation for quantum information processing? Motivated by this question, we investigate several strength measures quantifying the resources intrinsic to a quantum operation. We develop a general theory of such strength measures, based on axiomatic considerations independent of state-based resources. The power of this theory is demonstrated with applications to quantum communication complexity, quantum computational complexity, and entanglement generation by unitary operations.
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
Self-citationEntanglement of Formation of an Arbitrary State of Two Qubits
Wootters, W. K. (1998) · Physical Review Letters · doi:10.1103/physrevlett.80.2245 · Cited by 8,290
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
Information Theory and Statistical Mechanics. II
Jaynes, E. T. (1957) · Physical Review · doi:10.1103/physrev.108.171 · Cited by 3,253
Entanglement of a pair of quantum bits
Hill, S., & Wootters, W. K. (1997) · Physical Review Letters · doi:10.1103/physrevlett.78.5022 · Cited by 2,823
Completely positive linear maps on complex matrices
Choi, M.-D. (1975) · Linear Algebra and its Applications · doi:10.1016/0024-3795(75)90075-0 · Cited by 2,659
Entanglement measures and purification procedures
Vedral, V., & Plenio, M. B. (1998) · Physical Review A · doi:10.1103/physreva.57.1619 · Cited by 1,419
General teleportation channel, singlet fraction, and quasidistillation
Horodecki, M., Horodecki, P., & Horodecki, R. (1999) · Physical Review A · doi:10.1103/physreva.60.1888 · Cited by 965
Proof of the strong subadditivity of quantum-mechanical entropy
Lieb, E. H., & Ruskai, M. B. (1973) · Journal of Mathematical Physics · doi:10.1063/1.1666274 · Cited by 831
Vidal, G. (2000) · Journal of Modern Optics · doi:10.1080/09500340008244048 · Cited by 821
Optimal creation of entanglement using a two-qubit gate
Kraus, B., & Cirac, J. I. (2001) · Physical Review A · doi:10.1103/physreva.63.062309 · Cited by 432
Semiclassical Fourier Transform for Quantum Computation
Griffiths, R. B., & Niu, C.-S. (1996) · Physical Review Letters · doi:10.1103/physrevlett.76.3228 · Cited by 431
Schmidt number for density matrices
Terhal, B. M., & Horodecki, P. (2000) · Physical Review A · doi:10.1103/physreva.61.040301 · Cited by 427
Entangling power of quantum evolutions
Zanardi, P., Zalka, C., & Faoro, L. (2000) · Physical Review A · doi:10.1103/physreva.62.030301 · Cited by 419
Universal quantum computation and simulation using any entangling Hamiltonian and local unitaries
Dodd, J. L., Nielsen, M. A., Bremner, M. J., & Thew, R. T. (2002) · Physical Review A · doi:10.1103/physreva.65.040301 · Cited by 156
Self-citationQuantum Entanglement and the Communication Complexity of the Inner Product Function
Cleve, R., van Dam, W., Nielsen, M., & Tapp, A. (1999) · Lecture Notes in Computer Science · doi:10.1007/3-540-49208-9_4 · Cited by 133
Self-citation
Cited by
Sim, S., Johnson, P. D., & Aspuru‐Guzik, A. (2019) · Advanced Quantum Technologies · doi:10.1002/qute.201900070 · Cited by 972
Quantum-process tomography: Resource analysis of different strategies
Mohseni, M., Rezakhani, A. T., & Lidar, D. A. (2008) · Physical Review A · doi:10.1103/physreva.77.032322 · Cited by 416
Alicki, R., Lidar, D. A., & Zanardi, P. (2006) · Physical Review A · doi:10.1103/physreva.73.052311 · Cited by 132
Unitary quantum gates, perfect entanglers, and unistochastic maps
Musz, M., Kuś, M., & Życzkowski, K. (2013) · Physical Review A · doi:10.1103/physreva.87.022111 · Cited by 58
Metadata
- Authors
- Nielsen, M. A., Dawson, C. M., Dodd, J. L., Gilchrist, A., Mortimer, D., Osborne, T. J., Bremner, M. J., Harrow, A. W., & Hines, A.
- Venue
- Physical Review A
- Publisher
- American Physical Society (APS)
- Published
- 2003-05-07
- Volume
- 67
- Issue
- 5
- ISSN
- 0556-2791 (ISSN-L)
- 1050-2947
- 1094-1622
- OpenAlex
- W1977997915
- Cited by
- 173
- References
- 16
- FWCI
- 10.60
- 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.