Pith. sign in

REVIEW 1 cited by

Scalable quantum dynamics compilation via quantum machine learning

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 2409.16346 v1 pith:Q4JGJONH submitted 2024-09-24 quant-ph cond-mat.str-elcs.LG

classification quant-phcond-mat.str-elcs.LG
keywords quantumcompilationdynamicsmethodsstateslearningaccuracycircuit
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
abstract

Quantum dynamics compilation is an important task for improving quantum simulation efficiency: It aims to synthesize multi-qubit target dynamics into a circuit consisting of as few elementary gates as possible. Compared to deterministic methods such as Trotterization, variational quantum compilation (VQC) methods employ variational optimization to reduce gate costs while maintaining high accuracy. In this work, we explore the potential of a VQC scheme by making use of out-of-distribution generalization results in quantum machine learning (QML): By learning the action of a given many-body dynamics on a small data set of product states, we can obtain a unitary circuit that generalizes to highly entangled states such as the Haar random states. The efficiency in training allows us to use tensor network methods to compress such time-evolved product states by exploiting their low entanglement features. Our approach exceeds state-of-the-art compilation results in both system size and accuracy in one dimension ($1$D). For the first time, we extend VQC to systems on two-dimensional (2D) strips with a quasi-1D treatment, demonstrating a significant resource advantage over standard Trotterization methods, highlighting the method's promise for advancing quantum simulation tasks on near-term quantum processors.

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. Learning Circuits with Infinite Tensor Networks

    quant-ph 2025-06 conditional novelty 7.0 of 10

    Infinite tensor networks are used to compile translation-invariant quantum circuits that prepare ground states and time evolution operators with fewer gates than Trotterization.

Pith tools