For chaotic one-dimensional brick-wall circuits at a fixed relative target precision, this work finds numerical evidence that the bond dimension required to obtain stable estimates grows subexponentially over the accessible time window.
Abstract
Tensor networks are powerful tools for simulating quantum many-body systems, but the growth of spatial entanglement severely limits the direct evolution of pure states under chaotic unitary circuits. Here we consider a more targeted task: the approximate strong simulation of a specified output probability of a 1D chaotic brick-wall circuit at finite relative precision. Given input and output bit strings $\by$ and $\bx$, we evaluate $p(\bx|\by)=|\bra{\bx}U(T)\ket{\by}|^2$ using the Sweeping RTM algorithm, a transverse tensor-network contraction based on reduced transition matrices (RTMs). The algorithm compresses the left and right temporal boundary states jointly, seeking an output probability that converges across spatial cuts and as the bond dimension is increased. For chaotic one-dimensional brick-wall circuits at a fixed relative target precision, we find numerical evidence that the bond dimension required to obtain stable estimates grows subexponentially over the accessible time window. Our findings open a direct route to classical probability queries for chaotic quantum circuits, with potential applications to benchmarking and learning tasks.
A depth lower bound of $\Omega(\log n/\log\log n)$, showing that global accuracy can require increasing depth as the lattice grows, and unconditional worst-case lower bounds using time-independent, purely dissipative processes that transport quantum information are proved.
Zhe-Yu Shen, Yu-Sen Wu, Xiao Yuan et al.· 0 citations
Local quantum interactions generate dynamics in an exponentially large Hilbert space, yet locality and entanglement restrict the information that can spread and accumulate. Bounds on propagation and entanglement growth, together with tensor networks, exploit these restrictions to discard information unnecessary for des...
H. Mackay, Donghoon Kim, Tan Van Vu et al.· 1 citation
Quantum imaginary-time evolution (QITE) provides a systematic route to ground-state preparation, but its cost grows rapidly with the locality $D$ of the unitary approximation, for which the local Pauli basis scales as $4^D$. We introduce Sparse-QITE, a regularized formulation that promotes compact generators, reducing...
Rafael Gómez-Lurbe, L. Ion, Alberto Acevedo et al.· 0 citations
Simulation of quantum many-body systems is a principal application of quantum computing, but available devices remain limited by the number of qubits and cannot accommodate systems of the desired size. One approach is to host a large evolution across several modest distributed systems that exchange classical informatio...
Yong Liu, Guang-Yao Huang, Wei-Xu Shi et al.· 0 citations
Process tensors in matrix product operator representation (PT-MPOs) are a powerful tool to calculate the temporal evolution and multi-time correlations of open quantum systems. While much progress has been made in making the calculation of process tensors for larger system dimensions possible, the numerical cost of the...
Understanding the dynamics of interacting quantum systems is a central goal of quantum simulation. For geometrically local Hamiltonians, locality suggests that digital simulation should retain much of the parallelism of the underlying dynamics. For a target accuracy $\epsilon$, we construct a nearest-neighbor quantum c...
Zhe-Yu Shen, Yu-Sen Wu, Peng-Hui Yao et al.· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.