Pith. sign in

REVIEW 2 cited by

Adaptive Quantum State Tomography with Neural Networks

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 1812.06693 v1 pith:LCYXRPOV submitted 2018-12-17 quant-ph cs.LG

classification quant-phcs.LG
keywords statequantumalgorithmmeasurementstomographyadaptivecomputationalcopies
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
abstract

Quantum State Tomography is the task of determining an unknown quantum state by making measurements on identical copies of the state. Current algorithms are costly both on the experimental front -- requiring vast numbers of measurements -- as well as in terms of the computational time to analyze those measurements. In this paper, we address the problem of analysis speed and flexibility, introducing \textit{Neural Adaptive Quantum State Tomography} (NA-QST), a machine learning based algorithm for quantum state tomography that adapts measurements and provides orders of magnitude faster processing while retaining state-of-the-art reconstruction accuracy. Our algorithm is inspired by particle swarm optimization and Bayesian particle-filter based adaptive methods, which we extend and enhance using neural networks. The resampling step, in which a bank of candidate solutions -- particles -- is refined, is in our case learned directly from data, removing the computational bottleneck of standard methods. We successfully replace the Bayesian calculation that requires computational time of $O(\mathrm{poly}(n))$ with a learned heuristic whose time complexity empirically scales as $O(\log(n))$ with the number of copies measured $n$, while retaining the same reconstruction accuracy. This corresponds to a factor of a million speedup for $10^7$ copies measured. We demonstrate that our algorithm learns to work with basis, symmetric informationally complete (SIC), as well as other types of POVMs. We discuss the value of measurement adaptivity for each POVM type, demonstrating that its effect is significant only for basis POVMs. Our algorithm can be retrained within hours on a single laptop for a two-qubit situation, which suggests a feasible time-cost when extended to larger systems. It can also adapt to a subset of possible states, a choice of the type of measurement, and other experimental details.

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. Guess, SWAP, Repeat : Capturing Quantum Snapshots in Classical Memory

    quant-ph 2025-04 reject novelty 5.0 of 10

    A machine learning method learns a pure quantum state's classical description using only SWAP-test fidelity as feedback, demonstrated in simulation and on single-qubit IBM hardware, but it is framed misleadingly as a ...

  2. Learning Algebraic Models of Quantum Entanglement

    cs.LG 2019-08 reject novelty 3.0 of 10

    Neural networks trained on algebraic-variety membership can classify separability and degeneracy of small pure quantum states, but the advertised border-rank and 5-qubit hyperdeterminant conclusions rest on flawed lab...

Pith tools