Papers › Efficient tomography of a quantum many-body system

Efficient tomography of a quantum many-body system

23 Dec 2016arXiv:1612.08000links table onlyarchive 2025-07-28

B. P. Lanyon, C. Maier, M. Holzäpfel, T. Baumgratz, C. Hempel, P. Jurcevic, I. Dhand, A. S. Buyskikh, A. J. Daley, M. Cramer, M. B. Plenio, R. Blatt, C. F. Roos

The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.

Quantum state tomography (QST) is the gold standard technique for obtaining an estimate for the state of small quantum systems in the laboratory. Its application to systems with more than a few constituents (e.g. particles) soon becomes impractical as the effort required grows exponentially in the number of constituents. Developing more efficient techniques is particularly pressing as precisely-controllable quantum systems that are well beyond the reach of QST are emerging in laboratories. Motivated by this, there is a considerable ongoing effort to develop new characterisation tools for quantum many-body systems. Here we demonstrate Matrix Product State (MPS) tomography, which is theoretically proven to allow the states of a broad class of quantum systems to be accurately estimated with an effort that increases efficiently with constituent number. We first prove that this broad class includes the out-of-equilbrium states produced by 1D systems with finite-range interactions, up to any fixed point in time. We then use the technique to reconstruct the dynamical state of a trapped-ion quantum simulator comprising up to 14 entangled spins (qubits): a size far beyond the reach of QST. Our results reveal the dynamical growth of entanglement and description complexity as correlations spread out during a quench: a necessary condition for future beyond-classical performance. MPS tomography should find widespread use to study large quantum many-body systems and to benchmark and verify quantum simulators and computers.

PaperPDFCodeCode Syntology ran

In Syntology Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.

For agents, Syntology's MCP tool lists every function and class Syntology harvested from this paper and whether it ran (how to connect): get_harvested_code_for_paper(arxiv_id="1612.08000")

Code

Syntology Ran 0 of 18 code samples harvested from 1 repository linked to this paper; 18 have no recorded run.

By repository: community (archive-listed): 18 samples from 1 repository, 0 ran. The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

dseuss/mpnum mentioned on GitHubtfBSD-3-Clause report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

18 samples harvested; 0 ran; 0 honoured the contract we drafted; 18 have no recorded run. Read from Syntology's graph 2026-09-24; that is when this build read the record, not when the samples ran.

18unverified

Licence: 0 of the 18 samples are pointer only, meaning Syntology does not serve that copy's text. This page shows no code text for any sample; each one links to its file in the repository.

Harvested from dseuss/mpnum. “Ran” means the sample executed on a synthesized input. It does not mean the output is correct, and nothing here reproduces the paper's results. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself; “our draft was wrong” and “fixture could not drive it” are failures of Syntology's instrument, not of the code.

Each sample ends with its code_sha256, Syntology's identity for that exact code. An agent fetches the stored sample with Syntology's MCP tool get_code(code_sha256="…") (how to connect); click an identity to copy that call.

Repository labels, per sample. official repository: The archive marks this repository official for the paper. named in the paper: The archive records that the paper mentions this repository; it is not marked official. community (archive-listed): In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper. found in paper text by Syntology: Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted. community: Not in the archive's code links for this paper; a community repository Syntology harvested. Samples from a repository marked official are listed first. Licence labels name the repository's licence as recorded at harvest. “Pointer only” means Syntology does not serve that copy's text, for one of four reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; or the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar). Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence label for the reason. File links open the file on GitHub at the default branch, which may have changed since the harvest.

block_diag dseuss/mpnum/mpnum/utils/extmath.py community (archive-listed) unverified BSD-3-Clause (permissive) · 29ebd00f4660174a · report
compression_svd dseuss/mpnum/mpnum/_testing.py community (archive-listed) unverified BSD-3-Clause (permissive) · 21cb757bf23dd482 · report
dot dseuss/mpnum/mpnum/mparray.py community (archive-listed) unverified BSD-3-Clause (permissive) · cc16f373661bb4dd · report
eig dseuss/mpnum/mpnum/linalg.py community (archive-listed) unverified BSD-3-Clause (permissive) · 5d91caa1c0ca73bb · report
eig_sum dseuss/mpnum/mpnum/linalg.py community (archive-listed) unverified BSD-3-Clause (permissive) · 8a2fd1108ff52242 · report
eye dseuss/mpnum/mpnum/factory.py community (archive-listed) unverified BSD-3-Clause (permissive) · 7b77b57b12e40387 · report
global_to_local dseuss/mpnum/mpnum/utils/array_transforms.py community (archive-listed) unverified BSD-3-Clause (permissive) · e509a0e471bb4ffd · report
inner_prod_mps dseuss/mpnum/mpnum/special.py community (archive-listed) unverified BSD-3-Clause (permissive) · ade9bbea619a1083 · report
local_to_global dseuss/mpnum/mpnum/utils/array_transforms.py community (archive-listed) unverified BSD-3-Clause (permissive) · 3e545d13d087d896 · report
matdot dseuss/mpnum/mpnum/utils/extmath.py community (archive-listed) unverified BSD-3-Clause (permissive) · fe8b8f6432e3d2c4 · report
partial_trace dseuss/mpnum/mpnum/utils/extmath.py community (archive-listed) unverified BSD-3-Clause (permissive) · 95b069fa64cae200 · report
pmps_dm_to_array dseuss/mpnum/mpnum/mpsmpo.py community (archive-listed) unverified BSD-3-Clause (permissive) · dd63f719e206161c · report
pmps_reduction dseuss/mpnum/mpnum/mpsmpo.py community (archive-listed) unverified BSD-3-Clause (permissive) · 3819b6ccee572f3e · report
reductions_mpo dseuss/mpnum/mpnum/mpsmpo.py community (archive-listed) unverified BSD-3-Clause (permissive) · 57526b72877bff30 · report
x_povm dseuss/mpnum/mpnum/povm/localpovm.py community (archive-listed) unverified BSD-3-Clause (permissive) · 8825b938194fec94 · report
y_povm dseuss/mpnum/mpnum/povm/localpovm.py community (archive-listed) unverified BSD-3-Clause (permissive) · e081d948047e136d · report
z_povm dseuss/mpnum/mpnum/povm/localpovm.py community (archive-listed) unverified BSD-3-Clause (permissive) · 5638b2dc453b951e · report
zero dseuss/mpnum/mpnum/factory.py community (archive-listed) unverified BSD-3-Clause (permissive) · 91f6e476b96a966b · report

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections