Pith. sign in

REVIEW 4 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

Scalable quantum dynamics compilation via quantum machine learning

classification quant-ph cond-mat.str-elcs.LG
keywords quantumcompilationdynamicsmethodsstateslearningaccuracycircuit
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
Share X Bluesky LinkedIn Reddit HN
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)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 4 Pith papers

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

  1. Simulating the dynamics of an SU(2) matrix model on a trapped-ion quantum computer

    quant-ph 2026-04 conditional novelty 8.0

    First digital quantum simulation of SU(2) matrix model real-time dynamics on Quantinuum H2 using Loschmidt echo, with systematic error breakdown and modest post-selection gains.

  2. Hessian-vector products for tensor networks via recursive tangent-state propagation

    quant-ph 2026-04 unverdicted novelty 7.0

    An analytical Hessian-vector product kernel for arbitrary linear map compositions in tensor networks is derived via recursive tangent-state propagation, enabling scalable Riemannian trust-region optimization with majo...

  3. Simulating the dynamics of an SU(2) matrix model on a trapped-ion quantum computer

    quant-ph 2026-04 unverdicted novelty 6.5

    First digital quantum simulation of an SU(2) bosonic matrix model on Quantinuum H2, with Loschmidt-echo dynamics and a three-way error budget showing post-selection and ZNE give only modest, non-scaling gains.

  4. Variational Thermal State Preparation on Digital Quantum Processors Assisted by Matrix Product States

    quant-ph 2025-10 unverdicted novelty 6.0

    A variational framework assisted by matrix product states prepares approximate thermal Gibbs states for 1D lattices up to 30 sites and 2D lattices up to 6x6 using up to 44 qubits, with a demonstration on IBM Heron hardware.