Random dynamics in isolated quantum systems is of practical use in quantum information and is of theoretical interest in fundamental physics. Despite a large number of theoretical studies, it has not been addressed how random dynamics can be verified from experimental data. In this paper, based on an information-theoretic formulation of random dynamics, i.e., unitary $t$-designs, we propose a method for verifying random dynamics from the data that is experimentally easy-to-access. More specifically, we use measurement probabilities estimated by a finite number of measurements of quantum states generated by a given random dynamics. Based on a supervised learning method, we construct classifiers of random dynamics and show that the classifiers succeed to characterize random dynamics. We then apply the classifiers to the data set generated by local random circuits (LRCs), which are canonical quantum circuits with growing circuit complexity, and show that the classifiers successfully characterize the growing features. We further apply the classifiers to noisy LRCs, showing the possibility of using them for verifying noisy quantum devices, and to monitored LRCs, indicating that the measurement-induced phase transition may possibly not be directly related to randomness.
Random dynamics in isolated quantum systems is of practical use in quantum information and is of theoretical interest in fundamental physics. Despite a large number of theoretical studies, it has not been addressed how random dynamics can be verified from experimental data. In this paper, based on an information-theoretic formulation of random dynamics, i.e., unitary t-designs, we propose a method for verifying random dynamics from the data that is experimentally easy-to-access. More specifically, we use measurement probabilities estimated by a finite number of measurements of quantum states generated by a given random dynamics. Based on a supervised learning method, we construct classifiers of random dynamics and show that the classifiers succeed to characterize random dynamics. We then apply the classifiers to the data set generated by local random circuits (LRCs), which are canonical quantum circuits with growing circuit complexity, and show that the classifiers successfully characterize the growing features. We further apply the classifiers to noisy LRCs, showing the possibility of using them for verifying noisy quantum devices, and to monitored LRCs, indicating that the measurement-induced phase transition may possibly not be directly related to randomness.
Random ensembles of pure states have proven to be extremely important in various aspects of quantum physics such as benchmarking the performance of quantum circuits, testing for quantum advantage, studying many-body thermalization, and the black hole information paradox. Although generating a truly random quantum ensemble is experimentally challenging, approximate realizations are equally valuable and are known to emerge naturally in a variety of physical models, including Rydberg setups. These are referred to as approximate quantum state designs, and verifying their degree of randomness can be a measurement-intensive task, similar to performing full quantum state tomography on many-body systems. In this theoretical work, we present a measurement scheme and analysis techniques to validate the degree of randomness of a quantum ensemble generated by a simulated experimental setup. This is achieved by translating the information residing in the complex many-body state into a succinct representation of classical data using projective measurements in randomly chosen bases, which is then processed using methods of statistical inference such as maximum-likelihood estimation and neural networks, benchmarked against the predictions of shadow tomography. Our scheme only requires individually addressed single-qubit operations to be performed in order to be employed, making it applicable for a range of physical platforms.
Quantum circuits—built from local unitary gates and local measurements—are a new playground for quantum many-body physics and a tractable setting to explore universal collective phenomena far from equilibrium. These models have shed light on longstanding questions about thermalization and chaos, and on the underlying universal dynamics of quantum information and entanglement. In addition, such models generate new sets of questions and give rise to phenomena with no traditional analog, such as dynamical phase transitions in quantum systems that are monitored by an external observer. Quantum circuit dynamics is also topical in view of experimental progress in building digital quantum simulators that allow control of precisely these ingredients. Randomness in the circuit elements allows a high level of theoretical control, with a key theme being mappings between real-time quantum dynamics and effective classical lattice models or dynamical processes. Many of the universal phenomena that can be identified in this tractable setting apply to much wider classes of more structured many-body dynamics.
The intersection of physics and information theory has advanced rapidly in the past few decades. Information-theoretic concepts have been employed to formulate physical laws, while quantum information processing, such as quantum computation and communication, has been developed both theoretically and experimentally. Simultaneously, understanding the universal or specific behaviors of quantum many-body systems has remained a central challenge since shortly after the inception of quantum mechanics. This is studied in part by statistical mechanics, which models complex many-body systems using simple ensembles. In this thesis, we investigate information-theoretic problems in quantum many-body dynamics that lie at the intersection of these avenues. To begin with, we investigate the extent of randomness, captured by unitary designs, in random quantum circuits. Quantum circuits serve as discrete models for random many-body quantum dynamics. Specifically, we study how the internal structure of random gates influences the generation of randomness in quantum circuits. We demonstrate that the spectral gap of structured random circuits can be larger than that of unstructured ones, implying that the former can converge to designs faster than the latter. In this analysis, free-fermionic techniques play a crucial role in obtaining exact results on the spectrum of second-moment operators. We then investigate the effect of quantum measurements on the quantum complexity in random circuits. Here, the quantum complexity of a state is defined as the minimum number of local gates required for its exact preparation in quantum circuits. We prove that in monitored random quantum circuits, the complexity undergoes a measurement-induced phase transition by leveraging techniques from percolation theory. Above the critical measurement rate, the complexity saturates quickly. Below the threshold, it grows at least linearly for an exponentially long time. Finally, we discuss quantum communication scenarios in noisy quantum dynamics, where we simulate the identity channel by combining a given noisy quantum dynamics and our quantum operational strategies. Specifically, we consider multi-time noisy processes and optimize our strategies to simulate near-noiseless channels, both of which are mathematically formulated using quantum combs. We introduce formal concepts of simulation and capacity for quantum combs, and we derive lower-bounds on the minimum simulation error in terms of semidefinite programming (SDP). We impose certain conditions on our strategies, such as the positive partial transpose (PPT) preserving constraint. We then analyze these SDPs for simple models, such as the depolarizing process, to determine their fundamental communication limits.
Systems reaching thermal equilibrium are ubiquitous. For classical systems, this phenomenon is typically understood statistically through ergodicity in phase space, but translating this to quantum systems is a long-standing problem of interest. Recently, a strong notion of quantum ergodicity has been proposed, namely, that isolated, global quantum states uniformly explore their available state space, dubbed . Here, we observe signatures of this process with an experimental Rydberg quantum simulator and various numerical models, before generalizing to the case of a local quantum system interacting with its environment. For a closed system, where the environment is a complementary subsystem, we predict and observe a smooth quantum-to-classical transition in that observables progress from large, quantum fluctuations to small, Gaussian fluctuations as the bath size grows. This transition exhibits universal properties on a quantitative level among a wide range of systems, including those at finite temperature, those with itinerant particles, and random circuits. For an open system, where the environment is uncontrolled, we predict the statistics of observables under largely arbitrary noise channels including those with correlated errors, allowing us to discriminate between candidate error models both for continuous Hamiltonian time evolution and for digital random circuits. This allows for computationally efficient experimental noise learning and, more broadly, is a new avenue for quantitatively classifying the behavior of noisy quantum systems. Ultimately, our results clarify the role of ergodicity in quantum dynamics, with fundamental and practical consequences.
Quantum process characterization is a fundamental task in quantum information processing, yet conventional methods, such as quantum process tomography, require prohibitive resources and lack scalability. Here, we introduce an efficient quantum process learning method specifically designed for short-time Hamiltonian dynamics. Our approach reconstructs an equivalent quantum circuit representation from measurement data of unknown Hamiltonian evolution without requiring additional assumptions and achieves polynomial sample and computational efficiency. Our results have broad applications in various directions. We demonstrate applications in quantum machine learning, where our protocol enables efficient training of variational quantum neural networks by directly learning unitary transformations. Additionally, it facilitates the prediction of quantum expectation values with provable efficiency and provides a robust framework for verifying quantum computations and benchmarking realistic noisy quantum hardware. This work establishes a new theoretical foundation for practical quantum dynamics learning, paving the way for scalable quantum process characterization in both near-term and fault-tolerant quantum computing.
Efficient methods for generating pseudorandomly distributed unitary operators are needed for the practical application of Haar-distributed random operators in quantum communication and noise estimation protocols. We develop a theoretical framework for analyzing pseudorandom ensembles generated through a random circuit composition. We prove that the measure over random circuits converges exponentially (with increasing circuit length) to the uniform (Haar) measure on the unitary group, though the rate for uniform convergence must decrease exponentially with the number of qubits. We describe how the rate of convergence for test functions associated with specific randomization tasks leads to weaker convergence conditions that may allow efficient random circuit constructions.