Learning Circuits with Infinite Tensor Networks

• URL: http://arxiv.org/abs/2506.02105v1
• Date: Mon, 02 Jun 2025 18:00:01 GMT
• Title: Learning Circuits with Infinite Tensor Networks
• Authors: Joe Gibbs, Lukasz Cincio,
• Abstract summary: Hamiltonian simulation on quantum computers is constrained by gate counts, motivating techniques to reduce circuit depths.<n>We leverage tensor networks to support circuit design, with datasets of tensor networks enabling a unitary synthesis inspired by quantum machine learning.<n>Our approach finds circuits to efficiently prepare ground states, and perform time evolution on both infinite and finite systems.
• Score: 0.4972323953932129
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Hamiltonian simulation on quantum computers is strongly constrained by gate counts, motivating techniques to reduce circuit depths. While tensor networks are natural competitors to quantum computers, we instead leverage them to support circuit design, with datasets of tensor networks enabling a unitary synthesis inspired by quantum machine learning. For a target simulation in the thermodynamic limit, translation invariance is exploited to significantly reduce the optimization complexity, avoiding a scaling with system size. Our approach finds circuits to efficiently prepare ground states, and perform time evolution on both infinite and finite systems with substantially lower gate depths than conventional Trotterized methods. In addition to reducing CNOT depths, we motivate similar utility for fault-tolerant quantum algorithms, with a demonstrated $5.2\times$ reduction in $T$-count to realize $e^{-iHt}$. The key output of our approach is the optimized unit-cell of a translation invariant circuit. This provides an advantage for Hamiltonian simulation of finite, yet arbitrarily large, systems on real quantum computers.

Related papers

• Efficient Quantum Circuit Compilation for Near-Term Quantum Advantage [17.38734393793605]
  We propose an approximate method for compiling target quantum circuits into brick-wall layouts.<n>This new circuit design consists of two-qubit CNOT gates that can be directly implemented on real quantum computers.
  arXiv  Detail & Related papers  (2025-01-13T15:04:39Z)
• Towards Efficient Quantum Computing for Quantum Chemistry: Reducing Circuit Complexity with Transcorrelated and Adaptive Ansatz Techniques [0.0]
  This work demonstrates how to reduce circuit depth by combining the transcorrelated (TC) approach with adaptive quantum ans"atze. Our study demonstrates that combining the TC method with adaptive ans"atze yields compact, noise-resilient, and easy-to-optimize quantum circuits.
  arXiv  Detail & Related papers  (2024-02-26T15:31:56Z)
• Efficient quantum algorithm to simulate open systems through a single environmental qubit [0.0]
  We present an efficient algorithm for simulating open quantum systems dynamics described by the Lindblad master equation on quantum computers.<n>Under fixed accuracy conditions, our algorithm enables a reduction in the number of trotter steps compared to other approaches.
  arXiv  Detail & Related papers  (2023-11-16T16:45:30Z)
• Riemannian quantum circuit optimization for Hamiltonian simulation [2.1227079314039057]
  Hamiltonian simulation is a natural application of quantum computing. For translation invariant systems, the gates in such circuit topologies can be further optimized on classical computers. For the Ising and Heisenberg models on a one-dimensional lattice, we achieve orders of magnitude accuracy improvements.
  arXiv  Detail & Related papers  (2022-12-15T00:00:17Z)
• A single $T$-gate makes distribution learning hard [56.045224655472865]
  This work provides an extensive characterization of the learnability of the output distributions of local quantum circuits. We show that for a wide variety of the most practically relevant learning algorithms -- including hybrid-quantum classical algorithms -- even the generative modelling problem associated with depth $d=omega(log(n))$ Clifford circuits is hard.
  arXiv  Detail & Related papers  (2022-07-07T08:04:15Z)
• Optimizing Tensor Network Contraction Using Reinforcement Learning [86.05566365115729]
  We propose a Reinforcement Learning (RL) approach combined with Graph Neural Networks (GNN) to address the contraction ordering problem. The problem is extremely challenging due to the huge search space, the heavy-tailed reward distribution, and the challenging credit assignment. We show how a carefully implemented RL-agent that uses a GNN as the basic policy construct can address these challenges.
  arXiv  Detail & Related papers  (2022-04-18T21:45:13Z)
• An Algebraic Quantum Circuit Compression Algorithm for Hamiltonian Simulation [55.41644538483948]
  Current generation noisy intermediate-scale quantum (NISQ) computers are severely limited in chip size and error rates. We derive localized circuit transformations to efficiently compress quantum circuits for simulation of certain spin Hamiltonians known as free fermions. The proposed numerical circuit compression algorithm behaves backward stable and scales cubically in the number of spins enabling circuit synthesis beyond $mathcalO(103)$ spins.
  arXiv  Detail & Related papers  (2021-08-06T19:38:03Z)
• 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)
• Variational Quantum Optimization with Multi-Basis Encodings [62.72309460291971]
  We introduce a new variational quantum algorithm that benefits from two innovations: multi-basis graph complexity and nonlinear activation functions. Our results in increased optimization performance, two increase in effective landscapes and a reduction in measurement progress.
  arXiv  Detail & Related papers  (2021-06-24T20:16:02Z)
• 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)
• Investigating the Exchange of Ising Chains on a Digital Quantum Computer [0.0]
  We study a a braiding-like exchange operation through the movement of the state in the qubit subspace. The system consists of two Ising chains in a 1D geometry where the operation is simulated through the adiabatic time evolution of the ground state. Various aspects of the implementation including the circuit depth, Trotterization error, and quantum gate errors pertaining to the Noisy Intermediate-Scale Quantum (NISQ) hardware are discussed as well.
  arXiv  Detail & Related papers  (2021-03-09T15:50: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.