REVIEW 9 cited by
Gaussian decomposition of magic states for matchgate computations
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Gaussian decomposition of magic states for matchgate computations
read the original abstract
Magic states, pivotal for universal quantum computation via classically simulable Clifford gates, often undergo decomposition into resourceless stabilizer states, facilitating simulation through classical means. This approach yields three operationally significant metrics: stabilizer rank, fidelity, and extent. We extend these simulation methods to encompass matchgate circuits (MGCs), and define equivalent metrics for this setting. We begin with an investigation into the algebraic constraints defining Gaussian states, marking the first explicit characterisation of these states. The explicit description of Gaussian states is pivotal to our methods for tackling all the simulation tasks. Central to our inquiry is the concept of Gaussian rank -- a pivotal metric defining the minimum terms required for decomposing a quantum state into Gaussian constituents. This metric holds paramount significance in determining the runtime of rank-based simulations for MGCs featuring magic state inputs. The absence of low-rank decompositions presents a computational hurdle, thereby prompting a deeper examination of fermionic magic states. We find that the Gaussian rank of 2 instances of our canonical magic state is 4 under symmetry-restricted decompositions. Additionally, our numerical analysis suggests the absence of low-rank decompositions for 2 or 3 copies of this magic state. Further, we explore the Gaussian extent, a convex metric offering an upper bound on the rank. We prove the Gaussian extent's multiplicative behaviour on 4-qubit systems, along with initial strides towards proving its sub-multiplicative nature in general settings. One important result in that direction we present is an upper bound on the Gaussian fidelity of generic states.
Forward citations
Cited by 9 Pith papers
-
Typical Entanglement of Superpositions
An m-fold superposition of typical sub-maximally entangled states gains a universal ln(m) entanglement enhancement, while maximally entangled states relax to the Haar limit via N-independent scaling laws.
-
Unitary Designs from Doped Matchgate Circuits
Doped matchgate circuits achieve approximate parity-preserving 2-designs in polylogarithmic depth using a sparse number of non-Gaussian gates, with the design formation mapped exactly to a birth-death Markov chain.
-
Tomography of quantum states with bounded extent
A reduction from weak agnostic learning of class C to efficient tomography of states with bounded l1-extent w.r.t. C, with a concrete algorithm for stabilizer states running in poly(n, (ξ/ε)^log(ξ/ε)) time.
-
Fermionic non-Gaussianity via Bell sampling: monotones and efficient quantum algorithms
Defines bridge degree monotone for fermionic non-Gaussianity from Bell-sampling eigenvalues of Lambda, shows non-increase under Gaussian protocols for stronger no-go theorems, and gives polynomial-sample tests for Gau...
-
Classical simulation of free-fermionic dynamics and quantum chemistry with magic input
Block-product paired non-Gaussian fermionic states allow efficient classical additive-error approximation of transition amplitudes, overlaps, and high-weight correlators under free-fermionic dynamics using multivariat...
-
Computable measures of fermionic non-Gaussianity from the covariance matrix
Introduces occupation number entropies (Tsallis) and natural-orbital participation entropies (Renyi) as computable convex resource monotones for fermionic non-Gaussianity from the covariance matrix.
-
Non-Gaussianity of random quantum states
Haar random qubit states show vanishing fermionic non-Gaussianity for subsystems smaller than half the total size without symmetry, small but finite non-Gaussianity with U(1) symmetry, and extensive non-Gaussianity fo...
-
Classical simulation of free-fermionic dynamics and quantum chemistry with magic input
Paired non-Gaussian fermionic states under free-fermionic dynamics admit efficient classical additive-error approximations for amplitudes, overlaps, and high-weight correlators via reduction to multivariate Pfaffian c...
-
Distribution Complexity of Electronic Structure Simulations on Quantum Supercomputers
An algorithm is presented for estimating distribution complexity of electronic structure Hamiltonians, with O(N^3) entanglement estimation per fragment and quadratic/exponential reductions in distribution cost for qua...
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.