Characterizing quantum pseudorandomness by machine learning

• URL: http://arxiv.org/abs/2205.14667v2
• Date: Tue, 11 Oct 2022 15:01:45 GMT
• Title: Characterizing quantum pseudorandomness by machine learning
• Authors: Masahiro Fujii, Ryosuke Kutsuzawa, Yasunari Suzuki, Yoshifumi Nakata, Masaki Owari
• Abstract summary: We propose a method for verifying random dynamics from the data that is experimentally easy-to-access. We use measurement probabilities estimated by a finite number of measurements of quantum states generated by a given random dynamics.
• Score: 2.589904091148018
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: 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.

Related papers

• Fourier Neural Operators for Learning Dynamics in Quantum Spin Systems [77.88054335119074]
  We use FNOs to model the evolution of random quantum spin systems. We apply FNOs to a compact set of Hamiltonian observables instead of the entire $2n$ quantum wavefunction.
  arXiv  Detail & Related papers  (2024-09-05T07:18:09Z)
• Efficient Learning for Linear Properties of Bounded-Gate Quantum Circuits [63.733312560668274]
  Given a quantum circuit containing d tunable RZ gates and G-d Clifford gates, can a learner perform purely classical inference to efficiently predict its linear properties? We prove that the sample complexity scaling linearly in d is necessary and sufficient to achieve a small prediction error, while the corresponding computational complexity may scale exponentially in d. We devise a kernel-based learning model capable of trading off prediction error and computational complexity, transitioning from exponential to scaling in many practical settings.
  arXiv  Detail & Related papers  (2024-08-22T08:21:28Z)
• Subsystem Information Capacity in Random Circuits and Hamiltonian Dynamics [3.6343650965508187]
  This study focuses on the effective channels formed by the subsystem of random quantum circuits and quantum Hamiltonian evolution. We reveal the impact of different initial information encoding schemes on information dynamics including one-to-one, one-to-many, and many-to-many.
  arXiv  Detail & Related papers  (2024-05-08T14:18:36Z)
• Inferring interpretable dynamical generators of local quantum observables from projective measurements through machine learning [17.27816885271914]
  We utilize a machine-learning approach to infer the dynamical generator governing the evolution of local observables in a many-body system from noisy data. Our method is not only useful for extracting effective dynamical generators from many-body systems, but may also be applied for inferring decoherence mechanisms of quantum simulation and computing platforms.
  arXiv  Detail & Related papers  (2023-06-06T18:01:18Z)
• Statistical learning on randomized data to verify quantum state k-designs [0.0]
  Random ensembles of pure states have proven to be extremely important in various aspects of quantum physics. generating a fully random ensemble is experimentally challenging but approximations are just as useful. verifying their degree of randomness can be an expensive task, similar to performing full quantum state tomography on many-body systems.
  arXiv  Detail & Related papers  (2023-05-02T14:46:28Z)
• Importance sampling for stochastic quantum simulations [68.8204255655161]
  We introduce the qDrift protocol, which builds random product formulas by sampling from the Hamiltonian according to the coefficients. We show that the simulation cost can be reduced while achieving the same accuracy, by considering the individual simulation cost during the sampling stage. Results are confirmed by numerical simulations performed on a lattice nuclear effective field theory.
  arXiv  Detail & Related papers  (2022-12-12T15:06:32Z)
• Generalization Metrics for Practical Quantum Advantage in Generative Models [68.8204255655161]
  Generative modeling is a widely accepted natural use case for quantum computers. We construct a simple and unambiguous approach to probe practical quantum advantage for generative modeling by measuring the algorithm's generalization performance. Our simulation results show that our quantum-inspired models have up to a $68 times$ enhancement in generating unseen unique and valid samples.
  arXiv  Detail & Related papers  (2022-01-21T16:35:35Z)
• Quantum simulation using noisy unitary circuits and measurements [0.0]
  Noisy quantum circuits have become an important cornerstone of our understanding of quantum many-body dynamics. We give an overview of two classes of dynamics studied using random-circuit models, with a particular focus on the dynamics of quantum entanglement. We consider random-circuit sampling experiments and discuss the usefulness of random quantum states for simulating quantum many-body dynamics on NISQ devices.
  arXiv  Detail & Related papers  (2021-12-13T14:00:06Z)
• Learnability of the output distributions of local quantum circuits [53.17490581210575]
  We investigate, within two different oracle models, the learnability of quantum circuit Born machines. We first show a negative result, that the output distributions of super-logarithmic depth Clifford circuits are not sample-efficiently learnable. We show that in a more powerful oracle model, namely when directly given access to samples, the output distributions of local Clifford circuits are computationally efficiently PAC learnable.
  arXiv  Detail & Related papers  (2021-10-11T18:00:20Z)
• Quantum algorithms for quantum dynamics: A performance study on the spin-boson model [68.8204255655161]
  Quantum algorithms for quantum dynamics simulations are traditionally based on implementing a Trotter-approximation of the time-evolution operator. variational quantum algorithms have become an indispensable alternative, enabling small-scale simulations on present-day hardware. We show that, despite providing a clear reduction of quantum gate cost, the variational method in its current implementation is unlikely to lead to a quantum advantage.
  arXiv  Detail & Related papers  (2021-08-09T18:00:05Z)
• Machine learning approach for quantum non-Markovian noise classification [1.2891210250935146]
  We show that machine learning and artificial neural network models can be used to classify noisy quantum dynamics. Our approach is expected to find direct application in a vast number of experimental schemes and also for the noise benchmarking of the already available noisy intermediate-scale quantum devices.
  arXiv  Detail & Related papers  (2021-01-08T20:56:56Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.