Pith. sign in

REVIEW 2 cited by

Quantum state tomography with tensor train cross approximation

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2207.06397 v1 pith:I5Q56GVK submitted 2022-07-13 quant-ph

classification quant-ph
keywords statemethodquantumtomographyfulllocalapproximationcross
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

It has been recently shown that a state generated by a one-dimensional noisy quantum computer is well approximated by a matrix product operator with a finite bond dimension independent of the number of qubits. We show that full quantum state tomography can be performed for such a state with a minimal number of measurement settings using a method known as tensor train cross approximation. The method works for reconstructing full rank density matrices and only requires measuring local operators, which are routinely performed in state-of-art experimental quantum platforms. Our method requires exponentially fewer state copies than the best known tomography method for unstructured states and local measurements. The fidelity of our reconstructed state can be further improved via supervised machine learning, without demanding more experimental data. Scalable tomography is achieved if the full state can be reconstructed from local reductions.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Sketch Tomography: Hybridizing Classical Shadow and Matrix Product State

    quant-ph 2025-12 conditional novelty 6.0 of 10

    Sketch tomography reconstructs a matrix-product-state density matrix from classical Pauli-shadow data via sketched tensor-train equations, with a claimed O(n^2) sample guarantee.

  2. A Scalable Factorization Approach for High-Order Structured Tensor Recovery

    cs.LG 2025-06 conditional novelty 6.0 of 10

    Gradient descent on the Stiefel manifold recovers Tucker and tensor-train tensors with linear convergence whose initialization requirement and rate scale polynomially with the tensor order N.

Pith tools