Circuit complexity near critical points

• URL: http://arxiv.org/abs/2106.12648v2
• Date: Tue, 13 Jul 2021 15:22:55 GMT
• Title: Circuit complexity near critical points
• Authors: Uday Sood and Martin Kruczenski
• Abstract summary: We numerically compute the quantum circuit complexity of the ground state in the Mott insulator and superfluid phases. The complexity has peaks at the $O(2)$ critical points where the system can be described by a relativistic quantum field theory.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We consider the Bose-Hubbard model in two and three spatial dimensions and numerically compute the quantum circuit complexity of the ground state in the Mott insulator and superfluid phases using a mean field approximation with additional quadratic fluctuations. After mapping to a qubit system, the result is given by the complexity associated with a Bogoliubov transformation applied to the reference state taken to be the mean field ground state. In particular, the complexity has peaks at the $O(2)$ critical points where the system can be described by a relativistic quantum field theory. Given that we use a gaussian approximation, near criticality the numerical results agree with a free field theory calculation. To go beyond the gaussian approximation we use general scaling arguments that imply that, as we approach the critical point $t\rightarrow t_c$, there is a non-analytic behavior in the complexity $c_2(t)$ of the form $|c_2(t) - c_2(t_c)| \sim |t-t_c|^{\nu d}$, up to possible logarithmic corrections. Here $d$ is the number of spatial dimensions and $\nu$ is the usual critical exponent for the correlation length $\xi\sim|t-t_c|^{-\nu}$. As a check, for $d=2$ this agrees with the numerical computation if we use the gaussian critical exponent $\nu=\frac{1}{2}$. Finally, using AdS/CFT methods, we study higher dimensional examples and confirm this scaling argument with non-gaussian exponent $\nu$ for strongly interacting theories that have a gravity dual.

Related papers

• Optimized Quantum Simulation Algorithms for Scalar Quantum Field Theories [0.3394351835510634]
  We provide practical simulation methods for scalar field theories on a quantum computer that yield improveds. We implement our approach using a series of different fault-tolerant simulation algorithms for Hamiltonians. We find in both cases that the bounds suggest physically meaningful simulations can be performed using on the order of $4times 106$ physical qubits and $1012$ $T$-gates.
  arXiv  Detail & Related papers  (2024-07-18T18:00:01Z)
• Measuring quantum relative entropy with finite-size effect [53.64687146666141]
  We study the estimation of relative entropy $D(rho|sigma)$ when $sigma$ is known. Our estimator attains the Cram'er-Rao type bound when the dimension $d$ is fixed.
  arXiv  Detail & Related papers  (2024-06-25T06:07:20Z)
• KPZ scaling from the Krylov space [83.88591755871734]
  Recently, a superdiffusion exhibiting the Kardar-Parisi-Zhang scaling in late-time correlators and autocorrelators has been reported. Inspired by these results, we explore the KPZ scaling in correlation functions using their realization in the Krylov operator basis.
  arXiv  Detail & Related papers  (2024-06-04T20:57:59Z)
• Learning with Norm Constrained, Over-parameterized, Two-layer Neural Networks [54.177130905659155]
  Recent studies show that a reproducing kernel Hilbert space (RKHS) is not a suitable space to model functions by neural networks. In this paper, we study a suitable function space for over- parameterized two-layer neural networks with bounded norms.
  arXiv  Detail & Related papers  (2024-04-29T15:04:07Z)
• The Cost of Entanglement Renormalization on a Fault-Tolerant Quantum Computer [0.042855555838080824]
  We perform a detailed estimate for the prospect of using deep entanglement renormalization ansatz on a fault-tolerant quantum computer. For probing a relatively large system size, we observe up to an order of magnitude reduction in the number of qubits. For estimating the energy per site of $epsilon$, $mathcalOleft(fraclog Nepsilon right)$ $T$ gates and $mathcalOleft(log Nright)$ qubits suffice.
  arXiv  Detail & Related papers  (2024-04-15T18:00:17Z)
• Detection-Recovery Gap for Planted Dense Cycles [72.4451045270967]
  We consider a model where a dense cycle with expected bandwidth $n tau$ and edge density $p$ is planted in an ErdHos-R'enyi graph $G(n,q)$. We characterize the computational thresholds for the associated detection and recovery problems for the class of low-degree algorithms.
  arXiv  Detail & Related papers  (2023-02-13T22:51:07Z)
• Random quantum circuits transform local noise into global white noise [118.18170052022323]
  We study the distribution over measurement outcomes of noisy random quantum circuits in the low-fidelity regime. For local noise that is sufficiently weak and unital, correlations (measured by the linear cross-entropy benchmark) between the output distribution $p_textnoisy$ of a generic noisy circuit instance shrink exponentially. If the noise is incoherent, the output distribution approaches the uniform distribution $p_textunif$ at precisely the same rate.
  arXiv  Detail & Related papers  (2021-11-29T19:26:28Z)
• Resolving mean-field solutions of dissipative phase transitions using permutational symmetry [0.0]
  Phase transitions in dissipative quantum systems have been investigated using various analytical approaches, particularly in the mean-field (MF) limit. These two solutions cannot be reconciled because the MF solutions above $d_c$ should be identical. numerical studies on large systems may not be feasible because of the exponential increase in computational complexity.
  arXiv  Detail & Related papers  (2021-10-18T16:07:09Z)
• Circuit Complexity in $\mathcal{Z}_{2}$ ${\cal EEFT}$ [1.3177888879666482]
  We computation circuit complexity in $mathcalZ$ Even Effective Field Theories. We consider a massive free field theory with higher-order Wilsonian operators. The study has been carried out for nearly Gaussian states.
  arXiv  Detail & Related papers  (2021-09-20T18:00:04Z)
• Quantum Algorithms for Simulating the Lattice Schwinger Model [63.18141027763459]
  We give scalable, explicit digital quantum algorithms to simulate the lattice Schwinger model in both NISQ and fault-tolerant settings. In lattice units, we find a Schwinger model on $N/2$ physical sites with coupling constant $x-1/2$ and electric field cutoff $x-1/2Lambda$. We estimate observables which we cost in both the NISQ and fault-tolerant settings by assuming a simple target observable---the mean pair density.
  arXiv  Detail & Related papers  (2020-02-25T19:18:36Z)
• Approximate unitary $t$-designs by short random quantum circuits using nearest-neighbor and long-range gates [0.0]
  We prove that $poly(t)cdot n1/D$-depth local random quantum circuits with two qudit nearest-neighbor gates are approximate $t$-designs in various measures. We also prove that anti-concentration is possible in depth O(log(n) loglog(n) using a different model.
  arXiv  Detail & Related papers  (2018-09-18T22:28:15Z)

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.