arXiv subjects

Glen Evenbly

Publications and source records attributed to Glen Evenbly.

At least 19 recordsLinked to original sources

arXiv2026

Tensor Network Loop Cluster Expansions for Quantum Many-Body Problems

We analyze the tensor network loop cluster expansion, introduced in [G. Park, J. Gray, and G. K.-L. Chan, Phys. Rev. B 112, 174310 (2025)] as a systematic correction to belief propagation, in the context of general quantum many-body problems. We provide numerical examples of the accuracy and practical applicability of the approach for the computation of ground-state observables for high bond dimension tensor networks, in two- and three-dimensions, with open and periodic boundary conditions, and for spin and fermion problems. We find that the contraction error converges approximately exponentially with cluster size, enabling accurate local observable and energy estimates for many systems where standard contraction methods are otherwise impractical.

quant-ph↗

arXiv2025

Partitioned Expansions for Approximate Tensor Network Contractions

We propose a method for approximating the contraction of a tensor network by partitioning the network into a sum of computationally cheaper networks. This method, which we call a partitioned network expansion (PNE), builds upon recent work that systematically improves belief propagation (BP) approximations using loop corrections. However, in contrast to previous approaches, our expansion does not require a known BP fixed point to be implemented and can still yield accurate results even in cases where BP fails entirely. The flexibility of our approach is demonstrated through applications to a variety of example networks, including finite 2D and 3D networks, infinite networks, networks with open indices, and networks with degenerate BP fixed points. Benchmark numerical results for networks composed of Ising, AKLT, and random tensors typically show an improvement in accuracy over BP by several orders of magnitude (when BP solutions are obtainable) and also demonstrate improved performance over traditional network approximations based on singular value decomposition (SVD) for certain tasks.

quant-ph↗

arXiv2025

Loop Series Expansions for Tensor Networks

Belief propagation (BP) can be a useful tool to approximately contract a tensor network, provided that the contributions from any closed loops in the network are sufficiently weak. In this manuscript we describe how a loop series expansion can be applied to systematically improve the accuracy of a BP approximation to a tensor network contraction, in principle converging arbitrarily close to the exact result. More generally, our result provides a framework for expanding a tensor network as a sum of component networks in a hierarchy of increasing complexity. We benchmark this proposal for the contraction of iPEPS, either representing the ground state of an AKLT model or with randomly defined tensors, where it is shown to improve in accuracy over standard BP by several orders of magnitude whilst incurring only a minor increase in computational cost. These results indicate that the proposed series expansions could be a useful tool to accurately evaluate tensor networks in cases that otherwise exceed the limits of established contraction routines.

quant-ph↗

arXiv2025

Hardware-efficient quantum error correction via concatenated bosonic qubits

In order to solve problems of practical importance, quantum computers will likely need to incorporate quantum error correction, where a logical qubit is redundantly encoded in many noisy physical qubits. The large physical-qubit overhead typically associated with error correction motivates the search for more hardware-efficient approaches. Here, using a microfabricated superconducting quantum circuit, we realize a logical qubit memory formed from the concatenation of encoded bosonic cat qubits with an outer repetition code of distance $d=5$. The bosonic cat qubits are passively protected against bit flips using a stabilizing circuit. Cat-qubit phase-flip errors are corrected by the repetition code which uses ancilla transmons for syndrome measurement. We realize a noise-biased CX gate which ensures bit-flip error suppression is maintained during error correction. We study the performance and scaling of the logical qubit memory, finding that the phase-flip correcting repetition code operates below threshold, with logical phase-flip error decreasing with code distance from $d=3$ to $d=5$. Concurrently, the logical bit-flip error is suppressed with increasing cat-qubit mean photon number. The minimum measured logical error per cycle is on average $1.75(2)\%$ for the distance-3 code sections, and $1.65(3)\%$ for the longer distance-5 code, demonstrating the effectiveness of bit-flip error suppression throughout the error correction cycle. These results, where the intrinsic error suppression of the bosonic encodings allows us to use a hardware-efficient outer error correcting code, indicate that concatenated bosonic codes are a compelling paradigm for reaching fault-tolerant quantum computation.

quant-ph↗

arXiv2024

Exploring Gamification in Quantum Computing: The Qubit Factory

Gamification of quantum theory can provide new inroads into the subject: by allowing users to experience simulated worlds that manifest obvious quantum behaviors they can potentially build intuition for quantum phenomena. The Qubit Factory is an engineering-style puzzle game based on a gamified quantum circuit simulator that is designed to provide an introduction to qubits and quantum computing, while being approachable to those with no prior background in the area. It introduces an intuitive visual language for representing quantum states, gates and circuits, further enhanced by animations to aid in visualization. The Qubit Factory presents a hierarchy of increasingly difficult tasks for the user to solve, where each task requires the user to construct and run an appropriate classical/quantum circuit built from a small selection of components. Earlier tasks cover the fundamentals of qubits, quantum gates, superpositions and entanglement. Later tasks cover important quantum algorithms and protocols including superdense coding, quantum teleportation, entanglement distillation, classical and quantum error correction, state tomography, the Bernstein-Vazirani algorithm, quantum repeaters and more.

physics.ed-ph↗

arXiv2023

Reconstruction of Randomly Sampled Quantum Wavefunctions using Tensor Methods

We propose and test several tensor network based algorithms for reconstructing the ground state of an (unknown) local Hamiltonian starting from a random sample of the wavefunction amplitudes. These algorithms, which are based on completing a wavefunction by minimizing the block Renyi entanglement entropy averaged over all local blocks, are numerically demonstrated to reliably reconstruct ground states of local Hamiltonians on 1D lattices to high fidelity, often at the limit of double-precision numerics, while potentially starting from a random sample of only a few percent of the total wavefunction amplitudes.

quant-ph↗

arXiv2023

Reduced Contraction Costs of Corner-Transfer Methods for PEPS

We propose a pair of approximations that allows the leading order computational cost of contracting an infinite projected entangled-pair state (iPEPS) to be reduced from $\mathcal{O}(χ^3D^6)$ to $\mathcal{O}(χ^3D^3)$ when using a corner-transfer approach. The first approximation involves (i) reducing the environment needed for truncation of the boundary tensors (ii) relies on the sequential contraction and truncation of bra and ket indices, rather than doing both together as with the established algorithm. To verify the algorithm, we perform benchmark simulations over square lattice Heisenberg model and obtain results that are comparable to the standard iPEPS algorithm. The improvement in computational cost enables us to perform large bond dimension calculations, extending its potential to solve challenging problems.

quant-ph↗

arXiv2022

Improved Wavelets for Image Compression from Unitary Circuits

We benchmark the efficacy of several novel orthogonal, symmetric, dilation-3 wavelets, derived from a unitary circuit based construction, towards image compression. The performance of these wavelets is compared across several photo databases against the CDF-9/7 wavelets in terms of the minimum number of non-zero wavelet coefficients needed to obtain a specified image quality, as measured by the multi-scale structural similarity index (MS-SSIM). The new wavelets are found to consistently offer better compression efficiency than the CDF-9/7 wavelets across a broad range of image resolutions and quality requirements, averaging 7-8% improved compression efficiency on high-resolution photo images when high-quality (MS-SSIM = 0.99) is required.

eess.IV↗

arXiv2022

A Practical Guide to the Numerical Implementation of Tensor Networks I: Contractions, Decompositions and Gauge Freedom

We present an overview of the key ideas and skills necessary to begin implementing tensor network methods numerically, which is intended to facilitate the practical application of tensor network methods for researchers that are already versed with their theoretical foundations. These skills include an introduction to the contraction of tensor networks, to optimal tensor decompositions, and to the manipulation of gauge degrees of freedom in tensor networks. The topics presented are of key importance to many common tensor network algorithms such as DMRG, TEBD, TRG, PEPS and MERA.

quant-ph↗

arXiv2021

Exact holographic tensor networks for the Motzkin spin chain

The study of low-dimensional quantum systems has proven to be a particularly fertile field for discovering novel types of quantum matter. When studied numerically, low-energy states of low-dimensional quantum systems are often approximated via a tensor-network description. The tensor network's utility in studying short range correlated states in 1D have been thoroughly investigated, with numerous examples where the treatment is essentially exact. Yet, despite the large number of works investigating these networks and their relations to physical models, examples of exact correspondence between the ground state of a quantum critical system and an appropriate scale-invariant tensor network have eluded us so far. Here we show that the features of the quantum-critical Motzkin model can be faithfully captured by an analytic tensor network that exactly represents the ground state of the physical Hamiltonian. In particular, our network offers a two-dimensional representation of this state by a correspondence between walks and a type of tiling of a square lattice. We discuss connections to renormalization and holography.

quant-ph↗

arXiv2019

TensorTrace: an application to contract tensor networks

Tensor network methods are a conceptually elegant framework for encoding complicated datasets, where high-order tensors are approximated as networks of low-order tensors. In practice, however, the numeric implementation of tensor network algorithms is often a labor-intensive and error-prone task, even for experienced researchers in this area. \emph{TensorTrace} is application designed to alleviate the burden of contracting tensor networks: it provides a graphic drawing interface specifically tailored for the construction of tensor network diagrams, from which the code for their optimal contraction can then be automatically generated (in the users choice of the MATLAB, Python or Julia languages). \emph{TensorTrace} is freely available at \url{https://www.tensortrace.com} with versions for Windows, Mac and Ubuntu.

quant-ph↗

arXiv2019

Tensor Renormalization Group Centered About a Core Tensor

We propose a modified form of a tensor renormalization group algorithm for evaluating partition functions of classical statistical mechanical models on 2D lattices. This algorithm coarse-grains only the rows and columns of the lattice adjacent to a single core tensor at each step, such that the lattice size shrinks linearly with the number of coarse-graining steps as opposed to shrinking exponentially as in the usual tensor renormalization group (TRG). However, the cost of this new approach only scales as $O(χ^4)$ in terms of the bond dimension $χ$, significantly cheaper than the $O(χ^6)$ cost scaling of TRG, whereas numerical benchmarking indicates that both approaches have comparable accuracy for the same bond dimension $χ$. It follows that the new algorithm can allow for more accurate investigation of classical models on modestly sized lattices than is possible with standard TRG.

quant-ph↗

arXiv2019

Number-State Preserving Tensor Networks as Classifiers for Supervised Learning

We propose a restricted class of tensor network state, built from number-state preserving tensors, for supervised learning tasks. This class of tensor network is argued to be a natural choice for classifiers as (i) they map classical data to classical data, and thus preserve the interpretability of data under tensor transformations, (ii) they can be efficiently trained to maximize their scalar product against classical data sets, and (iii) they seem to be as powerful as generic (unrestricted) tensor networks in this task. Our proposal is demonstrated using a variety of benchmark classification problems, where number-state preserving versions of commonly used networks (including MPS, TTN and MERA) are trained as effective classifiers. This work opens the path for powerful tensor network methods such as MERA, which were previously computationally intractable as classifiers, to be employed for difficult tasks such as image recognition.

quant-ph↗

arXiv2018

Gauge fixing, canonical forms and optimal truncations in tensor networks with closed loops

We describe an approach to fix the gauge degrees of freedom in tensor networks, including those with closed loops, which allows a canonical form for arbitrary tensor networks to be realized. Additionally, a measure for the internal correlations present in a tensor network is proposed, which quantifies the extent of resonances around closed loops in the network. Finally we describe an algorithm for the optimal truncation of an internal index from a tensor network, based upon proper removal of the redundant internal correlations. These results, which offer a unified theoretical framework for the manipulation of tensor networks with closed loops, can be applied to improve existing tensor network methods for the study of many-body systems and may also constitute key algorithmic components of sophisticated new tensor methods.

quant-ph↗

arXiv2017

Entanglement renormalization for disordered systems

We propose a tensor network method for investigating strongly disordered systems that is based on an adaptation of entanglement renormalization [G. Vidal, Phys. Rev. Lett. 99, 220405 (2007)]. This method makes use of the strong disorder renormalization group to determine the order in which lattice sites are coarse-grained, which sets the overall structure of the corresponding tensor network ansatz, before optimization using variational energy minimization. Benchmark results from the disordered XXZ model demonstrates that this approach accurately captures ground state entanglement in disordered systems, even at long distances. This approach leads to a new class of efficiently contractible tensor network ansatz for 1D systems, which may be understood as a generalization of the multi-scale entanglement renormalization ansatz for disordered systems.

cond-mat.str-el↗

arXiv2017

Rigorous free fermion entanglement renormalization from wavelet theory

We construct entanglement renormalization schemes which provably approximate the ground states of non-interacting fermion nearest-neighbor hopping Hamiltonians on the one-dimensional discrete line and the two-dimensional square lattice. These schemes give hierarchical quantum circuits which build up the states from unentangled degrees of freedom. The circuits are based on pairs of discrete wavelet transforms which are approximately related by a "half-shift": translation by half a unit cell. The presence of the Fermi surface in the two-dimensional model requires a special kind of circuit architecture to properly capture the entanglement in the ground state. We show how the error in the approximation can be controlled without ever performing a variational optimization.

quant-ph↗

arXiv2017

Implicitly disentangled renormalization

We propose a new implementation of real-space renormalization group (RG) transformations for quantum states on a lattice. Key to this approach is the removal of short-ranged entanglement, similar to Vidal's entanglement renormalization (ER), which allows a proper RG flow to be achieved. However, our proposal only uses operators that act locally within each block, such that the use of disentanglers acting across block boundaries is not required. By avoiding the use of disentanglers we argue many tensor network algorithms for studying quantum many-body systems can be significantly improved. The effectiveness of this RG approach is demonstrated through application to the ground state of a 1D system at criticality, which is shown to reach a scale-invariant fixed point.

quant-ph↗

arXiv2017

Hyper-invariant tensor networks and holography

We propose a new class of tensor network state as a model for the AdS/CFT correspondence and holography. This class is demonstrated to retain key features of the multi-scale entanglement renormalization ansatz (MERA), in that they describe quantum states with algebraic correlation functions, have free variational parameters, and are efficiently contractible. Yet, unlike MERA, they are built according to a uniform tiling of hyperbolic space, without inherent directionality or preferred locations in the holographic bulk, and thus circumvent key arguments made against the MERA as a model for AdS/CFT. Novel holographic features of this tensor network class are examined, such as an equivalence between the causal cones C(R) and the entanglement wedges E(R) of connected boundary regions R.

quant-ph↗