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.
Machine learning of quantum channels on NISQ devices
1 Pith paper cite this work. Polarity classification is still indexing.
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.
citation-role summary
citation-polarity summary
fields
math.NA 1years
2025 1verdicts
REJECT 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
An Iterative Methodology for Unitary Quantum Channel Search
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.