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

• URL: http://arxiv.org/abs/2502.04857v1
• Date: Fri, 07 Feb 2025 11:47:44 GMT
• Title: Explicit Pfaffian Formula for Amplitudes of Fermionic Gaussian Pure States in Arbitrary Pauli Bases
• Authors: M. A. Rajabpour, M. A. Seifi Mirjafarlou,
• Abstract summary: The explicit computation of amplitudes for fermionic Gaussian pure states in arbitrary Pauli bases is a long-standing challenge in quantum many-body physics. We present an explicit Pfaffian formula for determining these amplitudes in arbitrary Pauli bases, utilizing a Pfaffian of a matrix based on qubit parity. Together, these results provide a versatile framework for applications in global entanglement, Shannon-R'enyi entropy, formation probabilities, and quantum tomography.
• Score: 0.0
• License:
• 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 particular, 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 Pfaffian of a matrix based on qubit parity. Additionally, we introduce a recursive relation (Theorem 2) that links the amplitudes of systems with different qubit counts, enabling scalable calculations for large systems. Together, these results provide a versatile framework for applications in global entanglement, Shannon-R\'enyi entropy, formation probabilities, and quantum tomography, significantly expanding the computational toolkit for analyzing complex quantum systems.

Related papers

• 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)
• 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. We derive rigorous expansions for the decay of entanglement across bonds in the MPS representation depending on the smoothness of the input function. 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)
• 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)
• A powered full quantum eigensolver for energy band structures [8.763736858332704]
  We propose a powered full quantum eigensolver(P-FQE), by using the exponentiation of operators of the full quantum eigensolver(FQE) We experimentally demonstrate the feasibility and robustness of the P-FQE algorithm using superconducting quantum computers for graphene and Weyl semimetal.
  arXiv  Detail & Related papers  (2023-08-06T15:03:07Z)
• 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)
• 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)
• Error mitigation and quantum-assisted simulation in the error corrected regime [77.34726150561087]
  A standard approach to quantum computing is based on the idea of promoting a classically simulable and fault-tolerant set of operations. We show how the addition of noisy magic resources allows one to boost classical quasiprobability simulations of a quantum circuit.
  arXiv  Detail & Related papers  (2021-03-12T20:58:41Z)
• 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.