Pith. sign in

REVIEW 1 cited by

Quantum Algorithms for tensor-SVD

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 2405.19485 v1 pith:UHBDZOLX submitted 2024-05-29 quant-ph

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

A promising area of applications for quantum computing is in linear algebra problems. In this work, we introduce two new quantum t-SVD (tensor-SVD) algorithms. The first algorithm is largely based on previous work that proposed a quantum t-SVD algorithm for context-aware recommendation systems. The new algorithm however seeks to address and fix certain drawbacks to the original, and is fundamentally different in its approach compared to the existing work. The second algorithm proposed uses a hybrid variational approach largely based on a known variational quantum SVD algorithm.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

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

  1. GPU-Accelerated Host-Aware Dead-Measurement Detection in Hybrid Quantum--Classical Programs: Full Version

    quant-ph 2026-07 conditional novelty 6.5 of 10

    Semantics-aware abstract interpretation of classical host code finds non-contributory measurements, enabling ~38% gate removal standalone and >30% after SOTA circuit optimizers, with GPU speedups via levelized SSA.

Pith tools