Probing scrambling and operator size distributions using random mixed states and local measurements

• URL: http://arxiv.org/abs/2305.16992v1
• Date: Fri, 26 May 2023 14:52:36 GMT
• Title: Probing scrambling and operator size distributions using random mixed states and local measurements
• Authors: Philip Daniel Blocher, Karthik Chinni, Sivaprasad Omanakuttan, Pablo M. Poggi
• Abstract summary: We put forward an alternative toolbox of measurement protocols to experimentally probe scrambling. We demonstrate how to efficiently probe the probability-generating function of the operator distribution. We show that manipulating the initial state of the protocol allows us to directly obtain the individual elements of the distribution for small system sizes.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: The dynamical spreading of quantum information through a many-body system, typically called scrambling, is a complex process that has proven to be essential to describe many properties of out-of-equilibrium quantum systems. Scrambling can, in principle, be fully characterized via the use of out-of-time-ordered correlation functions, which are notoriously hard to access experimentally. In this work, we put forward an alternative toolbox of measurement protocols to experimentally probe scrambling by accessing properties of the operator size probability distribution, which tracks the size of the support of observables in a many-body system over time. Our measurement protocols require the preparation of separable mixed states together with local operations and measurements, and combine the tools of randomized operations, a modern development of near-term quantum algorithms, with the use of mixed states, a standard tool in NMR experiments. We demonstrate how to efficiently probe the probability-generating function of the operator distribution and discuss the challenges associated with obtaining the moments of the operator distribution. We further show that manipulating the initial state of the protocol allows us to directly obtain the individual elements of the distribution for small system sizes.

Related papers

• Ancilla-free measurement of out-of-time-ordered correlation functions: General measurement protocol and Rydberg atom implementation [0.0]
  We introduce a protocol that gives access to out-of-time-ordered correlation functions in many-body quantum systems. We put forward a strategy for Hamiltonian sign inversion $Hto-H$ in arrays of Rydberg-dressed atoms.
  arXiv  Detail & Related papers  (2024-03-13T16:20:37Z)
• Random-matrix models of monitored quantum circuits [0.0]
  We study the competition between Haar-random unitary dynamics and measurements for unstructured systems of qubits. For projective measurements, we derive various properties of the statistical ensemble of Kraus operators. We expect that the statistical properties of Kraus operators will serve as a model for the entangling phase of monitored quantum systems.
  arXiv  Detail & Related papers  (2023-12-14T18:46:53Z)
• Many-body entropies and entanglement from polynomially-many local measurements [0.26388783516590225]
  We show that efficient estimation strategies exist under the assumption that all the spatial correlation lengths are finite. We argue that our method could be practically useful to detect bipartite mixed-state entanglement for large numbers of qubits available in today's quantum platforms.
  arXiv  Detail & Related papers  (2023-11-14T12:13:15Z)
• Multimodal deep representation learning for quantum cross-platform verification [60.01590250213637]
  Cross-platform verification, a critical undertaking in the realm of early-stage quantum computing, endeavors to characterize the similarity of two imperfect quantum devices executing identical algorithms. We introduce an innovative multimodal learning approach, recognizing that the formalism of data in this task embodies two distinct modalities. We devise a multimodal neural network to independently extract knowledge from these modalities, followed by a fusion operation to create a comprehensive data representation.
  arXiv  Detail & Related papers  (2023-11-07T04:35:03Z)
• Benchmarking a boson sampler with Hamming nets [1.0555513406636092]
  We propose a machine-learning-based protocol to benchmark a boson sampler with unknown scattering matrix. Our framework can be directly applied for characterizing boson sampling devices that are currently available in experiments.
  arXiv  Detail & Related papers  (2023-05-18T13:07:02Z)
• 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)
• The randomized measurement toolbox [3.2095357952052854]
  We review recently developed protocols for probing the properties of complex many-qubit systems. In all these protocols, a quantum state is repeatedly prepared and measured in a randomly chosen basis. We discuss a range of use cases that have already been realized in quantum devices.
  arXiv  Detail & Related papers  (2022-03-21T22:33:18Z)
• Finite resolution ancilla-assisted measurements of quantum work distributions [77.34726150561087]
  We consider an ancilla-assisted protocol measuring the work done on a quantum system driven by a time-dependent Hamiltonian. We consider system Hamiltonians which both commute and do not commute at different times, finding corrections to fluctuation relations like the Jarzynski equality and the Crooks relation.
  arXiv  Detail & Related papers  (2021-11-30T15:08:25Z)
• A Trainable Optimal Transport Embedding for Feature Aggregation and its Relationship to Attention [96.77554122595578]
  We introduce a parametrized representation of fixed size, which embeds and then aggregates elements from a given input set according to the optimal transport plan between the set and a trainable reference. Our approach scales to large datasets and allows end-to-end training of the reference, while also providing a simple unsupervised learning mechanism with small computational cost.
  arXiv  Detail & Related papers  (2020-06-22T08:35:58Z)
• Generalized Sliced Distances for Probability Distributions [47.543990188697734]
  We introduce a broad family of probability metrics, coined as Generalized Sliced Probability Metrics (GSPMs) GSPMs are rooted in the generalized Radon transform and come with a unique geometric interpretation. We consider GSPM-based gradient flows for generative modeling applications and show that under mild assumptions, the gradient flow converges to the global optimum.
  arXiv  Detail & Related papers  (2020-02-28T04:18:00Z)
• Distributed, partially collapsed MCMC for Bayesian Nonparametrics [68.5279360794418]
  We exploit the fact that completely random measures, which commonly used models like the Dirichlet process and the beta-Bernoulli process can be expressed as, are decomposable into independent sub-measures. We use this decomposition to partition the latent measure into a finite measure containing only instantiated components, and an infinite measure containing all other components. The resulting hybrid algorithm can be applied to allow scalable inference without sacrificing convergence guarantees.
  arXiv  Detail & Related papers  (2020-01-15T23:10:13Z)

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.