Quantum phase estimation in presence of glassy disorder

• URL: http://arxiv.org/abs/2112.04411v2
• Date: Thu, 7 Jul 2022 07:34:23 GMT
• Title: Quantum phase estimation in presence of glassy disorder
• Authors: Soubhadra Maiti, Kornikar Sen, Ujjwal Sen
• Abstract summary: We prove that when a large number of auxiliary qubits are involved in the circuit, the probability does not depend on the actual type of disorder but only on the mean and strength of the disorder. We find a concave to convex transition in the dependence of probability on the strength of disorder, and a log-log dependence is witnessed between the point of inflection and the number of auxiliary qubits used.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We investigate the response to noise, in the form of glassy disorder present in circuit elements, in the success probability of the quantum phase estimation algorithm, a subroutine used to determine the eigenvalue - a phase - corresponding to an eigenvector of a unitary gate. We prove that when a large number of auxiliary qubits are involved in the circuit, the probability does not depend on the actual type of disorder but only on the mean and strength of the disorder. For further analysis, we consider three types of disorder distributions: Haar-uniform with a circular cut-off, Haar-uniform with an elliptical or squeezed cut-off, and spherical normal. There is generally a depreciation of the disorder-averaged success probability in response to the disorder incorporation. Even in the presence of the disorder, increasing the number of auxiliary qubits helps to get a better precision of the phase, albeit to a lesser extent (probability) than that in the clean case. We find a concave to convex transition in the dependence of probability on the strength of disorder, and a log-log dependence is witnessed between the point of inflection and the number of auxiliary qubits used.

Related papers

• Observation of disorder-free localization and efficient disorder averaging on a quantum processor [117.33878347943316]
  We implement an efficient procedure on a quantum processor, leveraging quantum parallelism, to efficiently sample over all disorder realizations. We observe localization without disorder in quantum many-body dynamics in one and two dimensions.
  arXiv  Detail & Related papers  (2024-10-09T05:28:14Z)
• To Believe or Not to Believe Your LLM [51.2579827761899]
  We explore uncertainty quantification in large language models (LLMs) We derive an information-theoretic metric that allows to reliably detect when only epistemic uncertainty is large. We conduct a series of experiments which demonstrate the advantage of our formulation.
  arXiv  Detail & Related papers  (2024-06-04T17:58:18Z)
• 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)
• Complexity Measure Diagnostics of Ergodic to Many-Body Localization Transition [0.8192907805418583]
  We introduce new diagnostics of the transition between the ergodic and many-body localization phases. We use these complexity measures to analyze the power-law random banded matrix model.
  arXiv  Detail & Related papers  (2024-04-24T16:00:31Z)
• Quantum entanglement in the multicritical disordered Ising model [0.0]
  entanglement entropy is calculated at the quantum multicritical point of the random transverse-field Ising model. We find a universal logarithmic corner contribution to the area law b*ln(l) that is independent of the form of disorder.
  arXiv  Detail & Related papers  (2024-04-19T16:42:43Z)
• Disorder-induced topological quantum phase transitions in multi-gap Euler semimetals [2.0388938295521575]
  We study the effect of disorder in systems having a non-trivial Euler class. We show that quenched disorder drives Euler semimetals into critical metallic phases. We also show that magnetic disorder can also induce topological transitions to quantum anomalous Hall plaquettes.
  arXiv  Detail & Related papers  (2023-06-22T17:57:10Z)
• Effects of noise on performance of Bernstein-Vazirani algorithm [0.0]
  We introduce various forms of glassy disorders into the effect of Hadamard gates used in the Bernstein-Vazirani circuit. We find that the effectiveness of the algorithm decreases with increasing disorder strength in all cases.
  arXiv  Detail & Related papers  (2023-05-31T11:15:07Z)
• Deconfounded Score Method: Scoring DAGs with Dense Unobserved Confounding [101.35070661471124]
  We show that unobserved confounding leaves a characteristic footprint in the observed data distribution that allows for disentangling spurious and causal effects. We propose an adjusted score-based causal discovery algorithm that may be implemented with general-purpose solvers and scales to high-dimensional problems.
  arXiv  Detail & Related papers  (2021-03-28T11:07:59Z)
• Scaling of non-adiabaticity in disordered quench of quantum Rabi model close to phase transition [0.0]
  We analyze the response to disorder in quenches on a non-adiabaticity quantifier for the quantum Rabi model. We find that the non-adiabatic effects are unaffected by the presence of disorder in the total time of the quench.
  arXiv  Detail & Related papers  (2020-12-08T17:13:58Z)
• Random quantum circuits anti-concentrate in log depth [118.18170052022323]
  We study the number of gates needed for the distribution over measurement outcomes for typical circuit instances to be anti-concentrated. Our definition of anti-concentration is that the expected collision probability is only a constant factor larger than if the distribution were uniform. In both the case where the gates are nearest-neighbor on a 1D ring and the case where gates are long-range, we show $O(n log(n)) gates are also sufficient.
  arXiv  Detail & Related papers  (2020-11-24T18:44:57Z)
• On estimating the entropy of shallow circuit outputs [49.1574468325115]
  Estimating the entropy of probability distributions and quantum states is a fundamental task in information processing. We show that entropy estimation for distributions or states produced by either log-depth circuits or constant-depth circuits with gates of bounded fan-in and unbounded fan-out is at least as hard as the Learning with Errors problem.
  arXiv  Detail & Related papers  (2020-02-27T15:32:08Z)

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.