A Simplified Expression for Quantum Fidelity
- URL: http://arxiv.org/abs/2309.10565v4
- Date: Tue, 10 Oct 2023 17:41:54 GMT
- Title: A Simplified Expression for Quantum Fidelity
- Authors: Adrian M\"uller
- Abstract summary: This work shows in a novel, elegant proof that the expression can be rewritten into a form.
The simpler expression gives rise to a formulation that is subsequently shown to be more computationally efficient than the best previous methods.
- Score: 0.0
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: Quantum fidelity is one of the most important measures of similarity between
mixed quantum states. However, the usual formulation is cumbersome and hard to
understand when encountering the first time. This work shows in a novel,
elegant proof that the expression can be rewritten into a form, which is not
only more concise but also makes its symmetry property more obvious. Further,
the simpler expression gives rise to a formulation that is subsequently shown
to be more computationally efficient than the best previous methods by avoiding
any full decomposition. Future work might look for ways in which other theorems
could be affected or utilize the reformulation where fidelity is the
computational bottleneck.
Related papers
- (Quantum) Indifferentiability and Pre-Computation [50.06591179629447]
Indifferentiability is a cryptographic paradigm for analyzing the security of ideal objects.
Despite its strength, indifferentiability is not known to offer security against pre-processing attacks.
We propose a strengthening of indifferentiability which is not only composable but also takes arbitrary pre-computation into account.
arXiv Detail & Related papers (2024-10-22T00:41:47Z) - Entropy augmentation through subadditive excess: information theory in irreversible processes [0.0]
The Boltzmann equation seems unique in its capacity to accurately describe the transition from almost any initial state to a self-equilibrated thermal state.
An increase of the Gibbs-Shannon-von entropy results without the usual coarse-graining.
The mathematical structure of the ansatz also provides avenues for efficient computation and simulation.
arXiv Detail & Related papers (2024-07-24T14:47:14Z) - Third quantization of open quantum systems: new dissipative symmetries
and connections to phase-space and Keldysh field theory formulations [77.34726150561087]
We reformulate the technique of third quantization in a way that explicitly connects all three methods.
We first show that our formulation reveals a fundamental dissipative symmetry present in all quadratic bosonic or fermionic Lindbladians.
For bosons, we then show that the Wigner function and the characteristic function can be thought of as ''wavefunctions'' of the density matrix.
arXiv Detail & Related papers (2023-02-27T18:56:40Z) - Quantum Pseudoentanglement [4.3053817709507]
Entanglement is a quantum resource, in some ways analogous to randomness in classical computation.
We give a construction of pseudoentangled states with entanglement entropy arbitrarily close to $log n$ across every cut.
We discuss applications of this result to Matrix Product State testing, entanglement distillation, and the complexity of the AdS/CFT correspondence.
arXiv Detail & Related papers (2022-11-01T21:04:49Z) - Object Representations as Fixed Points: Training Iterative Refinement
Algorithms with Implicit Differentiation [88.14365009076907]
Iterative refinement is a useful paradigm for representation learning.
We develop an implicit differentiation approach that improves the stability and tractability of training.
arXiv Detail & Related papers (2022-07-02T10:00:35Z) - 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) - Unified Multivariate Gaussian Mixture for Efficient Neural Image
Compression [151.3826781154146]
latent variables with priors and hyperpriors is an essential problem in variational image compression.
We find inter-correlations and intra-correlations exist when observing latent variables in a vectorized perspective.
Our model has better rate-distortion performance and an impressive $3.18times$ compression speed up.
arXiv Detail & Related papers (2022-03-21T11:44:17Z) - Local Additivity Revisited [0.0]
We make a number of simplifications in Gour and Friedland's proof of local additivity of minimum output entropy of a quantum channel.
We use a different approach to reduce the general case to that of a square positive definite matrix.
We extend this result to the maximum relative entropy with respect to a fixed reference state.
arXiv Detail & Related papers (2021-11-22T17:51:24Z) - Generative Semantic Hashing Enhanced via Boltzmann Machines [61.688380278649056]
Existing generative-hashing methods mostly assume a factorized form for the posterior distribution.
We propose to employ the distribution of Boltzmann machine as the retrievalal posterior.
We show that by effectively modeling correlations among different bits within a hash code, our model can achieve significant performance gains.
arXiv Detail & Related papers (2020-06-16T01:23:39Z) - Advanced Equivalence Checking for Quantum Circuits [4.265279817927261]
We propose an advanced methodology for equivalence checking of quantum circuits.
We show that, by exploiting the reversibility of quantum circuits, complexity can be kept feasible.
In contrast to the classical realm, simulation is very powerful in verifying quantum circuits.
arXiv Detail & Related papers (2020-04-17T18:56:23Z) - Quantum Adiabatic Theorem Revisited [6.259224706032504]
We show how to adiabatically prepare an arbitrary qubit state from an initial state.
As applications, we show how to adiabatically prepare an arbitrary qubit state from an initial state.
arXiv Detail & Related papers (2020-03-06T07:49:45Z)
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.