Computing exact moments of local random quantum circuits via tensor networks

• URL: http://arxiv.org/abs/2403.01706v2
• Date: Wed, 4 Sep 2024 07:35:06 GMT
• Title: Computing exact moments of local random quantum circuits via tensor networks
• Abstract summary: A basic primitive in quantum information is the computation of the moments $mathbbE_U[rm Tr[Urho Udagger O]t]$. In this work, we propose to estimate the moments via tensor networks, where the local gates moment operators are mapped to small dimensional tensors acting on their local commutant bases.
• Score: 0.40498500266986387
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: A basic primitive in quantum information is the computation of the moments $\mathbb{E}_U[{\rm Tr}[U\rho U^\dagger O]^t]$. These describe the distribution of expectation values obtained by sending a state $\rho$ through a random unitary $U$, sampled from some distribution, and measuring the observable $O$. While the exact calculation of these moments is generally hard, if $U$ is composed of local random gates, one can estimate $\mathbb{E}_U[{\rm Tr}[U\rho U^\dagger O]^t]$ by performing Monte Carlo simulations of a Markov chain-like process. However, this approach can require a prohibitively large number of samples, or suffer from the sign problem. In this work, we instead propose to estimate the moments via tensor networks, where the local gates moment operators are mapped to small dimensional tensors acting on their local commutant bases. By leveraging representation theoretical tools, we study the local tensor dimension and we provide bounds for the bond dimension of the matrix product states arising from deep circuits. We compare our techniques against Monte Carlo simulations, showing that we can significantly out-perform them. Then, we showcase how tensor networks can exactly compute the second moment when $U$ is a quantum neural network acting on thousands of qubits and having thousands of gates. To finish, we numerically study the anticoncentration phenomena of circuits with orthogonal random gates, a task which cannot be studied via Monte Carlo due to sign problems.

Related papers

• Scalable quantum simulation of continuous-time generative models via tensor networks [0.0]
  Continuous-time flow and diffusion models are widely used across many application domains.<n>Wavefunction flows target this cost by recasting learned transport as unitary evolution.<n>We present the first numerical study of these flows, in which we represent time-dependent potentials and states as tensor networks.
  arXiv  Detail & Related papers  (2026-08-22T00:24:06Z)
• Replica Tensor Train [0.0]
  We describe a numerical many-body technique that is based on both tensor networks and quantum Monte Carlo.<n>The variational ansatz is a tensor network that can harvest volume-law entanglement.<n>We show that the approach can be extended to build Krylov-subspace ground-state methods within the variational manifold.
  arXiv  Detail & Related papers  (2026-04-24T17:07:07Z)
• Tensor Decomposition Networks for Fast Machine Learning Interatomic Potential Computations [63.945006006152035]
  tensor decomposition networks (TDNs) achieve competitive performance with dramatic speedup in computations.<n>We evaluate TDNs on PubChemQCR, a newly curated molecular relaxation dataset containing 105 million DFT-calculated snapshots.
  arXiv  Detail & Related papers  (2025-07-01T18:46:27Z)
• Emergence and scaling laws in SGD learning of shallow neural networks [64.48316762675141]
  We study the complexity of online gradient descent (SGD) for learning a two-layer neural network with $P$ neurons on isotropic Gaussian data.<n>We provide a precise analysis of SGD dynamics for the training of a student two-layer network to minimize the mean squared error (MSE) objective.
  arXiv  Detail & Related papers  (2025-04-28T16:58:55Z)
• Quantum Detection of Recurrent Dynamics [0.0]
  We describe simple quantum algorithms to detect such approximate recurrence. Hidden tensor structures have been observed to emerge both in a high energy context of operator-level spontaneous symmetry breaking. We collect some observations on the computational difficulty of locating these structures and detecting related spectral information.
  arXiv  Detail & Related papers  (2024-07-22T21:13:45Z)
• Tensor network approximation of Koopman operators [0.0]
  We propose a framework for approximating the evolution of observables of measure-preserving ergodic systems. Our approach is based on a spectrally-convergent approximation of the skew-adjoint Koopman generator. A key feature of this quantum-inspired approximation is that it captures information from a tensor product space of dimension $(2d+1)n$.
  arXiv  Detail & Related papers  (2024-07-09T21:40:14Z)
• Architectures and random properties of symplectic quantum circuits [0.0]
  Parametrized and random unitary $n$-qubit circuits play a central role in quantum information. We present a universal set of generators $mathcalG$ for the symplectic algebra $imathfraksp(d/2)$. We find that the operators in $mathcalG$ cannot generate arbitrary local symplectic unitaries. We then review the Schur-Weyl duality between the symplectic group and the Brauer algebra, and use tools from Weingarten calculus to prove that Pauli measurements can converge
  arXiv  Detail & Related papers  (2024-05-16T17:15:39Z)
• Tensor cumulants for statistical inference on invariant distributions [49.80012009682584]
  We show that PCA becomes computationally hard at a critical value of the signal's magnitude. We define a new set of objects, which provide an explicit, near-orthogonal basis for invariants of a given degree. It also lets us analyze a new problem of distinguishing between different ensembles.
  arXiv  Detail & Related papers  (2024-04-29T14:33:24Z)
• 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)
• Simulation of IBM's kicked Ising experiment with Projected Entangled Pair Operator [71.10376783074766]
  We perform classical simulations of the 127-qubit kicked Ising model, which was recently emulated using a quantum circuit with error mitigation. Our approach is based on the projected entangled pair operator (PEPO) in the Heisenberg picture. We develop a Clifford expansion theory to compute exact expectation values and use them to evaluate algorithms.
  arXiv  Detail & Related papers  (2023-08-06T10:24:23Z)
• Recipes for the Digital Quantum Simulation of Lattice Spin Systems [0.0]
  We describe methods to construct digital quantum simulation algorithms for quantum spin systems on a regular lattice with local interactions. We provide resource estimates and quantum circuit elements for the most important cases and classes of spin systems.
  arXiv  Detail & Related papers  (2022-09-16T13:30:09Z)
• Simulating Large PEPs Tensor Networks on Small Quantum Devices [0.0]
  We map low-bond-dimension PEPs tensor networks to quantum circuits. We employ this approach to calculate the values of a long-range loop observable in the topological Wen plaquette model. Our results serve as a proof-of-concept for simulating large two-dimensional quantum systems on small quantum devices.
  arXiv  Detail & Related papers  (2021-10-01T16:19:06Z)
• A quantum algorithm for training wide and deep classical neural networks [72.2614468437919]
  We show that conditions amenable to classical trainability via gradient descent coincide with those necessary for efficiently solving quantum linear systems. We numerically demonstrate that the MNIST image dataset satisfies such conditions. We provide empirical evidence for $O(log n)$ training of a convolutional neural network with pooling.
  arXiv  Detail & Related papers  (2021-07-19T23:41:03Z)
• 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)
• Efficient construction of tensor-network representations of many-body Gaussian states [59.94347858883343]
  We present a procedure to construct tensor-network representations of many-body Gaussian states efficiently and with a controllable error. These states include the ground and thermal states of bosonic and fermionic quadratic Hamiltonians, which are essential in the study of quantum many-body systems.
  arXiv  Detail & Related papers  (2020-08-12T11:30:23Z)
• 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)
• How fast do quantum walks mix? [0.34410212782758054]
  We find the quantum mixing time of Erd"os-Renyi random networks where each edge exists with probability $p$ independently. Our results could lead to novel insights into the equilibration times of isolated quantum systems defined by random Hamiltonians.
  arXiv  Detail & Related papers  (2020-01-14T10:45:41Z)

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.