analiza aiqbench
This research introduces a novel class of solvable quantum circuits featuring non-Markovian influence matrices, offering an efficient framework for simulating complex local dynamics within many-body systems. By constructing these circuits from dressed free-fermion models with specific interactions, the study bridges gaps between exactly solvable instances and typical correlation patterns observed in broader quantum physics contexts. The work also provides a direct interpretation of error correction schemes where deviations from exact solvability act as simulated errors, advancing theoretical tools for quantum simulation.
Solvable Quantum Circuits with non-Markovian Influence Matrices
arXiv:2607.25969v1 Announce Type: cross Abstract: Influence matrices encode the action exerted on local subsystems by the rest of an extended quantum many-body system during their evolution. Thus, knowledge of the influence matrix facilitates computationally efficient simulations of local dynamics. Here we propose a new systematic approach to generating quantum circuits with complex dynamics for which the influence matrices can be written down exactly. In contrast to previous frameworks of this kind, such as dual-unitary circuits, the resulting influence matrices are non-Markovian, exhibiting nontrivial temporal correlations. We explicitly construct a broad family of circuits of this kind, based on dressing free-fermion (matchgate) circuits with appropriately chosen interaction terms. We show that, contrary to previous solvable instances, these circuits produce patterns of correlations that closely resemble that of typical many-body systems. Our approach can be directly interpreted in terms of an error correction scheme where the terms breaking the solvability of the influence matrices play the role of errors.
Abstract:Influence matrices encode the action exerted on local subsystems by the rest of an extended quantum many-body system during their evolution. Thus, knowledge of the influence matrix facilitates computationally efficient simulations of local dynamics. Here we propose a new systematic approach to generating quantum circuits with complex dynamics for which the influence matrices can be written down exactly. In contrast to previous frameworks of this kind, such as dual-unitary circuits, the resulting influence matrices are non-Markovian, exhibiting nontrivial temporal correlations. We explicitly construct a broad family of circuits of this kind, based on dressing free-fermion (matchgate) circuits with appropriately chosen interaction terms. We show that, contrary to previous solvable instances, these circuits produce patterns of correlations that closely resemble that of typical many-body systems. Our approach can be directly interpreted in terms of an error correction scheme where the terms breaking the solvability of the influence matrices play the role of errors.
Statistical Mechanics (cond-mat.stat-mech); Mathematical Physics (math-ph); Quantum Physics (quant-ph)
arXiv:2607.25969 [cond-mat.stat-mech]
(or arXiv:2607.25969v1 [cond-mat.stat-mech] for this version)
https://doi.org/10.48550/arXiv.2607.25969 Focus to learn more arXiv-issued DOI via DataCite (pending registration)
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Text integral sub licența deschisă a publicației · 252 cuvinte
Subiecte conexe

New theory ranks the complexity of quantum system simulations
Quantum Zeitgeist · 13 oct. 2026

Researchers map quantum dynamics to free probability theory
Quantum Zeitgeist · 6 aug. 2026

A solvable quantum circuit’s limits define chaos
Quantum Zeitgeist · 4 oct. 2026

Researchers Simulate Systems with Memory Using Quantum Algorithms
Quantum Zeitgeist · 17 aug. 2026