An Algorithm for Estimating $α$-Stabilizer Rényi Entropies via Purity

• URL: http://arxiv.org/abs/2507.02540v1
• Date: Thu, 03 Jul 2025 11:34:46 GMT
• Title: An Algorithm for Estimating $α$-Stabilizer Rényi Entropies via Purity
• Authors: Benjamin Stratton,
• Abstract summary: We introduce an alternative algorithm for measuring the Stabilizer R'enyi Entropies of an unknown quantum state.<n>We show the existence of a state, produced from the action of a channel on $alpha$ copies of some pure state, that encodes the $alpha$-Stabilizer R'enyi Entropy into its purity.<n>A non-stabilizerness/entanglement relationship is shown to exist in the algorithm, demonstrating a novel relationship between the two resources.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Non-stabilizerness, or magic, is a resource for universal quantum computation in most fault-tolerant architectures; access to states with non-stabilizerness allows for non-classically simulable quantum computation to be performed. Quantifying this resource for unknown states is therefore essential to assessing their utility in quantum computation. The Stabilizer R\'enyi Entropies have emerged as a leading tools for achieving this, having already enabled one efficient algorithm for measuring non-stabilizerness. In addition, the Stabilizer R\'enyi Entropies have proven useful in developing connections between non-stabilizerness and other quantum phenomena. In this work, we introduced an alternative algorithm for measuring the Stabilizer R\'enyi Entropies of an unknown quantum state. Firstly, we show the existence of a state, produced from the action of a channel on $\alpha$ copies of some pure state, that encodes the $\alpha$-Stabilizer R\'enyi Entropy into its purity. We detail several methods of applying this channel and then, by employing existing purity-measuring algorithms, provide an algorithm for measuring the $\alpha$-Stabilizer R\'enyi Entropies for all integers $\alpha>1$. This algorithm is benchmarked for qubits and the resource requirements compared to other known algorithms. Finally, a non-stabilizerness/entanglement relationship is shown to exist in the algorithm, demonstrating an novel relationship between the two resources.

Related papers

• Matrix encoding method in variational quantum singular value decomposition [49.494595696663524]
  We propose the variational quantum singular value decomposition based on encoding the elements of the considered $Ntimes N$ matrix into the state of a quantum system of appropriate dimension.<n> Controlled measurement is involved to avoid small success in ancilla measurement.
  arXiv  Detail & Related papers  (2025-03-19T07:01:38Z)
• Non-stabilizerness of Neural Quantum States [41.94295877935867]
  We introduce a methodology to estimate non-stabilizerness or "magic", a key resource for quantum complexity, with Neural Quantum States (NQS)<n>We study the magic content in an ensemble of random NQS, demonstrating that neural network parametrizations of the wave function capture finite non-stabilizerness besides large entanglement.
  arXiv  Detail & Related papers  (2025-02-13T19:14:15Z)
• Estimation of Nonlinear Physical Quantities By Measuring Ancillas [0.0]
  We present quantum algorithms for estimating von Neumann entropy and Renyi entropy.<n>Our framework can complete the given task by measuring a small number of ancilla qubits without directly measuring the system.
  arXiv  Detail & Related papers  (2025-02-11T14:15:19Z)
• Estimating Non-Stabilizerness Dynamics Without Simulating It [43.80709028066351]
  Iterative Clifford Circuit Renormalization (I CCR) is designed to efficiently handle the dynamics of non-stabilizerness in quantum circuits.<n>I CCR embeds the complex dynamics of non-stabilizerness in the flow of an effective initial state.<n>We implement the I CCR algorithm to evaluate the non-stabilizerness dynamics for systems of size up to N = 1000.
  arXiv  Detail & Related papers  (2024-05-09T18:57:55Z)
• Handbook for Quantifying Robustness of Magic [0.0]
  Robustness of magic (RoM) characterizes the degree of usefulness of a given quantum state for non-Clifford operation. We present efficient novel algorithms to compute the RoM. We numerically demonstrate our state-of-the-art results for copies of magic states and partially disentangled quantum states.
  arXiv  Detail & Related papers  (2023-11-02T16:15:00Z)
• Measuring the Loschmidt amplitude for finite-energy properties of the Fermi-Hubbard model on an ion-trap quantum computer [27.84599956781646]
  We study the operation of a quantum-classical time-series algorithm on a present-day quantum computer. Specifically, we measure the Loschmidt amplitude for the Fermi-Hubbard model on a $16$-site ladder geometry (32 orbitals) on the Quantinuum H2-1 trapped-ion device. We numerically analyze the influence of noise on the full operation of the quantum-classical algorithm by measuring expectation values of local observables at finite energies.
  arXiv  Detail & Related papers  (2023-09-19T11:59:36Z)
• Hybrid algorithm simulating non-equilibrium steady states of an open quantum system [10.752869788647802]
  Non-equilibrium steady states are a focal point of research in the study of open quantum systems. Previous variational algorithms for searching these steady states have suffered from resource-intensive implementations. We present a novel variational quantum algorithm that efficiently searches for non-equilibrium steady states by simulating the operator-sum form of the Lindblad equation.
  arXiv  Detail & Related papers  (2023-09-13T01:57:27Z)
• An adaptive Bayesian quantum algorithm for phase estimation [0.0]
  We present a coherence-based phase-estimation algorithm which can achieve the optimal quadratic scaling in the mean absolute error and the mean squared error. In the presence of noise, our algorithm produces errors that approach the theoretical lower bound.
  arXiv  Detail & Related papers  (2023-03-02T19:00:01Z)
• Phase transition in Stabilizer Entropy and efficient purity estimation [0.0]
  We show that Stabilizer Entropy (SE) quantifies the spread of a state in the basis of Pauli operators. We show that there is a phase transition in the residual subsystem SE as a function of the density of non-Clifford resources.
  arXiv  Detail & Related papers  (2023-02-15T19:00:02Z)
• A single $T$-gate makes distribution learning hard [56.045224655472865]
  This work provides an extensive characterization of the learnability of the output distributions of local quantum circuits. We show that for a wide variety of the most practically relevant learning algorithms -- including hybrid-quantum classical algorithms -- even the generative modelling problem associated with depth $d=omega(log(n))$ Clifford circuits is hard.
  arXiv  Detail & Related papers  (2022-07-07T08:04:15Z)
• Improved Quantum Algorithms for Fidelity Estimation [77.34726150561087]
  We develop new and efficient quantum algorithms for fidelity estimation with provable performance guarantees. Our algorithms use advanced quantum linear algebra techniques, such as the quantum singular value transformation. We prove that fidelity estimation to any non-trivial constant additive accuracy is hard in general.
  arXiv  Detail & Related papers  (2022-03-30T02:02:16Z)
• A Hybrid Quantum-Classical Algorithm for Robust Fitting [47.42391857319388]
  We propose a hybrid quantum-classical algorithm for robust fitting. Our core contribution is a novel robust fitting formulation that solves a sequence of integer programs. We present results obtained using an actual quantum computer.
  arXiv  Detail & Related papers  (2022-01-25T05:59:24Z)
• Computationally Efficient Approximations for Matrix-based Renyi's Entropy [33.72108955447222]
  Recently developed matrix based Renyi's entropy enables measurement of information in data. computation of such quantity involves the trace operator on a PSD matrix $G$ to power $alpha$(i.e., $tr(Galpha)$. We present computationally efficient approximations to this new entropy functional that can reduce its complexity to even significantly less than $O(n2)$.
  arXiv  Detail & Related papers  (2021-12-27T14:59:52Z)
• Improved Graph Formalism for Quantum Circuit Simulation [77.34726150561087]
  We show how to efficiently simplify stabilizer states to canonical form. We characterize all linearly dependent triplets, revealing symmetries in the inner products. Using our novel controlled-Pauli $Z$ algorithm, we improve runtime for inner product computation from $O(n3)$ to $O(nd2)$ where $d$ is the maximum degree of the graph.
  arXiv  Detail & Related papers  (2021-09-20T05:56:25Z)
• Byzantine-Resilient Non-Convex Stochastic Gradient Descent [61.6382287971982]
  adversary-resilient distributed optimization, in which. machines can independently compute gradients, and cooperate. Our algorithm is based on a new concentration technique, and its sample complexity. It is very practical: it improves upon the performance of all prior methods when no. setting machines are present.
  arXiv  Detail & Related papers  (2020-12-28T17:19:32Z)

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.