Unified Framework for Matchgate Classical Shadows

• URL: http://arxiv.org/abs/2409.03836v1
• Date: Thu, 5 Sep 2024 18:01:00 GMT
• Title: Unified Framework for Matchgate Classical Shadows
• Authors: Valentin Heyraud, Héloise Chomet, Jules Tilly,
• Abstract summary: Estimating quantum fermionic properties is a computationally difficult yet crucial task for the study of electronic systems. Recent developments have begun to address this challenge by introducing classical shadows protocols. We propose an approach that unifies these different protocols, proving their equivalence, and deriving from it an optimal sampling scheme.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Estimating quantum fermionic properties is a computationally difficult yet crucial task for the study of electronic systems. Recent developments have begun to address this challenge by introducing classical shadows protocols relying on sampling of Fermionic Gaussian Unitaries (FGUs): a class of transformations in fermionic space which can be conveniently mapped to matchgates circuits. The different protocols proposed in the literature use different sub-ensembles of the orthogonal group $O(2n)$ to which FGUs can be associated. We propose an approach that unifies these different protocols, proving their equivalence, and deriving from it an optimal sampling scheme. We begin by demonstrating that the first three moments of the FGU ensemble associated with $SO(2n)$ and of its intersection with the Clifford group are equal, generalizing a result known for $O(2n)$ and addressing a question raised in previous works. Building on this proof, we establish the equivalence between the shadows protocols resulting from FGU ensembles analyzed in the literature. Finally, from our results, we propose a sampling scheme for a small sub-ensemble of matchgates circuits that is optimal in terms of number of gates and that inherits the performances guarantees of the previous ensembles.

Related papers

• Storage and retrieval of two unknown unitary channels [37.928612512813494]
  We consider the case where the unknown unitary is selected with equal prior probability from two options. First, we prove that the optimal storage strategy involves the sequential application of the $n$ uses of the unknown unitary. Next, we show that incoherent "measure-and-prepare" retrieval achieves the maximum fidelity between the retrieved operation and the original (qubit) unitary.
  arXiv  Detail & Related papers  (2024-10-30T18:27:46Z)
• A Lightweight Protocol for Matchgate Fidelity Estimation [0.0]
  We use a modified Pauli-Liouville representation of quantum channels, with Clifford algebra elements as a basis. We show that this choice of representation leads to a block-diagonal compound matrix structure of matchgate superoperators. We offer simple extensions of our protocol which (without additional overhead) benchmark matchgate circuits intertwined by Clifford circuits, and circuits composed of exclusively nearest-neighbour $XY(theta)$ gates or Givens rotations.
  arXiv  Detail & Related papers  (2024-04-11T17:56:18Z)
• Joint Bayesian Inference of Graphical Structure and Parameters with a Single Generative Flow Network [59.79008107609297]
  We propose in this paper to approximate the joint posterior over the structure of a Bayesian Network. We use a single GFlowNet whose sampling policy follows a two-phase process. Since the parameters are included in the posterior distribution, this leaves more flexibility for the local probability models.
  arXiv  Detail & Related papers  (2023-05-30T19:16:44Z)
• Extragradient-Type Methods with $\mathcal{O} (1/k)$ Last-Iterate Convergence Rates for Co-Hypomonotone Inclusions [8.0153031008486]
  We develop two "Nesterov's accelerated" variants of the well-known extragradient method to approximate a solution of a co-hypomonotone inclusion. Our results can be viewed as alternatives of a recent class of Halpern-type methods for root-finding problems.
  arXiv  Detail & Related papers  (2023-02-08T14:47:34Z)
• Neural Inverse Kinematics [72.85330210991508]
  Inverse kinematic (IK) methods recover the parameters of the joints, given the desired position of selected elements in the kinematic chain. We propose a neural IK method that employs the hierarchical structure of the problem to sequentially sample valid joint angles conditioned on the desired position.
  arXiv  Detail & Related papers  (2022-05-22T14:44:07Z)
• 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)
• Towards Sample-Optimal Compressive Phase Retrieval with Sparse and Generative Priors [59.33977545294148]
  We show that $O(k log L)$ samples suffice to guarantee that the signal is close to any vector that minimizes an amplitude-based empirical loss function. We adapt this result to sparse phase retrieval, and show that $O(s log n)$ samples are sufficient for a similar guarantee when the underlying signal is $s$-sparse and $n$-dimensional.
  arXiv  Detail & Related papers  (2021-06-29T12:49:54Z)
• Revisiting the Sample Complexity of Sparse Spectrum Approximation of Gaussian Processes [60.479499225746295]
  We introduce a new scalable approximation for Gaussian processes with provable guarantees which hold simultaneously over its entire parameter space. Our approximation is obtained from an improved sample complexity analysis for sparse spectrum Gaussian processes (SSGPs)
  arXiv  Detail & Related papers  (2020-11-17T05:41:50Z)
• Fermionic partial tomography via classical shadows [0.0]
  We propose a tomographic protocol for estimating any $ k $-body reduced density matrix ($ k $-RDM) of an $ n $-mode fermionic state. Our approach extends the framework of classical shadows, a randomized approach to learning a collection of quantum-state properties, to the fermionic setting.
  arXiv  Detail & Related papers  (2020-10-30T06:28:26Z)
• Quantum Communication Complexity of Distribution Testing [114.31181206328276]
  Two players each receive $t$ samples from one distribution over $[n]$. The goal is to decide whether their two distributions are equal, or are $epsilon$-far apart. We show that the quantum communication complexity of this problem is $tildeO$(tepsilon2))$ qubits when distributions have low $l$-norm.
  arXiv  Detail & Related papers  (2020-06-26T09:05:58Z)
• Clustering Binary Data by Application of Combinatorial Optimization Heuristics [52.77024349608834]
  We study clustering methods for binary data, first defining aggregation criteria that measure the compactness of clusters. Five new and original methods are introduced, using neighborhoods and population behavior optimization metaheuristics. From a set of 16 data tables generated by a quasi-Monte Carlo experiment, a comparison is performed for one of the aggregations using L1 dissimilarity, with hierarchical clustering, and a version of k-means: partitioning around medoids or PAM.
  arXiv  Detail & Related papers  (2020-01-06T23:33:31Z)

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.