Explicit Pfaffian Formula for Amplitudes of Fermionic Gaussian Pure States in Arbitrary Pauli Bases

• URL: http://arxiv.org/abs/2502.04857v3
• Date: Tue, 01 Jul 2025 20:20:40 GMT
• Title: Explicit Pfaffian Formula for Amplitudes of Fermionic Gaussian Pure States in Arbitrary Pauli Bases
• Authors: M. A. Rajabpour, M. A. Seifi Mirjafarlou, Reyhaneh Khasseh,
• Abstract summary: Explicit computation of amplitudes for fermionic Gaussian pure states in arbitrary Pauli bases is a long-standing challenge in quantum many-body physics.<n>We present an explicit Pfaffian formula for determining these amplitudes in arbitrary Pauli bases, utilizing a matrix whose structure reflects the qubit parity.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: The explicit computation of amplitudes for fermionic Gaussian pure states in arbitrary Pauli bases is a long-standing challenge in quantum many-body physics, with significant implications for quantum tomography, experimental studies, and quantum dynamics. These calculations are essential for analyzing complex properties beyond traditional measures, such as formation probabilities, global entanglement, and entropy in non-standard bases, where exact and computationally efficient methods remain underdeveloped. In addition to these physical applications, having explicit formulas is crucial for optimizing negative log-likelihood functions in quantum tomography, a key task in the NISQ era. In this work, we present an explicit Pfaffian formula (Theorem 1) for determining these amplitudes in arbitrary Pauli bases, utilizing a matrix whose structure reflects the qubit parity. Additionally, we introduce a recursive relation (Theorem 2) that connects amplitudes for systems with varying qubit numbers, enabling scalable computations for large systems. Together, these results provide a versatile framework for studying global entanglement, Shannon-R\'enyi entropies, formation probabilities, and performing efficient quantum tomography, thereby significantly expanding the computational toolkit for analyzing complex quantum systems. Finally, we utilize our formalism to determine the post-measurement entanglement entropy, reflecting how local measurements alter entanglement, and compare the outcomes with conformal field theory predictions.

Related papers

• Fermionic Magic Resources of Quantum Many-Body Systems [0.0]
  We develop a framework for quantifying fermionic magic resources, also referred to as fermionic non-Gaussianity.<n>FAF is an efficiently computable and experimentally accessible measure of non-Gaussianity.<n>We show that FAF detects phase transitions, reveals universal features of critical points, and uncovers special solvable points in many-body systems.
  arXiv  Detail & Related papers  (2025-05-30T18:00:01Z)
• Tensor Cross Interpolation of Purities in Quantum Many-Body Systems [0.0]
  In quantum many-body systems the exponential scaling of the Hilbert space with the number of degrees of freedom renders a complete state characterization. Recently, a compact way of storing subregions' purities by encoding them as amplitudes of a fictitious quantum wave function, known as entanglement feature, was proposed. In this work, we demonstrate that the entanglement feature can be efficiently defining using only a amount of samples in the number of degrees of freedom.
  arXiv  Detail & Related papers  (2025-03-21T15:33:00Z)
• Quantum computer formulation of the FKP-operator eigenvalue problem for probabilistic learning on manifolds [0.0]
  We present a quantum computing formulation to address a challenging problem in the development of probabilistic learning on manifold (PLoM) It involves solving the spectral problem of the high-dimensional Fokker-Planck operator, which remains beyond the reach of classical computing. Explicit formulas for the Laplacian and potential are derived and mapped onto qubits using Pauli matrix expressions.
  arXiv  Detail & Related papers  (2025-02-20T14:05:16Z)
• Reducing the sampling complexity of energy estimation in quantum many-body systems using empirical variance information [45.18582668677648]
  We consider the problem of estimating the energy of a quantum state preparation for a given Hamiltonian in Pauli decomposition.<n>We construct an adaptive estimator using the state's actual variance.
  arXiv  Detail & Related papers  (2025-02-03T19:00:01Z)
• The quantum magic of fermionic Gaussian states [0.0]
  We introduce an efficient method to quantify nonstabilizerness in fermionic Gaussian states.<n>We reveal an extensive leading behavior equal to that of Haar random states, with logarithmic subleading corrections.<n>Applying the sampling algorithm to a two-dimensional free-fermionic topological model, we uncover a sharp transition in magic at the phase boundaries.
  arXiv  Detail & Related papers  (2024-12-06T19:00:16Z)
• Scalable and shallow quantum circuits encoding probability distributions informed by asymptotic entanglement analysis [0.28917933888634956]
  matrix product state (MPS) methods emerged as the most promising approach for constructing shallow quantum circuits.<n>We derive rigorous expansions for the decay of entanglement across bonds in the MPS representation depending on the smoothness of the input function.<n>We construct an improved MPS-based algorithm yielding shallow and accurate encoding quantum circuits.
  arXiv  Detail & Related papers  (2024-12-06T17:31:35Z)
• Efficient Learning for Linear Properties of Bounded-Gate Quantum Circuits [63.733312560668274]
  Given a quantum circuit containing d tunable RZ gates and G-d Clifford gates, can a learner perform purely classical inference to efficiently predict its linear properties? We prove that the sample complexity scaling linearly in d is necessary and sufficient to achieve a small prediction error, while the corresponding computational complexity may scale exponentially in d. We devise a kernel-based learning model capable of trading off prediction error and computational complexity, transitioning from exponential to scaling in many practical settings.
  arXiv  Detail & Related papers  (2024-08-22T08:21:28Z)
• Characterizing randomness in parameterized quantum circuits through expressibility and average entanglement [39.58317527488534]
  Quantum Circuits (PQCs) are still not fully understood outside the scope of their principal application. We analyse the generation of random states in PQCs under restrictions on the qubits connectivities. We place a connection between how steep is the increase on the uniformity of the distribution of the generated states and the generation of entanglement.
  arXiv  Detail & Related papers  (2024-05-03T17:32:55Z)
• Efficient Representation of Gaussian Fermionic Pure States in Non-Computational Bases [0.0]
  This paper introduces an innovative approach for representing Gaussian fermionic states, pivotal in quantum spin systems and fermionic models. We focus on transitioning these states from the conventional computational (sigmaz) basis to more complex bases, such as (phi, fracpi2, alpha) We present a novel algorithm that not only simplifies the basis transformation but also reduces computational complexity.
  arXiv  Detail & Related papers  (2024-03-05T19:43:33Z)
• Gaussian Entanglement Measure: Applications to Multipartite Entanglement of Graph States and Bosonic Field Theory [50.24983453990065]
  An entanglement measure based on the Fubini-Study metric has been recently introduced by Cocchiarella and co-workers. We present the Gaussian Entanglement Measure (GEM), a generalization of geometric entanglement measure for multimode Gaussian states. By providing a computable multipartite entanglement measure for systems with a large number of degrees of freedom, we show that our definition can be used to obtain insights into a free bosonic field theory.
  arXiv  Detail & Related papers  (2024-01-31T15:50:50Z)
• Higher-order topological kernels via quantum computation [68.8204255655161]
  Topological data analysis (TDA) has emerged as a powerful tool for extracting meaningful insights from complex data. We propose a quantum approach to defining Betti kernels, which is based on constructing Betti curves with increasing order.
  arXiv  Detail & Related papers  (2023-07-14T14:48:52Z)
• Universality of critical dynamics with finite entanglement [68.8204255655161]
  We study how low-energy dynamics of quantum systems near criticality are modified by finite entanglement. Our result establishes the precise role played by entanglement in time-dependent critical phenomena.
  arXiv  Detail & Related papers  (2023-01-23T19:23:54Z)
• Analyzing Prospects for Quantum Advantage in Topological Data Analysis [35.423446067065576]
  We analyze and optimize an improved quantum algorithm for topological data analysis. We show that super-quadratic quantum speedups are only possible when targeting a multiplicative error approximation. We argue that quantum circuits with tens of billions of Toffoli can solve seemingly classically intractable instances.
  arXiv  Detail & Related papers  (2022-09-27T17:56:15Z)
• Theory of Quantum Generative Learning Models with Maximum Mean Discrepancy [67.02951777522547]
  We study learnability of quantum circuit Born machines (QCBMs) and quantum generative adversarial networks (QGANs) We first analyze the generalization ability of QCBMs and identify their superiorities when the quantum devices can directly access the target distribution. Next, we prove how the generalization error bound of QGANs depends on the employed Ansatz, the number of qudits, and input states.
  arXiv  Detail & Related papers  (2022-05-10T08:05:59Z)
• Preparing Arbitrary Continuous Functions in Quantum Registers With Logarithmic Complexity [0.0]
  Key applications can only achieve their potential speedup if their inputs are prepared efficiently. We effectively solve the problem of efficiently preparing quantum states following arbitrary continuous functions with logarithmic complexity in the desired resolution. Our work has significant implications in a wide range of applications, for instance in financial forecasting, and in quantum simulation.
  arXiv  Detail & Related papers  (2022-05-01T17:29:12Z)
• Numerical Simulations of Noisy Quantum Circuits for Computational Chemistry [51.827942608832025]
  Near-term quantum computers can calculate the ground-state properties of small molecules. We show how the structure of the computational ansatz as well as the errors induced by device noise affect the calculation.
  arXiv  Detail & Related papers  (2021-12-31T16:33:10Z)
• 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)
• The role of boundary conditions in quantum computations of scattering observables [58.720142291102135]
  Quantum computing may offer the opportunity to simulate strongly-interacting field theories, such as quantum chromodynamics, with physical time evolution. As with present-day calculations, quantum computation strategies still require the restriction to a finite system size. We quantify the volume effects for various $1+1$D Minkowski-signature quantities and show that these can be a significant source of systematic uncertainty.
  arXiv  Detail & Related papers  (2020-07-01T17:43:11Z)

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.