Pith. sign in

REVIEW 2 cited by

Machine learning of quantum channels on NISQ devices

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.12598 v2 pith:CZ7R2WI4 submitted 2024-05-21 quant-ph cond-mat.dis-nncond-mat.stat-mech

classification quant-phcond-mat.dis-nncond-mat.stat-mech
keywords dynamicsquantumchannelsapproachdevicesdiscrete-timeeffectivegeneric
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

World-wide efforts aim at the realization of advanced quantum simulators and processors. However, despite the development of intricate hardware and pulse control systems, it may still not be generally known which effective quantum dynamics, or channels, are implemented on these devices. To systematically infer those, we propose a neural-network algorithm approximating generic discrete-time dynamics through the repeated action of an effective quantum channel. We test our approach considering time-periodic Lindblad dynamics as well as non-unitary subsystem dynamics in many-body unitary circuits. Moreover, we exploit it to investigate cross-talk effects on the ibmq_ehningen quantum processor, which showcases our method as a practically applicable tool for inferring quantum channels when the exact nature of the underlying dynamics on the physical device is not known a priori. While the present approach is tailored for learning Markovian dynamics, we discuss how it can be adapted to also capture generic non-Markovian discrete-time evolutions.

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. An Iterative Methodology for Unitary Quantum Channel Search

    math.NA 2025-06 reject novelty 5.0 of 10

    An iterative polar-decomposition method for finding a unitary U with sigma approx U rho U* from state pairs, with a claim of convergence to a local minimum and a limited-data reconstruction scheme.

  2. Learning Equivariant Maps with Variational Quantum Circuits

    quant-ph 2024-12 reject novelty 4.0 of 10

    A parameterized quantum embedding can be trained to make a circuit output invariant under a finite group, which the authors interpret as learning an equivariant map between representations.

Pith tools