Interpretation of tomography and spectroscopy as dual forms of quantum computation
Abstract
It is important to be able to determine the state of a quantum system and to measure properties of its evolution. State determination can be achieved using tomography, in which the system is subjected to a series of experiments, whereas spectroscopy can be used to probe the energy spectrum associated with the system's evolution. Here we show that, for a quantum system whose state or evolution can be modelled on a quantum computer, tomography and spectroscopy can be interpreted as dual forms of quantum computation. Specifically, we find that the phase estimation algorithm (which underlies a quantum computer's ability to perform efficient simulations and to factorize large numbers) can be adapted for tomography or spectroscopy. This is analogous to the situation encountered in scattering experiments, in which it is possible to obtain information about both the state of the scatterer and its interactions. We provide an experimental demonstration of the tomographic application by performing a measurement of the Wigner function (a phase space distribution) of a quantum system. For this purpose, we use three qubits formed from spin-1/2 nuclei in a quantum computation involving liquid-state nuclear magnetic resonance.
Integrity signals
Registry
Cites
Statistics
Claims the paper makes
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 Hadamard test can evaluate the overlap <ψ|U|ψ> on a quantum computer using a single extra qubit.
“The Hadamard test can evaluate such a quantity on the quantum computer using a single extra qubit (Miquel et al. , 2002).”
From Noisy intermediate-scale quantum algorithms (2022) · cites this paper as Miquel et al., 2002
Cites
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 · see citing works
Simulating physics with computers
Feynman, R. P. (1982) · International Journal of Theoretical Physics · doi:10.1007/bf02650179 · Cited by 7,691 · see citing works
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 · see citing works
Lloyd, S. (1996) · Science · doi:10.1126/science.273.5278.1073 · Cited by 3,088 · cited 1× · see citing works
“(which underlies a quantum computer's ability to perform efficient simulation”
BackgroundSmithey, D. T., Beck, M., Raymer, M. G., & Faridani, A. (1993) · Physical Review Letters · doi:10.1103/physrevlett.70.1244 · Cited by 1,538 · see citing works
Flagged first, then by citations
Cited by
Sorted by citations
Ladd, T. D., Jelezko, F., Laflamme, R., Nakamura, Y., Monroe, C., & O’Brien, J. L. (2010) · Nature · doi:10.1038/nature08812 · Cited by 3,592 · see citing works
Self-citationNoisy intermediate-scale quantum algorithms
Bharti, K., Cervera-Lierta, A., Kyaw, T. H., Haug, T., Alperin-Lea, S., Anand, A., Degroote, M., Heimonen, H., Kottmann, J. S., Menke, T., et al. (2022) · Reviews of Modern Physics · doi:10.1103/revmodphys.94.015004 · Cited by 1,726 · see citing works
Quantum systems with finite Hilbert space
Vourdas, A. (2004) · Reports on Progress in Physics · doi:10.1088/0034-4885/67/3/r03 · Cited by 321 · see citing works
- Authors
- Miquel, C., Paz, J. P., Saraceno, M., Knill, E., Laflamme, R., & Negrevergne, C.
- Affiliations
- Universidad de Buenos Aires (AR)
- Comisión Nacional de Energía Atómica (AR)
- Los Alamos National Laboratory (US)
- University of Waterloo (CA)
- Corresponding author
- Paz, Juan Pablo
- Venue
- Nature
- Published
- 2002-07
- Volume
- 418
- Issue
- 6893
- Pages
- 59-62
- ISSN
- 0028-0836 (ISSN-L)
- 1476-4687
- OpenAlex
- W1967067160
- Cited by
- 110
- References
- 5
- Citations by year
- 2026: 2 · 2025: 2 · 2024: 7 · 2023: 2 · 2022: 6 · 2021: 2 · 2020: 4 · 2019: 1 · 2018: 1 · 2017: 3 · 2016: 3 · 2014: 2 · 2013: 3 · 2012: 3
- FWCI
- 11.77
- Type
- journal article
- Language
- en
- Open access
- closed
- Licence
- www.springer.com/tdm (tdm)
- Locations
- Nature (publishedVersion)
- PubMed (publishedVersion)
- RePEc: Research Papers in Economics (submittedVersion)
- Funders
- Secretaría de Ciencia y Técnica, Universidad de Buenos Aires
- 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 Mechanics and Applications
- Keywords
- quantum state tomography, quantum spectroscopy, quantum state estimation, Wigner function, phase space distribution, quantum computing, spin-1/2 nuclei, qubits, quantum simulation
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