REVIEW 4 cited by
Efficient Direct Tomography for Matrix Product States
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
Efficient Direct Tomography for Matrix Product States
read the original abstract
In this note, we describe a method for reconstructing matrix product states from a small number of efficiently-implementable measurements. Our method is exponentially faster than standard tomography, and it can also be used to certify that the unknown state is an MPS. The basic idea is to use local unitary operations to measure in the Schmidt basis, giving direct access to the MPS representation. This compares favorably with recently and independently proposed methods that recover the MPS tensors by performing a variational minimization, which is computationally intractable in certain cases. Our method also has the advantage of recovering any MPS, while other approaches were limited to special classes of states that exclude important examples such as GHZ and W states.
Forward citations
Cited by 4 Pith papers
-
Agnostic learning of qudit stabilizer states
A quantum algorithm learns an n-qudit stabilizer state within ε of optimal fidelity with sample/time (d/τ)^{O(d^2 log(1/τ))} poly(n,1/ε), for odd prime d.
-
A Provably Efficient Method for Tensor Ring Decomposition and Its Applications
BLOSTR recovers exact tensor ring cores in a fixed number of algebraic steps from O(r²Σnⱼ) sampled entries, under genericity conditions and mode sizes ≥ r².
-
Sketch Tomography: Hybridizing Classical Shadow and Matrix Product State
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.
-
Lower overhead fault-tolerant building blocks for noisy quantum computers
New combinatorial proofs and circuit designs for quantum error correction reduce physical qubit overhead by up to 10x and time overhead by 2-6x for codes including Steane, Golay, and surface codes.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.