Classical shadows with Pauli-invariant unitary ensembles
- URL: http://arxiv.org/abs/2202.03272v1
- Date: Mon, 7 Feb 2022 15:06:30 GMT
- Title: Classical shadows with Pauli-invariant unitary ensembles
- Authors: Kaifeng Bu, Dax Enshan Koh, Roy J. Garcia, Arthur Jaffe
- Abstract summary: 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.
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: The classical shadow estimation protocol is a noise-resilient and
sample-efficient quantum algorithm for learning the properties of quantum
systems. Its performance depends on the choice of a unitary ensemble, which
must be chosen by a user in advance. What is the weakest assumption that can be
made on the chosen unitary ensemble that would still yield meaningful and
interesting results? To address this question, we consider the class of
Pauli-invariant unitary ensembles, i.e. unitary ensembles that are invariant
under multiplication by a Pauli operator. This class includes many previously
studied ensembles like the local and global Clifford ensembles as well as
locally scrambled unitary ensembles. For this class of ensembles, we provide an
explicit formula for the reconstruction map corresponding to the shadow channel
and give explicit sample complexity bounds. In addition, we provide two
applications of our results. Our first application is to locally scrambled
unitary ensembles, where we give explicit formulas for the reconstruction map
and sample complexity bounds that circumvent the need to solve an
exponential-sized linear system. Our second application is to the classical
shadow tomography of quantum channels with Pauli-invariant unitary ensembles.
Our results pave the way for more efficient or robust protocols for predicting
important properties of quantum states, such as their fidelity, entanglement
entropy, and quantum Fisher information.
Related papers
- Unified framework for efficiently computable quantum circuits [0.0]
Quantum circuits consisting of Clifford and matchgates are two classes of circuits that are known to be efficiently simulatable on a classical computer.
We introduce a unified framework that shows in a transparent way the special structure that allows these circuits can be efficiently simulatable.
arXiv Detail & Related papers (2024-01-16T08:04:28Z) - Sample Complexity for Quadratic Bandits: Hessian Dependent Bounds and
Optimal Algorithms [64.10576998630981]
We show the first tight characterization of the optimal Hessian-dependent sample complexity.
A Hessian-independent algorithm universally achieves the optimal sample complexities for all Hessian instances.
The optimal sample complexities achieved by our algorithm remain valid for heavy-tailed noise distributions.
arXiv Detail & Related papers (2023-06-21T17:03:22Z) - A hybrid quantum-classical classifier based on branching multi-scale
entanglement renormalization ansatz [5.548873288570182]
This paper proposes a quantum semi-supervised classifier based on label propagation.
Considering the difficulty of graph construction, we develop a variational quantum label propagation (VQLP) method.
In this method, a locally parameterized quantum circuit is created to reduce the parameters required in the optimization.
arXiv Detail & Related papers (2023-03-14T13:46:45Z) - Tensor Networks or Decision Diagrams? Guidelines for Classical Quantum
Circuit Simulation [65.93830818469833]
tensor networks and decision diagrams have independently been developed with differing perspectives, terminologies, and backgrounds in mind.
We consider how these techniques approach classical quantum circuit simulation, and examine their (dis)similarities with regard to their most applicable abstraction level.
We provide guidelines for when to better use tensor networks and when to better use decision diagrams in classical quantum circuit simulation.
arXiv Detail & Related papers (2023-02-13T19:00:00Z) - Operator relaxation and the optimal depth of classical shadows [0.0]
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.
arXiv Detail & Related papers (2022-12-22T18:46:46Z) - Reinforcement Learning from Partial Observation: Linear Function Approximation with Provable Sample Efficiency [111.83670279016599]
We study reinforcement learning for partially observed decision processes (POMDPs) with infinite observation and state spaces.
We make the first attempt at partial observability and function approximation for a class of POMDPs with a linear structure.
arXiv Detail & Related papers (2022-04-20T21:15:38Z) - 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) - 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) - Classical-quantum correspondence for two-level pseudo-Hermitian systems [0.0]
We show that the presence of a complex external field can be described by a pseudo-Hermitian Hamiltonian.
We construct a covariant quantization scheme which maps canonically related pseudoclassical theories to unitarily equivalent quantum realizations.
arXiv Detail & Related papers (2020-07-03T18:00:07Z) - Binary Classification with Classical Instances and Quantum Labels [0.0]
In classical statistical learning theory, one of the most well studied problems is that of binary classification.
A quantum analog of this task, with training data given as a quantum state has also been intensely studied and is now known to have the same sample complexity as its classical counterpart.
We propose a novel quantum version of the classical binary classification task by considering maps with classical input and quantum output and corresponding classical-quantum training data.
arXiv Detail & Related papers (2020-06-10T18:00:09Z) - A refinement of Reznick's Positivstellensatz with applications to
quantum information theory [72.8349503901712]
In Hilbert's 17th problem Artin showed that any positive definite in several variables can be written as the quotient of two sums of squares.
Reznick showed that the denominator in Artin's result can always be chosen as an $N$-th power of the squared norm of the variables.
arXiv Detail & Related papers (2019-09-04T11:46: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.