Related papers: Improving the efficiency of variational tensor net…
Quantum circuit simulation is a challenging computational problem crucial for quantum computing research and development. The predominant approaches in this area center on tensor networks, prized for their better concurrency and less…
The efficient simulation of complex quantum systems remains a central challenge due to the exponential growth of Hilbert space with system size. Tensor network methods have long been established as powerful approximation schemes, and their…
We introduce a change of perspective on tensor network states that is defined by the computational graph of the contraction of an amplitude. The resulting class of states, which we refer to as tensor network functions, inherit the…
Simulating strongly-correlated quantum many-body systems at finite temperatures is a significant challenge in computational physics. In this work, we present a scalable finite-temperature tensor network algorithm for two-dimensional quantum…
Near-term quantum devices generally suffer from shallow circuit depth and hence limited expressivity due to noise and decoherence. To address this, we propose tensor-network-assisted parametrized quantum circuits, which concatenate a…
In this paper we study the effect of non-trivial spatial topology on quantum entanglement by examining the degenerate ground states of a topologically ordered system on torus. Using the string-net (fixed-point) wave-function, we propose a…
We present a compendium of numerical simulation techniques, based on tensor network methods, aiming to address problems of many-body quantum mechanics on a classical computer. The core setting of this anthology are lattice problems in low…
Modern quantum optical systems such as photonic quantum computers and quantum imaging devices require great precision in their designs and implementations in the hope to realistically exploit entanglement and reach a real quantum advantage.…
Quantum algorithms reformulate computational problems as quantum evolutions in a large Hilbert space. Most quantum algorithms assume that the time-evolution is perfectly unitary and that the full Hilbert space is available. However, in…
We propose a simple connection between matrix quantum mechanics and tensor networks. This allows us to imbue tensor networks with some interesting additional structure. The geometry of the graph describing the tensor network state is…
We discuss in detail algorithms for implementing tensor network renormalization (TNR) for the study of classical statistical and quantum many-body systems. Firstly, we recall established techniques for how the partition function of a 2D…
We characterize the variational power of quantum circuit tensor networks in the representation of physical many-body ground-states. Such tensor networks are formed by replacing the dense block unitaries and isometries in standard tensor…
We investigate a recent conjecture connecting the AdS/CFT correspondence and entanglement renormalization tensor network states (MERA). The proposal interprets the tensor connectivity of the MERA states associated to quantum many body…
Quantum annealing targets low-energy solutions of Ising/QUBO problems, but reliable assessment requires more than best-energy comparisons. This dissertation develops a benchmarking framework for D-Wave quantum annealers that combines strong…
The ability to efficiently simulate random quantum circuits using a classical computer is increasingly important for developing Noisy Intermediate-Scale Quantum devices. Here we present a tensor network states based algorithm specifically…
Efficient simulation of quantum circuits has become indispensable with the rapid development of quantum hardware. The primary simulation methods are based on state vectors and tensor networks. As the number of qubits and quantum gates grows…
Being able to study the dynamics of quantum systems interacting with several environments is important in many settings ranging from quantum chemistry to quantum thermodynamics, through out-of-equilibrium systems. For such problems tensor…
The computational cost of counting the number of solutions satisfying a Boolean formula, which is a problem instance of #SAT, has proven subtle to quantify. Even when finding individual satisfying solutions is computationally easy (e.g.…
Projected entangled-pair states (PEPS) constitute a powerful variational ansatz for capturing ground state physics of two-dimensional quantum systems. However, accurately computing and minimizing the energy expectation value remains…
The generalization of the multi-scale entanglement renormalization ansatz (MERA) to continuous systems, or cMERA [Haegeman et al., Phys. Rev. Lett, 110, 100402 (2013)], is expected to become a powerful variational ansatz for the ground…