Operator relaxation and the optimal depth of classical shadows
- URL: http://arxiv.org/abs/2212.11963v3
- Date: Thu, 18 May 2023 06:09:22 GMT
- Title: Operator relaxation and the optimal depth of classical shadows
- Authors: Matteo Ippoliti, Yaodong Li, Tibor Rakovszky, Vedika Khemani
- Abstract summary: We study the sample complexity of learning the expectation value of Pauli operators via shallow shadows''
We show that the shadow norm is expressed in terms of properties of the Heisenberg time evolution of operators under the randomizing circuit.
- Score: 0.0
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: Classical shadows are a powerful method for learning many properties of
quantum states in a sample-efficient manner, by making use of randomized
measurements. Here we study the sample complexity of learning the expectation
value of Pauli operators via ``shallow shadows'', a recently-proposed version
of classical shadows in which the randomization step is effected by a local
unitary circuit of variable depth $t$. We show that the shadow norm (the
quantity controlling the sample complexity) is expressed in terms of properties
of the Heisenberg time evolution of operators under the randomizing
(``twirling'') circuit -- namely the evolution of the weight distribution
characterizing the number of sites on which an operator acts nontrivially. For
spatially-contiguous Pauli operators of weight $k$, this entails a competition
between two processes: operator spreading (whereby the support of an operator
grows over time, increasing its weight) and operator relaxation (whereby the
bulk of the operator develops an equilibrium density of identity operators,
decreasing its weight). From this simple picture we derive (i) an upper bound
on the shadow norm which, for depth $t\sim \log(k)$, guarantees an exponential
gain in sample complexity over the $t=0$ protocol in any spatial dimension, and
(ii) quantitative results in one dimension within a mean-field approximation,
including a universal subleading correction to the optimal depth, found to be
in excellent agreement with infinite matrix product state numerical
simulations. Our work connects fundamental ideas in quantum many-body dynamics
to applications in quantum information science, and paves the way to
highly-optimized protocols for learning different properties of quantum states.
Related papers
- Efficient Quantum Circuits for Non-Unitary and Unitary Diagonal Operators with Space-Time-Accuracy trade-offs [1.0749601922718608]
Unitary and non-unitary diagonal operators are fundamental building blocks in quantum algorithms.
We introduce a general approach to implement unitary and non-unitary diagonal operators with efficient-adjustable-depth quantum circuits.
arXiv Detail & Related papers (2024-04-03T15:42:25Z) - Demonstration of Robust and Efficient Quantum Property Learning with
Shallow Shadows [1.412425180760368]
We propose a robust shallow shadows protocol for characterizing quantum states on current quantum computing platforms.
Our protocol correctly recovers state properties such as expectation values, fidelity, and entanglement entropy, while maintaining a lower sample complexity.
This combined theoretical and experimental analysis positions the robust shallow shadow protocol as a scalable, robust, and sample-efficient protocol.
arXiv Detail & Related papers (2024-02-27T21:53:32Z) - Quantum Tensor Product Decomposition from Choi State Tomography [0.0]
We present an algorithm for unbalanced partitions into a small subsystem and a large one (the environment) to compute the tensor product decomposition of a unitary.
This quantum algorithm may be used to make predictions about operator non-locality, effective open quantum dynamics on a subsystem, as well as for finding low-rank approximations and low-depth compilations of quantum circuit unitaries.
arXiv Detail & Related papers (2024-02-07T16:36:47Z) - 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) - Exploring the role of parameters in variational quantum algorithms [59.20947681019466]
We introduce a quantum-control-inspired method for the characterization of variational quantum circuits using the rank of the dynamical Lie algebra.
A promising connection is found between the Lie rank, the accuracy of calculated energies, and the requisite depth to attain target states via a given circuit architecture.
arXiv Detail & Related papers (2022-09-28T20:24:53Z) - Improved Quantum Algorithms for Fidelity Estimation [77.34726150561087]
We develop new and efficient quantum algorithms for fidelity estimation with provable performance guarantees.
Our algorithms use advanced quantum linear algebra techniques, such as the quantum singular value transformation.
We prove that fidelity estimation to any non-trivial constant additive accuracy is hard in general.
arXiv Detail & Related papers (2022-03-30T02:02:16Z) - Classical shadows with Pauli-invariant unitary ensembles [0.0]
We consider the class of Pauli-invariant unitary ensembles that are invariant under multiplication by a Pauli operator.
Our results pave the way for more efficient or robust protocols for predicting important properties of quantum states.
arXiv Detail & Related papers (2022-02-07T15:06:30Z) - 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) - Bosonic field digitization for quantum computers [62.997667081978825]
We address the representation of lattice bosonic fields in a discretized field amplitude basis.
We develop methods to predict error scaling and present efficient qubit implementation strategies.
arXiv Detail & Related papers (2021-08-24T15:30:04Z) - Efficient quantum circuit simulation using a multi-qubit Bloch vector
representation of density matrices [0.0]
A generalization to $n$ qubits via tensor products represents a density operator by a real vector of length $4n$.
We study this approach for the purpose of quantum circuit simulation, including noise processes.
arXiv Detail & Related papers (2021-03-25T16:36:48Z) - Relevant OTOC operators: footprints of the classical dynamics [68.8204255655161]
The OTOC-RE theorem relates the OTOCs summed over a complete base of operators to the second Renyi entropy.
We show that the sum over a small set of relevant operators, is enough in order to obtain a very good approximation for the entropy.
In turn, this provides with an alternative natural indicator of complexity, i.e. the scaling of the number of relevant operators with time.
arXiv Detail & Related papers (2020-07-31T19:23:26Z)
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.