Overcoming exponential scaling with system size in Trotter-Suzuki implementations of constrained Hamiltonians: 2+1 U(1) lattice gauge theories

• URL: http://arxiv.org/abs/2208.03333v2
• Date: Tue, 24 Jan 2023 18:47:37 GMT
• Title: Overcoming exponential scaling with system size in Trotter-Suzuki implementations of constrained Hamiltonians: 2+1 U(1) lattice gauge theories
• Authors: Dorota M. Grabowska, Christopher Kane, Benjamin Nachman and Christian W. Bauer
• Abstract summary: For many quantum systems of interest, the classical computational cost of simulating their time evolution scales exponentially in the system size. quantum computers have been shown to allow for simulations of some of these systems using resources that scale exponentially with the system size. This work identifies a term in the Hamiltonian of a class of constrained systems that naively requires quantum resources that scale exponentially in the system size.
• Score: 1.5675763601034223
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: For many quantum systems of interest, the classical computational cost of simulating their time evolution scales exponentially in the system size. At the same time, quantum computers have been shown to allow for simulations of some of these systems using resources that scale polynomially with the system size. Given the potential for using quantum computers for simulations that are not feasible using classical devices, it is paramount that one studies the scaling of quantum algorithms carefully. This work identifies a term in the Hamiltonian of a class of constrained systems that naively requires quantum resources that scale exponentially in the system size. An important example is a compact U(1) gauge theory on lattices with periodic boundary conditions. Imposing the magnetic Gauss' law a priori introduces a constraint into that Hamiltonian that naively results in an exponentially deep circuit. A method is then developed that reduces this scaling to polynomial in the system size, using a redefinition of the operator basis. An explicit construction of the matrices defining the change of operator basis, as well as the scaling of the associated computational cost, is given.

Related papers

• Efficient Learning for Linear Properties of Bounded-Gate Quantum Circuits [63.733312560668274]
  Given a quantum circuit containing d tunable RZ gates and G-d Clifford gates, can a learner perform purely classical inference to efficiently predict its linear properties? We prove that the sample complexity scaling linearly in d is necessary and sufficient to achieve a small prediction error, while the corresponding computational complexity may scale exponentially in d. We devise a kernel-based learning model capable of trading off prediction error and computational complexity, transitioning from exponential to scaling in many practical settings.
  arXiv  Detail & Related papers  (2024-08-22T08:21:28Z)
• Efficient Representation of Gaussian Fermionic Pure States in Non-Computational Bases [0.0]
  This paper introduces an innovative approach for representing Gaussian fermionic states, pivotal in quantum spin systems and fermionic models. We focus on transitioning these states from the conventional computational (sigmaz) basis to more complex bases, such as (phi, fracpi2, alpha) We present a novel algorithm that not only simplifies the basis transformation but also reduces computational complexity.
  arXiv  Detail & Related papers  (2024-03-05T19:43:33Z)
• Classical Chaos in Quantum Computers [39.58317527488534]
  Current-day quantum processors, comprising 50-100 qubits, operate outside the range of quantum simulation on classical computers. We demonstrate that the simulation of classical limits can be a potent diagnostic tool potentially mitigating this problem. We find that classical and quantum simulations lead to similar stability metrics in systems with $mathcalO$ transmons.
  arXiv  Detail & Related papers  (2023-04-27T18:00:04Z)
• Universality of critical dynamics with finite entanglement [68.8204255655161]
  We study how low-energy dynamics of quantum systems near criticality are modified by finite entanglement. Our result establishes the precise role played by entanglement in time-dependent critical phenomena.
  arXiv  Detail & Related papers  (2023-01-23T19:23:54Z)
• Towards Neural Variational Monte Carlo That Scales Linearly with System Size [67.09349921751341]
  Quantum many-body problems are central to demystifying some exotic quantum phenomena, e.g., high-temperature superconductors. The combination of neural networks (NN) for representing quantum states, and the Variational Monte Carlo (VMC) algorithm, has been shown to be a promising method for solving such problems. We propose a NN architecture called Vector-Quantized Neural Quantum States (VQ-NQS) that utilizes vector-quantization techniques to leverage redundancies in the local-energy calculations of the VMC algorithm.
  arXiv  Detail & Related papers  (2022-12-21T19:00:04Z)
• Overcoming exponential volume scaling in quantum simulations of lattice gauge theories [1.5675763601034223]
  We present a formulation of a compact U(1) gauge theory in 2+1 dimensions free of gauge redundancies. A naive implementation onto a quantum circuit has a gate count that scales exponentially with the volume. We discuss how to break this exponential scaling by performing an operator redefinition that reduces the non-locality of the Hamiltonian.
  arXiv  Detail & Related papers  (2022-12-09T01:18:46Z)
• Quantum algorithms for quantum dynamics: A performance study on the spin-boson model [68.8204255655161]
  Quantum algorithms for quantum dynamics simulations are traditionally based on implementing a Trotter-approximation of the time-evolution operator. variational quantum algorithms have become an indispensable alternative, enabling small-scale simulations on present-day hardware. We show that, despite providing a clear reduction of quantum gate cost, the variational method in its current implementation is unlikely to lead to a quantum advantage.
  arXiv  Detail & Related papers  (2021-08-09T18:00:05Z)
• Fixed Depth Hamiltonian Simulation via Cartan Decomposition [59.20417091220753]
  We present a constructive algorithm for generating quantum circuits with time-independent depth. We highlight our algorithm for special classes of models, including Anderson localization in one dimensional transverse field XY model. In addition to providing exact circuits for a broad set of spin and fermionic models, our algorithm provides broad analytic and numerical insight into optimal Hamiltonian simulations.
  arXiv  Detail & Related papers  (2021-04-01T19:06:00Z)
• Orbital transformations to reduce the 1-norm of the electronic structure Hamiltonian for quantum computing applications [0.0]
  We investigate the effect of classical pre-optimization of the electronic structure Hamiltonian representation, via single-particle basis transformation, on the "1-norm" We derive a new formula for the 1-norm as a function of the electronic integrals, and use this quantity as a cost function for an orbital-optimization scheme.
  arXiv  Detail & Related papers  (2021-03-26T22:05:42Z)
• Efficient classical simulation of noisy random quantum circuits in one dimension [4.154652903729955]
  We study noisy random circuit sampling in one dimension (or 1D noisy RCS) as a simple model for exploring the effects of noise on the computational power of a noisy quantum device. We numerically demonstrate that for the two-qubit gate error rates we considered, there exists a characteristic system size above which adding more qubits does not bring about an exponential growth of the cost of classical MPO simulation.
  arXiv  Detail & Related papers  (2020-03-29T23:55:16Z)
• Quantum computation of molecular response properties [12.66895275733527]
  We propose an algorithm for computing linear and nonlinear molecular response properties on quantum computers. On the other hand, we introduce a variational hybrid quantum-classical variant of the proposed algorithm, which is more practical for near-term quantum devices.
  arXiv  Detail & Related papers  (2020-01-10T12:49:20Z)

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.