Purity of thermal mixed quantum states

• URL: http://arxiv.org/abs/2202.07207v3
• Date: Sun, 11 Sep 2022 09:40:31 GMT
• Title: Purity of thermal mixed quantum states
• Authors: Atsushi Iwaki and Chisa Hotta
• Abstract summary: We evaluate the purity of a series of thermal equilibrium states that can be calculated in numerical experiments without knowing the exact form of the quantum state. Canonical typicality guarantees that there are numerous microscopically different expressions of such states, which we call thermal mixed quantum (TMQ) states.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We develop a formula to evaluate the purity of a series of thermal equilibrium states that can be calculated in numerical experiments without knowing the exact form of the quantum state \textit{a priori}. Canonical typicality guarantees that there are numerous microscopically different expressions of such states, which we call thermal mixed quantum (TMQ) states. Suppose that we construct a TMQ state by a mixture of $N_\mathrm{samp}$ independent pure states. The weight of each pure state is given by its norm, and the partition function is given by the average of the norms. To qualify how efficiently the mixture is done, we introduce a quantum statistical quantity called "normalized fluctuation of partition function (NFPF)". For smaller NFPF, the TMQ state is closer to the equally weighted mixture of pure states, which means higher efficiency, requiring a smaller $N_\mathrm{samp}$. The largest NFPF is realized in the Gibbs state with purity-0 and exponentially large $N_\mathrm{samp}$, while the smallest NFPF is given for thermal pure quantum state with purity-1 and $N_\mathrm{samp}=1$. The purity is formulated using solely the NFPF and roughly gives $N_\mathrm{samp}^{-1}$. Our analytical results are numerically tested and confirmed by the two random sampling methods built on matrix-product-state-based wave functions.

Related papers

• Slow Mixing of Quantum Gibbs Samplers [47.373245682678515]
  We present a quantum generalization of these tools through a generic bottleneck lemma. This lemma focuses on quantum measures of distance, analogous to the classical Hamming distance but rooted in uniquely quantum principles. Even with sublinear barriers, we use Feynman-Kac techniques to lift classical to quantum ones establishing tight lower bound $T_mathrmmix = 2Omega(nalpha)$.
  arXiv  Detail & Related papers  (2024-11-06T22:51:27Z)
• Sample-Optimal Quantum Estimators for Pure-State Trace Distance and Fidelity via Samplizer [7.319050391449301]
  Trace distance and infidelity, as basic measures of the closeness of quantum states, are commonly used in quantum state discrimination, certification, and tomography. We present a quantum algorithm that estimates the trace distance and square root fidelity between pure states to within additive error $varepsilon$, given sample access to their identical copies.
  arXiv  Detail & Related papers  (2024-10-28T16:48:21Z)
• Pseudorandom density matrices [0.8204952610951527]
  Pseudorandom states (PRSs) are state ensembles that cannot be distinguished from Haar random states by any efficient quantum algorithm. We introduce PRDMs, ensembles of $n$-qubit states that are computationally indistinguishable from the generalized Hilbert-Schmidt ensemble. PRDMs with $m=omega(log n)$ are robust to unital noise channels and a recently introduced $mathsfPostBQP$ attack. We also introduce memoryless PRSs, a noise-robust notion of PRS which are indistinguishable to Haar random states for efficient
  arXiv  Detail & Related papers  (2024-07-16T11:14:58Z)
• The Power of Unentangled Quantum Proofs with Non-negative Amplitudes [55.90795112399611]
  We study the power of unentangled quantum proofs with non-negative amplitudes, a class which we denote $textQMA+(2)$. In particular, we design global protocols for small set expansion, unique games, and PCP verification. We show that QMA(2) is equal to $textQMA+(2)$ provided the gap of the latter is a sufficiently large constant.
  arXiv  Detail & Related papers  (2024-02-29T01:35:46Z)
• Efficient Quantum Mixed-State Tomography with Unsupervised Tensor Network Machine Learning [13.02007068572165]
  We propose an efficient mixed-state quantum state scheme based on the locally purified state ansatz. We demonstrate the efficiency and robustness of our scheme on various randomly initiated states with different purities. Our work reveals the prospects of applying network state ansatz and the machine learning approaches for efficient QST of many-body states.
  arXiv  Detail & Related papers  (2023-08-14T02:35:23Z)
• On sampling determinantal and Pfaffian point processes on a quantum computer [49.1574468325115]
  DPPs were introduced by Macchi as a model in quantum optics the 1970s. Most applications require sampling from a DPP, and given their quantum origin, it is natural to wonder whether sampling a DPP on a classical computer is easier than on a classical one. Vanilla sampling consists in two steps, of respective costs $mathcalO(N3)$ and $mathcalO(Nr2)$ operations on a classical computer, where $r$ is the rank of the kernel matrix.
  arXiv  Detail & Related papers  (2023-05-25T08:43:11Z)
• Sparse random Hamiltonians are quantumly easy [105.6788971265845]
  A candidate application for quantum computers is to simulate the low-temperature properties of quantum systems. This paper shows that, for most random Hamiltonians, the maximally mixed state is a sufficiently good trial state. Phase estimation efficiently prepares states with energy arbitrarily close to the ground energy.
  arXiv  Detail & Related papers  (2023-02-07T10:57:36Z)
• Quantum Approximation of Normalized Schatten Norms and Applications to Learning [0.0]
  This paper addresses the problem of defining a similarity measure for quantum operations that can be textitefficiently estimated We develop a quantum sampling circuit to estimate the normalized Schatten 2-norm of their difference and prove a Poly$(frac1epsilon)$ upper bound on the sample complexity. We then show that such a similarity metric is directly related to a functional definition of similarity of unitary operations using the conventional fidelity metric of quantum states.
  arXiv  Detail & Related papers  (2022-06-23T07:12:10Z)
• Average-case Speedup for Product Formulas [69.68937033275746]
  Product formulas, or Trotterization, are the oldest and still remain an appealing method to simulate quantum systems. We prove that the Trotter error exhibits a qualitatively better scaling for the vast majority of input states. Our results open doors to the study of quantum algorithms in the average case.
  arXiv  Detail & Related papers  (2021-11-09T18:49:48Z)
• Efficient Verification of Anticoncentrated Quantum States [0.38073142980733]
  I present a novel method for estimating the fidelity $F(mu,tau)$ between a preparable quantum state $mu$ and a classically specified target state $tau$. I also present a more sophisticated version of the method, which uses any efficiently preparable and well-characterized quantum state as an importance sampler.
  arXiv  Detail & Related papers  (2020-12-15T18:01:11Z)
• Quantum Gram-Schmidt Processes and Their Application to Efficient State Read-out for Quantum Algorithms [87.04438831673063]
  We present an efficient read-out protocol that yields the classical vector form of the generated state. Our protocol suits the case that the output state lies in the row space of the input matrix. One of our technical tools is an efficient quantum algorithm for performing the Gram-Schmidt orthonormal procedure.
  arXiv  Detail & Related papers  (2020-04-14T11:05:26Z)

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.